Paper Info
Title
A Bloom Filter Bank Based Hash Table for High Speed Packet Processing
Abstract
The use of hash tables in high speed packet processing applications is widely adopted and many different variants of such structures have been proposed in the literature. Nonetheless, the extremely variegated scenarios of application call for new specialized solutions, to best satisfy their possibly peculiar requirements. In this paper, we propose a randomized approach to the design of compact hash tables for network applications that need to frequently store and access short valued data. The approach is based on the use of a bank of Bloom filters and proves to be very effective both in terms of space occupancy and complexity, at the obvious cost of a non zero error probability.
Year
DOI
Venue
2014
10.1109/HPCC.2014.161
High Performance Computing and Communications, 2014 IEEE 6th Intl Symp Cyberspace Safety and Security, 2014 IEEE 11th Intl Conf Embedded Software and Syst
Keywords
Field
DocType
computational complexity,data structures,error statistics,bloom filter bank,hash table,high speed packet processing,nonzero error probability,randomized approach,space complexity,space occupancy
Resource management,Bloom filter,Computer science,Packet processing,Hash function,Probability of error,Hash table,Distributed computing
Conference
Citations 
PageRank 
References 
3
0.39
7
Authors
4
Name
Order
Citations
PageRank
Nicola Bonelli1708.72
C. Callegari29814.23
Stefano Giordano360986.56
Gregorio Procissi424926.53