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
Numerical transient analysis of Markov models
Computers and Operations Research
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
Algorithmic approach to bounding the mean response time of a minimum expected delay routing system
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
State space exploration in Markov models
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A Unified Framework for Simulating Markovian Models of Highly Dependable Systems
IEEE Transactions on Computers
On the sensitivity of transient solutions of Markov models
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Fast Simulation of Highly Dependable Systems with General Failure and Repair Processes
IEEE Transactions on Computers
Efficient exploration of availability models guided by failure distances
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bound Computation of Dependability and Performance Measures
IEEE Transactions on Computers
A Hybrid Solution of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Parallel and Distributed Systems
An iterative bounding method for stochastic automata networks
Performance Evaluation
Computing Performance Bounds of Fork-Join Parallel Programs Under a Multiprocessing Environment
IEEE Transactions on Parallel and Distributed Systems
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Probability in the Engineering and Informational Sciences
Bounding stationary results of Tandem networks with MAP input and PH service time distributions
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Bounding transient and steady-state dependability measures through algorithmic stochastic comparison
ACM SIGMETRICS Performance Evaluation Review
Modeling, analysis, measurement and experimentation with the Tangram-II integrated environment
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Bounds based on lumpable matrices for partially ordered state space
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Availability analysis of blade server systems
IBM Systems Journal
Closed form absorption time bounds
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Mathematics of Operations Research
| Hi-index | 14.99 |
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. An approximation technique is presented 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.