EaseCAM: an energy and storage efficient TCAM-based router architecture for IP lookup

Ternary content addressable memories (TCAMs) have been emerging as a popular device in designing routers for packet forwarding and classifications. Despite their premise on high-throughput, large TCAM arrays are prohibitive due to their excessive power consumption and lack of scalable design schemes. We present a TCAM-based router architecture that is energy and storage efficient. We introduce prefix aggregation and expansion techniques to compact the effective TCAM size in a router. Pipelined and paging schemes are employed in the architecture to activate a limited number of entries in the TCAM array during an IP lookup. The new architecture provides low power, fast incremental updating, and fast table look-up. Heuristic algorithms for page filling, fast prefix update, and memory management are also provided. Results have been illustrated with two large routers (bbnplanet and attcanada) to demonstrate the effectiveness of our approach.

[1]  Geoff Huston,et al.  Analyzing the Internet's BGP Routing Table , 2001 .

[2]  Huan Liu.  Routing Table Compaction in Ternary CAM , 2002, IEEE Micro.

[3]  J.P. Wade,et al.  Dynamic cross-coupled bitline content addressable memory cell for high density arrays , 1987, 1985 International Electron Devices Meeting.

[4]  Rina Panigrahy,et al.  Reducing TCAM power consumption and increasing throughput , 2002, Proceedings 10th Symposium on High Performance Interconnects.

[5]  Devavrat Shah,et al.  Fast Updating Algorithms for TCAMs , 2001, IEEE Micro.

[6]  Karsten P. Ulland,et al.  Vii. References , 2022 .

[7]  Paul Francis,et al.  Fast routing table lookup using CAMs , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[8]  Michael Zhang,et al.  Highly-Associative Caches for Low-Power Processors , 2000 .

[9]  Bin Liu,et al.  A TCAM based routing lookup system , 2002 .

[10]  Nick McKeown,et al.  Routing lookups in hardware at memory access speeds , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[11]  Tutomu Murase,et al.  A longest prefix match search engine for multi-gigabit IP processing , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[12]  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).

[13]  Norman P. Jouppi,et al.  Cacti 3. 0: an integrated cache timing, power, and area model , 2001 .

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

[15]  Mehrdad Nourani,et al.  An IP packet forwarding technique based on partitioned lookup table , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[16]  Frank Vahid,et al.  On-chip logic minimization , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).