Beyond centrality—classifying topological significance using backup efficiency and alternative paths

In networks characterized by broad degree distribution, such as the Internet AS graph, node significance is often associated with its degree or with centrality metrics which relate to its reachability and shortest paths passing through it. Such measures do not consider availability of efficient backup of the node and thus often fail to capture its contribution to the functionality and resilience of the network operation. In this paper we suggest the Quality of Backup (QoB) and Alternative Path Centrality (APC) measures as complementary methods which enable analysis of node significance in a manner which considers backup. We examine the theoretical significance of these measures and use them to classify nodes in the Internet AS graph while applying the BGP valley-free routing restrictions. We show that both node degree and node centrality are not necessarily evidence of its significance. In particular, some medium degree nodes with medium centrality measure prove to be crucial for efficient routing in the Internet AS graph.

[1]  Béla Bollobás,et al.  Random Graphs , 1985 .

[2]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[3]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[4]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[5]  Mikkel Thorup,et al.  Oracles for distances avoiding a link-failure , 2002, SODA '02.

[6]  Michalis Faloutsos,et al.  A simple conceptual model for the Internet topology , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[7]  M. Gerstein,et al.  Genomic analysis of regulatory network dynamics reveals large topological changes , 2004, Nature.

[8]  Walter Willinger,et al.  The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  Damien Magoni,et al.  Tearing down the Internet , 2003, IEEE J. Sel. Areas Commun..

[10]  P. ERDbS.  ON THE STRENGTH OF CONNECTEDNESS OF A RANDOM GRAPH , 2001 .

[11]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[12]  S. Schuster,et al.  Metabolic network structure determines key aspects of functionality and regulation , 2002, Nature.

[13]  Yuval Shavitt,et al.  A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.

[14]  John Scott.  Social Network Analysis , 1988 .

[15]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[16]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[17]  Yuval Shavitt,et al.  DIMES: let the internet measure itself , 2005, CCRV.

[18]  Avishai Wool,et al.  An Incremental Super-Linear Preferential Internet Topology Model: Extended Abstract , 2004, PAM.

[19]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[20]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[21]  Shlomo Havlin,et al.  Origins of fractality in the growth of complex networks , 2005, cond-mat/0507216.

[22]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[23]  B. Snel,et al.  Pathway alignment: application to the comparative analysis of glycolytic enzymes. , 1999, The Biochemical journal.

[24]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .

[25]  A. Cornish-Bowden,et al.  Complex networks of interactions connect genes to phenotypes. , 2001, Trends in biochemical sciences.

[26]  U. Alon,et al.  Subgraphs and network motifs in geometric networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  P. Erdos,et al.  On the strength of connectedness of a random graph , 1964 .

[28]  David M. Pennock,et al.  Static and dynamic analysis of the Internet's susceptibility to faults and attacks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[29]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[30]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[31]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[32]  B. Palsson,et al.  The Escherichia coli MG1655 in silico metabolic genotype: its definition, characteristics, and capabilities. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[33]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[34]  Lixin Gao.  On inferring autonomous system relationships in the internet , 2001, TNET.

[35]  Danny Dolev,et al.  Internet resiliency to attacks and failures under BGP policy routing , 2006, Comput. Networks.

[36]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[37]  M. Newman,et al.  Identifying the role that animals play in their social networks , 2004, Proceedings of the Royal Society of London. Series B: Biological Sciences.