A practical bounding algorithm for computing two-terminal reliability based on decomposition technique

Yi-feng Niu, Fang-Ming Shao
2011 Computers and Mathematics with Applications  
Two-terminal reliability, which is defined as the probability that there exists at least one path from source node to sink node, is an important performance measure in network system. However, it is well known that the complexity of exact two-terminal reliability evaluation is NP-hard. This paper considers a bounding algorithm for computing twoterminal reliability based on decomposition technique originally used in computing multistate reliability. Compared with traditional bounding algorithms,
more » ... the proposed algorithm requires neither all MPs/MCs to be enumerated in advance, nor all arcs to have the same state probabilities. It can sequentially improve the quality of approximation according to a predetermined value ε. Especially, it may be an exact algorithm if it runs into completion. An example shows that the proposed algorithm is practical and effective.
doi:10.1016/j.camwa.2010.09.033 fatcat:i3tlqpk7l5hudpjc5thgc3ntom