On transience of $\mathrm{M}/\mathrm{G}/\infty$ queues
Author:
Open Access
- 10 October 2024
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 62 (2) , 572-575
Abstract
We consider an $\mathrm{M}/\mathrm{G}/\infty$ queue with infinite expected service time. We then provide the transience/recurrence classification of the states (the system is said to be at state n if there are n customers being served), observing also that here (unlike irreducible Markov chains, for example) it is possible for recurrent and transient states to coexist. We also prove a lower bound on the growth speed in the transient case.
Keywords
This publication has 3 references indexed in Scilit:
- Extremal shot noise processes and random cutout setsBernoulli, 2025
- Semi-infinite particle systems with exclusion interaction and heterogeneous jump ratesProbability Theory and Related Fields, 2025
- The $M/G /\infty $ QueueSIAM Journal on Applied Mathematics, 1966