Graph Metrics for Network Robustness-A Survey

被引:50
作者
Oehlers, Milena [1 ,2 ]
Fabian, Benjamin [2 ,3 ]
机构
[1] Tech Univ Berlin, Dept Phys, D-10623 Berlin, Germany
[2] Humboldt Univ, Informat Syst, D-10178 Berlin, Germany
[3] Tech Univ Appl Sci Wildau, E Govt, D-15745 Wildau, Germany
关键词
network science; Internet; graphs; robustness; metrics; SCALE-FREE NETWORKS; ATTACK TOLERANCE; COMPLEX; TOPOLOGY; ERROR; SET;
D O I
10.3390/math9080895
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Research on the robustness of networks, and in particular the Internet, has gained critical importance in recent decades because more and more individuals, societies and firms rely on this global network infrastructure for communication, knowledge transfer, business processes and e-commerce. In particular, modeling the structure of the Internet has inspired several novel graph metrics for assessing important topological robustness features of large complex networks. This survey provides a comparative overview of these metrics, presents their strengths and limitations for analyzing the robustness of the Internet topology, and outlines a conceptual tool set in order to facilitate their future adoption by Internet research and practice but also other areas of network science.
引用
收藏
页数:48
相关论文
共 140 条
[1]   Evolutionary Network Analysis: A Survey [J].
Aggarwal, Charu ;
Subbian, Karthik .
ACM COMPUTING SURVEYS, 2014, 47 (01)
[2]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[3]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[4]  
[Anonymous], 2004, ARXIVCONDMAT04092
[5]  
[Anonymous], 2006, Phys Rev
[6]  
[Anonymous], 1996, GRAPHS DIGRAPHS
[7]  
[Anonymous], 2007, ACM SIGCOMM COMP COM
[8]  
[Anonymous], 2001, P WORKSH NETW REL DA
[9]  
[Anonymous], 2005, SOC NETWORKS, DOI DOI 10.1016/J.SOCNET.2004.11.009
[10]  
[Anonymous], 2004, ACM SIGCOMM COMP COM