A tale of three spelling checkers
Software—Practice & Experience
An algorithm for approximate membership checking with application to password security
Information Processing Letters
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
A second look at bloom filters
Communications of the ACM
Designing a Bloom filter for differential file access
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Informed content delivery across adaptive overlay networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Hashing Methods and Relational Algebra Operations
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Topology Discovery by Active Probing
SAINT-W '02 Proceedings of the 2002 Symposium on Applications and the Internet (SAINT) Workshops
The Bloomier filter: an efficient data structure for static support lookup tables
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Fast hash table lookup using extended bloom filter: an aid to network processing
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
DIMES: let the internet measure itself
ACM SIGCOMM Computer Communication Review
Beyond bloom filters: from approximate membership checks to approximate state machines
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Taming the torrent: a practical approach to reducing cross-isp traffic in peer-to-peer systems
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Internet Mapping: From Art to Science
CATCH '09 Proceedings of the 2009 Cybersecurity Applications & Technology Conference for Homeland Security
Where the sidewalk ends: extending the internet as graph using traceroutes from P2P users
Proceedings of the 5th international conference on Emerging networking experiments and technologies
INTERNET TOPOLOGY DISCOVERY: A SURVEY
IEEE Communications Surveys & Tutorials
Deployment of an Algorithm for Large-Scale Topology Discovery
IEEE Journal on Selected Areas in Communications
L-priorities bloom filter: A new member of the bloom filter family
International Journal of Automation and Computing
Hi-index | 0.00 |
Where distributed agents must share voluminous set membership information, Bloom filters provide a compact, though lossy, way for them to do so. Numerous recent networking papers have examined the trade-offs between the bandwidth consumed by the transmission of Bloom filters, and the error rate, which takes the form of false positives. This paper is about the retouched Bloom filter (RBF). An RBF is an extension that makes the Bloom filter more flexible by permitting the removal of false positives, at the expense of introducing false negatives, and that allows a controlled trade-off between the two. We analytically show that creating RBFs through a random process decreases the false positive rate in the same proportion as the false negative rate that is generated. We further provide some simple heuristics that decrease the false positive rate more than the corresponding increase in the false negative rate, when creating RBFs. These heuristics are more effective than the ones we have presented in prior work. We further demonstrate the advantages of an RBF over a Bloom filter in a distributed network topology measurement application. We finally discuss several networking applications that could benefit from RBFs instead of standard Bloom filters.