Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 16 min ago
PreprintCC BY-SA 4.0arXiv

Erlang Loss Model with Energy Constrained Servers

Abstract

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.

Related

  1. Energy-constrained two-way capacities of pure-loss and quantum-limited amplifier channels
    Stefano Pirandola
    arXivPreprintarXiv licenceFull textMathematical physicsOptics & photonicsarXiv
  2. Distribution of Age of Information in the Erlang Loss System
    Nail Akar, Sennur Ulukus
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Retrials in Loss Systems: Mean-Field Analysis, Erlang Bounds, and Power-of-d Comparison
    D Cuesta, M Jonckheere, B J Prabhu +1
    HALPreprintPublisher termsFull textProbabilityHALarXiv
  4. Exact analysis of a split--merge queue with latent Erlang-factor dependent subtask times
    Dawit Zerom
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. The Laplace transform of the time of ruin in the Cramér--Lundberg model with Erlang E2(μ) claims: spectrum, exact moments and matrix reduction
    Goluba Yurieva
    arXivPreprintCC BY-SA 4.0Full textProbabilityarXiv
BibTeX
@misc{kulikov2026erlang,
  title = {{Erlang Loss Model with Energy Constrained Servers}},
  author = {Elijah Kulikov and Eliezer Fuentes-Quezada and Jamol Pender},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.01559},
  eprint = {2609.01559},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.01559},
  note = {CC BY-SA 4.0},
}
RIS
TY  - UNPB
TI  - Erlang Loss Model with Energy Constrained Servers
AU  - Elijah Kulikov
AU  - Eliezer Fuentes-Quezada
AU  - Jamol Pender
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.01559
UR  - https://arxiv.org/abs/2609.01559
AB  - 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.
ER  -