Autonomous systems - Oregon-1
Dataset information
9 graphs of Autonomous Systems (AS) peering information inferred from Oregon route-views between March 31 2001 and May 26 2001.
Dataset statistics are calculated for the graph with the lowest (Mar 31 2001) and highest (May 26 2001) number of nodes:
| Dataset statistics for graph witdh lowest number of nodes - Mar 31 2001 | |
|---|---|
| Nodes | 10670 |
| Edges | 22002 |
| Nodes in largest WCC | 10670 (1.000) |
| Edges in largest WCC | 22002 (1.000) |
| Nodes in largest SCC | 10670 (1.000) |
| Edges in largest SCC | 22002 (1.000) |
| Average clustering coefficient | 0.2970 |
| Number of triangles | 17144 |
| Fraction of closed triangles | 0.003121 |
| Diameter (longest shortest path) | 9 |
| 90-percentile effective diameter | 4.4 |
| Dataset statistics for graph with highest number of nodes - May 26 2001 | |
|---|---|
| Nodes | 11174 |
| Edges | 23409 |
| Nodes in largest WCC | 11174 (1.000) |
| Edges in largest WCC | 23409 (1.000) |
| Nodes in largest SCC | 11174 (1.000) |
| Edges in largest SCC | 23409 (1.000) |
| Average clustering coefficient | 0.2964 |
| Number of triangles | 19894 |
| Fraction of closed triangles | 0.003233 |
| Diameter (longest shortest path) | 9 |
| 90-percentile effective diameter | 4.4 |
Other dataset statistics can be found below.
Source (citation)
- J. Leskovec, J. Kleinberg and C. Faloutsos. Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2005.
Files
| File | Description |
|---|---|
| oregon1_010331.txt.gz | AS peering information inferred from Oregon route-views from March 31 2001 |
| oregon1_010407.txt.gz | AS peering information inferred from Oregon route-views from April 7 2001 |
| oregon1_010414.txt.gz | AS peering information inferred from Oregon route-views from April 14 2001 |
| oregon1_010421.txt.gz | AS peering information inferred from Oregon route-views from April 21 2001 |
| oregon1_010428.txt.gz | AS peering information inferred from Oregon route-views from April 28 2001 |
| oregon1_010505.txt.gz | AS peering information inferred from Oregon route-views from May 05 2001 |
| oregon1_010512.txt.gz | AS peering information inferred from Oregon route-views from May 12 2001 |
| oregon1_010519.txt.gz | AS peering information inferred from Oregon route-views from May 19 2001 |
| oregon1_010526.txt.gz | AS peering information inferred from Oregon route-views from May 26 2001 |
Other dataset statistics
| Dataset statistics for Apr 07 2001 | |
|---|---|
| Nodes | 10729 |
| Edges | 21999 |
| Nodes in largest WCC | 10729 (1.000) |
| Edges in largest WCC | 21999 (1.000) |
| Nodes in largest SCC | 10729 (1.000) |
| Edges in largest SCC | 21999 (1.000) |
| Average clustering coefficient | 0.2921 |
| Number of triangles | 15834 |
| Fraction of closed triangles | 0.00286 |
| Diameter (longest shortest path) | 11 |
| 90-percentile effective diameter | 4.5 |
| Dataset statistics for Apr 14 2001 | |
|---|---|
| Nodes | 10790 |
| Edges | 22469 |
| Nodes in largest WCC | 10790 (1.000) |
| Edges in largest WCC | 22469 (1.000) |
| Nodes in largest SCC | 10790 (1.000) |
| Edges in largest SCC | 22469 (1.000) |
| Average clustering coefficient | 0.2954 |
| Number of triangles | 18237 |
| Fraction of closed triangles | 0.00316 |
| Diameter (longest shortest path) | 9 |
| 90-percentile effective diameter | 4.4 |
| Dataset statistics for Apr 21 2001 | |
|---|---|
| Nodes | 10859 |
| Edges | 22747 |
| Nodes in largest WCC | 10859 (1.000) |
| Edges in largest WCC | 22747 (1.000) |
| Nodes in largest SCC | 10859 (1.000) |
| Edges in largest SCC | 22747 (1.000) |
| Average clustering coefficient | 0.2968 |
| Number of triangles | 19108 |
| Fraction of closed triangles | 0.003258 |
| Diameter (longest shortest path) | 10 |
| 90-percentile effective diameter | 4.4 |
| Dataset statistics for Apr 28 2001 | |
|---|---|
| Nodes | 10886 |
| Edges | 22493 |
| Nodes in largest WCC | 10886 (1.000) |
| Edges in largest WCC | 22493 (1.000) |
| Nodes in largest SCC | 10886 (1.000) |
| Edges in largest SCC | 22493 (1.000) |
| Average clustering coefficient | 0.2940 |
| Number of triangles | 17645 |
| Fraction of closed triangles | 0.002991 |
| Diameter (longest shortest path) | 10 |
| 90-percentile effective diameter | 4.4 |
| Dataset statistics for May 05 2001 | |
|---|---|
| Nodes | 10943 |
| Edges | 22607 |
| Nodes in largest WCC | 10943 (1.000) |
| Edges in largest WCC | 22607 (1.000) |
| Nodes in largest SCC | 10943 (1.000) |
| Edges in largest SCC | 22607 (1.000) |
| Average clustering coefficient | 0.2940 |
| Number of triangles | 17597 |
| Fraction of closed triangles | 0.002968 |
| Diameter (longest shortest path) | 9 |
| 90-percentile effective diameter | 4.5 |
| Dataset statistics for May 12 2001 | |
|---|---|
| Nodes | 11011 |
| Edges | 22677 |
| Nodes in largest WCC | 11011 (1.000) |
| Edges in largest WCC | 22677 (1.000) |
| Nodes in largest SCC | 11011 (1.000) |
| Edges in largest SCC | 22677 (1.000) |
| Average clustering coefficient | 0.2942 |
| Number of triangles | 17598 |
| Fraction of closed triangles | 0.002954 |
| Diameter (longest shortest path) | 9 |
| 90-percentile effective diameter | 4.5 |
| Dataset statistics for May 19 2001 | |
|---|---|
| Nodes | 11051 |
| Edges | 22724 |
| Nodes in largest WCC | 11051 (1.000) |
| Edges in largest WCC | 22724 (1.000) |
| Nodes in largest SCC | 11051 (1.000) |
| Edges in largest SCC | 22724 (1.000) |
| Average clustering coefficient | 0.2921 |
| Number of triangles | 17677 |
| Fraction of closed triangles | 0.002932 |
| Diameter (longest shortest path) | 11 |
| 90-percentile effective diameter | 4.5 |