Subscription Propagation in Highly-Available Publish/Subscribe Middleware

Achieving availability and scalability while providing service guarantees such as in-order, gapless delivery is essential for deploying publish/subscribe messaging middleware in wide area networks. Scalability often requires a publish/subscribe system to propagate subscription information and perform content matching across the network. Existing subscription propagation algorithms do not support in-order, gapless delivery in a redundant overlay network.This paper presents a novel approach that utilizes virtual time (VT) vectors to convey temporal consistency in propagating incremental and consolidated subscription information. The VT vectors provide a means of testing sufficiency of filtering information, by comparing a broker's VT vector with that of a message. When the test fails, indicating insufficient broker subscription information, safety may be preserved by "flooding" the message to all neighbors on a routing tree. This approach does not require subscription state agreement across redundant paths and hence is highly available. We present a detailed evaluation of the approach.

[1]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, TOCS.

[2]  Saurabh Bagchi,et al.  Exactly-once delivery in a content-based publish-subscribe system , 2002, Proceedings International Conference on Dependable Systems and Networks.

[3]  MatternFriedemann,et al.  Detecting causal relationships in distributed computations , 1994 .

[4]  Alejandro P. Buchmann,et al.  Filter Similarities in Content-Based Publish/Subscribe Systems , 2002, ARCS.

[5]  Peter Triantafillou,et al.  Subscription summarization: a new paradigm for efficient publish/subscribe systems , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[6]  Jon Crowcroft,et al.  Networked Group Communication , 2001, Lecture Notes in Computer Science.

[7]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[8]  Alex C. Snoeren,et al.  Mesh-based content routing using XML , 2001, SOSP.

[9]  Dennis Shasha,et al.  Filtering algorithms and implementation for very fast publish/subscribe systems , 2001, SIGMOD '01.

[10]  Alfonso Fuggetta,et al.  The JEDI Event-Based Infrastructure and Its Application to the Development of the OPSS WFMS , 2001, IEEE Trans. Software Eng..

[11]  Hartmut Schmeck,et al.  Trends in Network and Pervasive Computing — ARCS 2002 , 2002, Lecture Notes in Computer Science.

[12]  Alley Stoughton,et al.  Detection of Mutual Inconsistency in Distributed Systems , 1983, IEEE Transactions on Software Engineering.

[13]  Vom Fachbereich Informatik.  Large-Scale Content-Based Publish/Subscribe Systems , 2002 .

[14]  LamportLeslie.  Time, clocks, and the ordering of events in a distributed system , 1978 .

[15]  Miguel Castro,et al.  SCRIBE: The Design of a Large-Scale Event Notification Infrastructure , 2001, Networked Group Communication.

[16]  Liuba Shrira,et al.  Lazy replication: exploiting the semantics of distributed services , 1990, ACM SIGOPS European Workshop.

[17]  Bill Segall,et al.  Content Based Routing with Elvin4 , 2000 .

[18]  Marcos K. Aguilera,et al.  Matching events in a content-based subscription system , 1999, PODC '99.

[19]  Ben Y. Zhao,et al.  Exploiting Routing Redundancy Using a Wide-area Overlay , 2002 .

[20]  Joshua S. Auerbach,et al.  Scalably supporting durable subscriptions in a publish/subscribe system , 2003, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings..

[21]  Friedemann Mattern,et al.  Detecting causal relationships in distributed computations: In search of the holy grail , 1994, Distributed Computing.

[22]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[23]  Pascal Felber,et al.  A scalable protocol for content-based routing in overlay networks , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..