Abstract
Continuous time Markov chains describing the behaviour of closed queueing networks are considered. We present an algorithm which enables the reduction of storage requirements for generator matrices of Markov chains. Applying this algorithm in the area of iterative numerical solution methods, we can show that neither the generator matrix nor ”parts” of them must be generated and stored. We will consider models with up to 107 states and 109 matrix entries and we will demonstrate that these models can be analysed. Further, this algorithm can be integrated easily in tools which contain iterative numerical solution methods.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baskett,F., Chandy, K.M., Muntz, R.R., Palacios, G.F. Open, Closed and Mixed Network of Queues with different Classes of Custumers. Journal of the ACM, Vol.22, No.8, April 1975, pp 248–260.
Buchholz,P. Numerical solution methods based on structured descriptions of Markovian models. In Balbo, G. and Serazzi, G. (Eds). Computer Performance Evaluation-Modelling Techniques and Tools. North-Holland, Amsterdam, 1992, pp 251–267.
Bucholz,P., Dunkel,J., Müller-Clostermann, B., Sczittnick, M. and Zäske, S. Quantitative Systemanalyse mit Markovschen Ketten. B.G. Teubner Verlagsgesellschaft, 1994.
Donatelli, S. Superposed Stochastic Automata: A class of Stochastic Petri nets amenable to parallel solution. Proc. of the Fourth International Workshop on Petri Nets and Performance Models (PNPM91), Melbourne, 1991, pp 54–63.
Knaup, W. Algebraische Strukturen in einfachen Warteschlangen-Netzen. Verlag Hänsel-Hohenhausen, Egelsbach (Germany), 1994.
Krieger, U.R., Müller-Clostermann, B. and Sczittnick, M. Modelling and Analysis of Communication Systems Based on Computational Methods for Markov Chains. IEEE J. Sel. Areas in Comm., Vol.8, No.9, December 1990, pp 1630–1648.
Massey, W.A. and Srinivasan, R. A. Heavy Traffic Analysis for Semi-Open Networks. Proc. of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Edinburgh (Scotland), September 1990, pp 289–300.
Massey, W.A. An Operator Analytic Approach to the Jackson Network. Journal of Applied Probability, 21, 1984, pp 379–393.
Plateau, B. On the stochastic structure of parallelism and synchronization models for distributed models. ACM Sigmetrics Conference on Measurement and Modelling of Computer Systems, Austin, August 1985.
Plateau, B., Fourneau, J.M. and Lee, K.H. PEPS: A package for solving complex Markov models of parallel systems. Fourth International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, Palma, Sept., 1988.
Wallace, V.L. Toward an Algebraic Theory of Markovian Networks. Proc. of the Symp. of Computer-Communications Network and Teletraffic, Polytechnic Institute of Brooklyn, April 1972, pp 397–407.
Williamson, S.G. Combinatorics for Computer Science. Comp. Sc. Press, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knaup, W. (1995). A new iterative numerical solution algorithm for Markovian queueing networks. In: Beilner, H., Bause, F. (eds) Quantitative Evaluation of Computing and Communication Systems. TOOLS 1995. Lecture Notes in Computer Science, vol 977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024316
Download citation
DOI: https://doi.org/10.1007/BFb0024316
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60300-9
Online ISBN: 978-3-540-44789-4
eBook Packages: Springer Book Archive