skip to main content
short-paper

Asymptotic analysis of closed queueing networks and its implications to achievable service levels

Published:15 October 2010Publication History
First page image

References

  1. F. Baskett, K. M. Chandy, R. Muntz, and F. Palacios-Gomez. Open, closed, and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach., 22:248--260, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. Knessl and C. Tier. Asymptotic approximations and bottleneck analysis in product form queueing networks wi th large populations. Performance Evaluation, 33:219--248, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Y. Kogan. Another approach to asymptotic expansions for large queueing networks. Oper. Res. Lett., 11:317--321, 1992.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. S. Lavenberg. Computer Performance Modeling Handbook. Academic Press, 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. E. Lazowska, J. Zahorjan, G. G.S., and S. K.C. Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Prentice-Hall, Inc., 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. McKenna and D. Mitra. Integral representations and asymptotic expansions for closed Markovian queueing networks. Bell Syst. Tech. J., 61:661--683, 1982.Google ScholarGoogle ScholarCross RefCross Ref
  7. R. Muntz and J. Wong. Asymptotic preperties of closed queueing network models. In Proc. 8th Ann. Princeton Conf. Inform. Sci. and Systems, March 1974.Google ScholarGoogle Scholar
  8. P. Schweitzer, G. Serazzi, and M. Broglia. A survey of bottleneck analysis in closed queues. Performance Evaluation of Computer and Communications Systems, Lecture Notes in Computer Science, 729:491--508, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. B. Urgaonkar, G. Pacifici, P. Shenoy, M. Spreitzer, and A. Tantawi. Analytic modeling of multitier internet applications. ACM Transactions on the Web, 1, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Zahorjan, K. Sevcik, D. Eager, and B. Galler. Balanced job bound analysis of queueing networks. Comm. ACM, 25:134--141, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Asymptotic analysis of closed queueing networks and its implications to achievable service levels
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM SIGMETRICS Performance Evaluation Review
      ACM SIGMETRICS Performance Evaluation Review  Volume 38, Issue 2
      September 2010
      55 pages
      ISSN:0163-5999
      DOI:10.1145/1870178
      Issue’s Table of Contents

      Copyright © 2010 Authors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 15 October 2010

      Check for updates

      Qualifiers

      • short-paper

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader