By Topic

A TCAM-based IP lookup scheme for multi-nexthop routing

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
$33 $13
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

3 Author(s)
Zhiyong Liang ; Dept. of Comput. Sci., Tsinghua Univ., Beijing, China ; Jianping Wu ; Ke Xu

TCAM (ternary content addressable memory) is a popular device for fast routing lookups. TCAM can achieve O(1) lookup complexity with parallel technique. However, TCAM has three explicit disadvantages: high cost; high power consumption; and complex update. For load balancing and policy routing, routers have to hold considerable multi-nexthop routes with multi paths for a destination network. This paper proposes a fast TCAM-based lookup scheme that can support multi-nexthop routing lookups. Using two level index tables, the scheme can store and retrieve multi-nexthop routes quickly. To improve update performance of TCAM, we also propose a fast update algorithm-N-subspace algorithm that can approximately reach O(1) update complexity for TCAM routing tables. To decrease cost and power consumption of TCAM, we also apply an effective routing compaction method that is based on the trie structure and can reduce 20% routes for current Internet routing tables. Also, the scheme can easily scale to IPv6.

Published in:

Computer Networks and Mobile Computing, 2003. ICCNMC 2003. 2003 International Conference on

Date of Conference:

20-23 Oct. 2003