Lyapunov-Based Completion-Aware Scheduling for PDU Set-Based Real-Time XR Traffic
This paper proposes a MAC scheduler for real-time XR services that considers set-level completion dependency, deadline urgency, and feasibility.
The authors propose a new MAC scheduler that jointly considers set-level completion dependency, deadline urgency, and feasibility.
Before reading this…
Applications
- →XR services
- →Real-time communication systems
To understand this paper, make sure you know these concepts first:
- Understanding of MAC schedulingfind papers →
- Familiarity with Lyapunov theoryfind papers →
Abstract
More Like ThisReal-time extended reality (XR) services impose stringent throughput, latency, and reliability requirements. An XR media unit is commonly segmented into a protocol data unit (PDU) set that is useful only when all required PDUs are delivered within its delay budget. Existing PDU set-aware medium access control (MAC) schedulers generally prioritize transmissions according to urgency or progress, without explicitly accounting for whether a PDU set can still be completed on time. In this paper, we propose a Lyapunov-based completion-aware MAC scheduler that jointly captures the set-level completion dependency, deadline urgency, and completion feasibility of each head-of-line PDU set. Long-term quality-of-service (QoS) requirements are represented through virtual debt queues, and resources are allocated according to their marginal contribution to the timely-completion probability of each head-of-line PDU set. These components are integrated into a drift-plus-penalty scheduling metric that balances long-term reliability requirements against current completion opportunities. System-level simulations demonstrate that the proposed scheduler improves PDU set delivery reliability and lower-tail performance under resource contention, while providing robust performance across heterogeneous traffic demands and network conditions.