This directory contains topology information for the four toy networks presented in the paper:

Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications.
L. Li, D. Alderson, J. Doyle, and W. Willinger.
Internet Mathematics. In Press. (2006) [pdf]

The four networks are contained in files:

• HSFnetTopology.txt: Fig5(a), network from Hierarchical Scale Free construction
• RDnetTopology.txt: Fig5(b), network resulting from Random rewiring of HSF network
• SubOptTopology.txt: Fig5(c), suboptimally designed topology
• HOTnetTopology.txt: Fig5(d), Heuristically Optimal Topology

Each file contains topology information for the respective network, represented as node adjacency pairs. That is, on every line of data appears two numbers, corresponding to the nodeIDs on either side of a given network link. There is one line of data per network link.

IMPORTANT: It is crucial to understand that these are toy networks, constructed for the purpose of illustrating the diversity of graphs having the same degree sequence. They should not be taken as models of the actual router-level Internet.

For questions regarding the data, please contact: Lun Li (lun@cds.caltech.edu) or David Alderson (alderd@cds.caltech.edu).