Metraipolis › archive › dc_04be4fdbf4a2

Lyapunov-Based Completion-Aware Scheduling for PDU Set-Based Real-Time XR Traffic — arXiv:2608.05537

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.05537
License (as archived)
CC0-1.0
Archived
2026-10-31T11:09:33.551Z
SHA-256 of the archived text
c6578d133d391337ff9d0861cee8ceeb3b0c21ee5ff762162accddc28fe0569c
Stable URL of this page
https://metraipolis.com/documento/dc_04be4fdbf4a2

How to cite

Lyapunov-Based Completion-Aware Scheduling for PDU Set-Based Real-Time XR Traffic — arXiv:2608.05537 — arXiv (en), https://arxiv.org/abs/2608.05537 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_04be4fdbf4a2 (Metraipolis archive dc_04be4fdbf4a2, sha256 c6578d133d391337ff9d0861cee8ceeb3b0c21ee5ff762162accddc28fe0569c)
BibTeX
@misc{dc04be4fdbf4a2,
  title = {Lyapunov-Based Completion-Aware Scheduling for PDU Set-Based Real-Time XR Traffic — arXiv:2608.05537},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.05537},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_04be4fdbf4a2; sha256 c6578d133d391337ff9d0861cee8ceeb3b0c21ee5ff762162accddc28fe0569c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.05537. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Real-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.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-07 in eess.SP).
Categorie arXiv: Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2608.05537 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T10:59:50.826Z dalla pagina https://arxiv.org/catchup/eess.SP/2026-08-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).