Review article: Achieving maximum reliability in fault tolerant network design for variable networks

作者: B. Kaushik , N. Kaur , A.K. Kohli

DOI: 10.1016/J.ASOC.2013.02.017

关键词:

摘要: The objective of this paper is to present a novel method achieve maximum reliability for fault tolerant optimal network design when has variable size. Reliability calculation most important and critical component required. A must be supplied with certain parameters that guarantee proper functionality maintainability under worse situations. Many alternative methods measuring have been stated in literature design. Most these mentioned evaluating may analytical simulation based. These provide significant way compute limited Also, computational effort required growing sized networks. Therefore, neural presented high highly This computes improved learning rate gradient descent based method. result shows achievable by at manageable cost.

参考文章(60)
Chat Srivaree-ratana, Abdullah Konak, Alice E. Smith, Estimation of all-terminal network reliability using an artificial neural network Computers & Operations Research. ,vol. 29, pp. 849- 868 ,(2002) , 10.1016/S0305-0548(00)00088-5
Satish J. Kamat, William E. Franzmeier, Determination of Reliability Using Event-Based Monte Carlo Simulation Part II IEEE Transactions on Reliability. ,vol. R-25, pp. 254- 255 ,(1976) , 10.1109/TR.1976.5219984
Terje Aven, Availability evaluation of oil/gas production and transportation systems Reliability Engineering. ,vol. 18, pp. 35- 44 ,(1987) , 10.1016/0143-8174(87)90050-3
K.K. Aggarwal, Suresh Rai, Reliability Evaluation in Computer-Communication Networks IEEE Transactions on Reliability. ,vol. R-30, pp. 32- 35 ,(1981) , 10.1109/TR.1981.5220952
Tongdan Jin, David W. Coit, Approximating network reliability estimates using linear and quadratic unreliability of minimal cuts Reliability Engineering & System Safety. ,vol. 82, pp. 41- 48 ,(2003) , 10.1016/S0951-8320(03)00117-0
J. Scott Provan, Michael O. Ball, The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected SIAM Journal on Computing. ,vol. 12, pp. 777- 788 ,(1983) , 10.1137/0212053
K. Aggarwal, J. Gupta, K. Misra, A Simple Method for Reliability Evaluation of a Communication System IEEE Transactions on Communications. ,vol. 23, pp. 563- 566 ,(1975) , 10.1109/TCOM.1975.1092838
Yuan-Shun Dai, Min Xie, Quan Long, Szu-Hui Ng, Uncertainty Analysis in Software Reliability Modeling by Bayesian Analysis with Maximum-Entropy Principle IEEE Transactions on Software Engineering. ,vol. 33, pp. 781- 795 ,(2007) , 10.1109/TSE.2007.70739
Orhan Dengiz, Abdullah Konak, Alice E. Smith, Connectivity management in mobile ad hoc networks using particle swarm optimization ad hoc networks. ,vol. 9, pp. 1312- 1326 ,(2011) , 10.1016/J.ADHOC.2011.01.010