Compact Routing on Internet-Like Graphs
<|reference_start|>Compact Routing on Internet-Like Graphs: The Thorup-Zwick (TZ) routing scheme is the first generic stretch-3 routing scheme delivering a nearly optimal local memory upper bound. Using both direct analysis and simulation, we calculate the stretch distribution of this routing scheme on random graphs with power-law node degree distributions, $P_k \sim k^{-\gamma}$. We find that the average stretch is very low and virtually independent of $\gamma$. In particular, for the Internet interdomain graph, $\gamma \sim 2.1$, the average stretch is around 1.1, with up to 70% of paths being shortest. As the network grows, the average stretch slowly decreases. The routing table is very small, too. It is well below its upper bounds, and its size is around 50 records for $10^4$-node networks. Furthermore, we find that both the average shortest path length (i.e. distance) $\bar{d}$ and width of the distance distribution $\sigma$ observed in the real Internet inter-AS graph have values that are very close to the minimums of the average stretch in the $\bar{d}$- and $\sigma$-directions. This leads us to the discovery of a unique critical quasi-stationary point of the average TZ stretch as a function of $\bar{d}$ and $\sigma$. The Internet distance distribution is located in a close neighborhood of this point. This observation suggests the analytical structure of the average stretch function may be an indirect indicator of some hidden optimization criteria influencing the Internet's interdomain topology evolution.<|reference_end|>
@article{krioukov2003compact,
    title={Compact Routing on Internet-Like Graphs},
    author={Dmitri Krioukov, Kevin Fall, and Xiaowei Yang},
    journal={INFOCOM 2004},
    year={2003},
    doi={10.1109/INFCOM.2004.1354495},
    number={IRB-TR-03-10},
    archivePrefix={arXiv},
    eprint={cond-mat/0308288},
    primaryClass={cond-mat.stat-mech cond-mat.dis-nn cs.NI}
}