Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bobbio, A., Ferraris, C., Terruggia, R.: New Challenges in Network Reliability Analysis. Technical Report, TR-INF-UNIPMN, pp. 1–8 (2006)
Rauzy, A.: New algorithms for fault tolerant trees analysis. Reliability Engineering and System Safety 5(59), 203–211 (1993)
Rauzy, A.: A new methodology to handle Boolean models with loops. IEEE Trans. Reliability R-52(1), 96–105 (2003)
Satyanarayana, A., Chang, M.K.: Network reliability and the factoring theorem. Networks 13, 107–120 (1983)
Akers, B.: Binary decision diagrams. IEEE Trans. Computers C-27, 509–516 (1978)
Lucet, C., Manouvrier, J.-F.: Exact methods to compute network reliability. In: Ionescu, D.C., Limnios, N. (eds.) Statistical and Probabilistic Models in Reliability, pp. 279–294. Birkhauser, Boston (1999)
Yeh, F., Lu, S., Kuo, S.: OBDD-based evaluation of k-terminal network reliability. IEEE Trans. Reliability R-51(4), 443–451 (2002)
Hardy, G., Lucet, C., Limnios, N.: Computing all-terminal reliability of stochastic networks with binary decision diagrams. In: Proc.11th International Symposium on Applied Stochastic Models and Data Analysi., pp. 1468–1473 (2005)
Imai, H., Sekine, K., Imai, K.: Computational investigations of all terminal network reliability via BDDs. IEICE Transactions on Fundamentals E82-A(5), 714–721 (1999)
Carlier, J., Lucet, C.: A decomposition algorithm for network reliability evaluation. Discrete Applied Mathematics 65, 141–156 (1996)
Gadani, J.P.: System effectiveness evaluation using star and delta transformations. IEEE Trans. Reliability R-30(1), 43–47 (1981)
Provan, J.S.: The complexity of reliability computations on planar and acyclic graphs. SIAM J. Computing 15(3), 694–702 (1986)
Ball, M.O.: Computational complexity of network reliability analysis An overview. IEEE Trans. Reliability R-35(3), 230–239 (1986)
Locks, M.O.: A minimizing algorithm for sum of disjoint products. IEEE Trans. Reliability R-36(4), 436–445 (1987)
Choi, M.S., Jun, C.H.: Some variant of polygon-to-chain reductions in evaluating reliability of undirected network. Microelectron Reliability 35(1), 1–11 (1985)
Singhal, M., Chauhan, R.K., Sharma, G.: Use of Modified Binary Decision Diagrams in Reliability Evaluation of a Directed Computer Communication Network. The Icfai University Journal of Computer Sciences III(3), 22–30 (2009)
Singhal, M., Chauhan, R.K., Sharma, G.: A New Optimal Approach for evaluating the size of BDD (Binary Decision Diagram) for calculating the Reliability of a CCN (Computer Communication Network). International Journal of Advanced Networking and Applications 1(4), 230–235 (2010)
Singhal, M., Chauhan, R.K., Sharma, G.: Effects of Variable Ordering on Binary Decision Diagrams for Computation of Reliability of a Computer Communication Network. Journal of Computer Science (accepted 2010)
Coudert, O., Madre, J.C.: Implicit and incremental computation of primes and essential primes of Boolean functions. In: Proc. of the 29th ACM/IEEE Design Automation Conference, pp. 36–39 (1992)
Theologou, O., Carlier, J.: Factoring and reductions for networks with imperfect vertices. IEEE Trans. Reliability R-40, 210–217 (1991)
Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24(3), 293–318 (1992)
Wood, R.K.: A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability. Networks 15, 173–190 (1985)
Hariri, S., Raghavendra, C.S.: SYREL- A symbolic reliability algorithm based on path and cut set methods. IEEE Trans. Computers C-36(10), 1224–1232 (1987)
Ahmad, S.H.: Simple enumeration of minimal cut sets of acyclic directed graph. IEEE Trans. Reliability R-27(5), 484–487 (1988)
Friedman, S.J., Supowit, K.J.: Finding the optimal variable ordering for binary decision diagrams. In: Proc. 24th ACM/IEEE Conference on Design Automation, pp. 348–356 (1987)
Friedman, S.J., Supowit, K.J.: Finding an optimal variable ordering for binary decision diagrams. IEEE Trans. Computers C-39(5), 710–713 (1990)
Kuo, S., Yeh, S., Lu, Y.F.: Determining terminal pair reliability based on edge expansion diagrams using OBDD. IEEE Trans. Reliability 48(3), 234–246 (1999)
Zang, X., Sun, H., Trivedi, K.S.: A BDD-based algorithm for reliability Graph Analysis. Technical Report, http://www.ee.duke.edu/~hairong/workinduke/relgrap
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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: Ranka, S., et al. Contemporary Computing. IC3 2010. Communications in Computer and Information Science, vol 94. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14834-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-14834-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14833-0
Online ISBN: 978-3-642-14834-7
eBook Packages: Computer ScienceComputer Science (R0)