Effects Of Variable Ordering On Binary Decision Diagrams For Computation Of Reliability Of A Computer Communication Network

In this paper we compute the reliability of a computer communication network (CCN) by using different Binary Decision Diagrams (BDD). Here we take several orderings to generate different BDD of the given CCN and then compute network reliability by these different BDD. It is observed experimentally that the results (Reliability) of applying Classical Inclusion-exclusion principle on the given network are the same as obtained by applying Shannon's decomposition on different BDD.