Weighted Spectral Distribution for Internet Topology Analysis: Theory and Applications

Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant to the study of Internet topologies, such as the generation of synthetic topologies to represent the Internet's AS topology. We derive a new metric that enables exactly such a structural comparison: the weighted spectral distribution. We then apply this metric to three aspects of the study of the Internet's AS topology. i) We use it to quantify the effect of changing the mixing properties of a simple synthetic network generator. ii) We use this quantitative understanding to examine the evolution of the Internet's AS topology over approximately seven years, finding that the distinction between the Internet core and periphery has blurred over time. iii) We use the metric to derive optimal parameterizations of several widely used AS topology generators with respect to a large-scale measurement of the real AS topology.

[1]  Dmitri Loguinov,et al.  Wealth-Based Evolution Model for the Internet AS-Level Topology , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[2]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[3]  Zongpeng Li,et al.  The Flattening Internet Topology: Natural Evolution, Unsightly Barnacles or Contrived Collapse? , 2008, PAM.

[4]  Polly Huang,et al.  GEN02-3: On the Search of Internet AS-level Topology Invariants , 2006, IEEE Globecom 2006.

[5]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[6]  A. Wool,et al.  A clustering approach for exploring the Internet structure , 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.

[7]  Miguel Rio,et al.  Beyond Node Degree: Evaluating AS Topology Models , 2008, ArXiv.

[8]  S. V. N. Vishwanathan,et al.  Fast Computation of Graph Kernels , 2006, NIPS.

[9]  Peng Xie,et al.  Sampling biases in IP topology measurements , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Ronald R. Coifman,et al.  Diffusion Maps, Spectral Clustering and Eigenfunctions of Fokker-Planck Operators , 2005, NIPS.

[11]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[12]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[13]  Daniel J. Woods,et al.  Optimization on Microcomputers: The Nelder-Mead Simplex Algorithm , 1985 .

[14]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[15]  Shi Zhou,et al.  Characterising and modelling the internet topology — The rich-club phenomenon and the PFP model , 2006 .

[16]  Fan Chung Graham,et al.  Quasi-random graphs , 1988, Comb..

[17]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[18]  S. Hanna.  Representation and generation of plans using graph spectra , 2007 .

[19]  B. Sudakov,et al.  Pseudo-random Graphs , 2005, math/0503745.

[20]  Edwin R. Hancock,et al.  Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  A. Seary,et al.  Spectral methods for analyzing and visualizing networks : an introduction , 2000 .

[22]  Ping Zhu,et al.  A Study of Graph Spectra for Comparing Graphs , 2005, BMVC.

[23]  R. A. Silverman,et al.  Introductory Real Analysis , 1972 .

[24]  A. Thomason.  Pseudo-Random Graphs , 1987 .

[25]  S. Butler.  Interlacing for weighted graphs using the normalized Laplacian , 2007 .

[26]  Thomas Erlebach,et al.  On the Spectrum and Structure of Internet Topology Graphs , 2002, IICS.

[27]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[28]  Michalis Faloutsos,et al.  Characterizing and Modelling Clustering Features in AS-Level Internet Topology , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[29]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[30]  Viggo Kann,et al.  On the Approximability of the Maximum Common Subgraph Problem , 1992, STACS.

[31]  Lixia Zhang,et al.  Observing the evolution of internet as topology , 2007, SIGCOMM 2007.

[32]  Christos Gkantsidis,et al.  Spectral analysis of Internet topologies , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[33]  Sugih Jamin,et al.  Inet-3.0: Internet Topology Generator , 2002 .

[34]  H. Bunke.  Graph Matching : Theoretical Foundations , Algorithms , and Applications , 2022 .

[35]  Alessandro Vespignani,et al.  K-core decomposition of Internet graphs: hierarchies, self-similarity and measurement biases , 2005, Networks Heterog. Media.

[36]  Olaf Maennel,et al.  Testing the reachability of (new) address space , 2007, INM '07.

[37]  Matthieu Latapy,et al.  Complex Network Measurements: Estimating the Relevance of Observed Properties , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[38]  Miguel Rio,et al.  Tuning Topology Generators Using Spectral Distributions , 2008, SIPEW.

[39]  M. Faloutsos.  The internet AS-level topology: three data sources and one definitive metric , 2006, CCRV.

[40]  A. Jamakovic,et al.  On the relationship between the algebraic connectivity and graph's robustness to node and link failures , 2007, 2007 Next Generation Internet Networks.