Content-Based Routing with On-Demand Multicast
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Publish/subscribe in a mobile environment
Wireless Networks - Special issue: Pervasive computing and communications
Mirinae: A peer-to-peer overlay network for large-scale content-based publish/subscribe systems
NOSSDAV '05 Proceedings of the international workshop on Network and operating systems support for digital audio and video
Dynamic group communication in mobile peer-to-peer environments
Proceedings of the 2005 ACM symposium on Applied computing
Parameterized subscriptions in publish/subscribe systems
Data & Knowledge Engineering
Bloom filter based routing for content-based publish/subscribe
Proceedings of the second international conference on Distributed event-based systems
A scalable publish/subscribe system for large mobile ad hoc networks
Journal of Systems and Software
Filter merging for efficient information dissemination
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Analysis and optimization for boolean expression indexing
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
A key issue when designing and implementing large-scale publish/subscribe systems is how to efficiently propagate subscriptions among the brokers of the system. Brokers require this information in order to forward incoming events only to interested users, filtering out unrelated events, which can save significant overheads (particularly network bandwidth and processing time at the brokers). In this paper we contribute the notion of subscription summaries, a mechanism appropriately compacting subscription information. We develop the associated data structures and matching algorithms. The proposed mechanism can handle event/subscription schemata that are rich in terms of their attribute types and powerful in terms of the allowed operations on them. Our major results are that the proposed mechanism (i) is scalable, with the bandwidth required to propagate subscriptions increasing only slightly, even at huge-scales, and (ii) is significantly more efficient, up to orders of magnitude, depending on the scale, with respect to the bandwidth requirements for propagating subscriptions.