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.


Arrival Process Steady State Probability Departure Process Discrete Time Markov Chain Forward Process 
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.
    F. Baskett, M. Chandy, R. Muntz, and J. Palacios, “Open, closed and mixed networks of queues with different classes of customers,” Journal of Associated Computing Machinery, vol 22, pp. 248–260, 1975.MathSciNetMATHCrossRefGoogle Scholar
  2. 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
  3. 3.
    J. P. Buzen, “Computational algorithms for closed queueing networks with exponential servers,” Communications of ACM, vol. 16, pp. 527–531, 1973.MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    D. M. Dias and J. R. Jump, “Analysis and simulation of buffered delta networks,” IEEE Trans. on Computers, vol. 30, no. 4, pp. 273–282, April 1981.CrossRefGoogle Scholar
  5. 5.
    J. R. Jackson, “Networks of waiting lines,” Operations Research, vol-5, pp. 699–704, August 1957.CrossRefGoogle Scholar
  6. 6.
    Y. C. Jeng, “Performance analysis of a packet switch based on a single-buffered banyan network,” IEEE J. Selected Areas of Comm., vol-1, pp. 1014–1021, Dec. 83.CrossRefGoogle Scholar
  7. 7.
    F. P. Kelly, Reversibility and Stochastic Networks, Wiley, Chichester, 1979.MATHGoogle Scholar
  8. 8.
    L. Kleinrock, Queueing Systems,Vol. 2: Computer Applications, Wiley Interscience, New York, 1980.Google Scholar
  9. 9.
    H. Kobayashi, Modeling and Analysis: An Introduction to System Performance Evaluation Methodology, Addison-Wesley, Reading, MA, 1978.MATHGoogle Scholar
  10. 10.
    J. H. Patel, “Performance of processor-memory interconnections for multiprocessor,” IEEE Trans. on Computers, vol. 30, no. 10, pp. 771–780, Oct. 1981.CrossRefGoogle Scholar
  11. 11.
    T. H. Szymanski, On Interconnection Networks for Parallel Processors, Ph. D. Dissertation, Department of Electrical Engineering, University of Toronto, Sept. 1987.Google Scholar

Copyright information

© Springer Science+Business Media New York 1990

Authors and Affiliations

  • Joseph Y. Hui
    • 1
  1. 1.Rutgers UniversityUSA

Personalised recommendations