A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined Tries

An IP router has to match each incoming packet's IP destination address against all stored prefixes in its forwarding table. This task is increasingly more challenging as the routers have to: not only keep up with the ultra-high link speeds, but also be ready to switch to the 128-bit IPv6 address space while the number of prefixes grows quickly. Commercially, many routers employ Ternary Content Addressable Memory (TCAM) to facilitate fast IP lookup. However, TCAMs are power-eager, expensive, and not scalable. We advocate in this paper to keep the forwarding table in trie data structures that are accessed in a pipeline manner. Especially, we propose a new scalable IPv6 forwarding engine based on a multibit trie architecture that can achieve a throughput of 3.1 Tera bits per second.

[1]  Nian-Feng Tzeng,et al.  TCAM-Based Forwarding Engine with Minimum Independent Prefix Set (MIPS) for Fast Updating , 2006, 2006 IEEE International Conference on Communications.

[2]  Yan Ma,et al.  Tree, Segment Table, and Route Bucket: A Multi-Stage Algorithm for IPv6 Routing Table Lookup , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[3]  Rami G. Melhem,et al.  Advanced hashing schemes for packet forwarding using set associative memory architectures , 2010, J. Parallel Distributed Comput..

[4]  H. Jonathan Chao,et al.  FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps , 2010, 2010 Proceedings IEEE INFOCOM.

[5]  George Varghese,et al.  Network Algorithmics-An Interdisciplinary Approach to Designing Fast Networked Devices , 2004 .

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

[7]  Y. K. Li,et al.  Address lookup algorithms for IPv6 , 2006 .

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

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

[10]  H. Jonathan Chao,et al.  High Performance Switches and Routers , 2007 .

[11]  D. Pao,et al.  Comparative studies of address lookup algorithms for IPv6 , 2006, 2006 8th International Conference Advanced Communication Technology.

[12]  Rami G. Melhem,et al.  CHAP: Enabling Efficient Hardware-Based Multiple Hash Schemes for IP Lookup , 2009, Networking.

[13]  Rami G. Melhem,et al.  Progressive hashing for packet processing using set associative memory , 2009, ANCS '09.

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

[15]  Sartaj Sahni,et al.  Efficient Construction of Pipelined Multibit-Trie Router-Tables , 2007, IEEE Transactions on Computers.

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

[17]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

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

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

[20]  Viktor K. Prasanna,et al.  Multi-terabit ip lookup using parallel bidirectional pipelines , 2008, CF '08.

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

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