%0 Journal Article
%T DIRECTED ACYCLIC GRAPH BASED RELIABILITY COMPUTATION OF A NETWORK WITH IMPERFECT NODES
%A Manoj Singhal
%J International Journal of Engineering Sciences and Emerging Technologies
%D 2013
%I IAET
%X In this paper, a heuristic is proposed to find out the reliability of a directed network by using directed acyclic graph. This directed network has imperfect nodes as well as imperfect links. Directed acyclic graph based reliability computation involves three main steps: In the first step, built the reliability function of the given directed network which is the union of all min-paths from source to sink. In the second step, apply a heuristic approach to order the given communication links and nodes of the given directed network. Finally apply Shannon¡¯s decomposition method to compute the reliability of the given directed network. The paper also shows that the reliability obtained by this method is equal to the reliability obtained by applying the classical inclusion-exclusion method on the given directed network.
%K Binary Decision Diagrams (BDD)
%K Directed Acyclic Graph (DAG)
%K Computer communication Network (CNN)
%K Modified Binary Decision Diagram (MBDD)
%K Ordered Binary Decision Diagram (OBDD)
%K Dual Binary Decision Diagram (DBDD).
%U http://www.ijeset.com/media/0001/6N8-IJESET0402801.pdf