Journal article · 2019 · Open access

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

Chen–Feng Liu, Mehdi Bennis, Merouane Abdelkader Debbah, H. Vincent Poor

IEEE Transactions on Communications, 67(6), 4132–4150 · Published 11 February 2019 · DOI 10.1109/tcomm.2019.2898573

Open PDFView at the publisherCite this paper

In brief

“Dynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing” is a 2019 journal article by Chen–Feng Liu and 3 co-authors, published in IEEE Transactions on Communications. OpenAlex counts 457 citations as of 19 November 2026, which puts it in the top 1% of works published in 2019 by citations. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
457
Most cited in
2021 (94)
Field-weighted impact
28.37
References
53
Authors
4

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.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Liu, C., Bennis, M., Debbah, M. A., & Poor, H. V. (2019). Dynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing. IEEE Transactions on Communications, 67(6), 4132–4150. https://doi.org/10.1109/tcomm.2019.2898573

MLA 9

Liu, Chen–Feng, et al. “Dynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing.” IEEE Transactions on Communications, vol. 67, no. 6, 2019, pp. 4132–4150. https://doi.org/10.1109/tcomm.2019.2898573.

Chicago

Liu, Chen–Feng, Mehdi Bennis, Merouane Abdelkader Debbah, and H. Vincent Poor. 2019. “Dynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing.” IEEE Transactions on Communications 67 (6): 4132–4150. https://doi.org/10.1109/tcomm.2019.2898573.

Harvard

Liu, C. et al. (2019) ‘Dynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing’, IEEE Transactions on Communications, 67(6), pp. 4132–4150. doi:10.1109/tcomm.2019.2898573.

IEEE

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

BibTeX

@article{liu2019dynamic,
  title     = {{Dynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing}},
  author    = {Liu, Chen–Feng and Bennis, Mehdi and Debbah, Merouane Abdelkader and Poor, H. Vincent},
  journal   = {IEEE Transactions on Communications},
  year      = {2019},
  volume    = {67},
  number    = {6},
  pages     = {4132--4150},
  doi       = {10.1109/tcomm.2019.2898573},
  url       = {https://doi.org/10.1109/tcomm.2019.2898573}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
20191919
20204141
20219494
20227575
20236262
20246767
20256666
20263333

Its field-weighted citation impact is 28.37: it has been cited 28.37 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing

  • mobile edge computing
  • task offloading
  • resource allocation
  • ultra-reliable low-latency communication
  • extreme value theory
  • Lyapunov optimization
  • matching theory
  • two-timescale optimization

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Liu, C., Bennis, M., Debbah, M. A., & Poor, H. V. (2019). Dynamic Task Offloading and Resource Allocation for Ultra-Reliable Low-Latency Edge Computing. IEEE Transactions on Communications, 67(6), 4132–4150. https://doi.org/10.1109/tcomm.2019.2898573

How many times has this paper been cited?

457 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Chen–Feng Liu, Mehdi Bennis, Merouane Abdelkader Debbah, H. Vincent Poor.

What is the DOI of this paper?

10.1109/tcomm.2019.2898573, permanently at https://doi.org/10.1109/tcomm.2019.2898573. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.