Subscription propagation enables efficient content-based routing in publish/subscribe systems and is a challenging problem when it is required to support reliable delivery in networks with redundant routes. We have designed a generic model and a highly-asynchronous algorithm accomplishing these goals. Existing algorithms can be interpreted as different encodings and optimizations of the generic algorithm and hence their correctness can be derived from the generic algorithm. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Zhao, Y., Bhola, S., & Sturman, D. (2005). Subscription propagation and content-based routing with delivery guarantees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3724 LNCS, pp. 501–502). https://doi.org/10.1007/11561927_41
Mendeley helps you to discover research relevant for your work.