University of Oulu

C. Liu, M. Bennis, M. Debbah and H. V. Poor, "Dynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing," in IEEE Transactions on Communications, vol. 67, no. 6, pp. 4132-4150, June 2019. doi: 10.1109/TCOMM.2019.2898573

Dynamic task offloading and resource allocation for ultra-reliable low-latency edge computing

Saved in:
Author: Liu, Chen-Feng1; Bennis, Mehdi1; Debbah, Mérouane2,3;
Organizations: 1Centre for Wireless Communications, University of Oulu, 90014 Oulu, Finland
2Large Networks and System Group, CentraleSupélec, Université Paris–Saclay, 91192 Gif-sur-Yvette, France
3Mathematical and Algorithmic Sciences Laboratory, Huawei France Research and Development, 92100 Paris, France
4Department of Electrical Engineering, Princeton University, Princeton, NJ 08544, USA
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 6.8 MB)
Persistent link:
Language: English
Published: Institute of Electrical and Electronics Engineers, 2019
Publish Date: 2019-12-10


To overcome devices’ limitations in performing computation-intense applications, mobile edge computing (MEC) enables users to offload tasks to proximal MEC servers for faster task computation. However, the current MEC system design is based on average-based metrics, which fails to account for the ultra-reliable low-latency requirements in mission-critical applications. To tackle this, this paper proposes a new system design, where probabilistic and statistical constraints are imposed on task queue lengths, by applying extreme value theory. The aim is to minimize users’ power consumption while trading off the allocated resources for local computation and task offloading. Due to wireless channel dynamics, users are reassociated to MEC servers in order to offload tasks using higher rates or accessing proximal servers. In this regard, a user-server association policy is proposed, taking into account the channel quality as well as the servers’ computation capabilities and workloads. By marrying tools from Lyapunov optimization and matching theory, a two-timescale mechanism is proposed, where a user-server association is solved in the long timescale, while a dynamic task offloading and resource allocation policy are executed in the short timescale. The simulation results corroborate the effectiveness of the proposed approach by guaranteeing highly reliable task computation and lower delay performance, compared to several baselines.

see all

Series: IEEE transactions on communications
ISSN: 0090-6778
ISSN-E: 1558-0857
ISSN-L: 0090-6778
Volume: 67
Issue: 6
Pages: 4132 - 4150
DOI: 10.1109/TCOMM.2019.2898573
Type of Publication: A1 Journal article – refereed
Field of Science: 213 Electronic, automation and communications engineering, electronics
Funding: This work was supported in part by the Academy of Finland project CARMA, in part by the Academy of Finland project MISSION, in part by the Academy of Finland project SMARTER, in part by the INFOTECH project NOOR, in part by the Nokia Bell-Labs project FOGGY, in part by the Nokia Foundation, and in part by the U.S. National Science Foundation under Grant CNS-1702808.
Copyright information: © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.