Compact Routing on Internet-Like Graphs
Dmitri Krioukov, Kevin Fall, and Xiaowei Yang

TL;DR
This paper analyzes the Thorup-Zwick routing scheme on internet-like graphs, showing it achieves very low average stretch and small routing tables, with implications for understanding internet topology optimization.
Contribution
It provides the first detailed analysis of TZ routing on power-law graphs, revealing near-optimal stretch and small routing tables relevant to internet topology.
Findings
Average stretch around 1.1 for internet-like graphs
Routing table size around 50 records for 10,000 nodes
Internet's distance distribution aligns with minimal average stretch point
Abstract
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, . We find that the average stretch is very low and virtually independent of . In particular, for the Internet interdomain graph, , 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 -node networks. Furthermore, we find that both the average shortest path length (i.e. distance) and width of the distance distribution observed in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
