The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Most of the high-performance routers available commercially these days equip each of their <u>l</u>ine <u>c</u>ards (LCs) with a <u>f</u>orwarding <u>e</u>ngine (FE) to perform table lookups locally. This work introduces and evaluates a technique for <u>s</u>peedy <u>pa</u>cket <u>l</u>ookups, called SPAL, in such routers. The BGP routing table under SPAL is fragmented into subsets which constitute forwarding tables for different FEs so that the number of table entries in each FE drops as the router grows. This reduction in the forwarding table size drastically lowers the amount of SRAM (e.g., L3 data cache) required in each LC to hold the trie constructed according to the prefix matching algorithm. SPAL calls for caching the lookup result of a given IP address at its home LC (denoted by <tmath>{\rm{LC_{ho}}}</tmath>, using the LR-cache), such that the result can satisfy the lookup requests for the same address from not only <tmath>{\rm{LC_{ho}}}</tmath>, but also other LCs quickly. Our trace-driven simulation reveals that SPAL leads to improved mean lookup performance by a factor of at least 2.5 (or 4.3) for a router with three (or 16) LCs, if the LR-cache contains 4K blocks. SPAL achieves this significant improvement, while greatly lowering the SRAM (i.e., the L3 data cache plus the LR-cache combined) requirement in each LC and possibly shortening the worst-case lookup time (thanks to fewer memory accesses during longest-prefix matching search) when compared with a current router without partitioning the routing table. It promises good scalability (with respect to routing table growth) and exhibits a small mean lookup time per packet. With its ability to speed up packet lookup performance while lowering overall SRAM substantially, SPAL is ideally applicable to the new generation of scalable high-performance routers.</p>
Caches, forwarding engines, interconnects, line cards, prefix matching search, routers, routing table lookups, tries.
Nian-Feng Tzeng, "Routing Table Partitioning for Speedy Packet Lookups in Scalable Routers", IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 481-494, May 2006, doi:10.1109/TPDS.2006.65
101 ms
(Ver 3.3 (11022016))