Improving retouched Bloom filter for trading off selected false positives against false negatives

Computer Networks

Volumn 54, Issue 18, 2010, Pages 3373-3387

  Donnet, Benoit ^a   Baynat, Bruno ^b   Friedman, Timur ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

Bit clearing; Bloom filters; False negatives; False positives; Measurement; Traceroute

Indexed keywords

BLOOM FILTERS; DISTRIBUTED AGENTS; DISTRIBUTED NETWORKS; ERROR RATE; FALSE NEGATIVE RATE; FALSE NEGATIVES; FALSE POSITIVE; FALSE POSITIVE RATES; FALSE POSITIVES; NETWORKING APPLICATIONS; SET MEMBERSHIP; TRACEROUTE;

COMMERCE; ELECTRIC NETWORK TOPOLOGY; RADIAL BASIS FUNCTION NETWORKS; RANDOM PROCESSES;

BLOOMS (METAL);

EID: 78649473386     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2010.07.003     Document Type: Article

References (37)

1. B.H. Bloom Space/time trade-offs in hash coding with allowable errors Communications of the ACM 13 7 1970 422 426
2. A. Broder, and M. Mitzenmacher Network applications of Bloom filters: a survey Internet Mathematics 1 4 2002 485 509
3. L. Fan, P. Cao, J. Almeida, and A.Z. Broder Summary cache: a scalable wide-area Web cache sharing protocol IEEE/ACM Transactions on Networking 8 3 2000 281 293
4. B. Donnet, B. Baynat, T. Friedman, Retouched Bloom filters: allowing networked applications to trade off selected false positives against false negatives, in: Proceedings of the ACM SIGCOMM CoNEXT, 2006.
5. k. claffy, Y. Hyun, K. Keys, M. Fomenkov, D. Krioukov, Internet mapping: from art to science, in: Proceedings of the IEEE Cybersecurity Applications and Technologies Conference for Homeland Security (CATCH), 2009.
6. Y. Shavitt, and E. Shir DIMES: let the internet measure itself ACM SIGCOMM Computer Communication Review 35 5 2005 71 74
7. F. Georgatos, F. Gruber, D. Karrenberg, M. Santcroos, A. Susanj, H. Uijterwaal, R. Wilhelm, Providing active measurements as a regular service for ISPs, in: Proceedings of the Passive and Active Measurement Workshop (PAM), 2001.
8. H.V. Madhyastha, T. Isdal, M. Piatek, C. Dixon, T. Anderson, A. Krishnamurthy, A. Venkataramani, iPlane: an information plane for distributed services, in: Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2006.
9. Wide, Gulliver: distributed active measurement project, 2006. .
10. K. Chen, D. Choffnes, R. Potharaju, Y. Chen, F. Bustamante, D. Pei, Y. Zhao, Where the sidewalk ends: extending the Internet AS graph using traceroutes from P2P users, in: Proceedings of the ACM SIGCOMM CoNEXT, 2009.
11. T. Bourgeau, J. Augé, T. Friedman, TopHat: supporting experiments through measurement infrastructure federation, in: Proceedings of the International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TridentCom), 2010.
12. k. claffy, CAIDA 2010-2013 program plan, 2010. .
13. D.R. Choffnes, F.E. Bustamante, Taming the torrent: a practical approach to reducing cross-ISP traffic in P2P systems, in: Proceedings of the ACM SIGCOMM, 2008.
14. T. Lavian, Bloom filters, CS 270 - class notes, 2004. .
15. R.P. Laufer, P.B. Velloso, D. de O. Cunha, I.M. Moraes, M.D.D. Bicudo, O.C.M.B. Duarte, A new IP traceback system against distributed denial-of-service attacks, in: Proceedings of the 12th International Conference on Telecommunications (ICT), 2005.
16. H. Song, S. Dharmapurikar, J. Turner, J. Lockwood, Fast hash table lookup using extended Bloom filter: an aid to network processing, in: Proceedings of the ACM SIGCOMM, 2005.
17. F. Bonomi, M. Mitzenmacher, R. Panigraphy, S. Singh, G. Varghese, Beyond Bloom filters: from approximate membership checks to approximate state machines, in: Proceedings of the ACM SIGCOMM, 2006.
18. A. Kirsch, M. Mitzenmacher, Distance-sensitive Bloom filters, in: Proceedings of the Algorithm Engineering and Experiments (ALENEX), 2006.
19. Y. Lu, B. Prabhakar, F. Bonomi, Bloom filters: design, innovations, and novel applications, in: Proceedings of the 43rd Annual Allerton Conference, 2005.
20. B. Chazelle, J. Killian, R. Rubinfeld, A. Tal, The Bloomier filter: an efficient data structure for static support lookup tables, in: Proceedings of the 15th ACM/SIAM Symposium on Discrete Algorithms (SODA), 2004.
21. M. Matsumoto, and T. Nishimura Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator ACM Transactions on Modeling and Computer Simulation 8 1 1998 3 30
22. B. Huffaker, D. Plummer, D. Moore, k. claffy, Topology discovery by active probing, in: Proceedings of the Symposium on Applications and the Internet (SAINT), 2002.
23. B. Donnet, P. Raoult, and T. Friedman Deployment of a large-scale topology discovery algorithm IEEE Journal on Selected Areas in Communications, Sampling the Internet: Techniques and Applications 24 12 2006 2210 2220 (Pubitemid 44955762)
24. B. Donnet, and T. Friedman Internet topology discovery: a survey IEEE Communications Survey and Tutorials 9 4 2007 2 15
25. L. Dall'Asta, I. Alvarez-Hamelin, A. Barrat, A. Vázquez, A. Vespignani, A statistical approach to the traceroute-like exploration of networks: theory and simulations, in: Proceedings of the Combinatorial and Algorithmic Aspects of Networking Workshop (CAAN), 2004.
26. M.D. McIlroy Development of a spelling list IEEE Transactions on Communications 30 1 1982 91 99
27. J.K. Mullin, and D.J. Margoliash A tale of three spelling checkers Software - Practice and Experience 20 6 1990 625 630
28. K. Bratbergsengen, Hashing methods and relational algebra operations, in: Proceedings of the 10th International Conference on Very Large Databases, 1984.
29. P. Valdurez, and G. Gardarin Join and semijoin algorithms for a multiprocessor database machine ACM Transactions on Database Systems 9 1 1984 133 161
30. L.L. Gremilion Designing a Bloom filter for differential file access Communications of the ACM 25 9 1982 600 604
31. J.K. Mullin A second look at Bloom filters Communications of the ACM 26 8 1983 570 571
32. U. Mamber, and S. Wu An algorithm for approximate membership checking with application to password security Information Processing Letters 50 4 1994 191 197
33. D. Ficara, S. Giordano, G. Procissi, F. Vitucci, Multilayer compressed counting Bloom filters, in: Proceedings of the IEEE INFOCOM, 2008.
34. F.M. Cuenca-Acuna, C. Peery, R.P. Martin, T.D. Nguyen, PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities, in: Proceedings of the 12th IEEE Symposium on High Performance Distributed Computing (HPDC), 2003.
35. J. Byers, J. Considine, M. Mitzenmacher, S. Rost, Informed content delivery over adaptive overlay networks, in: Proceedings of the ACM SIGCOMM, 2002.
36. S.C. Rhea, J. Kubiatowicz, Probabilistic location and routing, in: Proceedings of the IEEE INFOCOM, 2002.
37. S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood Deep packet inspection using parallel Bloom filters IEEE Micro 24 1 2004 52 61