Hash-based address matching
Abstract:
In one embodiment, processing is performed based on the result of a lookup operation that determines a matching hash bucket entry, with each of the entries of the hash table spanning at least two memories. A first portion of the matching hash bucket entry is retrieved from a first random access memory from a first hash bucket stored at a first location identified based on a first particular hash function applied to a hash key. First current information of the hash key is determined to match the first portion. A second portion of the matching hash bucket entry is retrieved from a second random access memory from a second hash bucket stored at a second location identified based on a second particular hash function applied to the hash key. Second current information of the hash key is determined to match the second portion.
Public/Granted literature
Information query
Patent Agency Ranking
0/0