Multi-Dimensional Bloom Filter: Design and Evaluation

Bloom Filter is a bit array (a one-dimensional storage structure) that provides a compact representation for a set of data, which can be used to answer the membership query in an efficient manner with a small number of false positives. It has a lot of applications in many areas. In this paper, we extend the design of Bloom Filter by using a multidimensional matrix to replace the one-dimensional structure with three different implementations, namely OFFF, WOFF, FFF. We refer the extended Bloom Filter as Feng Filter. We show the false positive rates of our method. We compare the false positive rate of OFFF with that of the traditional onedimensional Bloom Filter and show that under certain condition, OFFF has a lower false positive rate. Traditional Bloom Filter can be regarded as a special case of our Feng Filter. key words: Bloom Filter, multi-dimensional matrix, false positive rates

[1]  George Varghese,et al.  Beyond bloom filters: from approximate membership checks to approximate state machines , 2006, SIGCOMM.

[2]  Margo I. Seltzer,et al.  Self-organization in peer-to-peer systems , 2002, EW 10.

[3]  Lee L. Gremillion.  Designing a Bloom filter for differential file access , 1982, CACM.

[4]  Habib Youssef,et al.  An efficient source authentication scheme in wireless sensor networks , 2010, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010.

[5]  Walid A. Najjar,et al.  Automatic Compilation Framework for Bloom Filter Based Intrusion Detection , 2006, ARC.

[6]  Chin-Laung Lei,et al.  Filtering False Messages En-Route in Wireless Multi-Hop Networks , 2010, 2010 IEEE Wireless Communication and Networking Conference.

[7]  James K. Mullin,et al.  Optimal Semijoins for Distributed Database Systems , 1990, IEEE Trans. Software Eng..

[8]  Philip Gross,et al.  Secure "selecticast" for collaborative intrusion detection systems , 2004, ICSE 2004.

[9]  M.E. Locasto,et al.  Towards collaborative security and P2P intrusion detection , 2005, Proceedings from the Sixth Annual IEEE SMC Information Assurance Workshop.

[10]  George Varghese,et al.  New directions in traffic measurement and accounting , 2002, CCRV.

[11]  Richard P. Martin,et al.  PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[12]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[13]  David Wetherall,et al.  Forwarding without loops in Icarus , 2002, 2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571).

[14]  James K. Mullin.  Estimating the size of a relational join , 1993, Inf. Syst..

[15]  Udi Manber,et al.  An Algorithm for Approximate Membership checking with Application to Password Security , 1994, Inf. Process. Lett..

[16]  John Kubiatowicz,et al.  Probabilistic location and routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[17]  David E. Taylor,et al.  Longest prefix matching using bloom filters , 2006, TNET.

[18]  Haiyun Luo,et al.  Statistical en-route filtering of injected false data in sensor networks , 2005, IEEE J. Sel. Areas Commun..