arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0708.0952math.PRmath.AP
收藏

许多服务器配置的Law of Large Numbers限制

Law of Large Numbers Limits for Many Server Queues

Haya Kaspi, Kavita Ramanan

摘要:

本文考虑了一个多服务器的排队系统,一般分布的服务时间以到达的顺序进入服务。该系统的动态表示在一个过程中,描述了系统中的客户总数,以及一个测量值的过程,跟踪服务的客户的年龄。在服务时间分布的温和假设下,当服务器的数量趋于无穷大时,这对过程的大数定律(或流体)极限成立。极限的特点是唯一的解决方案,一对耦合的积分方程,承认一个相当明确的表示。作为推论,还得到了其他几个感兴趣的泛函,如等待时间的流体极限。此外,在时间均匀的设置,流体极限收敛到其平衡。在此过程中,得到了一些独立的结果,包括一个连续映射的结果和流体极限的极大性。研究这些系统的动机是,它们是作为计算机数据系统和呼叫中心的模型出现的。

英文摘要:

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 is 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, in the time-homogeneous setting, 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑