Dynamic service deployment for budget‐constrained mobile edge computing. (5th July 2019)

• Record Type: Journal Article
• Authors: Zhou, Jingya; Fan, Jianxi; Wang, Jin; Jia, Juncheng
• Other Names: Li Gang guestEditor.; Batten Lynn guestEditor.; Foschini Luca guestEditor.; Kim Hyunbum guestEditor.; Dong Fang guestEditor.; Wu Chenshu guestEditor.; Gao Shangce guestEditor.
• Is Part Of: Concurrency and computation. Volume 31:Number 24(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-07-05
• Subjects: latency‐sensitive applications -- Lyapunov optimization -- mobile edge computing -- service deployment -- task scheduling; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5436
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Currently, Mobile edge computing (MEC) is facing a great challenge that is how to make full use of edge resources to provide a seamless support for compute‐intensive latency‐sensitive applications. Prior studies often make a simple assumption that tasks can be executed upon every edge server, but the assumption does not hold in practical scenarios. Because a specific application task often corresponds to a certain service that provides the corresponding running environment, whereas an edge server only has limited resources and cannot offer too many services. How to decide service deployment of so many types of services among multiple edge servers is also a big challenge. To address the challenge, we study dynamic service deployment for latency‐sensitive applications. We first model the long‐term budget‐constrained latency minimization problem as a multi‐slot latency minimization problem based on the Lyapunov framework. By doing this, the hardness of a problem is significantly reduced, since we never require future information to solve the long‐term optimization. Furthermore, we extend our study by joining the task scheduling optimization, where every edge server is fully utilized in an even more efficient collaborative manner. Our extensive experiments show that the proposed algorithms can bring short latency with low cost.