logo Netzschleuder network catalog, repository, and centrifuge

oregon_as — Oregon Route Views AS graphs (2001)

Description

Weekly snapshots of the Internet at the level of Autonomous Systems (ASs), between March 31 and May 26 2001, as distributed by SNAP and used by Leskovec, Kleinberg and Faloutsos in their study of the evolution of networks over time. Nodes are ASs, and an undirected edge indicates that two ASs exchange traffic (peering relationship), as inferred from routing data.

  • oregon1_<date>: 9 graphs inferred from the Border Gateway Protocol (BGP) tables collected by the University of Oregon Route Views project.
  • oregon2_<date>: 9 graphs inferred from the Route Views BGP data combined with Looking Glass data and the Internet Routing Registry, which reveal many more peering links.

The dates are given as YYMMDD (from 010331 to 010526). Each AS is identified by its AS number, which is consistent across all graphs. As distributed, each graph contains one edge listed twice.

The networks have the following properties:

  • (Node) as_number: the AS number.
Tags
Technological Communication Unweighted Temporal
Added
2026-10-25
Citation
  • J. Leskovec, J. Kleinberg, C. Faloutsos, "Graphs over time: densification laws, shrinking diameters and possible explanations." Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining (KDD), 177-187 (2005) 10.1145/1081870.1081893 Sci-Hub
  • University of Oregon Route Views Project www.routeviews.org
Upstream URL OK
https://snap.stanford.edu/data/Oregon-1.html
https://snap.stanford.edu/data/Oregon-2.html
Networks
Tip: click on a column header to sort the list, or hover over it for a description.
Column legend
$\left<k\right>$
Mean degree
$\sigma_k$
Standard deviation of the degrees
$\lambda_h$
Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$
Random walk mixing time
$r$
Degree assortativity
$c$
Global clustering coefficient
$\oslash$
(Pseudo-) diameter
$S$
Relative size of the largest component
NPs
Node properties
EPs
Edge properties
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv
oregon1_010331 10,670 22,003 4.12 31.99 46.29 27.41 -0.19 0.01 10 1.00 Undirected Unipartite as_number 219 KiB 298 KiB 300 KiB 247 KiB
oregon1_010407 10,729 22,000 4.10 32.02 45.48 27.90 -0.19 0.01 12 1.00 Undirected Unipartite as_number 220 KiB 300 KiB 302 KiB 250 KiB
oregon1_010414 10,790 22,470 4.16 32.61 47.86 27.97 -0.19 0.01 10 1.00 Undirected Unipartite as_number 222 KiB 300 KiB 303 KiB 253 KiB
oregon1_010421 10,859 22,748 4.19 32.77 48.43 27.39 -0.19 0.01 10 1.00 Undirected Unipartite as_number 228 KiB 304 KiB 309 KiB 254 KiB
oregon1_010428 10,886 22,494 4.13 32.83 47.94 28.04 -0.20 0.01 9 1.00 Undirected Unipartite as_number 222 KiB 302 KiB 299 KiB 253 KiB
oregon1_010505 10,943 22,608 4.13 32.82 47.71 28.44 -0.19 0.01 9 1.00 Undirected Unipartite as_number 222 KiB 303 KiB 307 KiB 255 KiB
oregon1_010512 11,011 22,678 4.12 32.80 47.69 29.67 -0.20 0.01 10 1.00 Undirected Unipartite as_number 229 KiB 313 KiB 311 KiB 256 KiB
oregon1_010519 11,051 22,725 4.11 32.94 47.80 29.99 -0.20 0.01 11 1.00 Undirected Unipartite as_number 230 KiB 314 KiB 311 KiB 257 KiB
oregon1_010526 11,174 23,410 4.19 33.10 48.68 29.89 -0.19 0.01 10 1.00 Undirected Unipartite as_number 230 KiB 316 KiB 314 KiB 261 KiB
oregon2_010331 10,900 31,181 5.72 34.00 67.88 33.65 -0.16 0.04 9 1.00 Undirected Unipartite as_number 235 KiB 335 KiB 333 KiB 276 KiB
oregon2_010407 10,981 30,856 5.62 33.98 67.23 30.61 -0.16 0.04 12 1.00 Undirected Unipartite as_number 239 KiB 338 KiB 336 KiB 276 KiB
oregon2_010414 11,019 31,762 5.76 34.51 70.77 29.02 -0.16 0.04 9 1.00 Undirected Unipartite as_number 237 KiB 342 KiB 341 KiB 279 KiB
oregon2_010421 11,080 31,539 5.69 34.50 68.96 29.73 -0.16 0.04 9 1.00 Undirected Unipartite as_number 236 KiB 341 KiB 339 KiB 280 KiB
oregon2_010428 11,113 31,435 5.66 34.56 67.92 29.86 -0.16 0.03 9 1.00 Undirected Unipartite as_number 240 KiB 346 KiB 342 KiB 281 KiB
oregon2_010505 11,157 30,944 5.55 34.37 66.13 32.31 -0.16 0.03 9 1.00 Undirected Unipartite as_number 239 KiB 343 KiB 340 KiB 280 KiB
oregon2_010512 11,260 31,304 5.56 34.47 66.45 34.38 -0.16 0.03 9 1.00 Undirected Unipartite as_number 247 KiB 351 KiB 350 KiB 284 KiB
oregon2_010519 11,375 32,288 5.68 34.97 70.15 34.27 -0.16 0.04 9 1.00 Undirected Unipartite as_number 245 KiB 357 KiB 350 KiB 288 KiB
oregon2_010526 11,461 32,731 5.71 35.21 72.23 33.75 -0.16 0.04 9 1.00 Undirected Unipartite as_number 244 KiB 351 KiB 345 KiB 291 KiB
Ridiculograms*
* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.