×

An insight review on Bloom filter and its variants with applications: an emerging hash based membership querying technique. (English) Zbl 1487.68085

MSC:

68P05 Data structures
68M18 Wireless sensor networks as related to computer science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Burton, Bloom, Space/Time Tradeoffs in Hash Coding with Allowable Errors, Comm. ACM, 13, 422-426 (1970) · Zbl 0195.47003
[2] Fan, L.; Cao, P.; Almeida, J.; Broder, A., Summary Cache: A Scalable Wide Area Web Cache Sharing Protocol, IEEE/ACM Transaction on Networking, 8, 3, 281-293 (2000)
[3] paynter, Michael; kocak, taskin, Fully pipelined bloom filter architecture”, IEEE Transaction Letters, 12 (2008)
[4] Guo, Deke; Wu, Jie; Honghui, Chen; Yuan, Ye; Luo, Xueshan, The Dynamic Bloom Filters for Deep Packet Inspection”, IEEE Transaction on knowledge and data engineering, 22 (2010)
[5] Esteve Rothenberg, Christian; Carols, Fabio; Magalhaes, F., The Deletable Bloom Filter: A new member of the bloom family, IEEE Communication Letters, 14, 6 (2010)
[6] Mitzenmacher, Michael, Compressed Bloom Filters”, IEEE/ACM Transactions on networking, 10, 5, 604-612 (2002)
[7] Hao, F.; Kodialam, M.; Lakshman, T. V., Incremental Bloom Filters, Proc. IEEE INFOCOM, 1741-1749 (2008)
[8] Xiao, Bin; Hua, Yu, Using Parallel Bloom Filters for Multiattribute Representation on Network Services, IEEE Transactions on parallel and distributed systems, 21, 1 (2010)
[9] Paynter, Michael; Kocak, Taskin, Fully Pipelined Bloom Filter Architecture, IEEE Communications letters, 12, 11 (2008)
[10] Rafael, P. Laufer; Velloso, Pedro B.; Duarte, Otto Carlos M. B., A Generalized Bloom Filter to Secure Distributed Network Applications, Computer Networks, 55, 1804-1819 (2011)
[11] Hao, F.; Kodialam, M.; Lakshman, T., Building High Accuracy Bloom Filters Using Partitioned Hashing, Proc. ACMSIGMETRICS, 277-288 (2007)
[12] Song, H.; Dharmapurikar, S.; Turner, J.; Lockwood, J., Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing, Proc. ACM SIGCOMM (2005)
[13] Kocak, Taskin; Kaya, Ilhan, Low Power Bloom Filter Architecture for Deep Packet Inspection, IEEE Communication letters, 10, 3 (2006)
[14] Bruck, Jehoshua; Gao, Jie; jiang, anxiao, Weighted Bloom Filter, ISIT (2006), IEEE Xplore
[15] Ramakrishna, M.; Fu, E.; Bahcekapili, E., A performance study of hashing functions for hardware applications, In Proc. of Int. Conf. on Computing and Information, 1621-1636 (1994)
[16] Cohen, Saar; Matias, Yossi, Spectral bloom filters, ACM SIGMOD (2003)
[17] Chazelle, B.; Kilian, J.; Rubinfeld, R.; Tal, A., The Bloomier filter: an efficient data structure for static support lookup tables, Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’04), 30-39 (2004) · Zbl 1317.68041
[18] Kumar, Abhishek; Xu, Jun(Jim); Li, Li; Wang, Jia, Space Code Bloom Filter for Efficient Traffic Flow Measurement, Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement, 167-172 (2007), ACM press
[19] Dharmapurikar, S.; Lockwood, J., Fast and scalable pattern matching for network intrusion detection systems, IEEE Journal on Selected Areas in Communications, 24, 10, 1781-1792 (2006)
[20] Broder, Andrei; Mitzenmacher, Michael, Network Applications of Bloom Filters: A Survey, Internet Mathematics, 1, 4, 485-509 (2004) · Zbl 1090.68515
[21] Whitaker, A.; Wetherall, D., Forwarding without Loops in Icarus, In Proceedings of the Fifth IEEE Conference on Open Architectures and Network Programming, 63-75 (2002)
[22] Dharmapurikar, Sarang; Krishnamurthy, Praveen; Taylor, David E., Longest prefix matching using Bloom filters, ACM SIGCOMM (2003)
[23] Guo, Deke; He, Yuan; Yang, Panlong, Receiver-oriented design of Bloom filters for data-centric routing, Computer Networks, 54, 165-174 (2010), Elsevier · Zbl 1185.68275
[24] Chen, Tao; Guo, Deke, A Bloom filters based dissemination protocol in wireless sensor networks, Journol on Adhoc networks (2010), Elsevier publications
[25] Alagu Priya, A. G.; Lim, Hyesook, Hierarchical packet classification using a Bloom filter and rule-priority tries, Computer Communications, 33, 1215-1226 (2010), Elsevier publications
[26] Guinde, Nitesh B.; Ziavras, Sotirios G., Efficient hardware support for pattern matching in network intrusion detection, Computers & Security, 29, 756-769 (2010), Elsevier publications
[27] Geneiatakis, Dimitris; Vrakas, Nikos; ambrinoudakis, Costas, Utilizing bloom filters for detecting flooding attacks against SIP based services, Computers & Security, 28, 578-591 (2009), Elsevier
[28] Rajagopalan, R.; Varshney, P. K., Data-aggregation techniques in sensor networks: a survey, IEEE Communication Surveys & Tutorials, 8, 4, 48-63 (2006)
[29] Abhishek, Das; Nguyen, David; Zambreno, Joseph; Memik, Gokhan; Choudhary, Alok, An FPGA-Based Network Intrusion Detection Architecture, IEEE transactions on information forensics and Security, 3, 1 (2008)
[30] Dharmapurikar, S.; Attig, M.; Lockwood, J. W., Design and implementation of a string matching system for network intrusion detection using FPGA-based bloom filters (2004)
[31] Dharmapurikar, S.; Krishnamurthy, P.; Sproull, T.; Lockwood, J. W., Deep packet inspection using Parallel bloom filters, presented at the Symp. High Performance Interconnects (2003), Stanford
[32] Fleury, M.; Self, B.; Downton, A. C., A fine-grained parallel pipelined Karhunen-Loeve transform, presented at the Int. Parallel and Distributed Processing Symp (2003), Nice · Zbl 1091.68117
[33] Almeida, Paulo Sérgio; Baquero, Carlos; Preguica, Nuno, Scalable Bloom Filter, Information Processing Letters (2007) · Zbl 1184.68197
[34] Jobson, J. D., Volume II: Categorical and Multivariate Methods, Applied Multivariate Data Analysis (1992), New York: Springer-Verlag, New York · Zbl 0760.62046
[35] Jolliffe, I. T., Principal Component Analysis (2002), New York: Springer- Verlag, New York · Zbl 1011.62064
[36] Krishnamurthy, B.; Sen, S.; Zhang, Y.; Chen, Y., Sketch based change detection: Methods, Evaluation, and applications, presented at the ACM SIGCOMM Internet Measurement Conf (2003)
[37] Lazarevic, A.; Ertoz, L.; Kumar, V.; Ozgur, A.; Srivastava, J., A comparative study of anomaly detection schemes in network intrusion detection, presented at the SIAM Conf. Data Mining, Minneapolis (2003)
[38] Kumar, A.; Xu, J.; Zegura, E. W., Effcient and Scalable Query Routing for Unstructured Peer-to-Peer Networks, Proc. IEEE INFOCOM, 1162-1173 (2005)
[39] Deng, F.; Rafiei, D., Approximately Detecting Duplicates for Streaming Data Using Stable Bloom Filters, Proc. 25th ACM SIGMOD, 25-36 (2006)
[40] Bonomi, F.; Mitzenmacher, M.; Panigrahy, R.; Singh, S.; Varghese, G., Beyond bloom filters: from approximate membership checks to approximate state machines, Proc. ACM SIGCOMM, 315-326 (2006)
[41] Pagh, A.; Pagh, R.; Rao, S., An Optimal Bloom Filter Replacement, Discrete Algorithms, 823-829 (2005) · Zbl 1297.68066
[42] Zhong, M.; Lu, P.; Shen, K.; Seiferas, J., Optimizing Data Popularity Conscious Bloom Filters, Principles of Distributed Computing (PODC) (2008) · Zbl 1301.90081
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.