Many-server diffusion limits for $G/Ph/n+GI$ queues
J. G. Dai, Shuangchi He, Tolga Tezcan

TL;DR
This paper derives diffusion limit theorems for large multi-server queues with phase-type services and customer abandonment, extending existing models to more general and overloaded scenarios with innovative proof techniques.
Contribution
It provides new diffusion limit theorems for $G/Ph/n+GI$ queues, including critically loaded and overloaded cases, generalizing prior results and introducing novel proof methods.
Findings
Diffusion limits for critically loaded queues generalize Puhalskii and Reiman (2000).
Overloaded queue limits refine fluid models and extend Whitt (2004).
Innovative proof techniques involve system perturbation and mapping methods.
Abstract
This paper studies many-server limits for multi-server queues that have a phase-type service time distribution and allow for customer abandonment. The first set of limit theorems is for critically loaded queues, where the patience times are independent and identically distributed following a general distribution. The next limit theorem is for overloaded queues, where the patience time distribution is restricted to be exponential. We prove that a pair of diffusion-scaled total-customer-count and server-allocation processes, properly centered, converges in distribution to a continuous Markov process as the number of servers goes to infinity. In the overloaded case, the limit is a multi-dimensional diffusion process, and in the critically loaded case, the limit is a simple transformation of a diffusion process. When the queues are critically loaded, our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
