Polling Systems in Heavy Traffic: A Bessel Process Limit
Polling Systems in Heavy Traffic: A Bessel Process Limit
复制标题
DOI：
10.1287/moor.23.2.257
复制
发表时间：
1998-02
期刊：
影响因子：
--
通讯作者：
E. Coffman;A. Puhalskii;M. Reiman
中科院分区：
文献类型：
--
作者：
E. Coffman;A. Puhalskii;M. Reiman
本文研究了经典的轮询模型下的穷举服务的假设，这样的模型仍然是非常有用的计算机/通信系统的性能研究。这里的分析扩展了作者早期的工作，一般情况下的非零开关超时。结果表明，在标准的重交通尺度下，系统中的总未完成工作量在重交通极限下趋于贝塞尔型扩散。它还证实，随着这一变化的限制未完成的工作过程中，平均原则建立的作者早些时候结转到一般模型。
This paper studies the classical polling model under the exhaustive-service assumption; such models continue to be very useful in performance studies of computer/communication systems. The analysis here extends earlier work of the authors to the general case of nonzero switch overtimes. It shows that, under the standard heavy-traffic scaling, the total unfinished work in the system tends to a Bessel-type diffusion in the heavy-traffic limit. It verifies in addition that, with this change in the limiting unfinished-work process, the averaging principle established earlier by the authors carries over to the general model.