Hardware-based IP routing using partitioned lookup table

We present a search algorithm implementable by a parallel architecture based on partitioned forwarding table. This scheme effectively reduces the complexity of finding "the longest prefix match" problem to "a prefix match" problem. The main feature of this algorithm is twofold. First, it advocates intelligent partitioning of the forwarding table to enhance and parallelize the lookup operation. Second, it takes advantage of ternary CAM to achieve low lookup time. The resulting architecture has better throughput and much better update time than the traditional TCAM. Our experimental results show that such features can significantly elevate the flexibility and scalability of the next generation packet processing devices.

[1]  Vince Fuller,et al.  Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy , 1993, RFC.

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

[3]  Butler W. Lampson,et al.  IP lookups using multiway and multicolumn search , 1999, TNET.

[4]  C. Zukowski,et al.  Putting routing tables in silicon , 1992, IEEE Network.

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

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

[7]  Kenneth J. Schultz.  Content-addressable memory core cells A survey , 1997, Integr..

[8]  Pankaj Gupta,et al.  Algorithms for routing lookups and packet classification , 2000 .

[9]  Günter Karjoth,et al.  Routing on longest-matching prefixes , 1996, TNET.

[10]  Toshiaki Miyazaki,et al.  High-speed table lookup engine for IPv6 longest prefix match , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[11]  Henry H.-Y. Tzeng,et al.  On fast address-lookup algorithms , 1999, IEEE J. Sel. Areas Commun..

[12]  Mehrdad Nourani,et al.  Reconfigurable memory architecture for scalable IP forwarding engines , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[13]  Donald R. Morrison,et al.  PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.

[14]  George Varghese,et al.  Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.

[15]  N. Yazdani,et al.  Fast and scalable schemes for the IP address lookup problem , 2000, ATM 2000. Proceedings of the IEEE Conference on High Performance Switching and Routing (Cat. No.00TH8485).

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

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

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

[19]  Nen-Fu Huang,et al.  A fast IP routing lookup scheme for gigabit switching routers , 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).

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

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

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

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

[24]  E. Stewart Lee.  Algorithms and Data Structures in Computer Engineering , 1992 .