CoChat

Dynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing

Open access
Liu, Chen-Feng, Bennis, Mehdi, Debbah, Merouane, Poor, H. Vincent · 2019 · IEEE Transactions on Communications

The DOI matches its Crossref record; 47 of the 52 references it cites were found in a registry or an index, and 1 are not checked yet.

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tcomm.2019.2898573

Cites

47 of 48 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 2

  1. roth, 1992, Two-Sided Matching A Study in Game-Theoretic
  2. 2017, Propagation Data and Prediction Methods for the Planning of Indoor Radiocommunication Systems and Radio Local Area Networks in the Frequency Range 300 MHz to 100 GHz

Cited by

See all 456

Metadata

Authors
Liu, C.-F., Bennis, M., Debbah, M., & Poor, H. V.
Affiliations
  • University of Oulu (FI)
  • Huawei Technologies (France) (FR)
  • Princeton University (US)
Venue
IEEE Transactions on Communications
Published
2019-06
Volume
67
Issue
6
Pages
4132-4150
ISSN
  • 0090-6778 (ISSN-L)
  • 1558-0857
OpenAlex
W2904994737
Cited by
435
References
52
Citations by year
2026: 19 · 2025: 58 · 2024: 64 · 2023: 59 · 2022: 73 · 2021: 98 · 2020: 46 · 2019: 18
FWCI
32.17
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Communications (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Academy of Finland
  • Academy of Finland project MISSION
  • Academy of Finland project SMARTER
  • INFOTECH project NOOR
  • Nokia
  • Nokia Foundation
  • National Science Foundation (CCF-093970, CCF-1513915)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
  • Physical Sciences › Computer Science › Computer Networks and Communications › Age of Information Optimization
Keywords
mobile edge computing, task offloading, resource allocation, ultra-reliable low-latency communication, extreme value theory, Lyapunov optimization, matching theory, two-timescale optimization, power consumption minimization, mission-critical applications

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.