Failure propagation of dependency networks with recovery mechanism
Authors: 
Ya-Nan Bai, Ning Huang, Li-Na Sun, Yue ZhangAuthors Info & Claims
Pages 1 - 6
Abstract
Networks with dependency relations have been shown to be more vulnerable under failure than those without. Due to dependency property among nodes, the failure nodes lead to the immediate failure of nodes depending on them. However, in real networks, the recovery mechanisms play an important role in failure propagation in complex networks. For dependency networks, existing recovery mechanisms focused mainly on how a failed node recovers from failure without considering the dependency relations of nodes in the recovery mechanism. In this study, we present a new cascading process model consisting of failure mechanisms and a dependency recovery mechanism to explore failure propagation. Comparing the existing random recovery mechanism and the targeted recovery mechanism, we find that the dependency recovery mechanism is more effective than these mechanisms for a wide range of topologies with the dependency property. Based on the mean-field approximation and generating function techniques, we provide an analytical framework for random networks with arbitrary degree distribution. For a larger recovery threshold, the network is more robust; and for a smaller failure threshold, the network is vulnerable. Moreover, the size of dependency group has a nonlinear effect on the network robustness. Numerical simulations employing the Erdös-Rényi networks are performed to validate our theoretical results.
References
[1]
D. J. Watts, “A simple model of global cascades on random networks,” Proceedings of the National Academy of Sciences, vol. 99, pp. 5766–5771, 2002.
[2]
A. E. Motter and Y.-C. Lai, “Cascade-based attacks on complex networks,” Physical Review E, vol. 66, p. 065102, 2002.
[3]
P. Crucitti, V. Latora, and M. Marchiori, “Model for cascading failures in complex networks,” Physical Review E, vol. 69, Apr 2004.
[4]
B.-L. Dou, X.-G. Wang, and S.-Y. Zhang, “Robustness of networks against cascading failures,” Physica A: Statistical Mechanics and its Applications, vol. 389, pp. 2310–2317, 2010.
[5]
K. Hu, T. Hu, and Y. Tang, “Model for cascading failures with adaptive defense in complex networks,” Chinese Physics B, vol. 19, Aug 2010.
[6]
J. Zhou, N. Huang, X. Wang, and F. Zhao, “An improved model for cascading failures in complex networks,” in 2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems, 2012, pp. 721–725.
[7]
J. Zhou, N. Huang, X. Sun, K. Wang, and H. Yang, “A new model of network cascading failures with dependent nodes,” in 2015 Annual Reliability and Maintainability Symposium (RAMS), 2015, pp. 1–6.
[8]
R. Parshani, S. V. Buldyrev, and S. Havlin, “Critical effect of dependency groups on the function of networks,” Proceedings of the National Academy of Sciences, vol. 108, pp. 1007–1010, 2011.
[9]
A. Bashan and S. Havlin, “The combined effect of connectivity and dependency links on percolation of networks,” Journal of Statistical Physics, vol. 145, pp. 686–695, 2011.
[10]
S. V. Buldyrev, R. Parshani, G. Paul, H. E. Stanley, and S. Havlin, “Catastrophic cascade of failures in interdependent networks,” Nature, vol. 464, pp. 1025–1028, 2010.
[11]
H. Wang, M. Li, L. Deng, and B.-H. Wang, “Percolation on Networks with Conditional Dependence Group,” Plos One, vol. 10, May 15 2015.
[12]
S. Boccaletti, G. Bianconi, R. Criado, C. I. del Genio, J. Gómez-Gardeñes, M. Romance et al., “The structure and dynamics of multilayer networks,” Physics Reports, vol. 544, pp. 1–122, 11/1/2014.
[13]
D. Zhou, H. E. Stanley, G. D'Agostino, and A. Scala, “Assortativity decreases the robustness of interdependent networks,” Physical Review E, vol. 86, p. 066103, 12/05/2012.
[14]
R. Parshani, S. V. Buldyrev, and S. Havlin, “Interdependent networks: Reducing the coupling strength leads to a change from a first to second order percolation transition,” Physical review letters, vol. 105, p. 048701, 2010.
[15]
Y. Hu, D. Zhou, R. Zhang, Z. Han, C. Rozenblat, and S. Havlin, “Percolation of interdependent networks with intersimilarity,” Physical Review E, vol. 88, p. 052805, 2013.
[16]
Y. Kornbluth, S. Lowinger, G. Cwilich, and S. V. Buldyrev, “Cascading failures in networks with proximate dependent nodes,” Physical Review E, vol. 89, p. 032808, 2014.
[17]
A. Majdandzic, B. Podobnik, S. V. Buldyrev, D. Y. Kenett, S. Havlin, and H. E. Stanley, “Spontaneous recovery in dynamical networks,” Nature Physics, vol. 10, pp. 34–38, Jan 2014.
[18]
M. Gong, L. Ma, Q. Cai, and L. Jiao, “Enhancing robustness of coupled networks under targeted recoveries,” Scientific Reports, vol. 5, Feb 13 2015.
[19]
F. Hu, C. H. Yeung, S. Yang, W. Wang, and A. Zeng, “Recovery of infrastructure networks after localised attacks,” Scientific reports, vol. 6, 2016.
[20]
A. Bashan, R. Parshani, and S. Havlin, “Percolation in networks composed of connectivity and dependency links,” Physical Review E, vol. 83, p. 051127, 2011.
[21]
M. E. Newman, “Spread of epidemic disease on networks,” Physical review E, vol. 66, p. 016128, 2002.
[22]
J. Shao, S. V. Buldyrev, L. A. Braunstein, S. Havlin, and H. E. Stanley, “Structure of shells in complex networks,” Physical Review E, vol. 80, p. 036105, 2009.
[23]
P. ERDdS and A. WI, “On random graphs I,” Publ. Math. Debrecen, vol. 6, pp. 290–297, 1959.
[24]
P. Erd6s and A. Rényi, “On the evolution of random graphs,” Publ. Math. Inst. Hungar. Acad. Sci, vol. 5, pp. 17–61, 1960.
Index Terms
- Failure propagation of dependency networks with recovery mechanism
Index terms have been assigned to the content through auto-classification.
Recommendations
Failure Type-Aware Reliability Assessment with Component Failure Dependency
SSIRI '10: Proceedings of the 2010 Fourth International Conference on Secure Software Integration and Reliability ImprovementMost of the existing reliability assessment techniques assume that components fail independently and consider different types of failures equally. By disregarding component failure dependency, these techniques assume inappropriately that a component ...
Maximizing double-link failure recovery of over-dimensioned optical mesh networks
AbstractDouble-link failure models, in which any two links in the network fail in an arbitrary order, are becoming critical in survivable optical network designs. Optical networks that are over-dimensioned and purposely preplanned for full ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Jan 2017
924 pages
Copyright © 2017.
Publisher
IEEE Press
Publication History
Published: 23 January 2017
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 11 Dec 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in