Networks of Queues

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


An appropriate model for a number of systems is a network of queues in which the output of one queue is fed into another. Under a wide range of assumptions, these networks may be modeled and analyzed by means of multidimensional birth-death processes. The salient result of this work is the product form solution in which the joint distribution of queue occupancies is the product of functions of the number in the individual queues. Networks satisfying the proper set of assumptions are called Jackson networks after J. R. Jackson, who discovered the product form solution.(1) In this chapter the model is applied to store-and-forward message-switched networks. Using the theory of Jackson networks we shall find queue occupancy and delay in message-switched networks. These results enable us to allocate transmission capacity in an optimum fashion. In the next chapter these same ideas are extended in order to model flow control in a store-and-forward network.


Service Time Queue Length Central Processor Average Delay Capacity Allocation 
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.
    J. R. Jackson, “Networks of Waiting Lines,” Operations Research, 5, 518–521 (1957).MathSciNetCrossRefGoogle Scholar
  2. 2.
    J. R. Jackson, “Jobshop-like Queueing Systems,” Management Science, 10,131–142 (1963).CrossRefGoogle Scholar
  3. 3.
    H. Kobayashi, Modeling and AnalysisAn Introduction to System Performance Methodology. Addison-Wesley, Reading, Massachusetts (1978).Google Scholar
  4. 4.
    E. Reich, “Waiting Time when Queues are in Tandem,” Annals of Mathematical Statistics, 28, 768–773 (1957).MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    P. J. Burke, “The Output Process of a Stationary M/M/S Queueing System,” Annals of Mathematical Statistics, 37(4), 1144–1152 (1968).MathSciNetCrossRefGoogle Scholar
  6. 6.
    P. J. Burke, “The Dependence of Delays in Tandem Queues,” Annals of Mathematical Statistics, 35, 874–875 (1964).MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    B. Melamed, “On Poisson Traffic Processes in Discrete State Markovian Systems with Applications to Queueing Theory,” Technical Report 77–7, Department of Industrial and Operations Engineering, University of Michigan (1977).Google Scholar
  8. 8.
    F. J. Beutler and B. Melamed, “Decomposition and Customer Streams of Feedback Networks of Queues in Equilibrium,” Operations Research, 26(6), 1059–1072, November-December (1978).MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    A. J. Lemoine, “Networks of Queues—A Survey of Equilibrium Analysis,” Management Science, 24(4), 464–481, December (1977).MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    F. Baskette et al., “Open, Closed and Mixed Networks of Queues with Different Classes of Customers,” Journal of the Association for Compting Machinery, 22, 248–260 (1975).CrossRefGoogle Scholar
  11. 11.
    S. M. Ross, Stochastic Processes, John Wiley, New York (1983).MATHGoogle Scholar
  12. 12.
    L. Kleinrock, Communication Nets: Stochastic Message Flow and Delay. McGraw-Hill, New York (1964), out of print; reprinted Dover, New York (1972).Google Scholar
  13. 13.
    B. Avi-Itzhak, “A Sequence of Service Stations with Arbitrary Input and Regular Service Times,” Management Science, 11(5), 565–571, March (1965).MathSciNetCrossRefGoogle Scholar
  14. 14.
    H. D. Friedman, “Reduction Methods for Tandem Queueing Systems,” Operations Research, 13, 121–133 (1965).MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    I. Rubin, “Message Path Delays in Packet Switching Communication Networks,” IEEE Transactions on Communications, COM-23(2), 186–192, February (1975).CrossRefGoogle Scholar
  16. 16.
    M. Kaplan, “A Two-fold Tandem Net with Deterministic Link and Source Interfaces,” Operations Research, 28, 512–526, May-June (1980).MathSciNetMATHCrossRefGoogle Scholar
  17. 17.
    B. Meister, H. R. Mueller, and H. Rudin, “New Optimization Criteria for Message-Switched Networks,” IEEE Transactions on Communications Technology, COM-19(3), 256–260, June (1971).CrossRefGoogle Scholar
  18. 18.
    R. E. Bellman, Dynamic Programming, Princeton University Press, Princeton, New Jersey (1957).MATHGoogle Scholar
  19. 19.
    S. E. Dreyfus, Dynamic Programming and the Calculus of Variations, Academic Press, New York (1965).MATHGoogle Scholar
  20. 20.
    J. F. Hayes, “The Viterbi Algorithm Applied to Digital Data Transmission,” IEEE Communication Society, 13(2), 15–20, March (1975).Google Scholar
  21. 21.
    D. G. Cantor and M. Gerla, “Capacity Allocation in Distributed Computer Networks,” Proceedings of 7th Hawaii International Conference on System Science (1974), pp. 115–117.Google Scholar
  22. 22.
    L. Kleinrock, Communication Nets: Stochastic Message Flow and Delay, McGraw-Hill, New York (1964), out of print; reprinted by Dover, New York (1972).Google Scholar

Copyright information

© Plenum Press, New York 1984

Authors and Affiliations

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

Personalised recommendations