Advertisement

Solving Reliability Problems in Complex Networks with Approximated Cuts and Paths

Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 44)

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.

Keywords

Approximated paths Approximated cuts Combinatorial spectrum Approximated combinatorial spectrum Neural network PSO 

References

  1. 1.
    Gertsbakh, I.: Reliability Theory. Springer-Verlag, Heidelberg (2000)MATHGoogle Scholar
  2. 2.
    Shier, D.R.: Network Reliability and Algebraic Structure. Oxford, New York (1991)Google Scholar
  3. 3.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)MATHGoogle Scholar
  4. 4.
    Aggarwal, K.K., Rai, S.: Reliability evaluation in computer-communication networks. IEEE Trans. Reliab. 30(1), 32–35 (1981)CrossRefMATHGoogle Scholar
  5. 5.
    Aggarwal, K., Gupta, J., Misra, K.: A simple method for reliability evaluation of a communication system. IEEE Trans. Comm. 23(5), 563–566 (1975)CrossRefMATHGoogle Scholar
  6. 6.
    Misra, K.B., Prasad, P.: Comments on: reliability evaluation of flow networks. IEEE Trans. Reliab. 31(2), 174–176 (1982)CrossRefMATHGoogle Scholar
  7. 7.
    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)CrossRefMATHGoogle Scholar
  8. 8.
    Rai, S.: A cutset approach to reliability evaluation in communication networks. IEEE Trans. Reliab. 31(5), 428–431 (1982)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Shpungin, Y.: Combinatorial approach to reliability evaluation of network with unreliable nodes and unreliable edges. Int. J. Comp. Sci. 1(3), 177–183 (2006)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Shpungin, Y.: Networks with unreliable nodes and edges: Monte Carlo lifetime estimation. World Acad. Sci. Eng. Tech. 27, 349–354 ((2007))Google Scholar
  12. 12.
    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)CrossRefMATHGoogle Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Department of Computer Science & EngineeringIndian School of MinesDhanbadIndia

Personalised recommendations