Queueing for Multi-Stage Packet Networks
In chapter 9, we formulated the multi-stage circuit switching problem as a multi-commodity resource allocation problem, for which a terminal pair requests the simultaneous allocation of bandwidth on a set of links In contrast, packet switching does not require simultaneous allocation but allocation on a link-by-link basis. Local conflicts in resource allocation result in queueing. Based on results for single stage queueing developed in the previous chapter, we approximate the queueing behavior in multi-stage packet networks in this chapter. The first two sections deal with more general results such as reversibility and product form solutions for networks. The last three sections discuss performance analysis methods for buffered banyan networks under different traffic assumptions.
KeywordsArrival Process Steady State Probability Departure Process Discrete Time Markov Chain Forward Process
Unable to display preview. Download preview PDF.
- 2.P. J. Burke, “Output processes and tandem queue,” Proc. Symp. on Computer-Communication and Teletraffic, New York, pp. 419–429, April 1972.Google Scholar
- 8.L. Kleinrock, Queueing Systems,Vol. 2: Computer Applications, Wiley Interscience, New York, 1980.Google Scholar
- 11.T. H. Szymanski, On Interconnection Networks for Parallel Processors, Ph. D. Dissertation, Department of Electrical Engineering, University of Toronto, Sept. 1987.Google Scholar