.png){kind=icon}
Return
Utility Aware Offloading for Mobile-Edge Computing
.png){kind=icon}
OA
AI
DOI：10.26599/TST.2019.9010062.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mobile-edge computing casts the computation-intensive and delay-sensitive applications of mobile devices onto network edges. Task offloading incurs extra communication latency and energy cost, and extensive efforts have focused on offloading schemes. Many metrics of the system utility are defined to achieve satisfactory quality of experience. However, most existing works overlook the balance between throughput and fairness. This study investigates the problem of finding an optimal offloading scheme in which the objective of optimization aims to maximize the system utility for leveraging between throughput and fairness. Based on Karush-Kuhn-Tucker condition, the expectation of time complexity is analyzed to derive the optimal scheme. A gradient-based approach for utility-aware task offloading is given. Furthermore, we provide an increment-based greedy approximation algorithm with 1 + 1/e - 1 ratio. Experimental results show that the proposed algorithms can achieve effective performance in utility and accuracy.
Keywords:
utility
approximation algorithm
quality of experience
mobile edge computing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
T
IF:
3.5
Papers:
987
Citations:
2.5K
Organization
Cited Papers
No cited papers available