The Community for Technology Leaders
2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops (2005)
Columbus, Ohio, USA
June 6, 2005 to June 10, 2005
ISSN: 1545-0678
ISBN: 0-7695-2328-5
pp: 370-376
Jaswinder Pal Singh , Princeton University
Fengyun Cao , Princeton University
<p>Architecture design for content-based publish-subscribe service networks has been a challenging problem, because its communication paradigm cannot be directly supported by existing network primitives. In this paper, we propose a new architectural design called MEDYM ñ Match Early with DYnamic Multicast. Unlike existing approaches, MEDYM does not rely on static overlay networks for event delivery. Instead, an event is matched against subscriptions early at the publishing server, to identify destinations with matching subscriptions, and then sent to destinations through a dynamically constructed multicast tree. This architecture achieves low computation cost in matching and high network efficiency in routing.</p> <p>We evaluate MEDYM through detailed simulations, and compare it with the two major existing design approaches: Content-based Forwarding and Channelization. Results show that MEDYM significantly improves event delivery efficiency and system scalability. We also examine closely overheads introduced in MEDYM, and found them to be well acceptable and more than outweighed by the benefits of the approach. We expect the MEDYM architecture to scale to pub-sub networks of thousands of servers, which we believe is adequate for many interesting applications in the foreseeable future.</p>
Jaswinder Pal Singh, Fengyun Cao, "MEDYM: Match-Early and Dynamic Multicast for Content-Based Publish-Subscribe Service Networks", 2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops, vol. 04, no. , pp. 370-376, 2005, doi:10.1109/ICDCSW.2005.86
104 ms
(Ver 3.1 (10032016))