Joint Scheduling and Resource Allocation for Packets with Deadlines and Priorities

Li On Raviv*, Amir Leshem

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.

Original languageAmerican English
Article number1
Pages (from-to)248-252
Number of pages5
JournalIEEE Communications Letters
Issue number1
StatePublished - 1 Jan 2023
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 1997-2012 IEEE.


  • EDF
  • Joint scheduling
  • channel allocation
  • deadline
  • integer linear programming
  • linear programming
  • priority
  • queues


Dive into the research topics of 'Joint Scheduling and Resource Allocation for Packets with Deadlines and Priorities'. Together they form a unique fingerprint.

Cite this