A Tree Based Router Search Engine Architecture with Single Port Memories

Pipelined forwarding engines are used in core routers to meet speed demands. Tree-based searches are pipelined across a number of stages to achieve high throughput, but this results in unevenly distributed memory. To address this imbalance, conventional approaches use either complex dynamic memory allocation schemes or over-provision each of the pipeline stages. This paper describes the microarchitecture of a novel network search processor which provides both high execution throughput and balanced memory distribution by dividing the tree into subtrees and allocating each subtree separately, allowing searches to begin at any pipeline stage. The architecture is validated by implementing and simulating state of the art solutions for IPv4 lookup, VPN forwarding and packet classification. The new pipeline scheme and memory allocator can provide searches with a memory allocation efficiency that is within 1% of non-pipelined schemes.

• Type: Conference
• Year: 2005
• Where: ISCA
• Authors: Florin Baboescu, Dean M. Tullsen, Grigore Rosu, Sumeet Singh
• Keywords: Hardware, ISCA 2005, Memory Allocation, Memory Allocation Schemes, Pipeline Stage