On the probability of facing random breakdowns: a measure of networks’ vulnerability

References

• R. Albert, H. Jeong, and A.-L. Barabási, Error and attack tolerance of complex networks, Nature. 406 (2000), pp. 378–382. doi: 10.1038/35019019
   PubMed Web of Science ®Google Scholar
• A. Avižienis, J.-C. Laprie, B. Randell, and C. Landwehr, Basic concepts and taxonomy of dependable and secure computing, IEEE Trans. Dependable Secure Comput. 1(1) (2004), pp. 11–33. doi: 10.1109/TDSC.2004.2
   Web of Science ®Google Scholar
• S. Boccaletti, J. Buldú, R. Criado, J. Flores, V. Latora, J. Pello, and M. Romance, Multiscale vulnerability of complex networks, Chaos. 17(4) (2007), article no. 043110. doi:doi:10.1063/1.2801687.
   Web of Science ®Google Scholar
• S. Boccaletti, R. Criado, J. Pello, M. Romance, and M. Vela-Pérez, Enhancing network synchronization by sparse repulsive couplings, Int. J.Bifur. Chaos Appl. Sci. Eng. 19(2) (2009), pp. 711–717. doi: 10.1142/S021812740902307X
   Web of Science ®Google Scholar
• M. Choi and C.M. Krishna, On measures of vulnerability of interconnection networks, Microelectron. Reliab. 29(6) (1989), pp. 1011–1020. doi: 10.1016/0026-2714(89)90026-7
   Web of Science ®Google Scholar
• R. Criado, J. Flores, B. Hernández-Bermejo, J. Pello, and M. Romance, Choosing a leader on a complex network, J. Math. Model. Algorithms. 4(3) (2005), pp. 307–316. doi: 10.1007/s10852-005-9006-1
   Google Scholar
• R. Criado, J. Pello, M. Romance, and M. Vela-Pérez, (ψ,p,q)-vulnerabilities: A unified approach to network robustness, Chaos. 19(1) (2009), article no. 013133. doi: 10.1063/1.3087314
   PubMed Web of Science ®Google Scholar
• R. Criado, J. Pello, M. Romance, and M. Vela-Pérez, A node-based multiscale vulnerability of complex networks, Int. J. Bifurcation Chaos Appl. Sci. Eng. 19(2) (2009), pp. 703–710. doi: 10.1142/S0218127409023068
   Web of Science ®Google Scholar
• P. Crucitti, V. Latora, and M. Marchiori, A topological analysis of the Italian electric power grid, Physica A. 338 (2004), pp. 92–97. doi: 10.1016/j.physa.2004.02.029
   Web of Science ®Google Scholar
• P. Crucitti, V. Latora, M. Marchiori, and A. Rapisarda, Efficiency of scale-free networks: Error and attack tolerance, Physica A. 320 (2003), pp. 622–642. doi: 10.1016/S0378-4371(02)01545-5
   Web of Science ®Google Scholar
• P. Crucitti, V. Latora, M. Marchiori, and A. Rapisarda, Error and attack tolerance of complex networks, Physica A. 340 (2004), pp. 388–394. doi: 10.1016/j.physa.2004.04.031
   Web of Science ®Google Scholar
• A.H. Dekker and B.D. Colbert, Proceedings of ACSC04, Network robustness and graph topology, the 27th Australasian Computer Science Conference, Dunedin, New Zealand. 26, pp. 359–368, 2004.
   Google Scholar
• M. Dorigoa and C. Blum, Ant colony optimization theory: A survey, Theoret. Comput. Sci. 344 (2005), pp. 243–278. doi: 10.1016/j.tcs.2005.05.020
   Web of Science ®Google Scholar
• P. Erdös and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci. 5 (1960), pp. 17–61.
   Google Scholar
• E. Estrada and J. Rodríguez-Velázquez, Subgraph centrality in complex networks, Phys. Rev. E. 71(5) (2005), article no. 056103. doi: 10.1103/PhysRevE.71.056103
   PubMed Web of Science ®Google Scholar
• G.H.L. Fletcher, H.A. Sheth, and K. Börner, Unstructured peer-to-peer networks: Topological properties and search performance, AP2PC 2004, LNAI 3601. pp. 14–27, 2005.
   Google Scholar
• J.B. Fraleigh, First Course in Abstract Algebra, 7th ed., Pearson, London, 2003.
   Google Scholar
• O. Goldschmidt, P. Jaillet, and R. LaSota, On reliability of graphs with node failures, Networks. 24 (1994), pp. 251–259. doi: 10.1002/net.3230240407
   Web of Science ®Google Scholar
• D.L. Hansen, B. Shneiderman, M.A. Smith, Analyzing Social Media Networks with Nodexl: Insights from a Connected World, Morgan Kaufmann Publications, San Francisco, CA, 2011.
   Google Scholar
• P. Holme, B.J. Kim, C.N. Yoon, and S.K. Han, Attack vulnerability of complex networks, Phys. Rev. E. 65(5) (2002), article no. 056109. doi: 10.1103/PhysRevE.65.056109
   Web of Science ®Google Scholar
• L.-H. Hsu and C.-K. Lin, Graph Theory and Interconnection Networks, CRC Press, Boca Raton, FL, 2009.
   Google Scholar
• H. Jeong, B. Tombor, R. Albert, Z.N. Oltvai, and A.-L. Barabási, The large-scale organization of metabolic networks, Nature. 407 (2000), pp. 651–654. doi: 10.1038/35036627
   PubMed Web of Science ®Google Scholar
• V. Lakamraju, I. Koren, and C.M. Krishna, Filtering random graphs to synthesize interconnection networks with multiple objectives, IEEE Trans. Parallel Distrib. Syst. 13(11) (2002), pp. 1139–1149. doi: 10.1109/TPDS.2002.1058097
   Web of Science ®Google Scholar
• V. Lakamraju, Z. Koren, I. Koren, and C.M. Krishna, Measuring vulnerability of interconnection networks in embedded systems, Parallel Distribut Process. 1388 (1998), pp. 919–924. doi: 10.1007/3-540-64359-1_756
   Web of Science ®Google Scholar
• V. Latora and M. Marchiori, Efficient behavior of small-world network, Phys. Rev. Lett. 87(19) (2001), pp. 1–4. doi: 10.1103/PhysRevLett.87.198701
   Web of Science ®Google Scholar
• D. Leonard, Z. Yao, V. Rai, and D. Loguinov, On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks, IEEE/ACM Trans. Network. 15(3) (2007), pp. 644–656. doi: 10.1109/TNET.2007.893199
   Web of Science ®Google Scholar
• D. Leonard, Z. Yao, X. Wang, and D. Loguinov, On static and dynamic partitioning behavior of large-scale P2P networks, IEEE/ACM Trans. Netw. 16(6) (2008), pp. 1475–1488. doi: 10.1109/TNET.2007.911433
   Web of Science ®Google Scholar
• X. Li, P. Zhaob, and L. Li, Resilience and reliability analysis of P2P network systems, Oper. Res. Lett. 38 (2010), pp. 20–26. doi: 10.1016/j.orl.2009.09.006
   Web of Science ®Google Scholar
• S. Liu, K.-H. Cheng, and X. Liu, Network reliability with node failures, Networks. 35(2) (2000), pp. 109–117. doi: 10.1002/(SICI)1097-0037(200003)35:2<109::AID-NET2>3.0.CO;2-N
   Web of Science ®Google Scholar
• L. Mariani, Fault-tolerant routing for P2P systems with unstructured topology, In Proceedings of symposium on applications and the internet (SAINT), Trento, Italy, pp. 256–263, Jan./Feb. 2005.
   Google Scholar
• W. Najjar and J.L. Gaudiot, Network resilience: A measure of network fault-tolerance, IEEE Trans. Comput. 39(2) (1990), pp. 174–181. doi: 10.1109/12.45203
   Web of Science ®Google Scholar
• E.J. Newman, The structure and function of complex networks, SIAM Rev. 45 (2003), pp. 167–256. doi: 10.1137/S003614450342480
   Web of Science ®Google Scholar
• M.E.J. Newman and G. Goshal, Bicomponents and the robustness of networks to failure, Phys. Rev. Lett. 100 (2008), article no. 138701. doi: 10.1103/PhysRevLett.100.138701
   Web of Science ®Google Scholar
• M.E.J. Newman, C. Moore, and D.J. Watts, Mean-field solution of the small-world network model, Phys. Rev. Lett. 84 (2000), pp. 3201–3204. doi: 10.1103/PhysRevLett.84.3201
   PubMed Web of Science ®Google Scholar
• M.E.J. Newman and R.M. Ziff, Efficient Monte Carlo algorithm and high-precision results for percolation, Phys. Rev. Lett. 85 (2000), pp. 4104–4107. doi: 10.1103/PhysRevLett.85.4104
   PubMed Web of Science ®Google Scholar
• G. Pandurangan, P. Raghavan, and E. Upfal, Building low-diameter peer-to-peer networks, IEEE J. Select. Areas Commun. 21(6) (2003), pp. 995–1002. doi: 10.1109/JSAC.2003.814666
   Web of Science ®Google Scholar
• S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A Scalable content-addressable network, ACM SIGCOMM'01. pp. 161–172, 2001.
   Google Scholar
• K. Rosen, Discrete Mathematics and its Applications, 6th ed., New York, NY, McGraw-Hill, 2007.
   Google Scholar
• F. Safaei, A. khonsari, and M.M. Gilak, A new performance measure for characterizing fault rings in interconnection networks, Inf. Sci. 180 (2010), pp. 664–678. doi: 10.1016/j.ins.2009.10.017
   Web of Science ®Google Scholar
• F. Safaei and M. ValadBeigi, A probabilistic approach to analysis of reliability in n-D meshes with interconnect router failures, Int. J. Comput. Netw. Commun. 3(4) (2011), pp. 87–97. doi: 10.5121/ijcnc.2011.3407
   Google Scholar
• F. Saffre and R.G. Hercock, Beyond anarchy: Self organized topology for peer-to-peer networks, Complexity. 9(2) (2003), pp. 49–53. doi: 10.1002/cplx.20003
   Web of Science ®Google Scholar
• C. Stivaros, On the residual node connectedness network reliability model, Ph.D. diss., Dept. of Electrical Engineering and Computer Science, Stevens Institute of Technology, 1990.
   Google Scholar
• I. Stoica R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, ACM SIGCOMM, 2001.
   Google Scholar
• D. Trpevski, D. Smilkov, I. Mishkovski, and L. Kocarev, Vulnerability of labeled networks, Physica A. 389(23) (2010), pp. 5538–5549. doi: 10.1016/j.physa.2010.08.008
   Web of Science ®Google Scholar
• A. Vázquez, R.P. Satorras, and A. Vespignani, Large-scale topological and dynamical properties of the internet, Phys. Rev. E. 65(6) (2002), pp. 066130–066130-12. doi: 10.1103/PhysRevE.65.066130
   Google Scholar
• R.J. Williams and N.D. Martinez, Simple rules yield complex food webs, Nature. 404 (2000), pp. 80–183. doi: 10.1038/35003577
   PubMed Web of Science ®Google Scholar
• D.R. Wuellner, S. Roy, and R.M. D'Souza, Resilience and rewiring of the passenger airline networks in the United States, Phys. Rev. E. 82 (2010), article no. 056101. doi: 10.1103/PhysRevE.82.056101
   PubMed Web of Science ®Google Scholar