Segregating the encompassing prefixes to enhance the performance of packet forwarding engines

We propose a novel approach for IP packet forwarding based on a new ternary content addressable memory configuration. Our design is an efficient hardware solution for the longest prefix matching problem in Internet routers. Our scheme segregates the encompassing prefixes into a separate, practically small TCAM module. Consequently, the remaining prefixes, that often conform to more than 92% of the lookup table, form a disjoint set. The big TCAM module that accommodates this set has a simplified architecture, with no priority encoder. Our architecture has lower update complexity, lower cost and shorter search time, compared to the conventional TCAM structure.

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

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

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

[4]  Chung-Hsun Huang,et al.  High-speed and low-power CMOS priority encoders , 2000, IEEE Journal of Solid-State Circuits.