Abstract
Mobile edge computing allows wireless users to exploit the power of cloud computing without the large communication delay. To serve data-intensive applications (e.g., augmented reality, video analytics) from the edge, we need, in addition to CPU cycles and memory for computation, storage resource for storing server data and network bandwidth for receiving user-provided data. Moreover, the data placement needs to be adapted over time to serve time-varying demands, while considering system stability and operation cost. We address this problem by proposing a two-time-scale framework that jointly optimizes service (data code) placement and request scheduling, under storage, communication, computation, and budget constraints. We fully characterize the complexity of our problem by analyzing the hardness of various cases. By casting our problem as a set function optimization, we develop a polynomial-time algorithm that achieves a constant-factor approximation under certain conditions. Extensive synthetic and trace-driven simulations show that the proposed algorithm achieves 90% of the optimal performance.
Original language | English |
---|---|
Title of host publication | INFOCOM 2019 - IEEE Conference on Computer Communications |
Pages | 1279-1287 |
Number of pages | 9 |
ISBN (Electronic) | 9781728105154 |
DOIs | |
State | Published - Apr 2019 |
Event | 2019 IEEE Conference on Computer Communications, INFOCOM 2019 - Paris, France Duration: Apr 29 2019 → May 2 2019 |
Publication series
Name | Proceedings - IEEE INFOCOM |
---|---|
Volume | 2019-April |
ISSN (Print) | 0743-166X |
Conference
Conference | 2019 IEEE Conference on Computer Communications, INFOCOM 2019 |
---|---|
Country/Territory | France |
City | Paris |
Period | 4/29/19 → 5/2/19 |
Bibliographical note
Publisher Copyright:© 2019 IEEE.
Keywords
- Mobile edge computing
- complexity analysis
- resource allocation
- service placement
ASJC Scopus subject areas
- General Computer Science
- Electrical and Electronic Engineering