Dynamic Service Placement for Mobile Micro-Clouds with Predicted Future Costs
TLDR
In this paper, the authors propose an offline algorithm that solves for the optimal configuration in a specific look-ahead time-window, and an online approximation algorithm with polynomial time-complexity to find the placement in real-time whenever an instance arrives.Abstract:
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 over time, 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 $O(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) user-mobility traces. The theoretical methodology used in this paper can potentially be applied to a larger class of dynamic resource allocation problems.read more
Citations
More filters
Book ChapterDOI
UAV Powered Cooperative Anti-interference MEC Network for Intelligent Agriculture
TL;DR: In this paper, the authors proposed an UAV powered cooperative anti-interference mobile edge computing strategy for intelligent agriculture, in which IoT devices transmit their information through distinct subcarriers, and the required energy for information transmission of UAV is minimized through optimizing power allocation.
Journal ArticleDOI
Budget-Constrained Service Allocation Optimization for Mobile Edge Computing
TL;DR: In this paper , the authors formulated the problem as a long-term quality of service (QoS) improvement problem while satisfying the budget of MEC service provider (MSP), and proposed a centralized algorithm to determine the resource allocation strategies.
Book ChapterDOI
Towards Efficient Resource Management in Fog Computing: A Survey and Future Directions
TL;DR: Fog computing is an advanced mechanism to reduce the latency and congestion in IoT networks that emphasizes processing the data as close as possible to the edge of the networks, instead of sending/receiving the data from the data centre by using large quantity of fog nodes.
Journal ArticleDOI
MoDEMS: Optimizing Edge Computing Migrations for User Mobility
Taejin Kim,Sandesh Dhawaskar Sathyanarayana,Siqi Chen,Young-Seog Im,Xiaoxi Zhang,Sangtae Ha,Carlee Joe-Wong +6 more
TL;DR: This paper introduces MoDEMS, a system model and architecture that provides a rigorous theoretical framework and studies the challenges of such migrations to minimize the service provider cost and user latency, and shows that finding the optimal migration plan is in general NP-hard.
References
More filters
Book
Convex Optimization
Stephen Boyd,Lieven Vandenberghe +1 more
TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Proceedings ArticleDOI
Friendship and mobility: user movement in location-based social networks
TL;DR: A model of human mobility that combines periodic short range movements with travel due to the social network structure is developed and it is shown that this model reliably predicts the locations and dynamics of future human movement and gives an order of magnitude better performance.
Book
Online Computation and Competitive Analysis
Allan Borodin,Ran El-Yaniv +1 more
TL;DR: This book discusses competitive analysis and decision making under uncertainty in the context of the k-server problem, which involves randomized algorithms in order to solve the problem of paging.
Book
Combinatorial Optimization: Theory and Algorithms
Bernhard Korte,Jens Vygen +1 more
TL;DR: This fourth edition of this comprehensive textbook on combinatorial optimization is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem.
Related Papers (5)
Mobile Edge Computing: A Survey on Architecture and Computation Offloading
Pavel Mach,Zdenek Becvar +1 more