Networks of Queues
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.
KeywordsService Time Queue Length Central Processor Average Delay Capacity Allocation
Unable to display preview. Download preview PDF.
- 3.H. Kobayashi, Modeling and Analysis—An Introduction to System Performance Methodology. Addison-Wesley, Reading, Massachusetts (1978).Google Scholar
- 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
- 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
- 20.J. F. Hayes, “The Viterbi Algorithm Applied to Digital Data Transmission,” IEEE Communication Society, 13(2), 15–20, March (1975).Google Scholar
- 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.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