Clustering algorithms for content-based publication-subscription systems

Riabov, Anton; Liu, Zhen; Wolf, Joel L.; Yu, Pengfei; Zhang, Li

doi:10.1109/icdcs.2002.1022250

Cited by 52 publications

(79 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is infeasible to manage such exponentially increasing numbers of groups, and the algorithms seek to construct a limited number of groups such that the number of groups any given message must be sent to is minimized and the precision of each group is maximized (i.e., minimize the number of group members that are not interested in events sent to that group). This is an NPcomplete problem [2], but there have been attempts to develop heuristics to construct such groups [23,30]. To avoid these complexities more recent contentbased routing algorithms [4,5], as well as the algorithms in this paper, have abandoned the notion of groups and rely on an overlay topology that performs filtering and routing based on message content.…”

Section: Related Workmentioning

confidence: 99%

Adaptive Content-Based Routing in General Overlay Topologies

Muthusamy

Jacobsen

2008

Middleware 2008

View full text Add to dashboard Cite

Abstract. This paper develops content-based publish/subscribe algorithms to support general overlay topologies, as opposed to traditional acyclic or tree-based topologies. Among other benefits, publication routes can adapt to dynamic conditions by choosing among alternate routing paths, and composite events can be detected at optimal points in the network. The algorithms are implemented in the PADRES publish/subscribe system and evaluated in a controlled local environment and a wide-area PlanetLab deployment. Atomic subscription notification delivery time improves by 20% in a well connected network, and composite subscriptions can be processed with 80% less network traffic and notifications delivered with about half the end to end delay.

show abstract

Section: Related Workmentioning

confidence: 99%

Adaptive Content-Based Routing in General Overlay Topologies

Muthusamy

Jacobsen

2008

Middleware 2008

View full text Add to dashboard Cite

show abstract

“…We compare five architectural approaches: MEDYM and H-MEDYM with the SPMST routing algorithm; two versions of CBF: CBF_MST as in [6], where a single CBF tree is built as the minimum spanning tree across all servers, and CBF_SPT as in [7], where CBF trees are shortest path trees rooted at publication servers; Channelization approach as in [18], using Forgy K-Means algorithm to cluster events into 50 channels, as this algorithm was found to produce the best partition results in the paper.…”

Section: Simulation Methodologymentioning

confidence: 99%

“…However, the effectiveness of clustering heavily depends on the event and subscription distribution. Unless the distribution offers promising clustering opportunity, as [18] pointed out, it is usually difficult to accurately support diversified user interests with only a small number of groups. Furthermore, the data distribution can be difficult to estimate and change over time.…”

Section: Channelizationmentioning

confidence: 99%

“…As a companion paper, [19] proposed optimization techniques for [18] and more extensive evaluation results. Although the techniques are proven to be effective, we expect them to be potentially applicable in other approaches as well, and therefore do not consider them as part of Channelization design in this paper.…”

Section: Channelizationmentioning

confidence: 99%

“…In this paper, we use [18] as a representative for the Channelization approach. As a companion paper, [19] proposed optimization techniques for [18] and more extensive evaluation results.…”

Section: Channelizationmentioning

confidence: 99%

See 2 more Smart Citations

MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks

Cao

Singh

2005

Middleware 2005

View full text Add to dashboard Cite

Abstract. Design of distributed architectures for content-based publishsubscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and diversified content-based pub-sub communication, we propose a new architectural design called MEDYM -Match-Early with DYnamic Multicast. MEDYM follows the End-to-End distributed system design principle. It decouples a pub-sub service into two functionalities: complex, application-specific matching at network edge, and simple, generic multicast routing in the network. This architecture achieves low computation cost in event matching and high network efficiency and flexibility in event routing. For higher scalability, we describe a novel approach to extend MEDYM to a hierarchy structure called H-MEDYM, which effectively balances the trade-off between event delivery efficiency and server states maintenance. We evaluate MEDYM and H-MEDYM using detailed simulations and real-world experiments, and compare them with major existing design approaches. Results show that MEDYM and H-MEDYM achieve high event delivery efficiency and system scalability, and their advantages are most prominent when user subscriptions are highly selective and diversified.

show abstract

Meeting subscriber‐defined QoS constraints in publish/subscribe systems

Tariq

Koldehofe

Koch

et al. 2011

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARY Current distributed publish/subscribe systems consider all participants to have similar QoS requirements and contribute equally to the system's resources. However, in many real‐world applications, the message delay tolerance of individual participants may differ widely. Disseminating messages according to individual delay requirements not only allows for the satisfaction of user‐specific needs, but also significantly improves the utilization of the resources that participants contribute to a publish/subscribe system. In this article, we propose a peer‐to‐peer‐based approach to satisfy the individual delay requirements of subscribers in the presence of bandwidth constraints. Our approach allows subscribers to dynamically adjust the granularity of their subscriptions according to their bandwidth constraints and delay requirements. Subscribers maintain the overlay in a decentralized manner, exclusively establishing connections that satisfy their individual delay requirements, and that provide messages exactly meeting their subscription granularity. The evaluations show that for many practical workloads, the proposed publish/subscribe system can scale up to a large number of subscribers and performs robustly in a very dynamic setting. Copyright © 2011 John Wiley & Sons, Ltd.

show abstract

Clustering algorithms for content-based publication-subscription systems

Cited by 52 publications

References 10 publications

Adaptive Content-Based Routing in General Overlay Topologies

Adaptive Content-Based Routing in General Overlay Topologies

MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks

Meeting subscriber‐defined QoS constraints in publish/subscribe systems

Contact Info

Product

Resources

About