Joint Scheduling and Resource Allocation for Packets with Deadlines and Priorities

TL;DR

This paper introduces a novel scheduling policy for cellular networks that manages packets with diverse priorities and deadlines, using linear programming relaxation to improve performance in congested traffic.

Contribution

It proposes a new scheduling policy for prioritized packets with deadlines, employing a linear programming relaxation to handle NP-hard complexity.

Findings

Outperforms existing scheduling strategies in simulations

Effectively manages packets with strict deadlines and priorities

Reduces complexity of scheduling in congested networks

Abstract

Cellular networks provide communication for different applications. Some applications have strict and very short latency requirements, while others require high bandwidth with varying priorities. The challenge of satisfying the requirements grows in congested traffic where some packets might miss their deadlines. Unfortunately, we prove that the problem is NP-Hard. To overcome this, we propose a new scheduling policy for packets with multiple priorities, latency requirements, and strict deadlines. To alleviate the complexity, our solution incorporates a novel time domain relaxation solved by linear programming. Simulation results show that this method outperforms existing scheduling strategies.