Abstract
This chapter presents the primitive steps in computation of network reliability, and some of the popular examples by applying network reliability. Network reliability is one of the most interesting topics in network theory. It has been applied to many real-world applications such as traffic planning, computer network planning, power transmission planning, etc. The planners usually want to know how reliable the systems they planned. Network reliability helps them to get the answer of such questions. Due to its NP-hard nature, many approaches have been developed to tackle the efficiency problems in computations. One of the most promising methods is the three-stage approach, which divides the problem into three smaller problems and conquers them, making the resolution process more efficient than others. Several examples are presented in the chapter for illustrative purposes.
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
References
Abel U, Bicker R (1982) Determination of all minimal cut-sets between a vertex pair in an undirected graph. IEEE Trans Reliab 31:167 – 171
Aggarwal KK, Chopra YC, Bajwa JS (1982) Capacity consideration in reliability analysis of communication systems. IEEE Trans Reliab 31:177–80
Aggarwal KK, Gupta JS, Misra KB (1975) A simple method for reliability evaluation of a communication system. IEEE Trans Commun 23:563–565
Aven T (1985) Reliability evaluation of multistate systems with multistate components. IEEE Trans Reliab 34:473–479
Chen SG (2014) Reduced recursive inclusion-exclusion principle for the probability of union events. In: 2014 IEEE international conference on industrial engineering and engineering management. Selangor, Malaysia, pp 1–3
Chen SG (2014) Reduced recursive sum of disjoint product in network reliability. In: 2014 the 20th ISSAT international conference on reliability and quality in design. Seattle, Washington, U.S.A., pp 170–173
Chen SG (2015) Search for all MCs with backtracking. Int J Reliab Qual Perform 6(2):101–106
Chen SG (2016) Optimal re-arrangement in fast enumeration for integer programming problems. In: 2016 IEEE international conference on industrial engineering and engineering management, pp 1255–1258
Chen SG (2019) A way from adjacency matrix to linked path structure. In: Proceedings of the 25th ISSAT international conference on reliability and quality in design, pp 20–23
Chen SG, Lin YK (2012) Search for all minimal paths in a general large flow network. IEEE Trans Reliab 61(4):949–956
Chen SG, Lin YK (2016) Searching for \(d\)-MPs with fast enumeration. J Comput Sci 17:139–147
Colbourn CJ (1987) The combinatorics of network reliability. Oxford University Press, UK
Doulliez P, Jamoulle J (1972) Transportation networks with random arc capacities. Recherche Operationnelle 3:45–60
Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press, NJ
Jane CC, Lin JS, Yuan J (1993) On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Trans Reliab 42:354–361, 368
Jasmon GB, Foong KW (1987) A method for evaluating all the minimal cuts of a graph. IEEE Trans Reliab 36:538 – 545
Lee SH (1980) Reliability evaluation of a flow network. IEEE Trans Reliab 29:24–26
Lin JS, Jane CC, Yuan J (1995) On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks 25:131–138
Lin YK (2001) On reliability evaluation of a stochastic-flow network in terms of minimal cuts. J Chin Inst Ind Eng 18:49–54
Lin YK (2001) A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Comput Oper Res 28(13):1277–1285
Lin YK, Chen SG (2019) An efficient searching method for minimal path vectors in multi-state networks. Ann Oper Res. 1–12. https://doi.org/10.1007/s10479-019-03158-6
Roberts FS, Tesman B (2009) Applied Combinatorics, 2nd edn. CRC Press
Schrijver A (2002) On the history of the transportation and maximum flow problems. Math Program 91(3):437–445
Shen Y (1995) A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectron Reliab 35:973–976
Wilson RJ (1972) Introduction to graph theory. Prentice-Hall
Xue J (1985) On multistate system analysis. IEEE Trans Reliab 34(4):329–337
Yeh WC (2001) A simple algorithm to search for all \(d\)-MPs with unreliable nodes. Reliab Eng Syst Saf 73:49–54
Yeh WC (2001) A simple approach to search for all \(d\)-MCs of a limited-flow network. Reliab Eng Syst Saf 71:15–19
Yeh WC (2002) A simple method to verify all \(d\)-minimal path candidates of a limited-flow network and its reliability. Int J Adv Manuf Technol 20(1):77–81
Yeh WC (2006) A simple algorithm to search for all MCs in networks. Eur J Oper Res 174:1694–1705
Yeh WC (2007) A simple heuristic algorithm for generating all minimal paths. IEEE Trans Reliab 56(3):488–494
Zuo MJ, Tian Z, Huang HZ (2007) An efficient method for reliability evaluation of multistate networks given all minimal path vectors. IIE Trans 39:811–817
Acknowledgements
This work was supported in part by the National Science Council, Taiwan, Republic of China, under Grant No. MOST 107-2221-E-236-004-MY3.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Chen, SG. (2020). Computation in Network Reliability. In: Pham, H. (eds) Reliability and Statistical Computing. Springer Series in Reliability Engineering. Springer, Cham. https://doi.org/10.1007/978-3-030-43412-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-43412-0_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43411-3
Online ISBN: 978-3-030-43412-0
eBook Packages: EngineeringEngineering (R0)