An Online Framework for Joint Network Selection and Service Placement in Mobile Edge Computing

被引:71
作者
Gao, Bin [1 ]
Zhou, Zhi [2 ]
Liu, Fangming [1 ]
Xu, Fei [3 ]
Li, Bo [4 ]
机构
[1] Huazhong Univ Sci & Technol, Natl Engn Res Ctr Big Data Technol & Syst, Serv Comp Technol & Syst Lab, Cluster & Grid Comp Lab,Sch Comp Sci & Technol, Wuhan 430074, Hubei, Peoples R China
[2] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou 510006, Guangdong, Peoples R China
[3] East China Normal Univ, Sch Comp Sci & Technol, Shanghai Key Lab Multidimens Informat Proc, Shanghai 200241, Peoples R China
[4] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Hong Kong, Peoples R China
关键词
Delays; Quality of service; Edge computing; Cloud computing; Switches; Optimization; Mobile computing; Mobile edge computing; network selection; service placement; online algorithm; stable matching; game theory; ASSIGNMENT; MANAGEMENT; ALGORITHM; CLOUD; MIGRATION;
D O I
10.1109/TMC.2021.3064847
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the rapid development and deployment of 5G wireless technology, mobile edge computing (MEC) has emerged as a new computing paradigm to facilitate a large variety of infrastructures at the network edge to reduce user-perceived communication delay. One of the fundamental problems in this new paradigm is to preserve satisfactory quality-of-service (QoS) for mobile users in light of densely dispersed wireless communication environment and often capacity-constrained MEC nodes. Such user-perceived QoS, typically in terms of the end-to-end delay, is highly vulnerable to both access network bottleneck and communication delay. Previous works have primarily focused on optimizing the communication delay through dynamic service placement, while ignoring the critical effect of access network selection on the access delay. In this work, we study the problem of jointly optimizing the access network selection and service placement for MEC, with the objective of improving the QoS in a cost-efficient manner by judiciously balancing the access delay, communication delay, and service switching cost. Specifically, we propose an efficient online framework to decompose a long-term time-varying optimization problem into a series of one-shot subproblems. To address the NP-hardness of the one-shot problem, we design a computationally-efficient two-phase algorithm based on matching and game theory, which achieves a near-optimal solution. Both rigorous theoretical analysis on the optimality gap and extensive trace-driven simulations are conducted to validate the efficacy of our proposed solution.
引用
收藏
页码:3836 / 3851
页数:16
相关论文
共 47 条
[1]  
[Anonymous], 2011, P 17 ACM SIGKDD INT, DOI DOI 10.1145/2020408.2020579
[2]  
[Anonymous], 2014, P 6 USENIX C HOT TOP
[3]  
[Anonymous], 2009, SIMUTOOLS 09 2 INT C
[4]   Energy-Aware Application Placement in Mobile Edge Computing: A Stochastic Optimization Approach [J].
Badri, Hossein ;
Bahreini, Tayebeh ;
Grosu, Daniel ;
Yang, Kai .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2020, 31 (04) :909-922
[5]   Human-Enabled Edge Computing: Exploiting the Crowd as a Dynamic Extension of Mobile Edge Computing [J].
Bellavista, Paolo ;
Chessa, Stefano ;
Foschini, Luca ;
Gioia, Leo ;
Girolami, Michele .
IEEE COMMUNICATIONS MAGAZINE, 2018, 56 (01) :149-155
[6]   Joint Optimization of Service Caching Placement and Computation Offloading in Mobile Edge Computing Systems [J].
Bi, Suzhi ;
Huang, Liang ;
Zhang, Ying-Jun Angela .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2020, 19 (07) :4947-4963
[7]  
Bin Gao, 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, P1459, DOI 10.1109/INFOCOM.2019.8737543
[8]  
Chen ST, 2019, IEEE INFOCOM SER, P2566, DOI [10.1109/infocom.2019.8737574, 10.1109/INFOCOM.2019.8737574]
[9]   A genetic algorithm for the generalised assignment problem [J].
Chu, PC ;
Beasley, JE .
COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (01) :17-23
[10]  
Clark C, 2005, USENIX ASSOCIATION PROCEEDINGS OF THE 2ND SYMPOSIUM ON NETWORKED SYSTEMS DESIGN & IMPLEMENTATION (NSDI '05), P273