By Topic

A TCAM Index Scheme for IP Address Lookup

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 $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)
Wei Lin ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing ; Bin Liu ; Yi Tang

The rapidly increasing number of hosts on the Internet has caused a significant growth of the number of entries in the routing table, which greatly exacerbates the pressure on TCAM space requirement. In this paper, we propose a novel lookup algorithm: TCAM index scheme (TIS) for IP lookup. The algorithm fully considers the discrepancies among different parts of the prefix tree, and divides the whole prefix tree into several different sub-trees. For each sub-tree, only a single prefix will be stored in the TCAM, while the information of other prefixes (in the sub-tree) is preserved in the correlated SRAM. Hence, the space demand for TCAM is extremely reduced. Meanwhile, bitmap compression is utilized to maximize the compression ratio and minimize average SRAM requirement. Viable implementations on software and hardware plane respectively are also provided. The simulation result shows that for a real-world IPv4 routing table containing 190k prefixes, our scheme can realize line-speed lookup with only 40k 72 bits TCAM entries and 1 MB SRAM. The compression ratio is even higher under IPv6 routing table. What's more, updating is more effective than traditional TCAM-based methods.

Published in:

Communications and Networking in China, 2006. ChinaCom '06. First International Conference on

Date of Conference:

25-27 Oct. 2006