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
Beschreibung
IEEE Xplore Abstract - Bounding availability of repairable systems
%0 Journal Article
%1 muntz1989bounding
%A Muntz, Richard R.
%A de Souza e Silva, E.
%A Goyal, A.
%D 1989
%J Computers, IEEE Transactions on
%K availability
%N 12
%P 1714-1723
%R 10.1109/12.40849
%T Bounding availability of repairable systems
%U http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=40849
%V 38
%X 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
@article{muntz1989bounding,
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. 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},
added-at = {2014-10-15T21:49:03.000+0200},
author = {Muntz, Richard R. and de Souza e Silva, E. and Goyal, A.},
biburl = {https://www.bibsonomy.org/bibtex/20aa12884399cae0a550aecbb96cb7240/avail_map_stud},
description = {IEEE Xplore Abstract - Bounding availability of repairable systems},
doi = {10.1109/12.40849},
interhash = {a424c6fe7f3ae61938e257a61efec32f},
intrahash = {0aa12884399cae0a550aecbb96cb7240},
issn = {0018-9340},
journal = {Computers, IEEE Transactions on},
keywords = {availability},
month = dec,
number = 12,
pages = {1714-1723},
timestamp = {2014-10-15T21:49:03.000+0200},
title = {Bounding availability of repairable systems},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=40849},
volume = 38,
year = 1989
}