By Topic

Efficient entry-reduction algorithm for TCAM-based IP forwarding engine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wang, P.-C. ; Inst. of Comput. Sci. & Inf. Technol., Nat. Chung-Hsing Univ., Taichung, Taiwan ; Chan, C.-T. ; Chen, R.-C. ; Chang, H.-Y.

Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix searching in O(1) time without considering the number of prefixes and their lengths. As compared to software-based solutions, ternary content-addressable memory can offer sustained throughput and simple system architecture. However, it also comes with several shortcomings, such as a limited number of entries, and enormous cost and power consumption. Accordingly, an efficient algorithm is proposed to reduce the required size of ternary content-addressable memory. The proposed scheme can eliminate 98% of ternary content-addressable memory entries by adding comparatively little DRAM and, thus, is attractive for IPv6 routing lookup.

Published in:

Communications, IEE Proceedings-  (Volume:152 ,  Issue: 2 )