Multi-Way Pipelining for Power-Efficient IP Lookup

Ternary Content Addressable Memories (TCAMs) have been widely adopted for IP lookup engines in today's routers. However, due to the massive parallelism inherent in their architectures, TCAMs do not scale well in terms of power consumption. On the other hand, SRAM-based pipelined algorithmic solutions become attractive alternatives. This paper proposes a partitioning-based multi-way linear pipeline architecture for power-efficient trie-based IP lookup. We develop a hybrid partitioning scheme to map a routing table onto multiple linear pipelines, ensuring each pipeline uses equal amounts of memory. Within each pipeline, a memory-efficient fine-grained node-to-stage mapping scheme is employed to achieve evenly distributed memory across the stages. Simulation experiments using real-life traces show that our 8-way architecture, storing a backbone routing table with over 200 K prefixes, achieves a 27-fold reduction in power consumption over state-of-the-art TCAM-based solutions, while sustaining a throughput of 590 Gbps for minimum size (40 bytes) packets.

[1]  George Varghese,et al.  Tree bitmap: hardware/software IP lookups with incremental updates , 2004, CCRV.

[2]  Girija J. Narlikar,et al.  Fast incremental updates for pipelined forwarding engines , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Walid Dabbous,et al.  Survey and taxonomy of IP address lookup algorithms , 2001, IEEE Netw..

[4]  Francis Zane,et al.  Coolcams: power-efficient TCAMs for forwarding engines , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Timothy Sherwood,et al.  Modeling TCAM power for next generation network devices , 2006, 2006 IEEE International Symposium on Performance Analysis of Systems and Software.

[6]  Grigore Rosu,et al.  A tree based router search engine architecture with single port memories , 2005, 32nd International Symposium on Computer Architecture (ISCA'05).

[7]  David E. Taylor Survey and taxonomy of packet classification techniques , 2005, CSUR.

[8]  V. Srinivasan,et al.  Fast address lookups using controlled prefix expansion , 1999, TOCS.

[9]  Viktor K. Prasanna,et al.  Beyond TCAMs: An SRAM-Based Parallel Multi-Pipeline Architecture for Terabit IP Lookup , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[10]  Jan van Lunteren Searching very large routing tables in wide embedded memory , 2001, GLOBECOM.

[11]  Patrick Crowley,et al.  CAMP: fast and efficient IP lookup architecture , 2006, ANCS '06.

[12]  Svante Carlsson,et al.  Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.