Joint optimization of service chain caching and task offloading in mobile edge computing

被引:51
作者
Peng, Kai [1 ]
Nie, Jiangtian [2 ]
Kumar, Neeraj [3 ,4 ,5 ]
Cai, Chao [1 ]
Kang, Jiawen [2 ]
Xiong, Zehui [6 ]
Zhang, Yang [7 ]
机构
[1] Huazhong Univ Sci & Technol, Wuhan, Hubei, Peoples R China
[2] Nanyang Technol Univ, Singapore, Singapore
[3] Thapar Inst Engn & Technol, Patiala, Punjab, India
[4] Asia Univ, Dept Comp Sci & Informat Engn, Taichung, Taiwan
[5] Univ Petr & Energy Studies UPES, Sch Comp Sci, Energy Acres Dehradun 248007, India
[6] Singapore Univ Technol & Design, Singapore, Singapore
[7] Wuhan Univ Technol, Wuhan, Peoples R China
关键词
Mobile edge computing; Service chain caching; Task offloading; Lyapunov Optimization; PLACEMENT;
D O I
10.1016/j.asoc.2021.107142
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Caching and offloading in Mobile Edge Computing (MEC) are hot topics recently. Existing caching strategies at the edge ignore the programming ability of edge network and design strategies independently thus network resource is under utilization and the quality of experience (QOE) for end users is far from satisfactory. In this paper, we design intelligently joint caching and offloading strategies under the assumption that applications can be in the form of divisible service chain. Different from common approaches that target on reducing response latency only for users, our system take the leasing cost into consideration thus is more efficient for Application Service Providers (ASP). To fulfill our design, we novelly utilize open Jackson queuing network to formulate this joint optimization problem under long term cost restrictions and design a pipeline of algorithm to search for the optimal solution. More specifically, we design a cost adaptive algorithm derived from Lyapunov drift-plus-penalty function so that the long-term problem can be optimized in the slot-by-slot basis. Moreover, we propose to exploit resource-based utility function and device-number-based relative distance to jointly find optimal caching and offloading scheme. Extensive simulation results demonstrate that our approach can effectively reduce the average service latency of the MEC system and keep a low average leasing cost. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页数:13
相关论文
共 33 条
[11]   It's Hard to Share: Joint Service Placement and Request Scheduling in Edge Clouds with Sharable and Non-sharable Resources [J].
He, Ting ;
Khamfroush, Hana ;
Wang, Shiqiang ;
La Porta, Tom ;
Stein, Sebastian .
2018 IEEE 38TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2018, :365-375
[12]  
Jia MK, 2014, IEEE CONF COMPUT, P352, DOI 10.1109/INFCOMW.2014.6849257
[13]  
Jiang JW, 2012, IEEE INFOCOM SER, P2876, DOI 10.1109/INFCOM.2012.6195719
[14]  
Leon-Garcia A, 2017, Probability, Statistics, and Random Processes for Electrical Engineering
[15]   Service Platform for Robotic Disassembly Planning in Remanufacturing [J].
Liu, Jiayi ;
Zhou, Zude ;
Duc Truong Pham ;
Xu, Wenjun ;
Cui, Jia ;
Yang, Can .
JOURNAL OF MANUFACTURING SYSTEMS, 2020, 57 :338-356
[16]   Collaborative optimization of robotic disassembly sequence planning and robotic disassembly line balancing problem using improved discrete Bees algorithm in remanufacturing [J].
Liu, Jiayi ;
Zhou, Zude ;
Duc Truong Pham ;
Xu, Wenjun ;
Ji, Chunqian ;
Liu, Quan .
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2020, 61
[17]  
Liu J, 2016, IEEE INT SYMP INFO, P1451, DOI 10.1109/ISIT.2016.7541539
[18]   Mobile Edge Computing: A Survey on Architecture and Computation Offloading [J].
Mach, Pavel ;
Becvar, Zdenek .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2017, 19 (03) :1628-1656
[19]  
Mao Y., 2017, IEEE Commun. Surv. Tutor. PP
[20]   A Survey on Mobile Edge Computing: The Communication Perspective [J].
Mao, Yuyi ;
You, Changsheng ;
Zhang, Jun ;
Huang, Kaibin ;
Letaief, Khaled B. .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2017, 19 (04) :2322-2358