TY - JOUR
T1 - Parameter Estimation-Aided Edge Server Selection Mechanism for Edge Task Offloading
AU - Xue, Hai
AU - Zhang, Di
AU - Wu, Celimuge
AU - Ji, Yusheng
AU - Long, Saiqin
AU - Wang, Cheng
AU - Sato, Takuro
N1 - Publisher Copyright:
© 1967-2012 IEEE.
PY - 2024/2/1
Y1 - 2024/2/1
N2 - As the extension of cloud computing, edge computing has witnessed remarkable progress in the last few years. In edge computing, task offloading from edge device to edge server is becoming a promising technique that substantially enhances the quality of service for edge devices. Nevertheless, appropriate edge server selection for task offloading remains a challenge if multiple edge servers are selectable nearby. In this article, we propose a parameter estimation-aided edge server selection scheme for task offloading (PEESS) with multiple potential edge servers. The proposed scheme jointly leverages Baum-Welch algorithm and forward algorithm of hidden Markov model. That is, PEESS leverages Baum-Welch algorithm to estimate the parameters of potential edge servers based on their time-sequential incoming task records. Subsequently, the forward algorithm is utilized for the probability calculation of the observations based on the estimated parameters. Eventually, the probability calculation results are sorted in descending order, and the edge device selects the target edge server based on the sequence of sending requests to the available edge servers from optimal to suboptimal. Extensive simulation results demonstrate that PEESS outperforms other conventional and state-of-the-art edge server selection schemes in terms of time consumption and energy consumption.
AB - As the extension of cloud computing, edge computing has witnessed remarkable progress in the last few years. In edge computing, task offloading from edge device to edge server is becoming a promising technique that substantially enhances the quality of service for edge devices. Nevertheless, appropriate edge server selection for task offloading remains a challenge if multiple edge servers are selectable nearby. In this article, we propose a parameter estimation-aided edge server selection scheme for task offloading (PEESS) with multiple potential edge servers. The proposed scheme jointly leverages Baum-Welch algorithm and forward algorithm of hidden Markov model. That is, PEESS leverages Baum-Welch algorithm to estimate the parameters of potential edge servers based on their time-sequential incoming task records. Subsequently, the forward algorithm is utilized for the probability calculation of the observations based on the estimated parameters. Eventually, the probability calculation results are sorted in descending order, and the edge device selects the target edge server based on the sequence of sending requests to the available edge servers from optimal to suboptimal. Extensive simulation results demonstrate that PEESS outperforms other conventional and state-of-the-art edge server selection schemes in terms of time consumption and energy consumption.
KW - Edge server selection
KW - hidden Markov model
KW - parameter estimation
KW - task offloading
UR - http://www.scopus.com/inward/record.url?scp=85171527908&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85171527908&partnerID=8YFLogxK
U2 - 10.1109/TVT.2023.3313162
DO - 10.1109/TVT.2023.3313162
M3 - Article
AN - SCOPUS:85171527908
SN - 0018-9545
VL - 73
SP - 2506
EP - 2519
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 2
ER -