Bound computation of dependability and performance measures

IEEE Transactions on Computers

Volumn 50, Issue 5, 2001, Pages 399-413

  Mahevas S ^a   Rubino, G ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Bounding techniques; Dependability evaluation; Markov chains; Numerical analysis; Performance evaluation

Indexed keywords

MARKOV PROCESSES; MATHEMATICAL MODELS; MONTE CARLO METHODS; QUEUEING NETWORKS; SYSTEMS ANALYSIS;

BOUNDING TECHNIQUES;

LARGE SCALE SYSTEMS;

EID: 0035334460     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.926156     Document Type: Article

References (20)

1. Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition
2. Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models
3. Bounding availibility of repairable computer systems
4. Sojourn times in finite Markov process
5. A simple bounding methodology for non-product form finite capacity queueing systems
6. Refinable bounds for large Markov chains
7. Evaluating bounds on steady-state availibility of repairable systems from Markov models
8. Computing bounds on steady state availibility of repairable computer systems
9. Bounding the response time of a minimum expected delay routing system
10. Improving availability bounds using the failure distance concept
11. Two bounding schemes for the steady-state solution of Markov chains
12. State space exploration in Markov models
13. Fast recursive solution of equilibrium state probabilities for three tandem queues with limited buffer space