IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v36y1988i5p716-732.html
   My bibliography  Save this article

The Analysis of Random Polling Systems

Author

Listed:
  • Leonard Kleinrock

    (University of California, Los Angeles, California)

  • Hanoch Levy

    (AT&T Bell Laboratories, Holmdel, New Jersey)

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.

Suggested Citation

  • Leonard Kleinrock & Hanoch Levy, 1988. "The Analysis of Random Polling Systems," Operations Research, INFORMS, vol. 36(5), pages 716-732, October.
    • Handle: RePEc:inm:oropre:v:36:y:1988:i:5:p:716-732
    DOI: 10.1287/opre.36.5.716
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.36.5.716
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.36.5.716?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Germs, Remco & Van Foreest, Nicky D., 2011. "Admission policies for the customized stochastic lot scheduling problem with strict due-dates," European Journal of Operational Research, Elsevier, vol. 213(2), pages 375-383, September.
    2. Herwig Bruneel & Arnaud Devos, 2024. "Explicit Solutions for Coupled Parallel Queues," Mathematics, MDPI, vol. 12(15), pages 1-31, July.
    3. Dieter Fiems & Eitan Altman, 2012. "Gated polling with stationary ergodic walking times, Markovian routing and random feedback," Annals of Operations Research, Springer, vol. 198(1), pages 145-164, September.
    4. Tetsuji Hirayama, 2012. "Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms," Annals of Operations Research, Springer, vol. 198(1), pages 83-123, September.
    5. Jelmer P. Gaast & Ivo J. B. F. Adan & René B. M. Koster, 2017. "The analysis of batch sojourn-times in polling systems," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 313-335, April.
    6. Christos Langaris, 1999. "Markovian polling systems with mixed service disciplines and retrial customers," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(2), pages 305-322, December.
    7. Chydzinski, Andrzej, 2016. "Analysis of the scheduling mechanism for virtualization of links with partial isolation," Applied Mathematics and Computation, Elsevier, vol. 281(C), pages 39-54.
    8. Mahender P. Singh & Mandyam M. Srinivasan, 2007. "Performance Bounds for Flexible Systems Requiring Setups," Management Science, INFORMS, vol. 53(6), pages 991-1004, June.
    9. Dimitris Bertsimas & José Niño-Mora, 1996. "Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case," Economics Working Papers 302, Department of Economics and Business, Universitat Pompeu Fabra, revised Jul 1998.
    10. Bertsimas, Dimitris., 1995. "The achievable region method in the optimal control of queueing systems : formulations, bounds and policies," Working papers 3837-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.

    More about this item

    Keywords

    queues: random polling;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:36:y:1988:i:5:p:716-732. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.