Reliability Computation with Perfect and Imperfect Vertices via Binary Decision Diagram of a Computer Communication Network

Dr. Manoj Singhal

In today’s market the requirement of computer communication network is increasing due to the exponential growth of internet. As a result traffic on computer communication network is increasing day by day. In this heavy traffic scenario, the nodes and the links may fail in any real computer communication network. Therefore reliability consideration is an important factor in computer communication network. In this paper I have found the reliability of a computer communication network represented in the form of a graph. Firstly I have considered that nodes in the graph are perfect and only communication links can fail with known probability. Secondly I have considered that the nodes and the edges of the graph are imperfect. It means nodes as well as communication links may fail with known probability.

Select Volume / Issues:

• Volume 3 Issue 6, Nov. 2012

Year:

2012

Type of Publication:

Article

Keywords:

Binary Decision Diagrams BDD; Computer Communication Network CNN; Directed Acyclic Graph DAG; Modified Binary Decision Diagram MBDD; Ordered Binary Decision Diagram OBDD

Journal:

IJECCE

Volume:

3

Number:

6

Pages:

1497-1502

Month:

November