Polling systems with correlated arrivals

Hanoch Levy, Moshe Sidi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we analyze polling systems with correlated arrivals, namely, the arrival processes of customers to the queues are not assumed to be independent. We 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 we 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.

Original languageEnglish
Title of host publicationIEEE INFOCOM'89, Proceedings of the 8th Annual Joint Conference of the IEEE Computer and Communications Societies
Pages907-913
Number of pages7
DOIs
StatePublished - 1989
Event8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89 - Ottawa, ON, Canada
Duration: 23 Apr 198927 Apr 1989

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Conference

Conference8th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'89
Country/TerritoryCanada
CityOttawa, ON
Period23/04/8927/04/89

Fingerprint

Dive into the research topics of 'Polling systems with correlated arrivals'. Together they form a unique fingerprint.

Cite this