公开(公告)号：DE602004010480D1

公开(公告)日：2008-01-17

申请号：DE602004010480

申请日：2004-12-17

Applicant: ST MICROELECTRONICS INC

Inventor： RAJGOPAL SURESH ,  HUANG LUN-BIN ,  RICHARDSON NICHOLAS JULIAN

IPC: H04L12/56 ,  G06F17/30 ,  H04L12/46 ,  H04L29/06

Abstract: Internet Protocol address prefixes (4-32) are hashed into hash tables (T4-T32) allocated memory blocks on demand after collisions occur for both a first hash and a single rehash. The number of memory blocks allocated to each hash table (T4-T32) is limited, with additional prefixes handled by an overflow content addressable memory (103). Each hash table (T4-T32) contains only prefixes of a particular length, with different hash tables (T4-T32) containing prefixes of different lengths. Only a subset of possible prefix lengths are accommodated by the hash tables (T4-T32), with a remainder of prefixes handled by the content addressable memory (103) or a similar alternate address lookup facility.

公开(公告)号：DE60311631D1

公开(公告)日：2007-03-22

申请号：DE60311631

申请日：2003-12-11

Applicant: ST MICROELECTRONICS INC

Inventor： HUANG LUN BIN ,  RICHARDSON NICHOLAS JULIAN ,  RAJGOPAL SURESH

IPC: H04L12/56

Abstract: For use in a pipeline network search engine of a router, a path compression optimization system and method is disclosed for eliminating single entry trie tables. The system embeds in a parent trie table (1) path compression patterns that comprise common prefix bits of a data packet and (2) skip counts that indicate the length of the path compression patterns. The network search engine utilizes the path compression patterns and the skip counts to eliminate single entry trie tables from a data structure. Each path compression pattern is processed one stride at a time in subsequent pipeline stages of the network search engine. The elimination of unnecessary single entry trie tables reduces memory space, power consumption, and the number of memory accesses that are necessary to traverse the data structure.