Hyperbolic Embedding of the Internet AS-Level Topology
Some of our topology research focused on how different routing approaches in nature are maximally efficient on certain types of peculiarly structured topologies, conveniently, those structured like the Internet AS graph.
Further, we found that self-similarity of clustering in real complex networks provides strong empirical evidence that some hidden metric spaces underlie these networks. In trying to model self-similar (scale-free) networks embedded into such a hidden space, we discover that a certain approach to routing - greedy routing - is phenomenally successful and efficient in such a model.
We are still exploring the ramifications of this intense discovery, and the even more intriguing breakthrough that this hidden space seems to be hyperbolic.
Two data files are made available which contain information extracted from DIMES data in 2007.
This file contains the AS links extracted from the DIMES data. The file format is:
which lists the observed links between AS1 and AS2.
This file contains the AS hyperbolic coordinates in the AS embedding. The file format is:
AS r theta
listing the hyperbolic radial and angular coordinates r and theta for each AS. The hyperbolic disc radius R in the embedding is 26.02.