@inproceedings{Hurley2007Bloom,

title = {Bloom Filters: One Size Fits All?},

author = {Paul Hurley and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2007/waldvogel07bloom.pdf},

issn = {0742-1303},

year  = {2007},

date = {2007-06-17},

urldate = {1000-01-01},

booktitle = {Proceedings of IEEE LCN 2007},

journal = {lcn},

pages = {183-190},

abstract = {Bloom filters impress by their sheer elegance and have become a widely and indiscriminately used tool in network applications, although, as we show, their performance can often be far from optimal. Notably in application areas where false negatives are tolerable, other techniques can clearly be better. We show that, at least for a specific area in the parameter space, Bloom filters are significantly outperformed even by a simple scheme. We show that many application areas where Bloom filters are deployed do not require the strong policy of no false negatives and sometimes even prefer false negatives. We analyze, through modelling, how far Bloom filters are from the optimal and then examine application specific issues in a distributed web caching scenario. We hope to open up and seed discussion towards domain-specific alternatives to Bloom filters while perhaps sparking ideas for a general-purpose alternative.},

keywords = {Bloom Filters, Hash Tables},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Norden2002Imprecise,

title = {Imprecise Multicast Routing for Scalable Information Distribution},

author = {Samphel Norden and Marcel Waldvogel},

url = {https://netfuture.ch/wp-content/uploads/2002/norden02imprecise.pdf},

year  = {2002},

date = {2002-02-01},

urldate = {1000-01-01},

booktitle = {Proceedings of International Zurich Seminar (IZS) 2002},

pages = {14-1 -- 14-6},

address = {Zurich, Switzerland},

abstract = {Typically, multicast data distribution uses rendezvous points (PIM, CBT), multicast distribution tree building protocols, and multicast forwarding. Whereas the first two approaches have been extensively studied, scaling multicast forwarding state without increasing forwarding complexity has not been addressed in detail. Having a scalable strategy for aggregation of multicast forwarding state is essential for inter-domain multicast which could have any number of concurrent multicast groups, especially in applications such as event notification and web cache invalidation mechanisms. We first present the essential characteristics of a scalable multicast routing mechanism. We then introduce and analyze, according to these metrics, a scalable aggregation mechanism for multicast-based update and change distribution based on imprecise (too generous) aggregation. Our mechanism is simple to implement, requires no additional information about the groups, and allows important savings in routing table size and routing protocol overhead, at a minimal expense in additional network and end-system traffic.},

keywords = {Bloom Filters, Fast Routers, Multicast},

pubstate = {published},

tppubtype = {inproceedings}

}