Metraipolis › archive › dc_d52e971d4cbd

Worse Routes, Fresher Information: Preemption Redefines Which Route is Best — arXiv:2609.13622

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.13622
License (as archived)
CC0-1.0
Archived
2026-10-16T01:34:25.813Z
SHA-256 of the archived text
f36e390ad1e723ec591c52ec6dd47e193ad2fe45c29d703206e79597d894eadd
Stable URL of this page
https://metraipolis.com/documento/dc_d52e971d4cbd

How to cite

Worse Routes, Fresher Information: Preemption Redefines Which Route is Best — arXiv:2609.13622 — arXiv (en), https://arxiv.org/abs/2609.13622 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d52e971d4cbd (Metraipolis archive dc_d52e971d4cbd, sha256 f36e390ad1e723ec591c52ec6dd47e193ad2fe45c29d703206e79597d894eadd)
BibTeX
@misc{dcd52e971d4cbd,
  title = {Worse Routes, Fresher Information: Preemption Redefines Which Route is Best — arXiv:2609.13622},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13622},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d52e971d4cbd; sha256 f36e390ad1e723ec591c52ec6dd47e193ad2fe45c29d703206e79597d894eadd},
  year = {2026}
}

Archived text

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

This paper studies joint sampling, route activation, and preemption control over $N$ heterogeneous transmission routes under a long-run objective combining Age of Information (AoI) with sampling and transmission costs. We formulate the problem as an average-cost impulse-control model, derive a vector-form integral average-cost optimality equation over a hybrid state space, and establish structural reductions on the state. We consider a two-route case and compute optimized policies using discretized policy iteration. Surprisingly, the results show that preemption can reverse routing preferences: the optimized policy may exclusively use a route with both a larger mean delay and a larger delay variance while avoiding the seemingly superior route. Relative to baselines that do not allow preemption, the proposed policy reduces average AoI by up to $96\%$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.13622 — 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-16T01:21:38.605Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).