Estimation of network reliability using optimal ROBDD approach

摘要

Reliability analysis of directed/undirected networks, by enumerating the minpath set of source-terminal or s-t connectivity has been proposed. Reduced Ordered Binary Decision Diagram (ROBDD) is a well ordered and effective method of representing the set of combinations than the conventional Binary Decision Diagrams (BDD) approach is used to study the 2-terminal network reliability problem extensively in order to compute an exact solution when a network complexity becomes an important and NP-hard. The proposed algorithm is based on the breadth-first search traversal in order to evaluate the number of minimal paths and estimate the reliability value using efficient ROBDD bottom-up approach. The experiment analysis is illustrated with some benchmark networks and is compared with previous algorithms presented in the literature.