This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Bound Computation of Dependability and Performance Measures
May 2001 (vol. 50 no. 5)
pp. 399-413

Abstract—We propose a new method to obtain bounds of dependability, performance or performability measures concerning complex systems modeled by a large Markov model. It extends previously published techniques mainly designed to the analysis of dependability measures only and working under more restrictive conditions. Our approach allows us to obtain tight bounds of performance measures on certain cases and, in particular, on models having an infinite state space. We illustrate the method with some analytically intractable open queuing networks, as well as with large dependability models.

[1] P.J. Courtois and P. Semal,“Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition,” JACM, vol. 31, 1984.
[2] P.-J. Courtois and P. Semal, “Computable Bounds for Conditional Steady-State Probabilities in Large Markov Chains and Queueing Models,” IEEE Trans. Selected Areas in Comm., vol. 4, no. 6, pp. 926-936, Sept. 1986.
[3] R.R. Muntz, E. De Souza e Silva, and A. Goyal, “Bounding Availibility of Repairable Computer Systems,” IEEE Trans. Computers, vol. 38, no. 12, Dec. 1989.
[4] G. Rubino and B. Sericola, “Sojourn Times in Finite Markov Process,” J. Applied Probability, vol. 27, pp. 744-756, July 1989.
[5] N.M. van Dijk, “A Simple Bounding Methodology for Non-Product Form Finite Capacity Queueing Systems,” Proc. first Int'l Workshop Queueing Networks with Blocking, May 1988.
[6] P. Semal, “Refinable Bounds for Large Markov Chains,” IEEE Trans. Computers, vol. 44, no. 10, pp. 1216-1222, Oct. 1995.
[7] R.R. Muntz and J.C.S. Lui, “Evaluating Bounds on Steady-State Availibility of Repairable Systems from Markov Models,” Numerical Solution of Markov Chains, pp. 435-454, 1991.
[8] R.R. Muntz and J.C.S. Lui, “Computing Bounds on Steady State Availibility of Repairable Computer Systems,” J. ACM, vol. 41, no. 4, pp. 676-707, July 1994.
[9] R.R. Muntz and J.C.S. Lui, “Bounding the Response Time of a Minimum Expected Delay Routing System,” IEEE Trans. Computers, vol. 44, no. 5, pp. 1371-1382, Dec. 1995.
[10] J. Carrasco, “Improving Availability Bounds Using the Failure Distance Concept,” Proc. Fourth Dependable Computing for Critical Applications (DCCA-4) Int'l Conf., Jan. 1994.
[11] M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins Univ. Press, 1981.
[12] H.G. Perros, Queueing Networks with Blocking. Oxford Univ. Press, 1994.
[13] P. Semal, “Analysis of Large Markov Models, Bounding Techniques and Applications,” PhD thesis, Univ. of Louvain, Belgium, 1992.
[14] P. Semal, “Two Bounding Schemes for the Steady-State Solution of Markov Chains,” Numerical Solution of Markov Chains, 1995.
[15] E. de Souza e Silva and P.M. Ochoa, "State Space Exploration in Markov Models," Performance Evaluation Rev., vol. 20, no. 1, pp. 152-166, 1992.
[16] A. Graham, Nonnegatige Matrices and Applicable Topics in Linear Algebra. Ellis Horwood Ltd., 1987.
[17] A. Berman and R.J. Plemmons, Nonnegatige Matrices in the Mathematical Sciences. 1994.
[18] E. Cinlar, Introduction to Stochastic Processes. Prentice Hall, 1975.
[19] T.G. Robertazzi, Computer Networks and Systems, 2d ed., Springer, New York, 1994.
[20] T.G. Robertazzi, “Fast Recursive Solution of Equilibrium State Probabilities for Three Tandem Queues with Limited Buffer Space,” Proc. 1994 Conf. Information Sciences and Systems, pp. 790-793, Mar. 1994.

Index Terms:
Dependability evaluation, performance evaluation, Markov chains, numerical analysis, bounding techniques.
Citation:
Stephanie Mahévas, Gerardo Rubino, "Bound Computation of Dependability and Performance Measures," IEEE Transactions on Computers, vol. 50, no. 5, pp. 399-413, May 2001, doi:10.1109/12.926156
Usage of this product signifies your acceptance of the Terms of Use.