Evaluating performability: Most probable states and bounds

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.

[1]  Che-Liang Yang,et al.  An Algorithm for Network Reliability Bounds , 1990, INFORMS J. Comput..

[2]  George S. Fishman,et al.  A Monte Carlo Sampling Plan for Estimating Network Reliability , 1984, Oper. Res..

[3]  Charles J. Colbourn,et al.  Renormalization of two - terminal reliability , 1993, Networks.

[4]  John F. Meyer,et al.  Performability: A Retrospective and Some Pointers to the Future , 1992, Perform. Evaluation.

[5]  B. Sanso,et al.  COMMUNICATION AND TRANSPORTATION NETWORKS RELIABILITY USING ROUTING MODELS. REVISED EDITION , 1987 .

[6]  Hiromitsu Kumamoto,et al.  Efficient Evaluation of System Reliability by Monte Carlo Method , 1977, IEEE Transactions on Reliability.

[7]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[8]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[9]  Charles J. Colbourn,et al.  Edge-packing of graphs and network reliability , 1988, Discret. Math..

[10]  Charles J. Colbourn,et al.  Series-Parallel Bounds for the Two-Terminal Reliability Problem , 1989, INFORMS J. Comput..

[11]  Y. F. Lam,et al.  An Improved Algorithm for Performance Analysis of Networks with Unreliable Components , 1986, IEEE Trans. Commun..

[12]  Charles J. Colbourn,et al.  Lower bounds on two-terminal network reliability , 1988, Discret. Appl. Math..

[13]  Richard M. Van Slyke,et al.  Network reliability analysis: Part I , 1971, Networks.

[14]  J. Shanthikumar.  Bounding network-reliability using consecutive minimal cutsets , 1988 .

[15]  D. Shier.  Network Reliability and Algebraic Structures , 1991 .