Transformer-Based Packet Scheduling Under Strict Delay and Buffer Constraints
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.
Authors
- Christophe J. Le Martret
- Philippe Ciblat (ORCID: https://orcid.org/0000-0002-2310-4115)
- Xavier Leturc (ORCID: https://orcid.org/0000-0003-4340-1771)
- Sylvain Nérondat
Institutions
- Thales (France) (FR)
- Laboratoire Traitement et Communication de l’Information (FR)
Publication Details
- Published
- 2025-03-24
- DOI
- https://doi.org/10.1109/wcnc61545.2025.10978237
- Primary Topic
- Interconnection Networks and Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00