Dynamic Service Placement for Mobile Micro-Clouds with Predicted Future Costs

• Published in: IEEE transactions on parallel and distributed systems Vol. 28; no. 4; pp. 1002 - 1016
• Main Authors: Wang, Shiqiang, Urgaonkar, Rahul, He, Ting, Chan, Kevin, Zafer, Murtaza, Leung, Kin K.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.04.2017; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Algorithms; Approximation algorithms; Cloud computing; Computer simulation; Configurations; Cost function; Electronic mail; fog/edge computing; Heuristic algorithms; Mathematical analysis; online approximation algorithm; optimization; Placement; Polynomials; Prediction algorithms; Predictions; Resource allocation; Upper bounds; Windows (intervals); wireless networks
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2016.2604814

Mobile micro-clouds are promising for enabling performance-critical cloud applications. However, one challenge therein is the dynamics at the network edge. In this paper, we study how to place service instances to cope with these dynamics, where multiple users and service instances coexist in the system. Our goal is to find the optimal placement (configuration) of instances to minimize the average cost overtime, leveraging the ability of predicting future cost parameters with known accuracy. We first propose an offline algorithm that solves for the optimal configuration in a specific look-ahead time-window. Then, we propose an online approximation algorithm with polynomial time-complexity to find the placement in real-time whenever an instance arrives. We analytically show that the online algorithm is 0(1)-competitive for a broad family of cost functions. Afterwards, the impact of prediction errors is considered and a method for finding the optimal look-ahead window size is proposed, which minimizes an upper bound of the average actual cost. The effectiveness of the proposed approach is evaluated by simulations with both synthetic and real-world (San Francisco taxi) usermobility traces. The theoretical methodology used in this paper can potentially be applied to a larger class of dynamic resource allocation problems.