IEEE Network · 2001 · 495 citations · 15 references
ComputingComputer EngineeringComputer ScienceComputer NetworksData StructuresInterconnection NetworksInternet RoutingLookup TablesNetwork AddressingNetwork Performance AnalysisRoutingRouting AlgorithmsLongest Prefix MatchingNetwork Prefixes
Rapid Internet traffic growth has led to gigabit‑per‑second backbone links, requiring routers to forward millions of packets per second, making fast IP address lookup—essential for longest‑prefix matching—a critical challenge. The authors survey state‑of‑the‑art IP address lookup algorithms. They compare these algorithms in terms of lookup speed, scalability, and update overhead.
Due to the rapid growth of traffic in the Internet, backbone links of several gigabits per second are commonly deployed. To handle gigabit-per-second traffic rates, the backbone routers must be able to forward millions of packets per second on each of their ports. Fast IP address lookup in the routers, which uses the packet's destination address to determine for each packet the next hop, is therefore crucial to achieve the packet forwarding rates required. IP address lookup is difficult because it requires a longest matching prefix search. In the last couple of years, various algorithms for high-performance IP address lookup have been proposed. We present a survey of state-of-the-art IP address lookup algorithms and compare their performance in terms of lookup speed, scalability, and update overhead.
15
Scalable high speed IP routing lookups
Marcel Waldvogel, George Varghese, Jon Turner et al. · 1997 · 663 citations · Full text
Small forwarding tables for fast routing lookups
Mikael Degermark, Andrej Brodnik, Svante Carlsson et al. · 1997 · 591 citations · Full text
Routing lookups in hardware at memory access speeds
Pravir Singh Gupta, Steven Lin, Nick McKeown · 2002 · 487 citations