In Section 2.7.4 of Chapter 2 the role of polling in access protocols for local area networks was discussed. In the model of polling systems a number of independent sources share a common facility, usually a transmission line; however, unlike priority queues, the sharing is equal. Again we use the commutator analogy where a server cycles among source buffers. The model is depicted in Figure 7.1. Messages arrive at N queues, with queue i receiving an average rate of λ i messages/sec. In most cases of interest we take the arrival process to be Poisson. The server goes from queue to queue in some prescribed order, pausing to remove messages from each of the queues. A salient feature of the model is that the amount of time spent by the server at a queue depends upon the number of messages in the queue when the server arrives. As we shall see, this leads to complex dependencies between the queues. A second important factor is walk-time or overhead. After a server leaves a queue and before it begins work on the next queue there is a period during which there is a walk-time and the server remains idle. In most cases of interest this walk-time between queues is a constant. However, analyses can be carried out under more general assumptions.


Cycle Time Central Processor Polling System Polling Model Access Delay 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Schwartz, Computer Communication Network Design and Analysis, Prentice-Hall, Englewood Cliffs, New Jersey (1977).MATHGoogle Scholar
  2. 2.
    A. S. Tanenbaum, Computer Networks, Prentice-Hall, Englewood Cliffs, New Jersey (1981).Google Scholar
  3. 3.
    W. R. Franta and J. Chamatac, Local Networks, Lexington Books, Lexington, Massachusetts (1981).Google Scholar
  4. 4.
    W. D. Farmer and E. E. Newhall, “An Experimental Distributed Switching System to Handle Bursty Computer Traffic,” Proceedings of the ACM Symposium, Problems in Optimization Data Communication Systems, pp. 1–34, Pine Mountain, Georgia (1969).Google Scholar
  5. 5.
    W. Bux, T. Closs, P. Janson, K. Kümmerle, and H. S. Müller, “A Reliable Token System for Local-Area Communication,” National Telecommunication Conference, pp. A2.2.1–A2.2.6, New Orleans, December (1981).Google Scholar
  6. 6.
    R. B. Cooper and G. Murray, “Queues Served in Cyclic Order,” Bell System Technical Journal, 48(3), 675–689, March (1969).MathSciNetMATHGoogle Scholar
  7. 7.
    R. B. Cooper, “Queues Served in Cyclic Order: Waiting Times,” Bell System Technical Journal, 49(3), 399–413, March (1970).MathSciNetMATHGoogle Scholar
  8. 8.
    C. Mack, T. Murphy, and N. L. Webb, “The Efficiency of N Machines Undirectionally Patrolled by One Operative when Walking and Repair Times are Constant,” Journal of the Royal Statistical Society, Series B, 19, 166–172 (1957).MathSciNetMATHGoogle Scholar
  9. 9.
    A. R. Kaye, “Analysis of Distributed Control Loop for Data Transmission,” Proceedings of the Symposium on Computer Communications Network Teletraffic, Polytechnic Institute of Brooklyn, New York (1972).Google Scholar
  10. 10.
    C. Mack, “The Efficiency of N Machines Unidirectionally Patrolled by One Operative when Walking Time is Constant and Repair Times are Variable,” Journal of Royal Statistical Society, Series B, 19, 173–178 (1957).MathSciNetMATHGoogle Scholar
  11. 11.
    M. A. Liebowitz, “An Approximate Method for Treating a Class of Multiqueue Problems,” IBM Syst. J., 5, 204–209, July (1961).Google Scholar
  12. 12.
    O. Hashida, “Analysis of Multiqueue,” Review of the Electrical Communication Laboratories NTT 20,(3, 4), 189–199, March (1972).Google Scholar
  13. 13.
    J. F. Hayes and D. N. Sherman, “A Study of Data Multiplexing Techniques and Delay Performance,” Bell System Technical Journal, 51, 1985–2011, November (1972).Google Scholar
  14. 14.
    L. Kleinrock, Queueing Systems: Vol. 1, Theory, John Willey, New York (1975).Google Scholar
  15. 15.
    J. F. Hayes, “Local Distribution in Computer Communications,” IEEE Communications Magazine, 19,(2), March (1981).Google Scholar
  16. 16.
    D. R. Cox and W. L. Smith, Queues, Methuen London (1961).Google Scholar
  17. 17.
    B. Avi-Itzhak, W. L. Maxwell, and L. W. Miller, “Queues with Alternating Priorities,” Journal of the Operations Research Society of America, 13(2), 306–318 (1965).MathSciNetMATHCrossRefGoogle Scholar
  18. 18.
    L. Takacs, “Two Queues Attended by a Single Server,” Operations Research, 16, 639–650 (1968).MATHCrossRefGoogle Scholar
  19. 19.
    J. S. Sykes, “Simplified Analysis of an Algernating Priority Queueing Model with Setup Time,” Operations Research, 18, 399–413 (1970).CrossRefGoogle Scholar
  20. 20.
    M. Eisenberg, “Two Queues with Changeover Times,” Operations Research, 19, 386–401 (1971).MATHCrossRefGoogle Scholar
  21. 21.
    M. Eisenberg, “Queues with Periodic Service and Changeover Times,” Operations Research 20, 440–451 (1972).MathSciNetMATHCrossRefGoogle Scholar
  22. 22.
    A. G. Konheim and B. Meister, “Waiting Lines and Times in a System with Polling,” Journal of the ACM, 21, 470–490, July (1974).MathSciNetMATHCrossRefGoogle Scholar
  23. 23.
    G. B. Swarz, “Polling in a Loop System,” Journal of the ACM, 27(1), 42–59, January (1980).Google Scholar
  24. 24.
    O. Hashida and K. Ohara, “Line Accommodation Capacity of a Communication Control Unit,” Review of the Electrical Communications Laboratories, NTT, 20, 231–239 (1972).Google Scholar
  25. 25.
    S. Halfin, “An Approximate Method for Calculating Delays for a Family of Cyclic Type Queues,” Bell System Technical Journal, 54(10), 1733–1754, December (1975).MathSciNetMATHGoogle Scholar
  26. 26.
    P. J. Kuehn, “Multiqueue Systems with Nonexhaustive Cyclic Service,” Bell System Technical Journal, 58(3), 671–699, March (1979).MATHGoogle Scholar
  27. 27.
    L. Kleinrock, Queueing Systems, Vol. 1: Theory, Wiley-Interscience, New York (1975).Google Scholar

Copyright information

© Plenum Press, New York 1984

Authors and Affiliations

  • Jeremiah F. Hayes
    • 1
  1. 1.Concordia UniversityMontrealCanada

Personalised recommendations