The Community for Technology Leaders
RSS Icon
Subscribe
Austin, Texas
May 31, 1999 to June 4, 1999
ISBN: 0-7695-0228-8
pp: 0262
ABSTRACT
The publish/subscribe (or pub/sub) paradigm is an increasingly popular model for interconnecting applications in a distributed environment. Many existing pub/sub systems are based on pre-defined subjects, and hence are able to exploit multicast technologies to provide scalability and availability. An emerging alternative to subject-based systems, known as content-based systems, allow information consumers to request events based on the content of published events. This model is considerably more flexible than subject-based pub/sub. However, it was previously not known how to efficiently multicast published events to interested content-based subscribers within a large and geographically distributed network of broker (or router) machines. In this paper, we develop and evaluate a novel and efficient distributed for this purpose, called ?link matching?. Link matching performs just enough computation at each node to determine the subset of links to which an event should be forwarded. We show via simulations that (a) link matching yields higher throughput than flooding when subscriptions are selective, and (b) the over CPU utilization of link matching is comparable to centralized matching.
INDEX TERMS
Distributed Algorithms, Publish-Subscribe, Multicast, Event Distribution Systems, Link Matching, Middleware
CITATION
Guruduth Banavar, Tushar Chandra, Bodhi Mukherjee, Jay Nagarajarao, Robert E. Strom, Daniel C. Sturman, "An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems", ICDCS, 1999, 2013 IEEE 33rd International Conference on Distributed Computing Systems, 2013 IEEE 33rd International Conference on Distributed Computing Systems 1999, pp. 0262, doi:10.1109/ICDCS.1999.776528
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool