POLLING SYSTEMS WITH ZERO SWITCHOVER TIMES: A HEAVY-TRAFFIC AVERAGING PRINCIPLE
成果类型：
Article
署名作者：
Coffman, E. G., Jr.; Puhalskii, A. A.; Reiman, M. I.
署名单位：
AT&T; Nokia Corporation; Nokia Bell Labs; Russian Academy of Sciences
刊物名称：
ANNALS OF APPLIED PROBABILITY
ISSN/ISSBN：
1050-5164
DOI：
10.1214/aoap/1177004701
发表日期：
1995
页码：
681-719
关键词：
摘要：
In polling systems, M >= 2 queues are visited by a single server in cyclic order. These systems model such diverse applications as token-ring communication networks and cyclic production systems. We study polling systems with exhaustive service and zero switchover (walk) times. Under standard heavy-traffic assumptions and scalings, the total unfinished work converges to a one-dimensional reflected Brownian motion, whereas the workloads of individual queues change at a rate that becomes infinite in the limit. Although it is impossible to obtain a multidimensional limit process in the usual sense, we obtain an averaging principle for the individual workloads. To illustrate the use of this principle, we calculate a heavy-traffic estimate of waiting times.