Name:	AS Graphs
Description:	These graphs represent the Autonomous Systems topology of the Internet. Every vertex represents an autonomous system, and two vertices are connected if there is at least one physical link between the two corresponding Autonomous Systems.
About this Data:	BGP routing data is collected by the University of Oregon Route Views Project, then processed and made available in various formats at the Global ISP interconnectivity by AS number page of NLANR (National Laboratory of Applied Network Research). Background information can be found here.
Preprocessing:	The data files called list of AS interconnections per AS number were downloaded from the Global ISP interconnectivity by AS number page of NLANR. The obtained graphs contain self-loops and parallel edges. These self-loops and parallel edges were removed, and the graphs were converted into LEDA format. In the LEDA graphs every undirected edge {u,v} is stored only once, either as edge (u,v) or as edge (v,u).
Properties:	undirected, simple, connected
Data:	File Nodes Edges Comment AS-19971108.graph 3015 5156 AS graph of 1997/11/08 AS-19980402.graph 3522 6324 AS graph of 1998/04/02 AS-19980703.graph 3797 6936 AS graph of 1998/07/03 AS-19981002.graph 4180 7768 AS graph of 1998/10/02 AS-19990114.graph 4517 8376 AS graph of 1999/01/14 AS-19990402.graph 4885 9276 AS graph of 1999/04/02 AS-19990702.graph 5357 10328 AS graph of 1999/07/02 AS-19991002.graph 5861 11313 AS graph of 1999/10/02 AS-20000102.graph 6474 12572 AS graph of 2000/01/02 AS-20000403.graph 7246 14629 AS graph of 2000/04/03 AS-20000702.graph 7956 15943 AS graph of 2000/07/02 AS-20001002.graph 8836 17823 AS graph of 2000/10/02 AS-20010102.graph 9048 18172 AS graph of 2001/01/02 AS-20010316.graph 10515 21455 AS graph of 2001/03/16 The files are in LEDA graph format.
Used in:	Network data from NLANR has been used in many papers, for example [FFF99].
Comments:	(none)