CAMP: fast and efficient IP lookup architecture

A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been proposed, which delivers very high lookup and update throughput. These architectures often use a pipeline of embedded memories, where each stage stores a single or set of levels of the lookup trie. A stream of lookup requests are issued into the pipeline, one every cycle, in order to achieve high throughput. Most recently, Baboescu et al. [21] have proposed a novel architecture, which uses circular memory pipeline and dynamically maps parts of the lookup trie to different stages. In this paper we extend this approach with an architecture called Circular, Adaptive and Monotonic Pipeline (CAMP), which is based upon the key observation that circular pipeline allows decoupling the number of pipeline stages from the number of levels in the trie. This provides much more flexibility in mapping nodes of the lookup trie to ...

• Type: Conference
• Year: 2006
• Where: ANCS
• Authors: Sailesh Kumar, Michela Becchi, Patrick Crowley, Jonathan S. Turner
• Keywords: ANCS 2006, Circular Pipeline, Computer Networks, Longest Prefix Match, Lookup Trie