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

**Authors:** Chen-Feng Liu, Mehdi Bennis, Merouane Debbah, H. Vincent Poor

arXiv: 1812.08076 · 2020-05-19

## TL;DR

This paper introduces a novel edge computing system that ensures ultra-reliable low-latency task processing by combining probabilistic constraints, dynamic resource allocation, and user-server association policies, optimized through Lyapunov and matching theory.

## Contribution

It proposes a new system design using extreme value theory and a two-timescale mechanism for reliable, low-latency task offloading and resource management in MEC.

## Key findings

- Achieves highly-reliable task computation with low delay.
- Reduces users' power consumption through optimized resource allocation.
- Effectively manages wireless channel dynamics with adaptive user-server association.

## 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, 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 re-associated 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 is executed in the short timescale. Simulation results corroborate the effectiveness of the proposed approach by guaranteeing highly-reliable task computation and lower delay performance, compared to several baselines.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1812.08076/full.md

## Figures

28 figures with captions in the complete paper: https://tomesphere.com/paper/1812.08076/full.md

## References

45 references — full list in the complete paper: https://tomesphere.com/paper/1812.08076/full.md

---
Source: https://tomesphere.com/paper/1812.08076