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

• Published in: IEEE transactions on parallel and distributed systems Vol. 29; no. 11; pp. 2429 - 2445
• Main Authors: Wang, Xinhou, Wang, Kezhi, Wu, Song, Di, Sheng, Jin, Hai, Yang, Kun, Ou, Shumao
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.11.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Cloud computing; Cloud radio access network; Computer simulation; Containers; Decision making; Design optimization; Design standards; Electronic devices; Lyapunov optimization; MATHEMATICS AND COMPUTING; Mobile computing; Mobile edge computing; Mobile handsets; Optimization; Power consumption; Power demand; Power-performance tradeoff; Processor scheduling; Resource scheduling; Scheduling; Systems stability; Wireless networks
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2018.2832124

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.