Skip to main content
SpringerLink
Log in
Book cover

Messung, Modellierung und Bewertung von Rechensystemen pp 339–353Cite as

Generalized Queueing Approximation Techniques for Analysis of Computer Systems

  • Chapter

  • 31 Accesses

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 41))

Abstract

The accuracy of response time approximation methods for G/G/1 and G/G/c queueing systems is investigated. It is shown that, for Em/Ek/c queues, approximating the squared coefficient of variation of inter-departure times and then applying Marshall’s relation yields the most accurate results. This technique, which has been used by operations researchers (and is not known to have been used in the analysis of computer systems to date), is subsequently generalized for G/G/1 and G/G/c queueing systems.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Allen, “Probability, Statistics, and Queueing Theory with Computer Science Applications”, Academic Press, New York, 1978.

    MATH  Google Scholar 

  2. P. Burke, “The Output of a Queueing System”, Operat. Res., 4, Dec. 1956, 699–704.

    Article  MathSciNet  Google Scholar 

  3. P. Burke, “Output Processes and Tandem Queues”, Proc. PIB MRI Symp. on Comput. Comm. Networks and Teletraffic, PIB Press, Brooklyn, N.Y., 1972, 419–428.

    Google Scholar 

  4. K. Chandy, and C. Sauer, “Approximate Methods in Analyzing Queueing Network Models of Computer Systems”, Comput. Surv., 10, 3 (Sept. 1978), 281–317.

    Article  MATH  Google Scholar 

  5. M. Fischer, “The Waiting Time in the Ek/M/1 Queueing System; Operat. Res., 22, 4, 1974, 898–902.

    Article  MATH  Google Scholar 

  6. S. Calo, “Bounds and Approximations for Moments of Queueing Processes”, Ph.D. Thesis, Dept. of EE, Princeton Univ., April 1976.

    Google Scholar 

  7. D. Gross, and C. Harris, “Fundamentals of Queueing Theory”, Wiley, N.Y.. 1974.

    Google Scholar 

  8. F. Hillier, and F. Lo, “Tables for Multiple-Server Queueing Systems Involving Erlang Distributions”, Tech. Rep. No. 31, Dept. of OR, Stanford Univ., Dec. 28, 1971, Stanford, CA.

    Google Scholar 

  9. L. Kleinrock, “Queueing Systems, Vol. I: Theory”, Wiley, N.Y., 1975

    MATH  Google Scholar 

  10. L. Kleinrock, “Queueing Systems, Vol. II: Computer Applications”, Wiley, N.Y., 1176.

    Google Scholar 

  11. H. Kobayashi, “Application of the Diffusion Approximation to Queueing Networks, Part I: Equilibrium Queue Distributions”, JACM, 21, 2 (April 1974), 316–328.

    Article  MATH  Google Scholar 

  12. H. Kobayashi, “Modeling and Analysis: An Introduction to System Performance Evaluation Methodology”, Addison-Wesley, Reading, MA., 1978.

    MATH  Google Scholar 

  13. K. Marshall, “Some Inequalities in Queueing”, Operat. Res., 16 (1968), 651–665.

    Article  MATH  Google Scholar 

  14. J. Martin, “Systems Analysis for Data Transmission”, Prentice-Hall Englewood Cliffs, N.J., 1972.

    Google Scholar 

  15. D. Paulish, and E. J. Smith, “The Modeling of Message Switches in Store-and-Forward Computer Communication Networks”, Rep. POLYEE/EP 75–007, Polytechnic Inst. of N.Y., June 1975.

    Google Scholar 

  16. D. Protopapas, “Multi-microprocessor/Multi-microcomputer Architectures: Their Modeling and Analysis”, Ph.D. Thesis, Dept. of EE, Polytechnic Inst. of N.Y., May 1980.

    Google Scholar 

  17. D. Protopapas, “Task Level Queueing Models for Multiprocessor/ Multicomputer Systems”, Proc. Intern°1 Conf, on Circuits and Computers, 1980, 733–736.

    Google Scholar 

  18. M. Reiser, and H. Kobayashi, “Accuracy of the Diffusion Approximation for Some Queueing Systems”, IBM Journal of R.D., March 1974, 110–124.

    Google Scholar 

  19. M. Rosenshine, and J. Chandra, “Approximate Solutions for Some Two-Stage Tandem Queues= Part 1: Individual Arrivals at the 2nd Stage”, Operat. Res., 23, 6 (Nov.-Dec. 1975 ), 1155–1166.

    Article  MATH  MathSciNet  Google Scholar 

  20. T. Saaty, “Elements of Queueing Theory”, McGraw-Hill, N.Y., 1961.

    MATH  Google Scholar 

  21. D. Stoyan, “Bounds and Approximations in Queueing thru Monotoni-city and Continuity”, Operat. Res., 25, 5 (Oct. 1977), 851–863.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ITT/Advanced Technology Center, Shelton, Ct., 06484, USA

    D. A. Protopapas

Authors
  1. D. A. Protopapas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Zentralinstitut für Angewandte Mathematik, Kernforschungsanlage Jülich GmbH, Postfach 1913, 5170, Jülich, Deutschland

    Burkhard Mertens

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Protopapas, D.A. (1981). Generalized Queueing Approximation Techniques for Analysis of Computer Systems. In: Mertens, B. (eds) Messung, Modellierung und Bewertung von Rechensystemen. Informatik-Fachberichte, vol 41. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67979-7_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-67979-7_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10619-7

  • Online ISBN: 978-3-642-67979-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation