Multi-Agent Reinforcement Learning for Online Traffic Scheduling in Time-Sensitive Application
This paper proposes a multi-agent reinforcement learning framework for time-sensitive networking scheduling in mobile edge computing, improving average frame waiting times and worst-case delays in dynamic XR-driven environments.
Introduces a multi-agent reinforcement learning approach for TSN scheduling in dynamic MEC environments
Keywords
Before reading this…
Applications
- →Extended reality (XR) applications
To understand this paper, make sure you know these concepts first:
- Understanding of time-sensitive networking, mobile edge computing, and reinforcement learningfind papers →
Abstract
More Like ThisTime-sensitive networking (TSN) is increasingly integrated into mobile edge computing (MEC) to support applications with stringent latency requirements, such as extended reality (XR). However, existing TSN scheduling solutions predominantly rely on static optimization techniques or centralized learning models that are based on fixed traffic patterns, limiting their effectiveness in dynamic environments. In practice, MEC environments often host multiple co-located XR traffic flows whose characteristics evolve over time, creating complex inter-queue dependencies that current schedulers fail to capture. Addressing these challenges requires adaptive, decentralized scheduling mechanisms capable of coordinating multiple TSN queues under varying traffic conditions. To this end, this paper proposes a multi-agent reinforcement learning (MARL) framework for TSN scheduling, where each TSN queue is modeled as an autonomous agent. The Heterogeneous-Agent Proximal Policy Optimization (HAPPO) algorithm is employed to explicitly model inter-agent dependencies and jointly optimize service delivery across queues. The simulation results demonstrate that the proposed approach reduces average frame waiting times by up to 26.8% and worst-case delays by approximately 16.8%, highlighting its effectiveness in dynamic XR-driven MEC scenarios.