By Topic

Bounding availability of repairable systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Muntz, Richard R. ; Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA ; de Souza e Silva, E. ; Goyal, A.

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

Published in:

Computers, IEEE Transactions on  (Volume:38 ,  Issue: 12 )