1997/10/01 by Mikael Degermark, Andrej Brodnik, Svante Carlsson +1 · 591 citations
Computer Science · #Cache #Computer network #Computer science #Database #Equal-cost multi-path routing #Forwarding plane #Gigabit #IP forwarding #Interconnection Networks and Systems #Network Packet Processing and Optimization #Network packet #Operating system #Packet forwarding #Parallel computing #Routing (electronic design automation) #Routing protocol #Routing table #Source routing #Table (database) #Telecommunications #VLSI and Analog Circuit Testing #Virtual routing and forwarding
paper · pdf · doi:10.1145/263105.263133
openalex publication_date 1997/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
For some time, the networking community has assumed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must find the routing entry with the longest matching prefix, a task that has been thought to require hardware support at lookup frequencies of millions per second.We present a forwarding table data structure designed for quick routing lookups. Forwarding tables are small enough to fit in the cache of a conventional general purpose processor. With the table in cache, a 200 MHz Pentium Pro or a 333 MHz Alpha 21164 can perform a few million lookups per second. This means that it is feasible to do a full routing lookup for each IP packet at gigabit speeds without special hardware.The forwarding tables are very small, a large routing table with 40,000 routing entries can be compacted to a forwarding table of 150-160 Kbytes. A lookup typically requires less than 100 instructions on an Alpha, using eight memory references accessing a total of 14 bytes.