Metraipolis › archive › dc_209aa69ee84d

Erlang Loss Model with Energy Constrained Servers — arXiv:2609.01559

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01559
License (as archived)
CC0-1.0
Archived
2026-10-17T07:06:01.789Z
SHA-256 of the archived text
cf9322f09585c53f7faae369e6b49a4887342c90ff335caa9e4471f4a02bf0f4
Stable URL of this page
https://metraipolis.com/documento/dc_209aa69ee84d

How to cite

Erlang Loss Model with Energy Constrained Servers — arXiv:2609.01559 — arXiv (en), https://arxiv.org/abs/2609.01559 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_209aa69ee84d (Metraipolis archive dc_209aa69ee84d, sha256 cf9322f09585c53f7faae369e6b49a4887342c90ff335caa9e4471f4a02bf0f4)
BibTeX
@misc{dc209aa69ee84d,
  title = {Erlang Loss Model with Energy Constrained Servers — arXiv:2609.01559},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01559},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_209aa69ee84d; sha256 cf9322f09585c53f7faae369e6b49a4887342c90ff335caa9e4471f4a02bf0f4},
  year = {2026}
}

Archived text

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

In this paper, we study an Erlang-type loss system with energy-constrained servers. Each server is equipped with a finite battery and becomes temporarily unavailable for service when its energy is depleted, entering a charging phase before returning to operation upon full recharge. Customers who arrive to find all servers unavailable are blocked and lost immediately. We characterize the steady-state behavior of this two-dimensional Markov process by extending classical truncation results for Jackson networks to incorporate energy dynamics. This yields a closed-form product-form stationary distribution, from which we derive explicit expressions for the steady-state moments and the blocking probability. Finally, we establish that the corresponding M/G/$k$/$k$ queue with stochastic charging is insensitive to both the service-time and charging-time distributions, depending only on their means. Thus, we extend the insensitivity property of the Erlang loss queue to the stochastic server setting.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-02 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.01559 — 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-17T06:52:29.081Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).