Abstract
The reliability of complex networks is a very sensitive issue which requires implementing powerful methods for its evaluation. Many algorithms have been proposed to solve networks reliability problem as those based on minimal pathsets and cutsets approximation. The enumeration of minimal pathsets can be obtained very easily, it just needs to use an ordinary algorithm to determine the paths/cuts, but in case the network size is large, more efficient algorithms are needed. This paper presents an intuitive algorithm to find all minimal paths. The algorithm proceeds recursively using an efficient procedure traversing cleverly the structure of a graph. Its complexity has been checked to be better than those developed until now. The program is simple, compact, modular and easy to be embedded to any software which evaluates the reliability as those based on sum-of-disjoint product approach. During our experiment tests, we have enumerated several networks of varied complexities and the comparison with demonstrated literature approaches is systematic.
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
Barlow, R.E., Proschan, F.: Mathematical Theory of Reliability. J. Wiley & Sons (1965) (reprinted 1996)
Aggarwal, K.K., Misra, K.B., Gupta, J.S.: A fast algorithm for reliability evaluation. IEEE Trans. Reliability R-24, 83–85 (1975)
Abraham, J.A.: An Improved Algorithm for Network Reliability. IEEE Transactions on Reliability R-28, 58–61 (1979)
Colbourn, C.J.: The combinatorics of network reliability. Oxford University Press, New York (1987)
Al-Ghanim, A.M.: A heuristic technique for generating path and cutsets of a general net-work. Computers & Industrial Engineering 36, 45–55 (1999)
Heidtmann, K.D.: Smaller sums of disjoint products by subproduct inversion. IEEE Trans. Reliability 38(3), 305–311 (1989)
Yeh, W.-C.: A simple Heuristic Algorithm for Generating All Minimal Paths. IEEE Transactions on Reliability 56(3), 488–494 (2007)
Yeh, W.-C.: A simple Universal Generating Function Method to Search for all Minimal Paths in Networks. IEEE Transactions on Reliability 39(6), 1246–1254 (2009)
Shier, D.R., Whited, A.E.: Algorithms for generating Minimal Cutsets by Inversion. IEEE Transactions on Reliability R-34(4), 314–319 (1985)
Patvardhan, C., Prasad, V.C.: Vertex Cutsets of Undirected Graphs. IEEE Transactions on Reliability 44(2), 347–353 (1995)
Rebaiaia, M.L., Ait-Kadi, D., Merlano, A.: A Practical Algorithm for Network Reliability Evaluation Based on the Factoring Theorem-A Case Study of a Generic Radiocommunication System. Journal of Quality 16(5), 323–336 (2009)
Berge, C.: Graphs and Hypergraphs. North Holland Publishing Company (1973)
Soh, S., Rai, S.: Experimental results on preprocessing of path/cut terms in sum of dis-joint products technique. IEEE Trans. Reliability 42(1), 24–33 (1993)
Jasmon, G.B., Kai, O.S.: A New Technique in Minimal Path and Cutset Evaluation. Reprinted from IEEE Transactions on Reliability R-34(2), 136–143 (1985)
Lee, C.Y.: Representation of Switching Circuits by Binary-Decision Programs. Bell Systems Technical Journal 38, 985–999 (1959)
Lin, H.Y., Kuo, S.Y., Yeh, F.M.: Minimal cutset enumeration and network reliability evaluation by recursive merge and BDD. In: Proceedings of the Eighth IEEE International Symposium on Computers and Communication, vol. 2, pp. 1341–1346 (2003)
Liu, H.H., Yang, W.T., Liu, C.C.: An improved minimizing algorithm for the summation of disjoint products by Shannon’s expansion. Microelectronic Reliability 33(4), 599–613 (1993)
Locks, M.O., Wilson, J.M.: Note on disjoint products algorithms. IEEE Transactions on Reliability 41(1), 81–84 (1992)
Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal of Computing 1(2), 146–160 (1972)
Ait-kadi, D., Rebaiaia, M.L., Merlano, A.: Modèle d’évaluation des performances du réseau national intégré de radiocommunications (RENIR). Rapport de recherche (2009)
Yan, L., Taha, H., Landers, L.L.: A recursive Approach for Enumerating Minimal Cutsets in a Network. IEEE Transactions on Reliability 43(3), 383–388 (1994)
Hariri, S., Raghavendra: Syrel A symbolic reliability algorithm based on path and cut-set methods. IEEE Transactions on Reliability C-36(10), 1224–1232 (1987)
Valian, L.G.: The Complexity of enumerating and reliability problem. SIAM Journal of Computing 8, 410–421 (1979)
Kantarci, B., Mouftah, H.T.: Availability and Cost-Constrained Long-Reach Passive Optical Network Planning. IEEE Transactions on Reliability 61(1), 113–124 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rebaiaia, ML., Ait-Kadi, D. (2012). An Efficient Algorithm for Enumerating Minimal PathSets in Communication Networks. In: Benlamri, R. (eds) Networked Digital Technologies. NDT 2012. Communications in Computer and Information Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30507-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-30507-8_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30506-1
Online ISBN: 978-3-642-30507-8
eBook Packages: Computer ScienceComputer Science (R0)