By Topic

Fast updating scheme of forwarding tables on TCAM

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)
Weidong Wu ; Huazhong Univ. of Sci. & Technol., Wuhan, China ; Bingxin Shi ; Feng Wang

Ternary content-addressable memories (TCAMs) have become a popular hardware device for fast routing lookups. However, due to the need to keep a sorted list of entries on TCAM, the entries are moved to make free space for the new entry. The slow update is a performance bottleneck. The paper presents a TCAM-based forwarding engine that is update efficient. We analyze the hierarchy of prefixes in the routing table, and give a level-partitioning algorithm to construct the routing table in TCAM. In our scheme, the update algorithm is fast and simple, the number of movements per update depends on the inserting sequence of new prefixes and is independent of the initial prefixes. For real route update traces, the average number of movements is less than 0.01.

Published in:

Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings. The IEEE Computer Society's 12th Annual International Symposium on

Date of Conference:

4-8 Oct. 2004