Law of large numbers limits for many-server queues
Authors:
- Haya KaspiHKHaya Kaspi
- Kavita RamananKRKavita Ramanan
Open Access
- 1 February 2011
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 21 (1) , 33-114
Abstract
This work considers a many-server queueing system in which customers with independent and identically distributed service times, chosen from a general distribution, enter service in the order of arrival. The dynamics of the system are represented in terms of a process that describes the total number of customers in the system, as well as a measure-valued process that keeps track of the ages of customers in service. Under mild assumptions on the service time distribution, as the number of servers goes to infinity, a law of large numbers (or fluid) limit is established for this pair of processes. The limit is characterized as the unique solution to a coupled pair of integral equations which admits a fairly explicit representation. As a corollary, the fluid limits of several other functionals of interest, such as the waiting time, are also obtained. Furthermore, when the arrival process is time-homogeneous, the measure-valued component of the fluid limit is shown to converge to its equilibrium. Along the way, some results of independent interest are obtained, including a continuous mapping result and a maximality property of the fluid limit. A motivation for studying these systems is that they arise as models of computer data systems and call centers.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- SPDE limits of many-server queuesThe Annals of Applied Probability, 2013
- Asymptotic approximations for stationary distributions of many-server queues with abandonmentThe Annals of Applied Probability, 2012
- Fluid limits of many-server queues with renegingThe Annals of Applied Probability, 2010
- The G/GI/N queue in the Halfin–Whitt regimeThe Annals of Applied Probability, 2009
- Fluid Limits for Processor-Sharing Queues with ImpatienceMathematics of Operations Research, 2008
- Martingale proofs of many-server heavy-traffic limits for Markovian queuesProbability Surveys, 2007
- Statistical Analysis of a Telephone Call CenterJournal of the American Statistical Association, 2005
- Fluid and heavy traffic diffusion limits for a generalized processor sharing modelThe Annals of Applied Probability, 2003
- The fluid limit of a heavily loaded processor sharing queueThe Annals of Applied Probability, 2002
- Skorokhod Topology and Convergence of Processes1987