The Analysis of Random Polling Systems

Leonard Kleinrock and Hanoch Levy
Additional contact information
Leonard Kleinrock: University of California, Los Angeles, California
Hanoch Levy: AT&T Bell Laboratories, Holmdel, New Jersey

Operations Research, 1988, vol. 36, issue 5, 716-732

Abstract: In this paper, we analyze the behavior of random polling systems . The polling systems we consider consist of N stations, each equipped with an infinite buffer and a single server who serves them in some order. In contrast to previously studied polling systems, where the order of service used by the server is periodic (and usually cyclic ), 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 ( j = 1, 2, …, N ) with probability p j . 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. Also in this paper, we analyze the cycle time and the number of customers found in the system.

Keywords: queues:; random; polling (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.5.716 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:36:y:1988:i:5:p:716-732

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().