Metraipolis › archive › dc_6b5d3bb6dfe1
Message-Level Scheduling for RLNC-Coded Multi-Source Traffic — arXiv:2609.10940
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.10940
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T05:58:54.957Z
- SHA-256 of the archived text
e3cd9dc16139f26a98591464b5403016f082813a1f1419988816f78e32922ec9- Stable URL of this page
https://metraipolis.com/documento/dc_6b5d3bb6dfe1
How to cite
Message-Level Scheduling for RLNC-Coded Multi-Source Traffic — arXiv:2609.10940 — arXiv (en), https://arxiv.org/abs/2609.10940 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6b5d3bb6dfe1 (Metraipolis archive dc_6b5d3bb6dfe1, sha256 e3cd9dc16139f26a98591464b5403016f082813a1f1419988816f78e32922ec9)
BibTeX
@misc{dc6b5d3bb6dfe1,
title = {Message-Level Scheduling for RLNC-Coded Multi-Source Traffic — arXiv:2609.10940},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.10940},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6b5d3bb6dfe1; sha256 e3cd9dc16139f26a98591464b5403016f082813a1f1419988816f78e32922ec9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10940. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper studies weighted decoding-delay minimization for multiple RLNC-coded message streams that compete for finite processing capacity at a destination. Packet arrivals are exogenous, while the scheduler only determines the processing order of packets already available at the destination. A trace-conditioned offline scheduling formulation shows that a batch-release subclass is strongly NP-hard even with a single processing unit. Message-Aware Innovation-Deficit Scheduling (MAIDS) is then developed to prioritize each serviceable message according to its weight and remaining decoding deficit. For a single processing unit, MAIDS is shown to be exactly optimal under nonblocking progressive arrivals with equal weights and under common activation with arbitrary positive weights, while the unrestricted weighted online problem admits no universal deterministic $O(1)$ competitive ratio. Simulation results on streaming and batch benchmarks show that MAIDS consistently reduces weighted decoding delay relative to the tested baselines, remains close to the offline optimum on average, and recovers the predicted exact performance boundaries. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-11 in cs.NI). Categorie arXiv: Networking and Internet Architecture (cs.NI). Pagina del lavoro: https://arxiv.org/abs/2609.10940 — 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-16T05:47:00.794Z dalla pagina https://arxiv.org/catchup/cs.NI/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).