Issue No. 01 - January (2010 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.136
MyungKeun Yoon , Korea Financial Telecommunications and Clearings Institute (KFTC), Seoul
A Bloom filter is a simple but powerful data structure that can check membership to a static set. As Bloom filters become more popular for network applications, a membership query for a dynamic set is also required. Some network applications require high-speed processing of packets. For this purpose, Bloom filters should reside in a fast and small memory, SRAM. In this case, due to the limited memory size, stale data in the Bloom filter should be deleted to make space for new data. Namely the Bloom filter needs aging like LRU caching. In this paper, we propose a new aging scheme for Bloom filters. The proposed scheme utilizes the memory space more efficiently than double buffering, the current state of the art. We prove theoretically that the proposed scheme outperforms double buffering. We also perform experiments on real Internet traces to verify the effectiveness of the proposed scheme.
Bloom filter, LRU, cache, packet processing.
M. Yoon, "Aging Bloom Filter with Two Active Buffers for Dynamic Sets," in IEEE Transactions on Knowledge & Data Engineering, vol. 22, no. , pp. 134-138, 2009.