This Article 
 Bibliographic References 
 Add to: 
EaseCAM: An Energy and Storage Efficient TCAM-Based Router Architecture for IP Lookup
May 2005 (vol. 54 no. 5)
pp. 521-533
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. This paper presents 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] P. Gupta, S. Lin, and N. McKeown, “Routing Lookups in Hardware at Memory Access Speeds,” Proc. INFOCOM, pp. 1240-1247, Mar. 1998.
[2] M. Kobayashi, T. Murase, and A. Kuriyama, “A Longest Prefix Match Search Engine for Multi-Gigabit IP Processing,” Proc. Int'l Conf. Comm., June 2000.
[3] J.P. Wade and C.G. Sodini, “Dynamic Cross-Coupled Bit-line Content Addressable Memory Cell for High Density Arrays,” IEEE J. Solid-State Circuits, vol. 22, no. 2, pp. 119-121, Feb. 1987.
[4] R.K. Brayton et al., Logic Minimization Algorithms for VLSI Synthesis. Boston: Kluwer Academic, 1984.
[5] A.J. McAuley and P. Francis, “Fast Routing Table Lookup Using CAMs,” Proc. INFOCOM, pp. 1382-1391, Mar. 1993.
[6] V. Srinivasan and G. Varghese, “Fast Address Lookups Using Controlled Prefix Expansion,” ACM Trans. Computer Systems, vol. 17, no. 1, pp. 1-40, Oct. 1999.
[7] D. Shah and P. Gupta, “Fast Updates on Ternary-CAMs for Packet Lookups and Classification,” IEEE Micro, vol. 21, no. 1, Jan./Feb. 2001.
[8] R. Panigrahy and S. Sharma, “Reducing TCAM Power Consumption and Increasing Throughput,” Proc. IEEE Hot Interconnects, Aug. 2002.
[9] H. Liu, “Routing Table Compaction in Ternary-CAM,” IEEE Micro, vol. 22, no. 1, Jan./Feb. 2002.
[10] F. Zane, G. Narlikar, and A. Basu, “CoolCAMs: Power-Efficient TCAMs for Forwarding Engines,” Proc. INFOCOM, Apr. 2003.
[11] M.J. Akhbarizadeh and M. Nourani, “An IP Packet Forwarding Technique Based on Partitioned Lookup Table,” Proc. Int'l Conf. Comm., Apr. 2002.
[12] R. Lysecky and F. Vahid, “On-Chip Logic Minimization,” Proc. ACM/IEEE Design and Automation Conf. (DAC), June 2003.
[13] G. Huston, “Analyzing the Internet's BGP Routing Table,” The Internet Protocol J., vol. 4, 2001.
[14] M. Zhang and K. Asanovic, “Highly Associative Caches for Low-Power Processors,” Proc. IEEE MICRO-33, Dec. 2000.
[15] P. Shivakumar and N.P. Jouppi, “Cacti 3.0: An Integrated Cache Timing, Power and Area Model,” Western Research Lab (WRL) Research Report, 2001/2002.
[16] Z. Dai and B. Liu, “A TCAM Based Routing Lookup System,” Proc. 15th Int'l Conf. Comm., pp. 1090-1096, 2002.

Index Terms:
Router, TCAMs, IP lookup, partition, compaction, page table.
V.C. Ravikumar, Rabi N. Mahapatra, Laxmi Narayan Bhuyan, "EaseCAM: An Energy and Storage Efficient TCAM-Based Router Architecture for IP Lookup," IEEE Transactions on Computers, vol. 54, no. 5, pp. 521-533, May 2005, doi:10.1109/TC.2005.78
Usage of this product signifies your acceptance of the Terms of Use.