Joint Optimization of Request Assignment and Computing Resource Allocation in Multi-Access Edge Computing

被引:12
作者
Liu, Haolin [1 ]
Long, Xiaoling [1 ]
Li, Zhetao [1 ]
Long, Saiqin [1 ]
Ran, Rong [2 ,3 ]
Wang, Hui-Ming [4 ,5 ]
机构
[1] Sch Comp Sci, Key Lab Hunan Prov Internet Things & Informat Secu, Xiangtan 411105, Peoples R China
[2] Xiangtan Univ, Hunan Int Sci & Technol Cooperat Base Intelligent, Xiangtan 411105, Peoples R China
[3] Ajou Univ, Dept Elect & Comp Engn, Suwon 16499, South Korea
[4] Xi An Jiao Tong Univ, Sch Informat & Commun Engn, Xian 710049, Shaanxi, Peoples R China
[5] Minist Educ Key Lab Intelligent Networks, Network Secur, Xian 710049, Peoples R China
基金
中国国家自然科学基金;
关键词
Resource management; Approximation algorithms; Task analysis; Optimization; Computational modeling; Heuristic algorithms; Cloud computing; Approximation algorithm; computing resource allocation; joint optimization; latency minimization; multi-access edge computing; request assignment;
D O I
10.1109/TSC.2022.3180105
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the development of multi-access edge computing (MEC), the cloudlet at the edge of the network can provide nearby high-performance computing services, thus reducing the computational consumption of user equipments (UEs). To provide more real-time computing services to UEs, service providers face the challenge of optimizing the assignment of requests and the allocation of cloudlets' computing resources to achieve low latency while dealing with the large number of offloaded requests from UEs. Therefore, in this paper, we study the problem of minimizing the total latency to complete the requests in the MEC network by jointly optimizing request assignment and computing resource allocation. The problem is formulated as a mixed integer nonlinear programming (MINLP) problem which is NP-hard. To solve the problem, we decompose the problem into two subproblems which respectively optimize the request assignment and the computing resource allocation. We first deal with the computing resource allocation problem by utilizing the Lagrangian multiplier method, and the resulting solution is applied for the request assignment problem. Then a novel primal-dual based approximation algorithm is devised to address the request assignment problem. Finally, to verify the efficiency of the proposed algorithm, we provide an upper bound on the approximation ratio. The experiment results show that the proposed algorithm outperforms baseline algorithms in terms of total latency, loading balancing, and computational speed.
引用
收藏
页码:1254 / 1267
页数:14
相关论文
共 33 条
  • [31] Williamson D.P., 2011, DESIGN APPROXIMATION
  • [32] Enhance Latency-Constrained Computation in MEC Networks Using Uplink NOMA
    Ye, Yinghui
    Hu, Rose Qingyang
    Lu, Guangyue
    Shi, Liqin
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (04) : 2409 - 2425
  • [33] Optimal Placement of Virtual Machines for Supporting Multiple Applications in Mobile Edge Networks
    Zhao, Lei
    Liu, Jiajia
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (07) : 6533 - 6545