On the Aggregatability of Router Forwarding Tables
Abstract
In this book chapter, the authors first present Optimal Routing Table Constructor (ORTC), an optimal one-time FIB aggregation algorithm that preserves strong forwarding correctness. The authors then present four-level FIB aggregation algorithm(s) that can handle dynamic routing updates while maintaining forwarding correctness. Afterwards, the authors evaluate our algorithms using routing tables from RouteViews, and compare the algorithms with ORTC using routing tables from a Tier-1 ISP. The authors found that ORTC's aggregation ratio is better than the Level 1, Level 2 and Level 3 algorithms, but the Level 4 algorithm has better aggregation ratio than ORTC as they relax the requirement of forwarding correctness. Finally, the authors evaluate the potential impact of introducing extra routable space in the Level 4 algorithm and discuss how to limit such negative impact.
Publication Title
Solutions for Sustaining Scalability in Internet Growth
Recommended Citation
Liu, Y., Wang, L., Zhao, X., & Zhang, B. (2013). On the Aggregatability of Router Forwarding Tables. Solutions for Sustaining Scalability in Internet Growth, 39-59. https://doi.org/10.4018/978-1-4666-4305-5.ch003
