A TCAM Management Scheme for IP Lookups

Wu, Weidong

doi:10.1109/icon.2006.302561

Search citation statements

Order By: Relevance

Paper Sections

Select...

A Tcam Updating1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2009

2013

Publication Types

Select...

Other2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…data structure on the same chain (the path from the root to a leaf node), the entries needs sorting. Therefore, only the overlapping prefixes need sorting [11] [12]. Chain-ancestor ordering constraint optimal algorithm (CAO_OPT) proposes how to arrange the empty space which is in the center of TCAM [11].…”

Section: A Tcam Updatingmentioning

confidence: 99%

A fast update scheme for TCAM-based IPv6 routing lookup architecture

Hsiao

Chen

Hsiao

et al. 2009

2009 15th Asia-Pacific Conference on Communications

View full text Add to dashboard Cite

With the rapid development of the Internet applications and the explosion of end users, IP address has been exhausted and routing lookup speed is the bottleneck of router design. In addition TCAM is widely used for implementation fast IP forwarding table lookup. However, the need to maintain a sorted list incremental updates may slow the lookup speed in a TCAM. In this paper, a fast TCAM update scheme is proposed for TCAM-Based IPv6 routing lookup architecture. Based on the characteristic of prefix distribution, we design a TCAM-Based router architecture for IPv6 routing lookup. As simulation result shows more than 90% update do not need any memory movement in updating operation. The worse case is (D-2)/2, where D is the length of chain.

show abstract

Section: A Tcam Updatingmentioning

confidence: 99%