Joint Task Offloading and Service Placement for Mobile Edge Computing: An Online Two-Timescale Approach
As a new computing paradigm, mobile edge computing (MEC) pushes the centralized cloud resources close to the edge network, which significantly reduces the pressure of the backbone network and meets the requirements of emerging mobile applications. To achieve high performance of the MEC system, it is...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on cloud computing 2023-10, Vol.11 (4), p.3656-3671 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | As a new computing paradigm, mobile edge computing (MEC) pushes the centralized cloud resources close to the edge network, which significantly reduces the pressure of the backbone network and meets the requirements of emerging mobile applications. To achieve high performance of the MEC system, it is essential to design efficient task offloading and service placement schemes, which are responsible for offloading tasks to the edge servers while considering the heterogeneity and diversity of computation services. Our MEC system aims to maximize the long-term average network utility while maintaining the stability of the edge network. Considering that synchronous manner overlooks the scenarios endowed with asymmetric update frequencies for service placement and task offloading, we propose an online algorithm based on the two-timescale Lyapunov optimization in a stochastic network environment without requiring the future information. By making asynchronous decisions on service placement and task offloading with different control parameters V V , we can achieve a time-average sub-optimal solution that is close to the offline optimum. In addition, we introduce the varying control parameter V(t) V(t) and \Omega Ω -additive approximation to enhance the robustness of the proposed algorithm within an error \Omega Ω . Finally, rigorous theoretical analysis and extensive trace-driven experimental results show that the proposed algorithm achieves the [O(1/V), O(V)] [O(1/V),O(V)] |
---|---|
ISSN: | 2168-7161 2372-0018 |
DOI: | 10.1109/TCC.2023.3312283 |