In this paper we adopted an efficient approach for generating the binary decision diagram of a computer communication network represented in the form of a directed graph for calculating the reliability of the computer communication network. We have shown that this binary decision diagram is of the minimum size. We have also generated modified binary decision diagrams of the given graph when a particular edge of this graph is down and these modified binary decision diagrams are of minimum size. Conclusively, we can say that if all min-paths of a network are disjoint, then more than one optimal ordering may be possible for finding the reliability of a computer communication network. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Singhal, M., Chauhan, R. K., & Sharma, G. (2010). An alternate approach to compute the reliability of a computer communication network using binary decision diagrams. In Communications in Computer and Information Science (Vol. 94 CCIS, pp. 160–170). https://doi.org/10.1007/978-3-642-14834-7_16
Mendeley helps you to discover research relevant for your work.