Bloom Filter Query Algorithm

This paper surveys the mathematics behind Bloom filters, some important variations and network-related applications of Bloom filters. The current researches show that although Bloom filters start drawing significant attention from the academic community and there has been considerable progress, there are still many unknown dimensions to be explorered. The research trends of Bloom filter algorithm are foreseen in the end.

[1]  Craig Partridge,et al.  Hash-based IP traceback , 2001, SIGCOMM.

[2]  Jie Wu,et al.  Theory and Network Applications of Dynamic Bloom Filters , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[4]  Cristian Estan,et al.  New directions in traffic measurement and accounting , 2001, IMW '01.

[5]  James K. Mullin,et al.  A second look at bloom filters , 1983, CACM.

[6]  A. Kumar,et al.  Space-code bloom filter for efficient per-flow traffic measurement , 2004, IEEE INFOCOM 2004.

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

[8]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

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

[10]  Fang Hao,et al.  Building high accuracy bloom filters using partitioned hashing , 2007, SIGMETRICS '07.

[11]  George Varghese,et al.  An Improved Construction for Counting Bloom Filters , 2006, ESA.

[12]  Steven S. Lumetta,et al.  Using the Power of Two Choices to Improve Bloom Filters , 2007, Internet Math..

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

[14]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

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

[16]  Michael Mitzenmacher,et al.  Compressed bloom filters , 2001, PODC '01.

[17]  Michael Mitzenmacher,et al.  Less hashing, same performance: Building a better Bloom filter , 2006, Random Struct. Algorithms.

[18]  Dafang Zhang,et al.  A Scalable Bloom Filter for Membership Queries , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

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

[20]  Craig Partridge,et al.  Single-packet IP traceback , 2002, TNET.

[21]  M. Douglas,et al.  Development of a Spelling List , 1982 .

[22]  Sarang Dharmapurikar,et al.  Longest prefix matching using bloom filters , 2006, IEEE/ACM Transactions on Networking.

[23]  Stefano Giordano,et al.  MultiLayer Compressed Counting Bloom Filters , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[24]  Fan Deng,et al.  Approximately detecting duplicates for streaming data using stable bloom filters , 2006, SIGMOD Conference.

[25]  Haiyun Luo,et al.  Statistical en-route filtering of injected false data in sensor networks , 2004, IEEE INFOCOM 2004.

[26]  Nicolas Hohn,et al.  Inverting sampled traffic , 2003, IEEE/ACM Transactions on Networking.

[27]  Rabi N. Mahapatra,et al.  A Memory-Efficient Hashing by Multi-Predicate Bloom Filters for Packet Classification , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[28]  Dafang Zhang,et al.  Basket Bloom Filters for Membership Queries , 2005, TENCON 2005 - 2005 IEEE Region 10 Conference.

[29]  Yafei Dai,et al.  MBF: a Real Matrix Bloom Filter Representation Method on Dynamic Set , 2007, 2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007).

[30]  Zhang Da.  A Trace Label Based Consistency Maintenance Algorithm in Unstructured P2P Systems , 2007 .

[31]  John W. Lockwood,et al.  Deep packet inspection using parallel bloom filters , 2004, IEEE Micro.

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

[33]  Chen Wei.  A Light-Weight Detection Method Against DDoS Attack , 2006 .

[34]  Duane Wessels,et al.  Cache Digests , 1998, Comput. Networks.

[35]  Matt W. Mutka,et al.  Sharing presence information and message notification in an ad hoc network* , 2003, Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003)..

[36]  Alex C. Snoeren,et al.  Hash-based IP traceback , 2001, SIGCOMM '01.

[37]  Yossi Matias,et al.  Spectral bloom filters , 2003, SIGMOD '03.

[38]  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.

[39]  Kun Xie.  A Trace Label Based Consistency Maintenance Algorithm in Unstructured P2P Systems , 2007 .

[40]  Xiao Ming.  Split Bloom Filter , 2004 .

[41]  Gong Jian,et al.  Reconstructing the Parameter for Massive Abnormal TCP Connections with Bloom Filter , 2006 .

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

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

[44]  Abhishek Kumar,et al.  Data streaming algorithms for efficient and accurate estimation of flow size distribution , 2004, SIGMETRICS '04/Performance '04.

[45]  John W. Byers,et al.  Scalable Coordination Techniques for Distributed Network Monitoring , 2005, PAM.

[46]  Haoyu Song,et al.  Fast packet classification using bloom filters , 2006, 2006 Symposium on Architecture For Networking And Communications Systems.

[47]  Michael Mitzenmacher,et al.  Distance-Sensitive Bloom Filters , 2006, ALENEX.

[48]  Xie Gao-gang,et al.  Combine multi-dimension Bloom filter for membership queries , 2008 .

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

[50]  P. Hebden,et al.  Data-Centric Routing using Bloom Filters in Wireless Sensor Networks , 2006, 2006 Fourth International Conference on Intelligent Sensing and Information Processing.

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

[52]  Michael Mitzenmacher,et al.  Simple Summaries for Hashing With Choices , 2008, IEEE/ACM Transactions on Networking.

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

[54]  Michael Mitzenmacher,et al.  Less Hashing, Same Performance: Building a Better Bloom Filter , 2006, ESA.

[55]  You Zhi.  Algebraic Operations on Bloom Filters , 2008 .