Abstract
In many networks with distributed operation and self-organization features, acquiring their global topological information is impractical, if feasible at all. Internet protocols drawing on node centrality indices may instead approximate them with their egocentric counterparts, computed out over the nodes’ ego-networks. Surprisingly, however, in router-level topologies the approximative power of localized ego-centered measurements has not been systematically evaluated. More importantly, it is unclear how to practically interpret any positive correlation found between the two centrality metric variants.
The paper addresses both issues using different datasets of ISP network topologies. We first assess how well the egocentric metrics approximate the original sociocentric ones, determined under perfect network-wide information. To this end we use two measures: their rank-correlation and the overlap in the top-k node lists the two centrality metrics induce. Overall, the rank-correlation is high, in the order of 0.8-0.9, and, intuitively, becomes higher as we relax the ego-network definition to include the ego’s r-hop neighborhood. On the other hand, the top-k node overlap is low, suggesting that the high rank-correlation is mainly due to nodes of lower rank. We then let the node centrality metrics drive elementary network operations, such as local search strategies. Our results suggest that, even under high rank-correlation, the locally-determined metrics can hardly be effective aliases for the global ones. The implication for protocol designers is that rank-correlation is a poor indicator for the approximability of centrality metrics.
This work has been partially supported by the National & Kapodistrian University of Athens Special Account of Research Grants no 10812 and the European Commission under the Network of Excellence in Internet Science project EINS (FP7-ICT-288021).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
The CAIDA UCSD Macroscopic Internet Topology Data Kit-[ITDK 2011-10], http://www.caida.org/data/active/internet-topology-data-kit/
Adamic, L.A., et al.: Search in power-law networks. Physical Review E 64(4) (September 2001)
Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25, 163–177 (2001)
Brandes, U., Pich, C.: Centrality Estimation in Large Networks. Int’l Journal of Birfucation and Chaos 17(7), 2303–2318 (2007)
Chai, W.K., He, D., Psaras, I., Pavlou, G.: Cache ”less for more” in information-centric networks. In: Bestak, R., Kencl, L., Li, L.E., Widmer, J., Yin, H. (eds.) NETWORKING 2012, Part I. LNCS, vol. 7289, pp. 27–40. Springer, Heidelberg (2012)
Daly, E.M., Haahr, M.: Social network analysis for information flow in disconnected delay-tolerant manets. IEEE Trans. Mob. Comput. 8(5), 606–621 (2009)
Everett, M., Borgatti, S.P.: Ego network betweenness. Social Networks 27(1), 31–38 (2005)
Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35–41 (1977)
Goh, K.I., et al.: Universal behavior of load distribution in scale-free networks. Phys. Rev. Lett. 87(27) (December 2001)
Kermarrec, A.M., et al.: Second order centrality: Distributed assessment of nodes criticity in complex networks. Comp. Com. 34 (2011)
Lim, Y., et al.: Online estimating the k central nodes of a network. In: IEEE Network Science Workshop (NSW 2011), pp. 118–122 (June 2011)
Marsden, P.: Egocentric and sociocentric measures of network centrality. Social Networks 24(4), 407–422 (2002)
Nanda, S., Kotz, D.: Localized bridging centrality for distributed network analysis. In: IEEE ICCCN 2008, Virgin Islands (August 2008)
Newman, M.E.J.: The Structure and Function of Complex Networks. SIAM Review 45(2), 167–256 (2003)
Pansiot, J.J., et al.: Extracting intra-domain topology from mrinfo probing. In: Proc. PAM, Zurich, Switzerland (April 2010)
Pantazopoulos, P., et al.: Efficient social-aware content placement for opportunistic networks. In: IFIP/IEEE WONS, Slovenia (2010)
Pantazopoulos, P., et al.: Centrality-driven scalable service migration. In: 23rd Int’l Teletraffic Congress (ITC 2011), San Francisco, USA (2011)
Pantazopoulos, P., et al.: On the local approximations of node centrality in Internet router-level topologies. Tech. rep. (January 2013), http://anr.di.uoa.gr/index.php/publications
Spring, N.T., et al.: Measuring ISP topologies with rocketfuel. IEEE/ACM Trans. Netw. 12(1), 2–16 (2004)
Vázquez, A., et al.: Large-scale topological and dynamical properties of the Internet. Phys. Rev. E 65(6), 066130 (2002)
Wasserman, S., Faust, K.: Social network analysis. Cambridge Univ. Pr. (1994)
Wehmuth, K., Ziviani, A.: Distributed assessment of the closeness centrality ranking in complex networks. In: SIMPLEX, NY, USA (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Pantazopoulos, P., Karaliopoulos, M., Stavrakakis, I. (2014). On the Local Approximations of Node Centrality in Internet Router-Level Topologies. In: Elmenreich, W., Dressler, F., Loreto, V. (eds) Self-Organizing Systems. IWSOS 2013. Lecture Notes in Computer Science, vol 8221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54140-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-54140-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54139-1
Online ISBN: 978-3-642-54140-7
eBook Packages: Computer ScienceComputer Science (R0)