An Incremental Super-Linear Preferential Internet Topology Model: Extended Abstract

By now it is well known that the distribution of node degrees in the graph induced by the peering arrangements between Autonomous Systems (ASs) exhibits power laws. The most appealing mathematical model that attempts to explain the power-law degree distribution was suggested by Barabasi and Albert (the BA model). We introduce two new models that are extensions to the BA model: the "Incremental Edge Ad- dition" (InEd) model, and the "Super-Linear Preferential Attachment" (SLiP) model. We prove that both our models are more successful in matching the power-law exponent, in producing leaves , and in produ- cing a large dense core. Beyond mathematical analysis, we have also implemented our models as a synthetic network generator we call Tang (Tel Aviv Network Generator). Experimentation with Tang shows that the networks it produces are more realistic than those generated by other network generators.

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

[2]  Michalis Faloutsos,et al.  Power laws and the AS-level internet topology , 2003, TNET.

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

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

[5]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[6]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

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

[8]  B. Bollobás.  The evolution of random graphs , 1984 .

[9]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

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

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