Polling systems in heavy traffic: A Bessel process limit
成果类型：
Article
署名作者：
Coffman, EG; Puhalskii, AA; Reiman, MI
署名单位：
Alcatel-Lucent; Lucent Technologies; AT&T; Russian Academy of Sciences
刊物名称：
MATHEMATICS OF OPERATIONS RESEARCH
ISSN/ISSBN：
0364-765X
DOI：
10.1287/moor.23.2.257
发表日期：
1998
页码：
257-304
关键词：
摘要：
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 switchover times. 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.