Metraipolis › archive › dc_ca49e84b2314

Distribution of Age of Information in the Erlang Loss System — arXiv:2609.39667

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39667
License (as archived)
CC0-1.0
Archived
2026-10-07T13:15:36.672Z
SHA-256 of the archived text
7b2c195ba2f3aecae1392708a1f5aad175e883099f16c1dac409d3642baa677c
Stable URL of this page
https://metraipolis.com/documento/dc_ca49e84b2314

How to cite

Distribution of Age of Information in the Erlang Loss System — arXiv:2609.39667 — arXiv (en), https://arxiv.org/abs/2609.39667 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ca49e84b2314 (Metraipolis archive dc_ca49e84b2314, sha256 7b2c195ba2f3aecae1392708a1f5aad175e883099f16c1dac409d3642baa677c)
BibTeX
@misc{dcca49e84b2314,
  title = {Distribution of Age of Information in the Erlang Loss System — arXiv:2609.39667},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39667},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ca49e84b2314; sha256 7b2c195ba2f3aecae1392708a1f5aad175e883099f16c1dac409d3642baa677c},
  year = {2026}
}

Archived text

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

In this paper, we study the exact distributions of the age of information (AoI) and peak AoI (PAoI) in a bufferless setting in which time-stamped updates, or processed tasks, generated by one or several information sources according to a Poisson process for each source, are submitted to a shared pool of $c$ homogeneous servers with exponentially distributed service times, i.e., the so-called M/M/c/c or the Erlang loss system. We consider three update management policies which come into play when a new update arrives to find all the servers busy: the arriving update is blocked (non-preemptive, NP) as in the Erlang loss system, or it preempts a randomly chosen update of its own source in service (preempt at random, PR), or the stalest such update (preempt the stalest, PS). All three policies preserve the same birth-death structure of the server occupancy process associated with the underlying Erlang loss system. However, their AoI and PAoI distributions can be very different. The approach we take is the absorbing Markov chain (AMC) method, in which a single AoI cycle, rather than the entire sample path of the system, is modeled by an absorbing Markov chain. Via the AMC method, we derive the exact distributions of AoI and PAoI in matrix-exponential form. The method extends to multiple sources sharing the same pool of servers, with the AoI of a given source being affected by the remaining sources only through their aggregate update rate. Numerical examples illustrate the implications of our findings, including distribution-based server provisioning under age violation constraints.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-10-01 in cs.PF).
Categorie arXiv: Information Theory (cs.IT) ; Performance (cs.PF).
Pagina del lavoro: https://arxiv.org/abs/2609.39667 — 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-07T12:47:13.956Z dalla pagina https://arxiv.org/catchup/cs.PF/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).