| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To provide an advanced IP address lookup technology. <P>SOLUTION: Internet Protocol address prefixes are hashed into hash tables 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 is limited, with additional prefixes, handled by an overflow content addressable memory. Each hash table contains only prefixes of a particular length, different hash tables contain prefixes of different lengths. Only subset of possible prefix lengths are accommodated by the hash tables, a remainder of prefixes is handled by the content addressable memory or a similar alternate address lookup facility. <P>COPYRIGHT: (C)2005,JPO&NCIPI</p> |
