Evaluating and Optimising Models of Network Growth

This paper presents a statistically sound method for measuring the accuracy with which a probabilistic model reflects the growth of a network, and a method for optimising parameters in such a model. The technique is data-driven, and can be used for the modeling and simulation of any kind of evolving network. The overall framework, a Framework for Evolving Topology Analysis (FETA), is tested on data sets collected from the Internet AS-level topology, social networking websites and a co-authorship network. Statisticalmodels of the growth of these networks are produced and tested using a likelihoodbased method. The models are then used to generate artificial topologies with the same statistical properties as the originals. This work can be used to predict future growth patterns for a known network, or to generate artificial models of graph topology evolution for simulation purposes. Particular application examples include strategic network planning, user profiling in social networks or infrastructure deployment in managed overlay-based services.

[1]  Petter Holme,et al.  An integrated model of traffic, geography and economy in the internet , 2008, CCRV.

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

[3]  Krishna P. Gummadi,et al.  Growth of the flickr social network , 2008, WOSN '08.

[4]  Priya Mahadevan,et al.  Orbis: rescaling degree correlations to generate annotated internet topologies , 2007, SIGCOMM '07.

[5]  Miguel Rio,et al.  Network topologies: inference, modeling, and generation , 2008, IEEE Communications Surveys & Tutorials.

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

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

[8]  Shi Zhou,et al.  Accurately modeling the Internet topology , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[11]  H. Akaike.  A new look at the statistical model identification , 1974 .

[12]  Walter Willinger,et al.  Scaling phenomena in the Internet: Critically examining criticality , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[13]  kc claffy,et al.  Internet topology: connectivity of IP graphs , 2001, SPIE ITCom.

[14]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[15]  Jia Wang,et al.  Scalable and accurate identification of AS-level forwarding paths , 2004, IEEE INFOCOM 2004.

[16]  D J PRICE,et al.  NETWORKS OF SCIENTIFIC PAPERS. , 1965, Science.

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

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