Abstract
MRMSolve is an analysis tool developed for the evaluation of large Markov Reward Models (MRM). The previous version of MRMSolve [8] provided only the moments of MRMs at arbitrary transient instant of time. This paper presents a new version of MRMSolve with new analysis features and software environment. The most important new functionality of MRMSolve is that it also makes distribution estimation of MRMs. MRMSolve can estimate the distribution of reward measures up to models with ∼106 states, and to the best of our knowledge no other algorithm can handle MRMs with more than ∼104 states.
This work was partially supported by Hungarian Scientific Research Fund (OTKA) under Grant No. T-34972.
This is a preview of subscription content, log in via an institution to check access.
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
N. I. Akhiezer and M. G. Krein, ”Some questions in the theory of moments”, Translations of mathematical monographs, 2, AMS., Providence, R.I., 1962.
L. Donatiello and V. Grassi, ”On evaluating the cumulative performance distribution of fault-tolerant computer systems”, IEEE Tr. on Computers, 1991.
W.K. Grassmann, ”Means and variances of time averages in markovian environment”, European Journal of Operational Research, Vol. 31, pp 132–139, 1987.
R. Iyer, L. Donatiello and P. Heidelberger, ”Analysis of performability for stochastic models of fault-tolerant systems”, IEEE Tr. on Comp. pp 902–907, 1986.
V. Kulkarni, V. Nicola and K. Trivedi, ”On modeling the performance and reliability of multi-mode computer systems”, J. of Syst. and Sw., pp 175–183, 1986.
H. Nabli and B. Sericola, ”Performability analysis: A new algorithm”, IEEE Tr. on Computers, C-45(4), pp 491–494, 1996.
S. Rácz, ”Numerical analysis of communication systems through Markov reward models”, Ph. D. thesis, Technical University of Budapest, 2000.
S. Rácz, B. P. Tóth and M. Telek, ”MRMSolve: A Tool for Transient Analysis of Large Markov Reward Models”, In Tools 2000, pp 337–340, LNCS 1786, 2000.
S. Rácz, M. Telek and G. Fodor, ”Link Capacity Sharing Between Guaranteed-and Best Effort Service on an ATM Transmission Link under GoS Constraints”, Telecommunication Systems, Vol. 17:1,2, 2001.
E. De Souza e Silva and H.R. Gail, ”An algorithm to calculate transient distribution of cumulative rate and impulse based reward”, Stoch. Models, pp 509–536, 1998.
R. Smith, K. Trivedi and A.V. Ramesh, ”Performability analysis: Measures, an algorithm and a case study”, IEEE Tr. on Computers, C-37, pp 406–417, 1988.
T. Stieltjes, ”Reserches sur les fractions continues”, Ann. Fac. Sci. Univ. Toulouse, Vol. 2, pp 111–122, 1894.
Aldo Tagliani, ”Existence and stability of a discrete probability distribution by maximum entropy approach”, Applied Math. and Computation, pp 105–114, 2000.
Miklós Telek and Sándor Rácz, ”Numerical analysis of large Markov reward models”, Performance Evaluation, Vol. 36&37, pp 95–114, August 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rácz, S., Tari, Á., Telek, M. (2002). MRMSolve: Distribution Estimation of Large Markov Reward Models. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds) Computer Performance Evaluation: Modelling Techniques and Tools. TOOLS 2002. Lecture Notes in Computer Science, vol 2324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46029-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-46029-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43539-6
Online ISBN: 978-3-540-46029-9
eBook Packages: Springer Book Archive