An alternate Approach to Compute the Reliability of a Network with Imperfect Nodes using Binary Decision Diagrams

In this paper i have adopted an efficient approach for calculating the reliability of the computer communication network with the help of binary decision diagram. The computer communication network has imperfect nodes and imperfect links. It means the nodes as well as the communication links may fail with known probability. The network is represented in the form of a directed graph. First i have found the reliability of the given network by applying the inclusionexclusion formula, which is an exact method to find the reliability of a network and then i have found the reliability of the given network with binary decision diagram. To find the reliability via binary decision diagram, we must order the nodes and the communication links of the given network by applying a proposed heuristic approach. I have found that the reliability obtained via binary decision diagram is equal to the reliability obtained by inclusion-exclusion formula. I have also shown that the generated binary decision diagram is of the minimum size.