Dynamic Resource Scheduling in Mobile Edge Cloud with Cloud Radio Access Network

被引:83
作者
Wang, Xinhou [1 ]
Wang, Kezhi [2 ]
Wu, Song [1 ]
Di, Sheng [3 ]
Jin, Hai [1 ]
Yang, Kun [4 ]
Ou, Shumao [5 ]
机构
[1] Huazhong Univ Sci & Technol, Serv Comp Technol & Syst Lab, Cluster & Grid Comp Lab, Sch Comp Sci & Technol, Wuhan 430074, Hubei, Peoples R China
[2] Northumbria Univ, Dept Comp & Informat Sci, Newcastle Upon Tyne NE1 8ST, Tyne & Wear, England
[3] Argonne Natl Lab, Lemont, IL 60439 USA
[4] Univ Essex, Colchester CO4 3SQ, Essex, England
[5] Oxford Brookes Univ, Oxford OX3 0BP, England
基金
美国国家科学基金会; 英国工程与自然科学研究理事会;
关键词
Cloud radio access network; mobile edge computing; power-performance tradeoff; Lyapunov optimization; scheduling; DISTRIBUTED DATA CENTERS; ALLOCATION; SERVICE;
D O I
10.1109/TPDS.2018.2832124
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Nowadays, by integrating the cloud radio access network (C-RAN) with the mobile edge cloud computing (MEC) technology, mobile service provider (MSP) can efficiently handle the increasing mobile traffic and enhance the capabilities of mobile devices. But the power consumption has become skyrocketing for MSP and it gravely affects the profit of MSP. Previous work often studied the power consumption in C-RAN and MEC separately while less work had considered the integration of C-RAN with MEC. In this paper, we present an unifying framework for the power-performance tradeoff of MSP by jointly scheduling network resources in C-RAN and computation resources in MEC to maximize the profit of MSP. To achieve this objective, we formulate the resource scheduling issue as a stochastic problem and design a new optimization framework by using an extended Lyapunov technique. Specially, because the standard Lyapunov technique critically assumes that job requests have fixed lengths and can be finished within each decision making interval, it is not suitable for the dynamic situation where the mobile job requests have variable lengths. To solve this problem, we extend the standard Lyapunov technique and design the VariedLen algorithm to make online decisions in consecutive time for job requests with variable lengths. Our proposed algorithm can reach time average profit that is close to the optimum with a diminishing gap (1/V) for the MSP while still maintaining strong system stability and low congestion. With extensive simulations based on a real world trace, we demonstrate the efficacy and optimality of our proposed algorithm.
引用
收藏
页码:2429 / 2445
页数:17
相关论文
共 51 条
[1]  
[Anonymous], 2017, GOOGLE COMPUTE ENGIN
[2]  
[Anonymous], 2015, MOBILE EDGE COMPUTIN
[3]  
[Anonymous], 2017, Amazon elastic compute cloud
[4]  
[Anonymous], 2010, P ACM MOBISYS, DOI [10.1145/1814433.1814441, DOI 10.1145/1814433.1814441]
[5]  
[Anonymous], 2017, DOCKER
[6]  
[Anonymous], IEEE COMMUN MAG
[7]  
[Anonymous], P DES AUT TEST EUR C
[8]  
[Anonymous], 2018, TECH REP
[9]   Dynamic Operations of Cloud Radio Access Networks (C-RAN) for Mobile Cloud Computing Systems [J].
Cai, Yegui ;
Yu, F. Richard ;
Bu, Shengrong .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2016, 65 (03) :1536-1548
[10]   Self-Adaptive Trade-off Decision Making for Autoscaling Cloud-Based Services [J].
Chen, Tao ;
Bahsoon, Rami .
IEEE TRANSACTIONS ON SERVICES COMPUTING, 2017, 10 (04) :618-632