Abstract
Markov chains and rewards have been widely used to evaluate performance, dependability and performability characteristics of computer systems and networks. Despite considerable works, the numerical analysis of Markov chains to obtain transient or steady-state distribution is still a difficult problem when the chain is large or the eigenvalues badly distributed. Thus bounding techniques have been proposed for long to analyze steady-state distribution.
Here, we show how to bound some dependability characteristics such as steady-state and point availability using an algorithmic approach. The bound is based on stochastic comparison of Markov chains but it does not use sample-path arguments. The algorithm builds a lumped Markov chain whose steady-state or transient distributions are upper bounds in the strong stochastic sense of the exact distributions. In this paper, the implementation of algorithm is detailed and we show some numerical results. We also show how we can avoid the generation of the state space and the transition matrix to model chains with more than 1010 states.
This work is supported by ACI Sécurité, project Sure-Paths.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Carrasco, J.A.: Bounding steady-state availability models with group repair and phase type repair distributions. Performance Evaluation 35, 193–204 (1999)
Ciardo, G., Miner, A.S.: Storage alternatives for larger structured state spaces. In: Marie, R., Plateau, B., Calzarossa, M.C., Rubino, G.J. (eds.) TOOLS 1997. LNCS, vol. 1245, pp. 44–57. Springer, Heidelberg (1997)
Courtois, P.J., Semal, P.: Bounds for the positive eigenvectors of nonnegative matrices and their approximations. J. ACM 31(4), 804–825 (1984)
Dayar, T., Fourneau, J.M., Pekergin, N.: Transforming stochastic matrices for stochastic comparison with the st-order. RAIRO-RO 37, 85–97 (2003)
Dayar, T., Pekergin, N.: Stochastic comparison, reorderings, and nearly completely decomposable Markov chains. In: Plateau, B., Stewart, W. (eds.) Proceedings of the International Conference on the Numerical Solution of Markov Chains (NSMC 1999), pp. 228–246. Prensas universitarias de Zaragoza (1999)
Fourneau, J.M., Pekergin, N.: An algorithmic approach to stochastic bounds. In: Calzarossa, M.C., Tucci, S. (eds.) Performance 2002. LNCS, vol. 2459, pp. 64–88. Springer, Heidelberg (2002)
Fourneau, J.M., Lecoz, M., Pekergin, N., Quessette, F.: An open tool to compute stochastic bounds on steady-state distributiuon and rewards. In: IEEE Mascots 2003, Orlando, USA (2003)
Fourneau, J.M., Lecoz, M., Quessette, F.: Algorithms for an irreducible and lumpable strong stochastic bound. In: Numerical Solution of Markov Chains, USA (2003)
Lui, J.C.S., Muntz, R.: Computing bounds on steady state availability of repairable computer systems. J. ACM 41(4), 676–707 (1994)
Mahevas, S., Rubino, G.: Bounding asymptotic dependability and performance measures. In: Second IEEE International Performance and Dependability Symposium, USA, pp. 176–186 (1996)
Muntz, R., de Souza e Silva, E., Goyal, A.: Bounding availability of repairable computer systems. IEEE Trans. on Computers 38(12), 1714–1723 (1989)
Plateau, B.: On the stochastic structure of parallelism and synchronization models for distributed algorithms. In: Proc. of the SIGMETRICS Conference, Texas, pp. 147–154 (1985)
Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton (1994)
Stoyan, D.: Comparison Methods for Queues and Other Stochastic Models. Wiley, Chichester (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bušić, A., Fourneau, J.M. (2005). Bounds for Point and Steady-State Availability: An Algorithmic Approach Based on Lumpability and Stochastic Ordering. In: Bravetti, M., Kloul, L., Zavattaro, G. (eds) Formal Techniques for Computer Systems and Business Processes. EPEW WS-FM 2005 2005. Lecture Notes in Computer Science, vol 3670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549970_8
Download citation
DOI: https://doi.org/10.1007/11549970_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28701-8
Online ISBN: 978-3-540-31903-0
eBook Packages: Computer ScienceComputer Science (R0)