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
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
IEEE/ACM Transactions on Networking (TON)
Topology Discovery by Active Probing
SAINT-W '02 Proceedings of the 2002 Symposium on Applications and the Internet (SAINT) Workshops
Efficient algorithms for large-scale topology discovery
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
An improved construction for counting bloom filters
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Improved algorithms for network topology discovery
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Improving retouched Bloom filter for trading off selected false positives against false negatives
Computer Networks: The International Journal of Computer and Telecommunications Networking
The deletable bloom filter: a new member of the bloom family
IEEE Communications Letters
A Generalized Bloom Filter to Secure Distributed Network Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Path similarity evaluation using Bloom filters
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design proposal of a photonic multicast Bloom filter node
Photonic Network Communications
Inferential time-decaying Bloom filters
Proceedings of the 16th International Conference on Extending Database Technology
| 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, and which rises the more the filters are compressed. In this paper, we introduce the retouched Bloom filter (RBF), an extension that makes the Bloom filter more flexible by permitting the removal of selected false positives at the expense of generating random false negatives. We analytically show that RBFs created through a random process maintain an overall error rate, expressed as a combination of the false positive rate and the false negative rate, that is equal to the false positive rate of the corresponding Bloom filters. We further provide some simple heuristics that decrease the false positive rate more than than the corresponding increase in the false negative rate, when creating RBFs. Finally, we demonstrate the advantages of an RBF over a Bloom filter in a distributed network topology measurement application, where information about large stop sets must be shared among route tracing monitors.