Skip to main content

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

  • 32 Accesses

Abstract

The package CQNA-2 allows the computation of some frequently referred to metrics related to queueing networks, The networks that can be analyzed belong to a subset of the well known BCMP class, /1/, main characterizations being fixed population size (‘closed network’ assumption), state independent service rates and stations with one of the following service disciplines: FCFS, LCFS-PR and RR-PS.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baskett, K. M. Chandy, R. R. Muntz and F. C. Pazacios, ‘Open Closed and Mixed Networks of Queues with Different Classes of Customers’, Journal of the Association for Computing Machinery, vol. 22, wv, 2, 248 — 260, April 1975

    Article  MATH  MathSciNet  Google Scholar 

  2. J. P. Bozen’ ‘Computational Algorithms for Closed Q“eoeing Networks with Exponential Services’, Communications of The Association for Computing Machinery, Vol. 16’ wo. 9, 527 — 531, September 1973

    Article  Google Scholar 

  3. M. Reiser, ‘Numerical Methods in Separable Queueing Networks’, IBM Research Report 1Rc58*2, 1976 Yorktown Heights, N.Y.

    Google Scholar 

  4. A. C. Williams and R. A. Bhandiwad, ‘A Generating Function Approach to Queueing Network Analysis or Multiprogrammed Computers’, wetworks/ Vol. 6/ No, 1/ 1 — 22, 1976

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Brizzi and D. Grillo, ‘Implementation of Algorithms for Performance Analysis of a Class of Multiprogrammed Computers’, Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems, Bonn, West Germany, 3 — 5 October, 1977, Ed. H. 8eilner and E. cezenue’ North Holland 1977

    Google Scholar 

  6. M. Brizzi and D. Grillo, ‘Cow*-1 (Closed Qveoeing Network Analyzer/’ User’s ovine’, Fondazione U. aorooni Monograph 381877’ December 1977

    Google Scholar 

  7. . L. Curzi, ‘Implementazione di un linqoaqniv per la descri- zione ui una classe oi reti di code’, Fondazione U. Bordoni Monograph 3A2578’ December 1978

    Google Scholar 

  8. D. Grilzo’ ‘Seporoble Qopoeing Networks Dpri,*u by Service Stations and Routing Parallelinn’` Fondazione U. Bordoni Monograph 382378’ December 1978

    Google Scholar 

  9. M. Brizzi and D. Grillo, ‘CQNA-2: Closed poeoein9 Network Analyzer. Users’ ovme’’ Fondazione U. Bordoni Monograph 382478` December 1978

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Brizzi, M., Grillo, D. (1981). CQNA-2: Closed Queueing Network Analyzer. 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_8

Download citation

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

  • 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