Evaluating Compact Routing Algorithms on Real-World Networks

Compact routing has shown promise for reducing the forwarding state in Internetlike graphs, without badly impacting traffic flows. This dissertation compares two such compact routing algorithms on real Internet snapshots from router data across 12 years. The results indicate that these algorithms behave consistently over time, and exhibit extremely small forwarding tables with very low path inflation.