A Near-Optimal Approach for Online Task Offloading and Resource Allocation in Edge-Cloud Orchestrated Computing

被引:35
作者
Liu, Tong [1 ]
Fang, Lu [1 ]
Zhu, Yanmin [2 ]
Tong, Weiqin [1 ]
Yang, Yuanyuan [3 ]
机构
[1] Shanghai Univ, Sch Comp Engn & Sci, Shanghai 200444, Peoples R China
[2] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China
[3] SUNY Stony Brook, Dept Elect & Comp Engn, Dept Comp Sci, Stony Brook, NY 11794 USA
基金
中国国家自然科学基金;
关键词
Task analysis; Servers; Mobile handsets; Smart devices; Energy consumption; Cloud computing; Computational modeling; Edge computing; cloud computing; task offloading; resource allocation; online optimization; WIRELESS; NETWORKS; DECISION;
D O I
10.1109/TMC.2020.3045471
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Due to the explosion of mobile devices and the evolution of wireless communication technologies, novel applications with intensive computation demands and low-latency requirements have arisen. Edge computing has been proposed as an extension of cloud computing, which moves computation workloads from remote cloud to network edge. Cooperating edge computing and cloud computing can significantly reduce the latency of computation tasks. However, considering the heterogeneity and stochastic arrivals of tasks and the limited computation and communication resources on the edge, task offloading and resource allocation are two joint crucial problems in an edge-cloud orchestrated computing system. In this paper, we propose an online task offloading and resource allocation approach for edge-cloud orchestrated computing, with the aim to minimize the average latency of tasks over time. We first build system models to analyze the latency and energy consumption incurred under different computing modes and formally formulate the joint problem as a mixed-integer optimal decision problem. Then, we employ Lyapunov optimization and duality theory to decompose the problem into a set of subproblems, which can be solved in a semi-decentralized way. We also formally analyze that our approach can achieve near-optimal performance. Extensive simulations are conducted to verify the superiority of our approach.
引用
收藏
页码:2687 / 2700
页数:14
相关论文
共 38 条
[1]   Mobile Edge Computing: A Survey [J].
Abbas, Nasir ;
Zhang, Yan ;
Taherkordi, Amir ;
Skeie, Tor .
IEEE INTERNET OF THINGS JOURNAL, 2018, 5 (01) :450-465
[2]   Energy-Efficient Resource Allocation for Mobile Edge Computing-Based Augmented Reality Applications [J].
Al-Shuwaili, Ali ;
Simeone, Osvaldo .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2017, 6 (03) :398-401
[3]   Dynamic Task Offloading and Scheduling for Low-Latency IoT Services in Multi-Access Edge Computing [J].
Alameddine, Hyame Assem ;
Sharafeddine, Sanaa ;
Sebbah, Samir ;
Ayoubi, Sara ;
Assi, Chadi .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2019, 37 (03) :668-682
[4]  
Bertsekas D., 2003, CONVEX ANAL OPTIMIZA, V1
[5]  
Eshraghi N, 2019, IEEE INFOCOM SER, P1414, DOI [10.1109/infocom.2019.8737559, 10.1109/INFOCOM.2019.8737559]
[6]   Computing with Nearby Mobile Devices: A Work Sharing Algorithm for Mobile Edge-Clouds [J].
Fernando, Niroshinie ;
Loke, Seng W. ;
Rahayu, Wenny .
IEEE TRANSACTIONS ON CLOUD COMPUTING, 2019, 7 (02) :329-343
[7]  
Guo ST, 2016, IEEE INFOCOM SER
[8]   OnDisc: Online Latency-Sensitive Job Dispatching and Scheduling in Heterogeneous Edge-Clouds [J].
Han, Zhenhua ;
Tan, Haisheng ;
Li, Xiang-Yang ;
Jiang, Shaofeng H. -C. ;
Li, Yupeng ;
Lau, Francis C. M. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (06) :2472-2485
[9]  
Huang K., 2017, ARXIV 170101090
[10]   Computation Offloading Scheduling for Periodic Tasks in Mobile Edge Computing [J].
Josilo, Sladana ;
Dan, Gyorgy .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (02) :667-680