Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
End-to-end arguments in system design
ACM Transactions on Computer Systems (TOCS)
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
The JEDI Event-Based Infrastructure and Its Application to the Development of the OPSS WFMS
IEEE Transactions on Software Engineering
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Clustering Algorithms for Content-Based Publication-Subscription Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
New Algorithms for Content-Based Publication-Subscription Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Forwarding in a content-based network
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Virtual landmarks for the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Subscription Summarization: A New Paradigm for Efficient Publish/Subscribe Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Subscription propagation in highly-available publish/subscribe middleware
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
An underlay aware, adaptive overlay for event broker networks
Proceedings of the 5th workshop on Adaptive and reflective middleware (ARM '06)
Dynamic content-based channels: meeting in the middle
Proceedings of the second international conference on Distributed event-based systems
Bloom filter based routing for content-based publish/subscribe
Proceedings of the second international conference on Distributed event-based systems
CCD: efficient customized content dissemination in distributed publish/subscribe
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
CCD: efficient customized content dissemination in distributed publish/subscribe
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
Efficacy of techniques for responsiveness in a wide-area publish/subscribe system
Proceedings of the 11th International Middleware Conference Industrial track
Building a reliable and high-performance content-based publish/subscribe system
Journal of Parallel and Distributed Computing
DYNATOPS: a dynamic topic-based publish/subscribe architecture
Proceedings of the 7th ACM international conference on Distributed event-based systems
| Hi-index | 0.00 |
Design of distributed architectures for content-based publish-subscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and diversified content-based pub-sub communication, we propose a new architectural design called MEDYM - Match-Early with DYnamic Multicast. MEDYM follows the End-to-End distributed system design principle. It decouples a pub-sub service into two functionalities: complex, application-specific matching at network edge, and simple, generic multicast routing in the network. This architecture achieves low computation cost in event matching and high network efficiency and flexibility in event routing. For higher scalability, we describe a novel approach to extend MEDYM to a hierarchy structure called H-MEDYM, which effectively balances the trade-off between event delivery efficiency and server states maintenance. We evaluate MEDYM and H-MEDYM using detailed simulations and real-world experiments, and compare them with major existing design approaches. Results show that MEDYM and H-MEDYM achieve high event delivery efficiency and system scalability, and their advantages are most prominent when user subscriptions are highly selective and diversified.