Transformer-Based Packet Scheduling Under Strict Delay and Buffer Constraints

  • Sylvain Nérondat
  • , Xavier Leturc
  • , Christophe J. Le Martret
  • , Philippe Ciblat

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper presents a packet scheduler for managing multiple links with varying channel capacities, where each link carries multiple data flows with finite buffers and strict delay constraints. Packet loss can result from buffer overflow or delay violations. We propose a deep reinforcement learning scheduler based on an encoder only transformer architecture, capable of handling a variable number of links without dedicated training. Using deep Q-learning, the scheduler minimizes the packet loss rate. Simulations show that our approach outper-forms a state-of-the-art fully connected scheduler, delivering better performance under diverse configurations of links, packet arrival rates, and channel capacities.

Original languageEnglish
Title of host publication2025 IEEE Wireless Communications and Networking Conference, WCNC 2025
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9798350368369
DOIs
Publication statusPublished - 1 Jan 2025
Event2025 IEEE Wireless Communications and Networking Conference, WCNC 2025 - Milan, Italy
Duration: 24 Mar 202527 Mar 2025

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)1525-3511

Conference

Conference2025 IEEE Wireless Communications and Networking Conference, WCNC 2025
Country/TerritoryItaly
CityMilan
Period24/03/2527/03/25

Keywords

  • Deep Reinforcement Learning
  • Packet Scheduling
  • Transformer

Fingerprint

Dive into the research topics of 'Transformer-Based Packet Scheduling Under Strict Delay and Buffer Constraints'. Together they form a unique fingerprint.

Cite this