Table of Contents
Fetching ...

Joint Optimization of Completion Ratio and Latency of Offloaded Tasks with Multiple Priority Levels in 5G Edge

Parisa Fard Moshiri, Murat Simsek, Burak Kantarci

TL;DR

The paper addresses the challenge of minimizing both latency and dropped task ratio in 5G-MEC offloading while respecting task urgency. It develops a joint optimization framework that includes computational latency, communication latency, and dropped task ratio, with urgent tasks prioritized to ensure zero drops, and solves it primarily via MILP while benchmarking PSO and GA. The methodology combines deterministic scheduling (FCFS/STF), linearization techniques, and an optimization-based approach to deliver substantial latency reductions and drop-rate improvements compared with baseline schemes. The results demonstrate the practical impact of the MILP-based solution for scalable, low-latency, low-drop 5G-MEC task offloading under varying UE and task counts.

Abstract

Multi-Access Edge Computing (MEC) is widely recognized as an essential enabler for applications that necessitate minimal latency. However, the dropped task ratio metric has not been studied thoroughly in literature. Neglecting this metric can potentially reduce the system's capability to effectively manage tasks, leading to an increase in the number of eliminated or unprocessed tasks. This paper presents a 5G-MEC task offloading scenario with a focus on minimizing the dropped task ratio, computational latency, and communication latency. We employ Mixed Integer Linear Programming (MILP), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA) to optimize the latency and dropped task ratio. We conduct an analysis on how the quantity of tasks and User Equipment (UE) impacts the ratio of dropped tasks and the latency. The tasks that are generated by UEs are classified into two categories: urgent tasks and non-urgent tasks. The UEs with urgent tasks are prioritized in processing to ensure a zero-dropped task ratio. Our proposed method improves the performance of the baseline methods, First Come First Serve (FCFS) and Shortest Task First (STF), in the context of 5G-MEC task offloading. Under the MILP-based approach, the latency is reduced by approximately 55% compared to GA and 35% compared to PSO. The dropped task ratio under the MILP-based approach is reduced by approximately 70% compared to GA and by 40% compared to PSO.

Joint Optimization of Completion Ratio and Latency of Offloaded Tasks with Multiple Priority Levels in 5G Edge

TL;DR

The paper addresses the challenge of minimizing both latency and dropped task ratio in 5G-MEC offloading while respecting task urgency. It develops a joint optimization framework that includes computational latency, communication latency, and dropped task ratio, with urgent tasks prioritized to ensure zero drops, and solves it primarily via MILP while benchmarking PSO and GA. The methodology combines deterministic scheduling (FCFS/STF), linearization techniques, and an optimization-based approach to deliver substantial latency reductions and drop-rate improvements compared with baseline schemes. The results demonstrate the practical impact of the MILP-based solution for scalable, low-latency, low-drop 5G-MEC task offloading under varying UE and task counts.

Abstract

Multi-Access Edge Computing (MEC) is widely recognized as an essential enabler for applications that necessitate minimal latency. However, the dropped task ratio metric has not been studied thoroughly in literature. Neglecting this metric can potentially reduce the system's capability to effectively manage tasks, leading to an increase in the number of eliminated or unprocessed tasks. This paper presents a 5G-MEC task offloading scenario with a focus on minimizing the dropped task ratio, computational latency, and communication latency. We employ Mixed Integer Linear Programming (MILP), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA) to optimize the latency and dropped task ratio. We conduct an analysis on how the quantity of tasks and User Equipment (UE) impacts the ratio of dropped tasks and the latency. The tasks that are generated by UEs are classified into two categories: urgent tasks and non-urgent tasks. The UEs with urgent tasks are prioritized in processing to ensure a zero-dropped task ratio. Our proposed method improves the performance of the baseline methods, First Come First Serve (FCFS) and Shortest Task First (STF), in the context of 5G-MEC task offloading. Under the MILP-based approach, the latency is reduced by approximately 55% compared to GA and 35% compared to PSO. The dropped task ratio under the MILP-based approach is reduced by approximately 70% compared to GA and by 40% compared to PSO.
Paper Structure (20 sections, 20 equations, 10 figures, 7 tables, 1 algorithm)

This paper contains 20 sections, 20 equations, 10 figures, 7 tables, 1 algorithm.

Figures (10)

  • Figure 1: Proposed methodology
  • Figure 2: General Process Flow for Proposed Methodology
  • Figure 3: Convergence to the objective function's optimal value
  • Figure 4: Comm. latency for different task counts per UE
  • Figure 5: Computational latency for different task counts per UE
  • ...and 5 more figures