Efficient analysis of polling systems

Alan G. Konheim, Hanoch Levy

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

Abstract

A large variety of computer communications systems, in particular the token ring network, are modeled and analyzed as polling systems. The authors present the descendant set approach as a general efficient algorithm for deriving all moments of packet delay (in particular, mean delay) in these systems. The method can apply to a very large variety of model variations including: the exhaustive, gated, and fractional service policies; the cyclic visit order; arbitrary periodic visit orders, (polling tables); random polling orders; and customer routing. For most variations the method significantly outperforms the algorithms commonly used.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM'92
Subtitle of host publicationThe Conference on Computer Communications
Pages2325-2331
Number of pages7
DOIs
StatePublished - 1992
Event11th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'92 - Florence, Italy
Duration: 6 May 19928 May 1992

Publication series

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

Conference

Conference11th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'92
Country/TerritoryItaly
CityFlorence
Period6/05/928/05/92

Fingerprint

Dive into the research topics of 'Efficient analysis of polling systems'. Together they form a unique fingerprint.

Cite this