Analysis of the autonomous system network topology

Mapping the Internet is a major challenge for network researchers. It is the key to building a successful modeling tool able to generate realistic graphs for use in networking simulations. In this paper we provide a detailed analysis of the inter-domain topology of the Internet. The collected data and the resulting analysis began in November 1997 and cover a period of two and a half years. We give results concerning major topology properties (nodes and edges number, average degree and distance, routing policy, etc.) and main distributions (degree, distance, etc.). We also present many results about the trees of this network. The evolution of these properties is reviewed and major trends are highlighted. We propose some empirical laws that match this current evolution. Four new power-laws concerning the number of shortest paths between node pairs and the tree size distribution are provided with their detailed validation.

[1]  Tony Bates,et al.  Guidelines for creation, selection, and registration of an Autonomous System (AS) , 1996, RFC.

[2]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Jon Postel,et al.  Internet Registry IP Allocation Guidelines , 1996, RFC.

[4]  Deborah Estrin,et al.  The impact of routing policy on Internet paths , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  W. B.,et al.  The Calculus of Observations: a Treatise on Numerical Mathematics , 1924, Nature.

[6]  Yakov Rekhter,et al.  Application of the Border Gateway Protocol in the Internet , 1995, RFC.

[7]  Jean-Jacques Pansiot,et al.  On routes and multicast trees in the Internet , 1998, CCRV.

[8]  Yakov Rekhter,et al.  Implications of Various Address Allocation Policies for Internet Routing , 1996, RFC.

[9]  Yakov Rekhter,et al.  An Architecture for IP Address Allocation with CIDR , 1993, RFC.

[10]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

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

[12]  PansiotJean-Jacques,et al.  On routes and multicast trees in the Internet , 1998 .

[13]  Vince Fuller,et al.  Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy , 1993, RFC.

[14]  Vern Paxson,et al.  End-to-end routing behavior in the Internet , 1996, TNET.

[15]  Ramesh Govindan,et al.  An analysis of Internet inter-domain topology and route stability , 1997, Proceedings of INFOCOM '97.

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

[17]  Yakov Rekhter,et al.  Application of the Border Gateway Protocol in the Internet , 1991, RFC.

[18]  George Robinson,et al.  The Calculus of Observations - A Treatise on Numerical Mathematics , 1924 .