Bounding availability of repairable computer systems

Authors:
R. R. Muntz;E. de Souza e Silva;A. Goyal
Affiliations:
UCLA Computer Science Department;Federal-University of Rio de Janeiro, NCE;IBM T.J. Watson Research Center
Venue:
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
1989

Citing 9
Cited 7

Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition

Journal of the ACM (JACM)
Hybrid reliability modeling of fault-tolerant computer systems

Computers and Electrical Engineering - Special issue: reliability and verification of computing systems
Calculating Cumulative Operational Time Distributions of Repairable Computer Systems

IEEE Transactions on Computers - The MIT Press scientific computation series
Bounds on conditional steady-state distributions in large Markovian and queueing models

Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
On the stochastic structure of parallelism and synchronization models for distributed algorithms
On Network Linguistics and the Conversational Design of Queueing Networks

Journal of the ACM (JACM)
Computable Error Bounds for Aggregated Markov Chains

Journal of the ACM (JACM)
Probability and Statistics with Reliability, Queuing and Computer Science Applications

Probability and Statistics with Reliability, Queuing and Computer Science Applications
Stability Analysis of Large Markov Chains

Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation

Computing bounds on steady state availability of repairable computer systems

Journal of the ACM (JACM)
Bounding of performance measures for a threshold-based queueing system with hysteresis

SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A new approach combining simulation and randomization for the analysis of large continuous time Markov chains

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on modeling and analysis of stochastic systems
Refinable Bounds for Large Markov Chains

IEEE Transactions on Computers
Bounding of Performance Measures for Threshold-Based Queuing Systems: Theory and Application to Dynamic Resource Management in Video-on-Demand Servers

IEEE Transactions on Computers
An Eclectic Survey of Bounding Methods for Markov Chain Models

MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Model-based qualitative risk assessment for availability of IT infrastructures

Software and Systems Modeling (SoSyM)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Markov models are widely used for the analysis of availability of computer/communication systems. Realistic models often involve state space cardinalities that are so large that it is impractical to generate the transition rate matrix let alone solve for availability measures. Various state space reduction methods have been developed, particularly for transient analysis. In this paper we present an approximation technique for determining steady state availability. Of particular interest is that the method also provides bounds on the error. Examples are given to illustrate the method.