In this paper, I have considered a computer communication network which has perfect vertices and imperfect links. It means communication links may fail with known probability. I have found the reliability of the given network by using an exact method (inclusion-exclusion formula) and with binary decision diagram. I have found that the reliability obtained by both the method is same. Binary decision diagram based reliability evaluation involves three main steps. First ordering the given communication link by applying a heuristic approach. I have proposed a heuristic approach to generate the minimum size binary decision diagram. Second generate the reliability function with the help of min-paths from source to sink. At last apply Shannon's decomposition to compute the reliability of the given network.
分享
引用
