Polling Systems with Zero Switchover Times: A Heavy-Traffic Averaging Principle

Abstract

In polling systems, $M \geq 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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 84 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.