Bloom Filter Based Routing for Content-Based Publish/Subscribe
Publikation: Beitrag zu Konferenzen › Paper › Beigetragen
Beitragende
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/sub-
scribe system.
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/sub-
scribe system.
Details
Originalsprache | Englisch |
---|---|
Seiten | 71-81 |
Seitenumfang | 11 |
Publikationsstatus | Veröffentlicht - 2008 |
Peer-Review-Status | Nein |
Konferenz
Titel | DEBS '08 - the second international conference on Distributed event-based systems, ACM, 2008. |
---|---|
Kurztitel | DEBS '08 |
Veranstaltungsnummer | |
Dauer | 1 April 2008 |
Bekanntheitsgrad | Internationale Veranstaltung |
Ort | |
Stadt | Rom |
Land | Italien |
Externe IDs
Scopus | 57549101419 |
---|
Schlagworte
Forschungsprofillinien der TU Dresden
DFG-Fachsystematik nach Fachkollegium
Schlagwörter
- distribution, interaction, publisch/subscribe, Bloom filter