Bounding steady-state availability models with group repair and phase type repair distributions

Performance Evaluation

Volumn 35, Issue 3, 1999, Pages 193-214

  Carrasco, Juan A ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; MATHEMATICAL MODELS; REPAIR; STATE SPACE METHODS;

BOUNDING STEADY-STATE AVAILABILITY MODELS; PHASE TYPE DISTRIBUTIONS; STEADY-STATE AVAILABILITY;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0032629804     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(99)00002-4     Document Type: Article

References (19)

1. U.N. Bhat, Elements of Applied Stochastic Processes, 2nd ed., Wiley, New York, 1984.
2. J.A. Carrasco, Tight steady-state availability bounds using the failure distance concept, Performance Evaluation 34 (1998) 27-64.
3. J.A. Carrasco, J. Escribá, A. Calderón, Efficient exploration of availability models guided by failure distances, Performance Evaluation Review 24 (1996) 1.
4. E, Çinlar, Introduction to Stochastic Processes, Prentice-Hall, Englewood Cliffs, NJ, 1975.
5. P.J. Courtois, P. Semal, Bounds for the positive eigenvectors of nonnegative matrices and for their approximations, J. ACM 31 (4) (1984) 804-825.
6. P.J. Courtois, P. Semal, Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models, IEEE J. Select. Areas Commun. SAC-4 (6) (1986) 926-937.
7. P. Heidelberger, J.K. Muppala, K.S. Trivedi, Accelerating mean time to failure computations, Performance Evaluation 27-28 (1996) 627-645.
8. J.C.S. Lui, R. Muntz, Evaluating bounds on steady-state availability of repairable systems from Markov models, in: Numerical Solution of Markov Chains, Marcel Dekker, New York, 1991, pp. 435-454.
9. J.C.S. Lui, R.R. Muntz, Computing bounds on steady state availability of repairable computer systems, J. ACM 41 (4) (1994) 676-707.
10. S. Mahévas, G. Rubino, Bounding asymptotic dependability and performance measures, in: Proceedings of the Second IEEE International Performance and Dependability Symposium, Urbana-Champaign, USA, September 1996, pp. 176-186.
11. S. Mahévas, G. Rubino, Bound computation of dependability and performance measures, INRIA Technical Report no. 3135, March 1997, available from ftp.inria.fr.
12. R.R. Muntz, E. de Souza e Silva, A. Goyal, Bounding availability of repairable computer systems, IEEE Trans. Comput. 38 (12) (1989) 1714-1723.
13. M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models. An Algorithmic Approach, Chapter 2, Dover, New York, 1994.
14. J.L. Peterson, Petri Net Theory and the Modeling of Systems, Appendix, Prentice-Hall, Englewood Cliffs, NJ, 1981.
15. S.M. Ross, Stochastic Processes, Wiley, New York, 1983.
16. G. Rubino, B. Sericola, Sojourn times in finite Markov processes, J. Appl. Prob. 27 (1989) 744-756.
17. P. Semal, Refinable bounds for large Markov chains, IEEE Trans. Comput. 44 (10) (1995) 1216-1222.
18. E. de Souza e Silva, P.M. Ochoa, State space exploration in Markov models, Performance Evaluation Review 20 (1) (1992) 152-166.
19. W.J. Stewart, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ, 1994.