Alternately accessed parallel lookup tables for locating information in a packet switched network
An address lookup table in a multiport switch is implemented as a plurality of address sub-tables. Entries in the address sub-tables are stored at row addresses based on a hash of the information in the entry. Hash collisions are stored in a common heap as a linked list of chained values. Entries in...
Saved in:
Main Authors | , |
---|---|
Format | Patent |
Language | English |
Published |
29.08.2006
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | An address lookup table in a multiport switch is implemented as a plurality of address sub-tables. Entries in the address sub-tables are stored at row addresses based on a hash of the information in the entry. Hash collisions are stored in a common heap as a linked list of chained values. Entries in the address sub-tables at any particular address are alternated between the address sub-tables. A search of the address sub-table for the particular entry is performed simultaneously on the plurality of address sub-tables. In this manner, the total memory size of the address table can be increased relative to a single address sub-table while decreasing the length of the longest chain length and the length of the average chain length. |
---|---|
Bibliography: | Application Number: US20010851934 |