V. Srinivasan, B. Nataraj and S. Khanna, “Methods for Longest Prefix Matching In a Content Addressable Memory,” US Patent 6237061, 1999.

has been cited by the following article:

• TITLE: Power and Time Efficient IP Lookup Table Design Using Partitioned TCAMs

  AUTHORS: Youngjung Ahn, Yongsuk Lee, Gyungho Lee

  KEYWORDS: IP Lookup Device; Routing Table; TCAMs; Insertion

  JOURNAL NAME: Circuits and Systems, Vol.4 No.3, June 27, 2013

  ABSTRACT: This paper proposes a power and time efficient scheme for designing IP lookup tables. The proposed scheme uses partitioned Ternary Content Addressable Memories (TCAMs) that store IP lookup tables. The proposed scheme enables O(1) time penalty for updating an IP lookup table. The partitioned TCAMs allow an update done by a simple insertion without the need for routing table sorting. The organization of the routing table of the proposed scheme is based on a partition with respect to the output port for routing with a smaller priority encoder. The proposed scheme still preserves a similar storage requirement and clock rate to those of existing designs. Furthermore, this scheme reduces power consumption due to using a partitioned routing table.