One memory access bloom filters and their generalization

Proceedings - IEEE INFOCOM

Volumn , Issue , 2011, Pages 1745-1753

  Qiao, Yan ^a   Li, Tao ^a   Chen, Shigang ^a  

^a J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM FILTERS; CHECK-IN; FALSE POSITIVE; FILTER DESIGNS; MEMBERSHIP QUERY; MEMORY ACCESS; NETWORK FUNCTIONS; PERFORMANCE TRADE-OFF; PROCESSING OVERHEAD; REAL TRAFFIC; SPACE OVERHEAD;

DATA STRUCTURES;

BLOOMS (METAL);

EID: 79960879420     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2011.5934972     Document Type: Conference Paper

References (15)

1. B. H. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors," Communications of the ACM, vol. 13, no. 7, pp. 422-426, 1970.
2. A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: a Survey," Internet Mathematics, vol. 1, no. 4, pp. 485-509, 2004.
3. S. Dharmapurikar, P. Krishnamurthy, and D. Taylor, "Longest Prefix Matching Using Bloom Filters," In Proc. of ACM SIGCOMM, August 2003.
4. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood, "Fast Hash Table Lookup Using Extended Bloom Filter: an Aid to Network Processing," In Proc. of ACM SIGCOMM, August 2005.
5. H. Song, F. Hao, M. Kodialam, and T. Lakshman, "IPv6 Lookups Using Distributed and Load Balanced Bloom Filters for 100Gbps Core Router Line Cards," In Proc. of IEEE INFOCOM, April 2009.
6. A. Kumar, J. Xu, J. Wang, O. Spatschek, and L. Li, "Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement," In Proc. of IEEE INFOCOM, March 2004.
7. Y. Lu and B. Prabhakar, "Robust Counting via Counter Braids: an Error-Resilient Network Measurement Architecture," In Proc. of IEEE INFOCOM, April 2009.
8. P. Reynolds and A. Vahdat, "Efficient Peer-to-Peer Keyword Searching," In Proc. of the International Middleware Conference, June 2003.
9. A. Kumar, J. Xu, and E. Zegura, "Efficient and Scalable Query Routing for Unstructured Peer-to-Peer Networks," In Proc. of IEEE INFOCOM, March 2005.
10. L. Fan, P. Cao, J. Almeida, and A. Broder, "Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol," IEEE/ACM Transactions on Networking, vol. 8, no. 3, pp. 281-293, 2000.
11. L. Maccari, R. Fantacci, P. Neira, and R. Gasca, "Mesh Network Firewalling with Bloom Filters," IEEE International Conference on Communications, June 2007.
12. D. Suresh, Z. Guo, B. Buyukkurt, and W. Najjar, "Automatic Compilation Framework for Bloom Filter Based Intrusion Detection," Reconfigurable Computing: Architectures and Applications, vol. 3985, pp. 413-418, 2006.
13. Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani, "Counter Braids: a Novel Counter Architecture for Per-Flow Measurement," In Proc. of ACM SIGMETRICS, June 2008.
14. A. Kirsch and M. Mitzenmacher, "Less Hashing, Same Performance: Building a Better Bloom Filter," In Proc. of the 14th conference on Annual European Symposium, September 2006.
15. M. K. F. Hao and T. Lakshman, "Building High Accuracy Bloom Filters Using Partitioned Hashing," In Proc. of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, June 2007.