Abstract
The paper solves reliability problems for the design of complex network without failure. The traditional approaches based on minimal paths and cuts require significant computational effort equals to NP-hard. The major difficulty lies in calculating the minimal cuts and paths to improve exact reliability bounds. Therefore, a neural network algorithm based on approximated paths and cuts to deal with this difficulty. The proposed approach is divided into two parts. The first part is used to approximate the computed minimal cuts and paths from two networks. The approach in other part improves the reliability bounds. The proposed approach has been tested on mesh network of 256 nodes and hyper-tree of 496 nodes. The performance of proposed approach is compared with PSO for the reliability bounds improvement in low failure probability.
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
Gertsbakh, I.: Reliability Theory. Springer-Verlag, Heidelberg (2000)
Shier, D.R.: Network Reliability and Algebraic Structure. Oxford, New York (1991)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
Aggarwal, K.K., Rai, S.: Reliability evaluation in computer-communication networks. IEEE Trans. Reliab. 30(1), 32–35 (1981)
Aggarwal, K., Gupta, J., Misra, K.: A simple method for reliability evaluation of a communication system. IEEE Trans. Comm. 23(5), 563–566 (1975)
Misra, K.B., Prasad, P.: Comments on: reliability evaluation of flow networks. IEEE Trans. Reliab. 31(2), 174–176 (1982)
Aggarwal, K.K., Chopra, Y.C., Bajwa, J.S.: Capacity consideration in reliability analysis of communication systems. IEEE Trans. Reliab. 31(2), 177–181 (1982)
Rai, S.: A cutset approach to reliability evaluation in communication networks. IEEE Trans. Reliab. 31(5), 428–431 (1982)
Shpungin, Y.: Combinatorial approach to reliability evaluation of network with unreliable nodes and unreliable edges. Int. J. Comp. Sci. 1(3), 177–183 (2006)
Shpungin, Y.: Combinatorial approaches to Monte Carlo estimation of dynamic systems reliability parameters. Comm. Depend. Quality Manage.: An Int. J. 9(1), 69–75 (2006)
Shpungin, Y.: Networks with unreliable nodes and edges: Monte Carlo lifetime estimation. World Acad. Sci. Eng. Tech. 27, 349–354 ((2007))
Ratana, C.S., Konak, A., Smith, A.E.: Estimation of all-terminal network reliability using an artificial neural network. Comp. Oper. Res 29(7), 849–868 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer India
About this paper
Cite this paper
Kaushik, B., Banka, H. (2016). Solving Reliability Problems in Complex Networks with Approximated Cuts and Paths. In: Nagar, A., Mohapatra, D., Chaki, N. (eds) Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics. Smart Innovation, Systems and Technologies, vol 44. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2529-4_8
Download citation
DOI: https://doi.org/10.1007/978-81-322-2529-4_8
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2528-7
Online ISBN: 978-81-322-2529-4
eBook Packages: EngineeringEngineering (R0)