Bloom Filters are efficient randomized data structures for membership queries on a set with a certain known false positive probability. Counting Bloom Filters (CBFs) allow the same operation on dynamic sets that can be updated via insertions and deletions with larger memory requirements. This paper first presents a simple tight upper bound for counters overflow probability in CBFs, which is adopted in the design of more efficient CBFs. On the basis of such theoretical achievements, we introduce the idea of a hierarchical structure as well as the use of Huffman code to improve standard CBFs in terms of fast access and limited memory consumption (up to 50% of memory saving). The target could be the implementation of the compressed data structures in the small (but fast) local memory or “on-chip SRAM” of devices such as network processors. As an application of our algorithms, an anti-evasion system is finally proposed.
|Autori:||D. FICARA; A. DI PIETRO; GIORDANO S; PROCISSI G; F. VITUCCI|
|Titolo:||Enhancing Counting Bloom Filters Through Huffman-Coded Multilayer Structures|
|Anno del prodotto:||2010|
|Digital Object Identifier (DOI):||10.1109/TNET.2010.2055243|
|Appare nelle tipologie:||1.1 Articolo in rivista|