Analysis of random polling systems

Leonard Kleinrock, Hanoch Levy

Research output: Contribution to journalArticlepeer-review

Abstract

The polling systems consist of N stations, each equipped with an infinite buffer and a single server who serves them in some order. In the systems we consider the next station to be served after station i is determined by probabilistic means. More specifically, according to the model we consider in this paper, after serving station i, the server will poll (i.e., serve) station j with probability Pj. The main results of this paper are expressions for the expected response time in a random polling system operated under a variety of service disciplines. The results are compared to the response time in the equivalent cyclic polling systems. We also analyze the cycle time and the number of customers found in the system.

Original languageEnglish
Pages (from-to)716-732
Number of pages17
JournalOperations Research
Volume36
Issue number5
DOIs
StatePublished - 1988
Externally publishedYes

Fingerprint

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

Cite this