TCAM-Based IP Address Lookup Using Longest Suffix Split

Ternary content addressable memory (TCAM) plays an important role in modern routers due to its capability of performing fast IP address lookup. However, it is expensive, space limited, and a major source of power consumption in a router. In addition, because TCAM only reports the first matching entry, updating TCAM entries would be slow due to necessary entry reordering. In this paper, we present a trie-based algorithm, longest suffix split, to reduce the number of TCAM entries for IP address lookup. The algorithm divides route prefixes into two portions, subprefix and suffix. The route prefixes with the same subprefix and similar suffix portions can then be represented by one TCAM entry and one SRAM entry. Each SRAM entry stores one of two succinct data structures, depending on the threshold number of similar suffixes. The experimental results show that our scheme can reduce 50% to 95% TCAM entries for the original routing tables. Our scheme also supports incremental updates. Because the drawbacks of TCAM are related to the number of required entries, our scheme significantly improves the feasibility of TCAM-based IP address lookup. While network virtualization may store multiple forwarding information bases in a router, the number of supported virtual routers can be increased by our scheme.

[1]  Stefan Schmid,et al.  Leveraging locality for FIB aggregation , 2014, 2014 IEEE Global Communications Conference.

[2]  Y. Zhou,et al.  Trie shifting scheme with depth adjusting for multiple virtual routers , 2012, IET Commun..

[3]  Fang Hao,et al.  Efficient Trie Braiding in Scalable Virtual Routers , 2012, IEEE/ACM Transactions on Networking.

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

[5]  Steve Uhlig,et al.  A trie merging approach with incremental updates for virtual routers , 2013, 2013 Proceedings IEEE INFOCOM.

[6]  Mehrdad Nourani,et al.  A TCAM-Based Parallel Architecture for High-Speed Packet Forwarding , 2007, IEEE Transactions on Computers.

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

[8]  R.S. Tucker,et al.  Photonic Switching and the Energy Bottleneck , 2007, 2007 Photonics in Switching.

[9]  Xiang Cheng,et al.  Energy-Aware Virtual Network Embedding , 2014, IEEE/ACM Transactions on Networking.

[10]  Viktor K. Prasanna,et al.  Multiroot: Towards Memory-Efficient Router Virtualization , 2011, 2011 IEEE International Conference on Communications (ICC).

[11]  Jing Fu,et al.  Efficient IP-address lookup with a shared forwarding table for multiple virtual routers , 2008, CoNEXT '08.

[12]  Brian Zill,et al.  Constructing optimal IP routing tables , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[13]  Nen-Fu Huang,et al.  A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers , 1999, IEEE J. Sel. Areas Commun..

[14]  Bin Liu,et al.  Approaching optimal compression with fast update for large scale routing tables , 2012, 2012 IEEE 20th International Workshop on Quality of Service.

[15]  Xin Zhao,et al.  On the Aggregatability of Router Forwarding Tables , 2010, 2010 Proceedings IEEE INFOCOM.

[16]  Steve Uhlig,et al.  Towards TCAM-based scalable virtual routers , 2012, CoNEXT '12.

[17]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.

[18]  Bin Liu,et al.  A TCAM-based distributed parallel IP lookup scheme and performance analysis , 2006, IEEE/ACM Transactions on Networking.

[19]  Heeyeol Yu,et al.  A memory- and time-efficient on-chip TCAM minimizer for IP lookup , 2010, 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010).

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

[21]  Rabi N. Mahapatra,et al.  TCAM architecture for IP lookup using prefix properties , 2004, IEEE Micro.

[22]  Sartaj Sahni,et al.  PETCAM—A Power Efficient TCAM Architecture for Forwarding Tables , 2012, IEEE Transactions on Computers.

[23]  Butler W. Lampson,et al.  IP lookups using multiway and multicolumn search , 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.

[24]  Qi Li,et al.  Guarantee IP lookup performance with FIB explosion , 2015, SIGCOMM 2015.

[25]  Nian-Feng Tzeng,et al.  SUSE: superior storage-efficiency for routing tables through prefix transformation and aggregation , 2010, TNET.

[26]  Stefan Schmid,et al.  Competitive FIB Aggregation without Update Churn , 2014, 2014 IEEE 34th International Conference on Distributed Computing Systems.

[27]  Hayato Musa SMALL FORWARDING TABLES FOR FAST ROUTING LOOKUPS , 2011 .

[28]  Bin Liu,et al.  Virtual routing tables polymerization for lookup and update , 2012, 2012 20th IEEE International Conference on Network Protocols (ICNP).

[29]  Nian-Feng Tzeng Routing table partitioning for speedy packet lookups in scalable routers , 2006, IEEE Transactions on Parallel and Distributed Systems.

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

[31]  Bin Liu,et al.  CLUE: Achieving Fast Update over Compressed Table for Parallel Lookup with Reduced Dynamic Redundancy , 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[32]  Vincenzo Eramo,et al.  Study of Migration Policies in Energy-Aware Virtual Router Networks , 2014, IEEE Communications Letters.

[33]  Gunnar Karlsson,et al.  IP-address lookup using LC-tries , 1999, IEEE J. Sel. Areas Commun..

[34]  David E. Taylor,et al.  Longest prefix matching using bloom filters , 2006, TNET.

[35]  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.

[36]  Laxmi N. Bhuyan,et al.  EaseCAM: an energy and storage efficient TCAM-based router architecture for IP lookup , 2005, IEEE Transactions on Computers.

[37]  Hyesook Lim,et al.  NXG06-1: An Efficient IP Address Lookup Algorithm Using a Priority Trie , 2006, IEEE Globecom 2006.

[38]  Gaogang Xie,et al.  A Hybrid Hardware Architecture for High-Speed IP Lookups and Fast Route Updates , 2014, IEEE/ACM Transactions on Networking.

[39]  W. Lu,et al.  Low-Power TCAMs for Very Large Forwarding Tables , 2010, IEEE/ACM Transactions on Networking.

[40]  Sartaj Sahni,et al.  DUOS - Simple dual TCAM architecture for routing tables with incremental update , 2010, The IEEE symposium on Computers and Communications.

[41]  Miljenko Mikuc,et al.  DXR: towards a billion routing lookups per second in software , 2012, CCRV.

[42]  Viktor K. Prasanna,et al.  Memory-efficient and scalable virtual routers using FPGA , 2011, FPGA '11.

[43]  Bernhard Plattner,et al.  Scalable high speed IP routing lookups , 1997, SIGCOMM '97.

[44]  Rami Cohen,et al.  Exact Worst Case TCAM Rule Expansion , 2013, IEEE Transactions on Computers.

[45]  Gaogang Xie,et al.  Offset addressing approach to memory-efficient IP address lookup , 2011, 2011 Proceedings IEEE INFOCOM.