Abstract
The number of states examined by most probable state algorithms for performability computations can be reduced dramatically by incorporating simple connectivity-based bounds, even when the performability measure is much more complex than connectivity. Modifications to Yang and Kubat's most probable state method are presented that permit the use of simple auxiliary bounds with only a small effect on the time per iteration. Computational results for a variety of performability measures are given.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
H.M.F. AboElFotoh and C.J. Colbourn, Series-parallel bounds for the two-terminal reliability problem, ORSA J. Comp. 1(1989)205–222.
M.O. Ball, C.J. Colbourn and J.S. Provan, Network reliability, in:Handbook of Operations Research: Networks, to appear.
T.B. Brecht and C.J. Colbourn, Lower bounds for two-terminal network reliability, Discr. Appl. Math. 21(1988)185–198.
C.J. Colbourn,The Combinatorics of Network Reliability (Oxford University Press, 1987).
C.J. Colbourn, Edge-packings of graphs and network reliability, Discr. Math. 72(1988)49–61.
C.J. Colbourn and E.I. Litvak, Bounding network reliability by graph transformations, in:Reliability of Computer and Communications Networks (AMS/ACM, 1991) pp. 91–104.
G.S. Fishman, A Monte Carlo sampling plan for estimating network reliability, Oper. Res. 34(1986)581–594.
D.D. Harms and C.J. Colbourn, Renormalization of two-terminal reliability, Networks 23(1993)289–298.
V.A. Kaustov, E.I. Litvak and I.A. Ushakov, The computational effectiveness of reliability estimates by the method of nonedge-intersecting chains and cuts, Sov. J. Comp. Syst. Sci. 24(1986)70–73.
K. Kumamoto, T. Tanaka and K. Inoue, Efficient evaluation of system reliability by a Monte Carlo method, IEEE Trans. Rel. R-26(1977)311–315.
Y.F. Lam and V.O.K. Li, An improved algorithm for performance analysis of networks with unreliable components, IEEE Trans. Commun. COM-34(1986)496–497.
J.F. Meyer, Performability: A retrospective and some pointers to the future, Perform. Eval. 14(1992)139–156.
B. Sanso and F. Soumis, Communication and transportation networks reliability using routing models, IEEE Trans. Rel. R-40(1991)29–38.
J.G. Shanthikumar, Bounding network reliability using consecutive minimal cutsets, IEEE Trans. Rel. R-37(1988)45–49.
D.R. Shier,Network Reliability and Algebraic Structures (Oxford University Press, 1991).
H.J. Strayer and C.J. Colbourn, Consecutive cuts and paths, and bounds onk-terminal reliability, Technical Report 93-23, DIMACS (1993).
L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8(1979)410–421.
R.M. Van Slyke and H. Frank, Network reliability analysis I, Networks 1(1972)279–290.
C.-L. Yang and P. Kubat, An algorithm for network reliability bounds, ORSA J. Comput. 2(1990)336–345.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Colbourn, C.J., Harms, D.D. Evaluating performability: Most probable states and bounds. Telecommunication Systems 2, 275–300 (1993). https://doi.org/10.1007/BF02109862
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02109862