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

Document Type

Article

Publication Date

5-1-2022

Abstract

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 $2(1+\xi)\ln (d+1)$2(1+ξ)ln(d+1) with a considerable probability, where $d$d is the maximum number of process slots of an edge node and $\xi$ξ 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.

Identifier

85113220948 (Scopus)

Publication Title

IEEE Transactions on Parallel and Distributed Systems

External Full Text Location

https://doi.org/10.1109/TPDS.2021.3105325

e-ISSN

15582183

ISSN

10459219

First Page

1185

Last Page

1198

Issue

5

Volume

33

Grant

61832008

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS