Bloom filter based routing for content-based publish/subscribe
Authors:
Open Access
- 1 July 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 71-81
Abstract
Achieving expressive and efficient content-based routing in publish/subscribe systems is a difficult problem. Traditional approaches prove to be either inefficient or severely limited in their expressiveness and flexibility. We present a novel routing method, based on Bloom filters, which shows high efficiency while simultaneously preserving the flexibility of content-based schemes. The resulting implementation is a fast, flexible and fully decoupled content-based publish/subscribe system.Keywords
This publication has 19 references indexed in Scilit:
- Towards a common API for publish/subscribe2007
- Faster Event Forwarding in a Content-Based Publish-Subscribe System through Lookup ReuseEvent2006
- Optimizing content-based routers: posets and forestsDistributed Computing, 2006
- Less Hashing, Same Performance: Building a Better Bloom Filter2006
- Semantic Peer-to-Peer Overlays for Publish/Subscribe Networks2005
- Cell-probe lower bounds for the partial match problemJournal of Computer and System Sciences, 2004
- The many faces of publish/subscribeACM Computing Surveys, 2003
- Design and evaluation of a wide-area event notification serviceACM Transactions on Computer Systems, 2001
- Summary cache: a scalable wide-area Web cache sharing protocolIEEE/ACM Transactions on Networking, 2000
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970