Skip to main content
SpringerLink
Log in

Analysis of two-terminal network reliability based on efficient data structure

  • Original Article
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

Abstract

The present work is depend upon a different data structure to perform the network reliability estimation efficiently. Zero suppressed binary decision diagram (ZBDD) is an well ordered and effective method of representing not only the boolean functions but also the sets of combinations than the conventional binary decision diagrams (BDD). This paper proposes new algorithm to manipulate the ZBDDs the variant of BDD on some benchmark networks. The 2-terminal network reliability problem has been studied extensively and effective results have been obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Akers SB (1978) Binary decision diagrams. IEEE Trans Comput 1(6):509–516

    Article  Google Scholar 

  • Ball MO (1986) Computational complexity of network reliability analysis: an overview. IEEE Trans Reliab 35(3):230–239

    Article  Google Scholar 

  • Ball MO, Colbourn CJ, Provan JS (1995) Network reliability, network models. Handbook of operations research. Elsevier, North Holland, pp 673–762

    Book  Google Scholar 

  • Bryant RE (1986) Graph based algorithms for Boolean function manipulation. IEEE Trans Comput C 35(8):677–691

    Article  Google Scholar 

  • Bryant RE (1992) Symbolic boolean manipulation with ordered binary decision diagrams. ACM Comput Surv (CSUR) 24(3):293–318

    Article  MathSciNet  Google Scholar 

  • Colbourn CJ (1987) The combinatorics of network reliability. Oxford University Press Inc, New York

    Google Scholar 

  • Hardy G, Lucet C, Limnios N (2007) K-terminal network reliability measures with binary decision diagrams. IEEE Trans Reliab 56(3):506–515

    Article  Google Scholar 

  • Hariri S, Raghavendra S (1987) Syrel: a symbolic reliability algorithm based on path and cutest methods. IEEE Trans Comput 10:1224–1232

    Article  Google Scholar 

  • Kobayashi K, Yamamoto H (1999) A new algorithm in enumerating all minimal paths in a sparse network. Reliab Eng Syst Saf 65(1):11–15

    Article  Google Scholar 

  • Kuo SY, Lu SK, Yeh FM (1999) Determining terminal-pair reliability based on edge expansion diagrams using OBDD. IEEE Trans Reliab 48(3):234–246

    Article  Google Scholar 

  • Kuo SY, Yeh FM, Lin HY (2007) Efficient and exact reliability evaluation for networks with imperfect vertices. IEEE Trans Reliab 56(2):288–300

    Article  Google Scholar 

  • Lee CY (1959) Representation of switching circuits by binary-decision programs. Bell Syst Tech J 38(4):985–999

    Article  MathSciNet  Google Scholar 

  • Lu JM, Innal F, Wu XY, Liu Y, Lun dteigen MA (2016) Two-terminal reliability analysis for multi-phase communication networks. Eksploatacja I Niezawodnosc 18(3):418–427

    Article  Google Scholar 

  • Minato SI (1993) Zero-suppressed BDDs for set manipulation in combinatorial problems. In: 30th ACM/IEEE design automation conference, pp 272–277

  • Minato SI (2001) Zero-suppressed BDDs and their applications. Int J Softw Tools Technol Transf 3(2):156–170

    Article  Google Scholar 

  • Misra R, Chaturvedi SK (2009) A cutset based unified framework to evaluate network reliability measures. IEEE Trans Reliab 58(4):658–666

    Article  Google Scholar 

  • Nguyen D, Vo B, Vu DL (2016) A parallel strategy for the logical-probabilistic calculus-based method to calculate two-terminal reliability. Qual Reliab Eng Int 32(7):2313–2327

    Article  Google Scholar 

  • Pino W, Gomes T, Kooij R (2015) A comparison between two all-terminal reliability algorithms. J Adv Comput Netw 3(4):284–290

    Article  Google Scholar 

  • Rauzy A (1993) New algorithms for fault tree analysis. Reliab Eng Syst Saf 40(3):203–211

    Article  Google Scholar 

  • Rauzy A (2003) A New methodology to handle boolean models with loops. IEEE Trans Reliab 52(1):96–105

    Article  Google Scholar 

  • Satyanarayana A, Chang MK (1983) Network reliability and the factoring theorem. Networks 13(1):107–120

    Article  MathSciNet  Google Scholar 

  • Shen Y (1995) A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectron Reliab 35(6):973–976

    Article  Google Scholar 

  • Singh H, Vaithilingam S, Anne K (1996) Terminal reliability using binary decision diagrams. Microelectron Reliab 36(3):363–365

    Article  Google Scholar 

  • Soh S, Rai S (1991) CAREL: computer aided reliability evaluator for distributed computing networks. IEEE Trans Parallel Distrib Syst 2(2):199–213

    Article  Google Scholar 

  • Soh S, Rai S (1993) Experimental results on preprocessing of path/cut terms in sum of disjoint product techniques. IEEE Trans Reliab 42(1):24–33

    Article  Google Scholar 

  • Somenzi F (2012) CUDD: CU decision diagram package: Release 2.5.0. http://vlsi.colorado.edu/~fabio/CUDD/

  • Thayse A, Davio M, Deschamps JP (1978) Optimization of multiple-valued decision diagrams. ISMVL-8, pp 171–177

  • Theologou O, Carlier J (1991) Factoring and reductions for networks with imperfect vertices. IEEE Trans Reliab 40(2):210–217

    Article  Google Scholar 

  • Veeraraghavan M, Trivedi KS (1991) An improved algorithm for symbolic reliability analysis. IEEE Trans Reliab 40(3):347–358

    Article  Google Scholar 

  • Venkata Ramana B, Chatterjee S, Vishwakarma GK (2017) Estimation of network reliability using optimal ROBDD approach. ARS Combinatoria (Accepted)

  • Yeh FM, Lu SK, Kuo SY (2002) OBDD-based evaluation of k-terminal network reliability. IEEE Trans Reliab 51(4):443–451

    Article  Google Scholar 

  • Zang X, Sun N, Trivedi KS (1999) A BDD-based algorithm for reliability analysis of phased mission systems. IEEE Trans Reliab 48(1):50–60

    Article  Google Scholar 

  • Zhang Z, Shao F (2018) A diameter-constrained approximation algorithm of multistate two-terminal reliability. IEEE Trans Reliab 67(3):1249–1260

    Article  Google Scholar 

  • Zhu P, Guo Y, Lombardi F, Han J (2017) Approximate reliability of multi-state two-terminal networks by stochastic analysis. IET Netw 6(5):116–124

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Indian institute of Technology (Indian School of Mines), Dhanbad, 826004, India

    S. Chatterjee, Venkata Ramana & Gajendra K. Vishwakarma

Authors
  1. S. Chatterjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Venkata Ramana
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gajendra K. Vishwakarma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Chatterjee.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chatterjee, S., Ramana, V. & Vishwakarma, G.K. Analysis of two-terminal network reliability based on efficient data structure. Int J Syst Assur Eng Manag 11, 15–20 (2020). https://doi.org/10.1007/s13198-019-00921-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-019-00921-7

Keywords

Search

Navigation