Law of large numbers limits for many-server queues
Law of large numbers limits for many-server queues
复制标题
大数定律对多服务器队列的限制
DOI:
10.1214/09-aap662
复制
发表时间:
2007
影响因子:
1.8
通讯作者:
K. Ramanan
中科院分区:
文献类型:
--
作者:
H. Kaspi;K. Ramanan
Abstract. This work considers a many-server queueing system in which customers with i.i.d., generally distributed service times 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 characterised 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 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.