Skip to main content
SpringerLink
Log in

The Throughput-Algorithms for BCMP-Networks

  • Conference paper
Messung, Modellierung und Bewertung von Rechensystemen

Part of the book series: Informatik—Fachberichte ((INFORMATIK,volume 110))

Abstract

In this paper we introduce the throughput algorithms that compute performance measures of BCMP-networks. We analyze such networks with load independent stations, several job classes, and load dependent stations. Also, we compare these algorithms with the corresponding convolution and MVA algorithms.

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

Access this chapter

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 44.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. I. F. Akyildiz: Der Algorithmus TUPAL für Warteschlangennetze mit Produktform. Elektronische Rechenanlage, Heft 1 (1985).

    Google Scholar 

  2. Buzen, J. P.: Computational Algorithms for Closed Queueing Networks with Exponential Servers. Communications of the ACM, Vol. 16, No. 9 (Sept. 1973).

    Google Scholar 

  3. H. Kobayashi: Computational Algorithms for Markovian Queueing Networks. IBM Research Report RC-8820, Yorktown Heights, N.Y. 10598 (May 1961).

    Google Scholar 

  4. M. Reiser: Numerical Methods in Seperable Queueing Networks. IBM Research Report RC-5842, Yorktown Heights, N.Y. 10598 (May 1976).

    Google Scholar 

  5. M. Reiser, S. S. Lavenberg: Mean Value Analysis of Closed Multichain Queueing Networks. IBM Research Report RC-7023, Yorktown Heights, N.Y. 10598 (Oct. 1978).

    Google Scholar 

  6. Reiser 81] M. Reiser: Mean Value Analysis and Convolution Method for Queue-Dependent Servers in Closed Queueing Networks. Performance Evaluation 1 (Jan. 1981) 7–18, North Holland.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik der Universität Hamburg, Rothenbaumchausse 67/69, 0-2000, Hamburg 13, West Germany

    Wolfgang Kowalk

Authors
  1. Wolfgang Kowalk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lehrstuhl Informatik IV, Universität Dortmund, Postfach 500500, 4600, Dortmund, Deutschland

    Heinz Beilner

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kowalk, W. (1985). The Throughput-Algorithms for BCMP-Networks. In: Beilner, H. (eds) Messung, Modellierung und Bewertung von Rechensystemen. Informatik—Fachberichte, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87472-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-87472-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15969-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation