Asymptotic approximations for stationary distributions of many-server queues with abandonment
Weining Kang, Kavita Ramanan

TL;DR
This paper analyzes the long-term behavior of many-server queues with customer abandonment, establishing conditions for the existence of stationary distributions and their convergence to fluid model limits.
Contribution
It introduces a rigorous framework for the stationary distributions of many-server queues with abandonment and proves their convergence to fluid limits under general assumptions.
Findings
The system's state process is a Feller process and admits a stationary distribution.
Scaled stationary distributions are tight and converge to an invariant state of the fluid limit.
Interchanging limits of large number of servers and time may not always be valid.
Abstract
A many-server queueing system is considered in which customers arrive according to a renewal process and have service and patience times that are drawn from two independent sequences of independent, identically distributed random variables. Customers enter service in the order of arrival and are assumed to abandon the queue if the waiting time in queue exceeds the patience time. The state of the system with servers is represented by a four-component process that consists of the forward recurrence time of the arrival process, a pair of measure-valued processes, one that keeps track of the waiting times of customers in queue and the other that keeps track of the amounts of time customers present in the system have been in service and a real-valued process that represents the total number of customers in the system. Under general assumptions, it is shown that the state process is a…
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.
