Evaluating advanced routing algorithms for content-based publish/subscribe systems

Mühl, Gero; Fiege, Ludger; Gärtner, Felix; Buchmann, Alejandro

doi:10.1109/mascot.2002.1167074

Cited by 43 publications

(45 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Routing computation cannot be ignored as a lower order effect as is standard in the literature [6,8,3,15,5]. In our experiments, routing computation sometimes cause the time to rebuild trees to increase by an order of magnitude.…”

Section: Discussionmentioning

confidence: 86%

See 1 more Smart Citation

Effects of routing computations in content-based routing networks with mobile data sources

Muthusamy

Petrovic

Jacobsen

2005

Proceedings of the 11th Annual International Conference on Mobile Computing and Networking

View full text Add to dashboard Cite

This paper presents the first quantitative evaluation of the role of routing computations on performance when mobility is introduced to a content-based routing network. Additionally, the paper identifies the factors that affect the performance of a distributed publish/subscribe architecture supporting mobile publishers, formalizes publisher mobility protocols for distributed publish/subscribe systems, and develops and evaluates protocols that reduce the costs associated with supporting mobile publishers in publish/subscribe systems. Our results show that ignoring route computation time paints a false picture of the scalability of content-based routing networks, but that with appropriate protocols the adverse effects can be mitigated.

show abstract

Section: Discussionmentioning

confidence: 86%

“…In fact, prior work evaluating contentbased routing completely ignores this cost [6,8,3,15,5]. We will see that routing computations can be a limiting factor when it comes to scalability of pub/sub systems that support mobility.…”

Section: Introductionmentioning

confidence: 98%

Effects of routing computations in content-based routing networks with mobile data sources

Muthusamy

Petrovic

Jacobsen

2005

Proceedings of the 11th Annual International Conference on Mobile Computing and Networking

View full text Add to dashboard Cite

show abstract

“…Brokers exchange subscription messages to create delivery paths connecting a publisher to a set of potential subscribers. The routing algorithms used for creating delivery paths are mainly based on reverse path forwarding [2,6], and use subscription equality or subscription covering to reduce the number of messages exchanged between system brokers, and the number of entries in broker routing tables. A recently proposed solution applies an algorithm based on core trees [8].…”

Section: Mobility Support With Persistent Notificationsmentioning

confidence: 99%

“…The existing pub/sub systems are optimized for stationary environments [2,4,8,6]. The mobility-related operation is managed by the application layer through a sequence of subscribe-unsubscribe-subscribe requests: A subscriber defines subscriptions when connecting to a pub/sub system, unsubscribes prior to disconnection, and re-subscribes after reconnecting to the system.…”

Section: Introductionmentioning

confidence: 99%

Supporting mobility with persistent notifications in publish/subscribe systems

Podnar¹

2004

"International Workshop on Distributed Event-Based Systems (DEBS 2004)" W18L Workshop - 26th International Conference on Softwa

View full text Add to dashboard Cite

show abstract

“…Brokers implement routing protocols to provide a consistent service with the goal of reducing networking costs generated by publications and subscriptions [5,6]: Subscriptions are typically routed through the network toward publishers to enable filtering of publications close to their sources. Subscription traffic, on the other hand, is reduced by not propagating covered subscriptions, as they are redundant, or by subscription merging [7,8].…”

Section: Introductionmentioning

confidence: 99%

Efficient Probabilistic Subsumption Checking for Content-Based Publish/Subscribe Systems

Ouksel

Jurca

Podnar

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Efficient subsumption checking, deciding whether a subscription or publication is covered by a set of previously defined subscriptions, is of paramount importance for publish/subscribe systems. It provides the core system functionality-matching of publications to subscriber needs expressed as subscriptions-and additionally, reduces the overall system load and generated traffic since the covered subscriptions are not propagated in distributed environments. As the subsumption problem was shown previously to be co-NP complete and existing solutions typically apply pairwise comparisons to detect the subsumption relationship, we propose a 'Monte Carlo type' probabilistic algorithm for the general subsumption problem. It determines whether a publication/subscription is covered by a disjunction of subscriptions in O(k m d), where k is the number of subscriptions, m is the number of distinct attributes in subscriptions, and d is the number of tests performed to answer a subsumption question. The probability of error is problem-specific and typically very small, and sets an upper bound on d. Our experimental results show significant gains in term of subscription set reduction which has favorable impact on the overall system performance as it reduces the total computational costs and networking traffic. Furthermore, the expected theoretical bounds underestimate algorithm performance because it performs much better in practice due to introduced optimizations, and is adequate for fast forwarding of subscriptions in case of high subscription rate.

show abstract

Evaluating advanced routing algorithms for content-based publish/subscribe systems

Cited by 43 publications

References 8 publications

Effects of routing computations in content-based routing networks with mobile data sources

Effects of routing computations in content-based routing networks with mobile data sources

Supporting mobility with persistent notifications in publish/subscribe systems

Efficient Probabilistic Subsumption Checking for Content-Based Publish/Subscribe Systems

Contact Info

Product

Resources

About