Name
Title | ||
|---|---|---|
Adaptive Bloom Filter: A Space-Efficient Counting Algorithm for Unpredictable Network Traffic |
Abstract | ||
|---|---|---|
The Bloom Filter (BF), a space-and-time-efficient hash-coding method, is used as one of the fundamental modules in several network processing algorithms and applications such as route lookups, cache hits, packet classification, per-flow state management or network monitoring. BF is a simple space-efficient randomized data structure used to represent a data set in order to support membership queries. However, BF generates false positives, and cannot count the number of distinct elements. A counting Bloom Filter (CBF) can count the number of distinct elements, but CBF needs more space than BF. We propose an alternative data structure of CBF, and we called this structure an Adaptive Bloom Filter (ABF). Although ABF uses the same-sized bit-vector used in BF, the number of hash functions employed by ABF is dynamically changed to record the number of appearances of a each key element. Considering the hash collisions, the multiplicity of a each key element on ABF can be estimated from the number of hash functions used to decode the membership of the each key element. Although ABF can realize the same functionality as CBF, ABF requires the same memory size as BF. We describe the construction of ABF and IABF (Improved ABF), and provide a mathematical analysis and simulation using Zipf's distribution. Finally, we show that ABF can be used for an unpredictable data set such as real network traffic. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1093/ietisy/e91-d.5.1292 | IEICE Transactions |
Keywords | Field | DocType |
distinct element,hash function,burst traffic,bloom filter,unpredictable network traffic,key element,improved abf,adaptive bloom filter,simple space-efficient randomized data,counting,alternative data structure,hash collision,unpredictable data,mathematical analysis,network monitoring,data structure,false positive | Zipf's law,Bloom filter,Data structure,Pattern recognition,CPU cache,Computer science,Cache,Algorithm,Adaptive filter,Artificial intelligence,Hash function,Network monitoring | Journal |
Volume | Issue | ISSN |
E91-D | 5 | 1745-1361 |
Citations | PageRank | References |
10 | 0.64 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoshihide Matsumoto | 1 | 10 | 0.98 |
| Hiroaki Hazeyama | 2 | 165 | 16.75 |
| Youki Kadobayashi | 3 | 463 | 65.10 |