A New Approach for Finding the various Optimal Variable Ordering to Generate the Binary Decision Diagrams 'BDD' of a Computer Communication Network

In this paper we have adopted a new approach for finding the various optimal ordering to generate the binary decision diagrams of a computer communication network. We have shown that these binary decision diagrams are of minimum size and take same time to generate. If two binary decision diagrams have the same size and representing the same Boolean function, then these binary decision diagrams are known as dual binary decision diagrams, because they are dual of each other. We have also shown that the reliability obtained from these dual binary decision diagrams is equal by applying Shannon’s decomposition.

[1]  Manoj Singhal,et al.  An Alternate Approach to Compute the Reliability of a Computer Communication Network Using Binary Decision Diagrams , 2010, IC3.

[2]  Sayeed Ahmad.  Simple enumeration of minimal cutsets of acyclic directed graph , 1988 .

[3]  Shyue-Kung Lu,et al.  OBDD-based evaluation of k-terminal network reliability , 2002, IEEE Trans. Reliab..

[4]  Marco Furini,et al.  International Journal of Computer and Applications , 2010 .

[5]  S. Kuo,et al.  Determining terminal-pair reliability based on edge expansion diagrams using OBDD , 1999 .

[6]  Michael O. Ball,et al.  Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.

[7]  Kishor S. Trivedi,et al.  A BDD-based algorithm for reliability analysis of phased-mission systems , 1999 .

[8]  M. O. Locks.  A Minimizing Algorithm for Sum of Disjoint Products , 1987, IEEE Transactions on Reliability.

[9]  J.P. Gadani,et al.  System Effectiveness Evaluation Using Star and Delta Transformations , 1981, IEEE Transactions on Reliability.

[10]  R. Kevin Wood.  A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability , 1985, Networks.

[11]  Kishor S. Trivedi,et al.  A BDD-Based Algorithm for Reliability , 2000 .

[12]  J. Carlier,et al.  Factoring and reductions for networks with imperfect vertices , 1991 .

[13]  C. Jun,et al.  Some variants of polygon-to-chain reductions in evaluating reliability of undirected network , 1995 .

[14]  Saburo Muroga,et al.  Binary Decision Diagrams , 2000, The VLSI Handbook.

[15]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[16]  Antoine Rauzy,et al.  A new methodology to handle Boolean models with loops , 2003, IEEE Trans. Reliab..

[17]  H. Imai,et al.  Computational Investigations of All-Terminal Network Reliability via BDDs (Special Section on Discrete Mathematics and Its Applications) , 1999 .

[18]  Mark K. Chang,et al.  Network reliability and the factoring theorem , 1983, Networks.

[19]  Corinne Lucet,et al.  Exact Methods to Compute Network Reliability , 1999 .

[20]  Salim Hariri,et al.  SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods , 1987, IEEE Transactions on Computers.

[21]  Olivier Coudert,et al.  Implicit and incremental computation of primes and essential primes of Boolean functions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[22]  Kenneth J. Supowit,et al.  Finding the Optimal Variable Ordering for Binary Decision Diagrams , 1990, IEEE Trans. Computers.

[23]  R. K. Chauhan,et al.  Network Reliability Computation by using Different Binary Decision Diagrams , 2010 .

[24]  J. Scott Provan,et al.  The Complexity of Reliability Computations in Planar and Acyclic Graphs , 1986, SIAM J. Comput..

[25]  Nikolaos Limnios,et al.  Statistical and probabilistic models in reliability , 1999 .