A survey of bottleneck analysis in closed networks of queues

  • P. J. Schweitzer
  • G. Serazzi
  • M. Broglia
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 729)

Abstract

Several of the principal results in bottleneck analysis for closed queueing networks are surveyed. Both product-form closed queueing networks, where exact bottleneck analysis is possible, and non-product-form closed queueing networks, where approximations are given for asymptotic bottleneck behavior, are considered. Algorithms for the asymptotic bottleneck analysis are presented and the switching surfaces of bottlenecks are described.

References

  1. [Bard79]
    Y. Bard. Some extensions to multiclass queueing network analysis. In A. Butrimenko M. Arato and E. Gelenbe, editors, Proceedings of the 4th International Symposium on Modelling and Performance Evaluation of Computer Systems, Performance of Computer Systems, pages 51–62, Amsterdam, Netherlands, 1979. North Holland Publishing Company.Google Scholar
  2. [BGPS87]
    O. Bronshtein, I. Gertsbakh, B. Pittel, and S. Shahaf. One-node closed multichannel service system: Several types of customers and service rates, and random pick-up from the waiting line. Advanced Applied Probability, 19:487–504, 1987.Google Scholar
  3. [BS93a]
    G. Balbo and G. Serazzi. Asymptotic analysis of multiclass closed queueing networks: Common bottleneck. Submitted for publication, 1993.Google Scholar
  4. [BS93b]
    G. Balbo and G. Serazzi. Asymptotic analysis of multiclass closed queueing networks: Multiple bottlenecks. Submitted for publication, 1993.Google Scholar
  5. [Chow83]
    W. M. Chow. Approximations for large scale closed queueing networks. Performance Evaluation, 3:1–12, 1983.Google Scholar
  6. [CN82]
    K. M. Chandy and D. Neuse. Linearizer: A heuristic algorithm for queueing network models of computing systems. Communications of the ACM, 25(2):126–134, February 1982.Google Scholar
  7. [KB91]
    Y. Kogan and A. Birman. Asymptotic analysis of closed queueing networks with bottlenecks. In Proceedings of International Conference Performance Distributed Systems and Integr. Comm. Networks, Kyoto, Japan, September 1991.Google Scholar
  8. [KT90]
    C. Knessl and C. Tier. Asymptotic expansions for large closed queueing networks. Journal of the ACM, 37(1):144–174, January 1990.Google Scholar
  9. [Lave82]
    S.S. Lavenberg. Closed multichain product form queueing networks with large population sizes. Applied Probability, pages 219–249, 1982.Google Scholar
  10. [Pitt79]
    B. Pittel. Closed exponential networks of queues with saturation: the jackson-type stationary distribution and its asymptotic analysis. Mathematics of Operations Research, 4(4):357–378, November 1979.Google Scholar
  11. [PKT90]
    K. R. Pattipati, M. M. Kostreva, and J. L. Teele. Approximate mean value analysis algorithms for queuing networks: Existence, uniqueness, and convergence results. Journal of the ACM, 37(3):643–673, July 1990.Google Scholar
  12. [RM82]
    K. G. Ramakrishnan and D. Mitra. An overview of PANACEA, a software package for analyzing markovian queueing networks. Bell Systems Technical Journal, 61(10):2849–2872, 1982.Google Scholar
  13. [Schw79]
    P. J. Schweitzer. Approximate analysis of multiclass closed networks of queues. In Proceedings of International Conference on Stochastic Control and Optimization, Free University, Amsterdam, Netherlands, April 1979.Google Scholar
  14. [SSB92]
    P. J. Schweitzer, G. Serazzi, and M. Broglia. A fixed-point approximation to product-form networks with large population. Presented at Second ORSA Telecommunications Conference, Boca Raton, Florida, March 1992.Google Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • P. J. Schweitzer
    • 1
  • G. Serazzi
    • 2
  • M. Broglia
    • 2
  1. 1.W. E. Simon Graduate School of Business AdministrationUniversity of RochesterRochesterUSA
  2. 2.Dip. Elettronica e InformazionePolitecnico di MilanoMilanoItaly

Personalised recommendations