Internet topology: connectivity of IP graphs

Andre Broido; kc claffy

doi:10.1117/12.434393

25 July 2001 Internet topology: connectivity of IP graphs

Andre Broido, kc claffy

Proceedings Volume 4526, Scalability and Traffic Control in IP Networks; (2001) https://doi.org/10.1117/12.434393
Event: ITCom 2001: International Symposium on the Convergence of IT and Communications, 2001, Denver, CO, United States

Abstract

In this paper we introduce a framework for analyzing local properties of Internet connectivity. We compare BGP and probed topology data, finding that currently probed topology data yields much denser coverage of AS-level connectivity. We describe data acquisition and construction of several IP- level graphs derived from a collection of 220 M skitter traceroutes. We find that a graph consisting of IP nodes and links contains 90.5% of its 629 K nodes in the acyclic subgraph. In particular, 55% of the IP nodes are in trees. Full bidirectional connectivity is observed for a giant component containing 8.3% of IP nodes.

Citation Download Citation

Andre Broido and kc claffy "Internet topology: connectivity of IP graphs", Proc. SPIE 4526, Scalability and Traffic Control in IP Networks, (25 July 2001); https://doi.org/10.1117/12.434393

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available