Abstract
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.
Chapter PDF
Similar content being viewed by others
References
CAIDA AS ranking. http://as-rank.caida.org/
University of oregon RouteViews project. http://www.antc.uoregon.edu/route-views/
Albert, R., Jeong, H., Barabási, A.-L.: Error and attack tolerance of complex networks. Nature 406, 378–382 (2000)
Bar, S., Gonen, M., Wool, A.: An incremental super-linear preferential internet topology model. In: Barakat, C., Pratt, I. (eds.) PAM 2004. LNCS, vol. 3015, Springer, Heidelberg (2004)
Carmi, S., et al.: Medusa: New model of Internet topology using k-shell decomposition. Technical report, arXiv (January 2006)
Cormen, T.H., et al.: Introduction to Algorithms (2001)
Dolev, D., et al.: Internet resiliency to attacks and failures under BGP policy routing. Computer Networks 50(16), 3183–3196 (2006)
Gao, L.: On inferring automonous system relationships in the Internet. IEEE/ACM Transactions on Networking 9(6), 733–745 (2001)
Jeong, H., et al.: Lethality and centrality in protein networks. Nature 411, 41–42 (2001)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. In: SODA, pp. 668–677 (1998)
Latora, V., Marchiori, M.: Efficient behavior of small-world networks. Physical Review Letters 87(19), 198701 (2001)
Magoni, D.: Tearing down the internet. IEEE Journal on Selected Areas in Communications 21(6), 949–960 (2003)
Milo, R., et al.: Network motifs: simple building blocks of complex networks. Science 298, 824–827 (2002), http://dx.doi.org/10.1126/science.298.5594.824
Park, S.-T., et al.: Static and dynamic analysis of the internet’s susceptibility to faults and attacks. In: IEEE INFOCOM 2003, San-Francisco, CA, USA, April 2003, IEEE Computer Society Press, Los Alamitos (2003)
Shavitt, Y., Shir, E.: DIMES: Let the internet measure itself. ACM SIGCOMM Computer Communication Review 35(5) (2005)
Shavitt, Y., Singer, Y.: A linear time shortest paths algorithm for the Internet AS graph. Tel Aviv University Technical Report (EE102) (2007)
Subramanian, L., et al.: Characterizing the Internet hierarchy from multiple vantage points. In: IEEE INFOCOM 2002, New York, NY, USA, April 2002, IEEE Computer Society Press, Los Alamitos (2002)
Tauro, L., et al.: A simple conceptual model for the Internet topology. In: Global Internet (Nov. 2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Shavitt, Y., Singer, Y. (2007). Beyond Centrality - Classifying Topological Significance Using Backup Efficiency and Alternative Paths. In: Akyildiz, I.F., Sivakumar, R., Ekici, E., Oliveira, J.C.d., McNair, J. (eds) NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet. NETWORKING 2007. Lecture Notes in Computer Science, vol 4479. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72606-7_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-72606-7_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72605-0
Online ISBN: 978-3-540-72606-7
eBook Packages: Computer ScienceComputer Science (R0)