Comparing static and dynamic measurements and models of the Internet's AS topology

Capturing a precise snapshot of the Internet's topology is nearly impossible. Recent efforts have produced autonomous-system (AS) level topologies with noticeably divergent characteristics, even calling into question the widespread belief that the Internet's degree distribution follows a power law. In turn, this casts doubt on Internet modeling efforts, since validating a model on one data set does little to ensure validity on another data set, or on the (unknown) actual Internet topology. We examine six metrics-three existing metrics and three of our own-applied to two large publicly-available topology data sets. Certain metrics highlight differences between the two topologies, while one of our static metrics and several dynamic metrics display an invariance between the data sets. Invariant metrics may capture properties inherent to the Internet and independent of measurement methodology, and so may serve as better gauges for validating models. We continue by testing nine models-seven existing models and two of our own-according to these metrics applied to the two data sets. We distinguish between growth models that explicitly add nodes and links over time in a dynamic process, and static models that add all nodes and links in a batch process. All existing growth models show poor performance according to at least one metric, and only one existing static model, called Inet, matches all metrics well. Our two new models-growth models that are modest extensions of one of the simplest existing growth models-perform better than any other growth model across all metrics. Compared with Inet, our models are very simple. As growth models, they provide a possible explanation for the processes underlying the Internet's growth, explaining, for example, why the Internet's degree distribution is more skewed than baseline models would predict

[1]  Allen B. Downey Using pathchar to estimate Internet link characteristics , 1999, SIGCOMM '99.

[2]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Deborah Estrin,et al.  Design of inter-administrative domain routing protocols , 1990, SIGCOMM 1990.

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

[6]  Sugih Jamin,et al.  Inet: Internet Topology Generator , 2000 .

[7]  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.

[8]  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).

[9]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[10]  Walter Willinger,et al.  Towards capturing representative AS-level Internet topologies , 2002, SIGMETRICS '02.

[11]  GrossThomas,et al.  Topology discovery for large ethernet networks , 2001 .

[12]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

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

[14]  Vern Paxson,et al.  On estimating end-to-end network path properties , 2001, SIGCOMM LA '01.

[15]  Marianne Shaw,et al.  Active bridging , 1997, SIGCOMM '97.

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

[17]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

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

[19]  MedinaAlberto,et al.  On the origin of power laws in Internet topologies , 2000 .

[20]  Gábor Vattay,et al.  On the propagation of long-range dependence in the Internet , 2000, SIGCOMM 2000.

[21]  R Pastor-Satorras,et al.  Dynamical and correlation properties of the internet. , 2001, Physical review letters.

[22]  Christopher R. Palmer,et al.  Generating network topologies that obey power laws , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[23]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[24]  Sándor Molnár,et al.  On the propagation of long-range dependence in the Internet , 2000, SIGCOMM.

[25]  Lili Qiu,et al.  The content and access dynamics of a busy Web site: findings and implications , 2000 .

[26]  Roger Wattenhofer,et al.  The impact of Internet policy and topology on delayed routing convergence , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[27]  Mary Baker,et al.  Measuring link bandwidths using a deterministic model of packet delay , 2000, SIGCOMM 2000.

[28]  Deborah Estrin,et al.  Design of inter-administrative domain routing protocols , 1990, SIGCOMM '90.

[29]  Walter Willinger,et al.  Towards capturing representative AS-level Internet topologies , 2004, Comput. Networks.

[30]  David M. Pennock,et al.  Winners don't take all: Characterizing the competition for links on the web , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[31]  Mary Baker,et al.  Measuring link bandwidths using a deterministic model of packet delay , 2000, SIGCOMM.

[32]  Scott Shenker,et al.  Asymptotic Resource Consumption in Multicast Reservation Styles , 1994, SIGCOMM.

[33]  Matthew Doar,et al.  A better model for generating test networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[34]  Edith Cohen,et al.  Improving end-to-end performance of the Web using server volumes and proxy filters , 1998, SIGCOMM '98.

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

[36]  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).

[37]  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.

[38]  Anja Feldmann,et al.  Dynamics of IP traffic: a study of the role of variability and the impact of control , 1999, SIGCOMM '99.

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

[40]  Thomas R. Gross,et al.  Topology discovery for large ethernet networks , 2001, SIGCOMM 2001.

[41]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[42]  Ibrahim Matta,et al.  On the origin of power laws in Internet topologies , 2000, CCRV.

[43]  J. J. Garcia-Luna-Aceves,et al.  Dynamics of distributed shortest-path routing algorithms , 1991, SIGCOMM '91.

[44]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.