Polling systems with correlated arrivals

Abstract

An analysis is made of polling systems with correlated arrivals, namely, systems in which the arrival processes of customers to the queues are not assumed to be independent. The authors consider cyclic polling systems with N queues, general service time distribution in each queue, and general switch-over times. For both the exhaustive and the gated service disciplines they derive the necessary equations for computing the N expected waiting time figures. A 'pseudo' conservation law for these systems is also derived. The analysis approach can be applied to other polling systems with correlated arrivals.>

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 — 16 citations exist upstream.

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