TY - JOUR
T1 - Dynamic Parallel Multi-Server Selection and Allocation in Collaborative Edge Computing
AU - Xu, Changfu
AU - Guo, Jianxiong
AU - Li, Yupeng
AU - Zou, Haodong
AU - Jia, Weijia
AU - Wang, Tian
N1 - This work was supported in part by grants from the National Key R&D Program of China (No. 2022YFE0201400), the National Natural Science Foundation of China (No. 62172046 and 62372047), Beijing Natural Science Foundation (No. 4232028), Zhuhai Basic and Applied Basic Research Foundation (No. 2220004002619), the Joint Project of Production, Teaching and Research of Zhuhai (No. 2220004002686 and ZH22017001210133PWC), the Science and Technology Projects of Social Development in Zhuhai (No. 2320004000213), the project ZHPT2023002 supported by “the Supplemental Funds for Major Scientific Research Projects of Beijing Normal University, Zhuhai”, the Fundamental Research Funds for the Central Universities, Guangdong Province Undergraduate Course Teaching and Research Office Construction Project (jx2022303), the National Natural Science Foundation of China (No. 62202402), Guangdong Basic and Applied Basic Research Foundation (No. 2022A1515011583 and No. 2023A1515011562), and Hong Kong RGC Early Career Scheme (No. 22202423).
Publisher Copyright:
IEEE
Publisher Copyright:
© 2024 IEEE.
PY - 2024/11
Y1 - 2024/11
N2 - Collaborative Mobile Edge Computing (MEC) has emerged as a promising approach to provide low service latency for computation-intensive Internet of Things applications, facilitated by the cooperation of edge-edge and edge-cloud resources. However, existing collaborative MEC methods typically restrict the collaborative processing between any two Edge Servers (ESs) or one ES and the cloud server for a task request, limiting the exploitation of available resources on other ESs. Moreover, these conventional methods rely on offline task partitioning, potentially leading to extended make-span, especially when ES computing capacities exhibit heterogeneity. In this paper, we propose an innovative method named SMCoEdge. This method performs dynamic parallel multi-ES selection and workload allocation in heterogeneous collaborative MEC environments, thus simultaneously enabling multiple ESs’ idle resources to accelerate task processing. We formulate our problem into an online linear programming problem, with the objective of minimizing task computing and transmission make-spans. To enhance computational efficiency, we decompose the problem into two stages: multi-ES selection and workload allocation. Then, we propose an online Deep Reinforcement Learning based Simultaneous Multi-ES Offloading (DRL-SMO) algorithm along with a top- $k$ deep Q-learning network model to effectively solve our problem, where an efficient algorithm is proposed to achieve the optimal solution for the workload allocation stage. Furthermore, we provide a theoretical performance analysis, demonstrating that the DRL-SMO algorithm achieves a near-optimal solution for our problem within an approximate linear time complexity. Finally, our extensive experimental results demonstrate the substantial advantages of our method. It consistently reduces the average make-span by 19.63% and keeps a lower offloading failure rate, when compared to state-of-the-art methods. These findings underline the efficacy of our method in enhancing collaborative MEC performance.
AB - Collaborative Mobile Edge Computing (MEC) has emerged as a promising approach to provide low service latency for computation-intensive Internet of Things applications, facilitated by the cooperation of edge-edge and edge-cloud resources. However, existing collaborative MEC methods typically restrict the collaborative processing between any two Edge Servers (ESs) or one ES and the cloud server for a task request, limiting the exploitation of available resources on other ESs. Moreover, these conventional methods rely on offline task partitioning, potentially leading to extended make-span, especially when ES computing capacities exhibit heterogeneity. In this paper, we propose an innovative method named SMCoEdge. This method performs dynamic parallel multi-ES selection and workload allocation in heterogeneous collaborative MEC environments, thus simultaneously enabling multiple ESs’ idle resources to accelerate task processing. We formulate our problem into an online linear programming problem, with the objective of minimizing task computing and transmission make-spans. To enhance computational efficiency, we decompose the problem into two stages: multi-ES selection and workload allocation. Then, we propose an online Deep Reinforcement Learning based Simultaneous Multi-ES Offloading (DRL-SMO) algorithm along with a top- $k$ deep Q-learning network model to effectively solve our problem, where an efficient algorithm is proposed to achieve the optimal solution for the workload allocation stage. Furthermore, we provide a theoretical performance analysis, demonstrating that the DRL-SMO algorithm achieves a near-optimal solution for our problem within an approximate linear time complexity. Finally, our extensive experimental results demonstrate the substantial advantages of our method. It consistently reduces the average make-span by 19.63% and keeps a lower offloading failure rate, when compared to state-of-the-art methods. These findings underline the efficacy of our method in enhancing collaborative MEC performance.
KW - Collaborative edge computing
KW - Dynamic parallel multi-server selection and allocation
KW - Edge-edge collaboration
KW - Make-span optimization
UR - http://www.scopus.com/inward/record.url?scp=85188468431&partnerID=8YFLogxK
U2 - 10.1109/TMC.2024.3376550
DO - 10.1109/TMC.2024.3376550
M3 - Journal article
AN - SCOPUS:85188468431
SN - 1536-1233
VL - 23
SP - 10523
EP - 10537
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 11
ER -