Intermittently Available Server, Priority Queues

Application to Ring Systems
  • Jeremiah F. Hayes
Part of the Applications of Communications Theory book series (ACTH)


It is frequently the case in communications systems that transmission facilities are shared among a number of different sources. In Chapter 5, for example, time-division multiplexing is used to distribute transmission capacity among the sources sharing the same line. The allocation of resources in this case is fixed and is therefore unresponsive to the instantaneous needs of users. In this and in subsequent chapters we shall be examining techniques for sharing resources that respond to variations in instantaneous traffic levels. In this chapter sharing will be effected by granting priority to one class of users over another. As we shall see presently, this mechanism does not necessarily mean inequitable service.


Average Delay Busy Period Priority Queue Priority Class Voice Call 
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.
    N. K. Jaiswal, Priority Queues, Academic Press, New York (1968).MATHGoogle Scholar
  2. 2.
    J. W. Cohen, The Single-Server Queue, North-Holland, Amsterdam (1969).MATHGoogle Scholar
  3. 3.
    D. R. Cox and W. L. Smith, Queues, Methuen, New York (1961).Google Scholar
  4. 4.
    B. Avi-Itzhak and P. Naor, “Some Queueing Problems with the Service Station Subject to Breakdown,” Operations Research, 11(3), 303–320 (1963).MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    L. Takâcs, Combinatorial Methods in the Theory of Stochastic Processes, John Wiley, New York (1967).MATHGoogle Scholar
  6. 6.
    L. Kleinrock, Queueing Systems, Vol. 1: Theory, John Wiley, New York (1975).Google Scholar
  7. 7.
    J. F. Hayes and D. N. Sherman, “Traffic Analysis of a Ring-Switched Data Transmission System,” Bell System Technical journal, 50(9), 2947–2978, November (1971).Google Scholar
  8. 8.
    R. R. Anderson, J. F. Hayes, and D. N. Sherman, “Simulated Performance of a Ring-Switched Data Network,” IEEE Transactions on Communications, Com-20(3), 516–591, June (1972).Google Scholar
  9. 9.
    J. D. Spragins, “Simple Derivation of Queueing Formulas for Loop Systems,” IEEE Transactions on Communications, Com-23, 446–448, April (1977).CrossRefGoogle Scholar
  10. 10.
    E. R. Hafner, Z. Nenadal, and M. Tschanz, “A Digital Loop Communication System,” IEEE Transactions on Communications, Com-22(6), 877–881, June (1974).CrossRefGoogle Scholar
  11. 11.
    W. Bux and M. Schlatter, “An Approximate Method for the Performance Analysis of Buffer Insertion Rings,” IEEE Transactions on Communications, Com-31(1), 50–55, January (1983).CrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1984

Authors and Affiliations

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

Personalised recommendations