Sciweavers

Share
SIGCOMM
2005
ACM

Fast hash table lookup using extended bloom filter: an aid to network processing

11 years 5 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state management and network monitoring. These applications, which typically form components of data-path in a high-speed router, must process and forward packets with little or no buffer in order to maintain the wire-speed throughout. A poorly designed hash table can critically affect the worstcase throughput due to multiple memory accesses required for each lookup. Hence, high throughput requirement in turn underscores the need for a hash table having good and more predictable worstcase lookup performance. While most of the existing hash table based packet processing algorithms rely on the assumption that hash table lookup needs constant time, very little discussion is provided on the underlying engineering considerations to achieve this performance. We present a novel hash table data structure and lookup algorithm whi...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where SIGCOMM
Authors Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turner, John W. Lockwood
Comments (0)
books