Towards Revenue-Driven Multi-User Online Task Offloading in Edge Computing

Mobile Edge Computing (MEC) has become an attractive solution to enhance the computing and storage capacity of mobile devices by leveraging available resources on edge nodes. In MEC, the arrivals of tasks are highly dynamic and are hard to predict precisely. It is of great importance yet very challe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems Jg. 33; H. 5; S. 1185 - 1198
Hauptverfasser: Ma, Zhi, Zhang, Sheng, Chen, Zhiqi, Han, Tao, Qian, Zhuzhong, Xiao, Mingjun, Chen, Ning, Wu, Jie, Lu, Sanglu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.05.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Approximation algorithms
Cloud computing
Computation offloading
Computer & video games
Edge computing
Educational software
Electronic devices
Mathematical programming
Mobile computing
Mobile edge computing
Nodes
online computation offloading
Optimization
primal-dual technique
Resource management
Revenue
revenue-optimal
Rounding
Software
Storage capacity
Task analysis
Wireless communication
ISSN:1045-9219, 1558-2183
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Mobile Edge Computing (MEC) has become an attractive solution to enhance the computing and storage capacity of mobile devices by leveraging available resources on edge nodes. In MEC, the arrivals of tasks are highly dynamic and are hard to predict precisely. It is of great importance yet very challenging to assign the tasks to edge nodes with guaranteed system performance. In this article, we aim to optimize the revenue earned by each edge node by optimally offloading tasks to the edge nodes. We formulate the revenue-driven online task offloading (ROTO) problem, which is proved to be NP-hard. We first relax ROTO to a linear fractional programming problem, for which we propose the Level Balanced Allocation (LBA) algorithm. We then show the performance guarantee of LBA through rigorous theoretical analysis, and present the LB-Rounding algorithm for ROTO using the primal-dual technique. The algorithm achieves an approximation ratio of <inline-formula><tex-math notation="LaTeX">2(1+\xi)\ln (d+1)</tex-math> <mml:math><mml:mrow><mml:mn>2</mml:mn><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ξ</mml:mi><mml:mo>)</mml:mo><mml:mo form="prefix">ln</mml:mo><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="zhang-ieq1-3105325.gif"/> </inline-formula> with a considerable probability, where <inline-formula><tex-math notation="LaTeX">d</tex-math> <mml:math><mml:mi>d</mml:mi></mml:math><inline-graphic xlink:href="zhang-ieq2-3105325.gif"/> </inline-formula> is the maximum number of process slots of an edge node and <inline-formula><tex-math notation="LaTeX">\xi</tex-math> <mml:math><mml:mi>ξ</mml:mi></mml:math><inline-graphic xlink:href="zhang-ieq3-3105325.gif"/> </inline-formula> is a small constant. The performance of the proposed algorithm is validated through both trace-driven simulations and testbed experiments. Results show that our proposed scheme is more efficient compared to baseline algorithms.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2021.3105325