Browse > Article
http://dx.doi.org/10.5573/ieie.2017.54.1.003

Ternary Bloom Filter Improving Counting Bloom Filter  

Byun, Hayoung (Department of Electronic and Electrical Engineering, Ewha Womans University)
Lee, Jungwon (Department of Electronic and Electrical Engineering, Ewha Womans University)
Lim, Hyesook (Department of Electronic and Electrical Engineering, Ewha Womans University)
Publication Information
Journal of the Institute of Electronics and Information Engineers / v.54, no.1, 2017 , pp. 3-10 More about this Journal
Abstract
Counting Bloom filters (CBFs) have been popularly used in many network algorithms and applications for the membership queries of dynamic sets, since CBFs can provide delete operations, which are not provided in a standard 1-bit vector Bloom filter. However, because of the counting functions, a CBF can have overflows and accordingly false negatives. CBFs composed of 4-bit counters are generally used, but the 4-bit CBF wastes memory spaces by allocating 4 bits for every counter. In this paper, we propose a simple alternative of a 4-bit CBF named ternary Bloom filter (TBF). In the proposed TBF structure, if two or more elements are mapped to a counter in programming, the counters are not used for insertion or deletion operations any more. When the TBF consumes the same amount of memory space as a 4-bit CBF, it is shown through simulation that the TBF provides a better false positive rate than the CBF as well as the TBF does not generate false negatives.
Keywords
Counting Bloom filter; dynamic set; counter; overflow; false positive;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B. Bloom, "Space/time Tradeoffs in Hash Coding with Allowable Errors," Communications of the ACM, Vol.13, No.7, pp. 422-426, Jul. 1970.   DOI
2 F. Bonomi, M. Mitzenmacher, R. Panigrah, S. Singh, and G. Varghese, "Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines," in Proc. ACM SIGCOMM, pp. 315-326, Pisa, Italy, Sep. 2006.
3 H. Song, F. Hao, M. Kodialam, and T. V. Lakshman, "IPv6 Lookups Using Distributed and Load Balanced Bloom Filters for 100 Gbps Core Router Line Cards," in Proc. IEEE INFOCOM, pp. 2518-2526, Rio, Brazil, Apr. 2009.
4 O. Rottenstreich and I. Keslassy, "The Bloom Paradox: When Not to Use a Bloom Filter," IEEE/ACM Trans. on Networking, Vol. 23, No. 3, pp. 703-716, Jun. 2015.   DOI
5 S. Dharmapurikar, P. Krishnamurthy, and D. E. Taylor, "Longest Prefix Matching Using Bloom Filters," IEEE/ACM Trans. on Networking, Vol. 14, No. 2, pp. 397-409, Apr. 2006.   DOI
6 H. Lim, K. Lim, N. Lee, and K. Park, "On Adding Bloom Filters to Longest Prefix Matching Algorithms," IEEE Trans. on Computers, Vol. 63, No. 2, pp. 411-423, Feb. 2014.   DOI
7 J. Mun, and H. Lim, "New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms," IEEE Trans. on Computers, Vol. 65, No.5, pp.1558-1565, May. 2016.   DOI
8 A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: A Survey," Internet Mathematics, Vol. 1, No.4, pp. 485-509, 2004.   DOI
9 S. Tarkoma, C. E. Rothenberg, and E. Lagerspetz, "Theory and Practice of Bloom Filters for Distributed Systems," IEEE Communications Surveys and Tutorials, Vol. 14, No. 1, pp. 131-155, First Quarter, 2012.   DOI
10 L. Fan, P. Cao, J. Almeida, and A. Broder, "Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol," IEEE/ACM Trans. on Networking, Vol. 8, No.3, pp. 281-293, Jun. 2000.   DOI
11 D. Ficara, A. Di Pietro, S. Giordano, G. Procissi, and F. Vitucci, "Enhancing Counting Bloom Filters through Huffman-Ccoded Multilayer Structures," IEEE/ACM Trans. on Networking, Vol. 18, No. 6, pp. 1977-1987, Dec. 2010.   DOI
12 Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani, "Counter Braids: A Novel Counter Architecture for Per-Flow Measurement," in Proc. ACM SIGMETRICS 2008, pp. 121-132, Annapolis, USA, 2008.
13 F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese, "An Improved Construction for Counting Bloom Filters," in Proc. ESA, pp. 684-695, Zurich, Switzerland, Sep. 2006.
14 O. Rottenstreich, Y. Kanizo, and I. Keslassy, "The Variable-Increment Counting Bloom Filter," IEEE/ACM Trans. on Networking, Vol. 22, No. 4, pp. 1092-1105, Aug. 2014.   DOI
15 K. Huang, J. Zhang, D. Zhang, G. Xie, K. Salamatian, A. Liu, and W. Li, "A multi-partitioning approach to building fast and accurate counting bloom filters," IEEE IPDPS, pp. 1159-1170, Boston, USA, May. 2013.
16 C. Rothenberg, C. Macapuna, F. Verdi, and M. Magalhaes, "The Deletable Bloom Filter: A New Member of the Bloom Family," IEEE Communications Letters, Vol. 14, No. 6, pp. 557-559, Jun. 2010.   DOI
17 Alexa the Web Information Company, http://www.alexa.com/
18 D. Ficara, A. Di Pietro, S. Giordano, G. Procissi, and F. Vitucci, "Enhancing counting Bloom filters through Huffman-coded multilayer structures," IEEE/ACM Trans. on Networking, Vol. 18, No. 6, pp. 1977-1987, Dec. 2010.   DOI
19 L. Li, B. Wang, and J. Lan, "A variable length counting Bloom filter," in Proc. 2nd Int. Conf. on ICCET, pp. 504-508, Kuala Lumpur, Malaysia, Apr. 2010.
20 N. Hua, H. Zhao, B. Lin, and J. Xu, "Rank-indexed hashing: A compact construction of Bloom filters and variants," in IEEE ICNP, pp. 73-82, Orlando, USA, Oct. 2008.