Abstract
The Markov chain remains one of the most useful and flexible techniques for the evaluation of the performances and of the reliability characteristics of models of communication and computer systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berman, A., and Plemmons, R.J., Nonnegative Matrices in the Mathematical Sciences, Academic Press, New York, 1979, 132–142.
Courtois, P.-J., and Semal, P., Bounds for the Positive Eigenvectors of Nonnegative Matrices and for Their Approximations by Decomposition, J. Assoc. Comput. Mach., 31, 1984, 804–825.
Courtois, P.-J., and Semai, P., On Polyhedra of Perron-Frobenius Eigenvectors, Linear Algebra and its Applications, 65, 1985, 157–170.
Courtois, P.-J., and Semai, P., Block Decomposition and Iteration in Stochastic Matrices, Philips Journal of Research, 39, 1984, 178–194.
Courtois, P.-J., and Semai, P., Analysis of large Markovian Models by Parts. Error Bounds and Applications. Manuscript M 109, Philips Research Laboratory, Brussels May 1985.
Kemeny, J.G., and Snell, J.L., Finite Markov Chain, D. Van Nostrand Co., Inc., New York, 1960, 150–152.
Wunderlich, E.F., Kaufman, L., Gopinath, B., The Control of Store and Forward Congestion in Packet Switching Networks, Proc. 5th Int. Conference on Computer Communication, Atlanta, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courtois, PJ. (1985). Analysis of Large Markovian Models by Parts. Applications to Queueing Network Models. 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_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-87472-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15969-8
Online ISBN: 978-3-642-87472-7
eBook Packages: Springer Book Archive