A peer-to-peer approach to content-based publish/subscribe

Terpstra, Wesley W.; Behnel, Stefan; Fiege, Ludger; Zeidler, Andreas; Buchmann, Alejandro

doi:10.1145/966626.966627

Cited by 59 publications

(78 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As shown in Figure 4.1, the average dissemination delay of GGQS-based hybrid method does not grow with the number of nodes in distributed clouds. However, the average dissemination operation of Chord-based method requires log n/2 number hops to delivery event to other clouds (Stoica et al, 2001;Terpstra et al, 2003). Therefore, the average dissemination delay of GGQS-based hybrid method is much lower than that of Chord-based method regardless of the number of nodes in distributed clouds.…”

Section: Performance Evaluationmentioning

confidence: 99%

A GGQS-based hybrid algorithm for inter-cloud time-critical event dissemination

Bae

2012

Journal of the Korean Data and Information Science Society

View full text Add to dashboard Cite

Cloud computing has rapidly become a new infrastructure for organizations to reduce their capital cost in IT investment and to develop planetary-scale distributed applications. One of the fundamental challenges in geographically distributed clouds is to provide efficient algorithms for supporting inter-cloud data management and dissemination. In this paper, we propose a geographic group quorum system (GGQS)-based hybrid algorithm for improving the interoperability of inter-cloud in time-critical event dissemination service, such as computing policy updating, message sharing, event notification and so forth. The proposed algorithm first organizes these distributed clouds into a geographic group quorum overlay to support a constant event dissemination latency. Then it uses a hybrid protocol that combines geographic group-based broadcast with quorum-based multicast. Our numerical results show that the GGQS-based hybrid algorithm improves the efficiency as compared with Chord-based, Plume and GQS-based algorithms.

show abstract

Section: Performance Evaluationmentioning

confidence: 99%

A GGQS-based hybrid algorithm for inter-cloud time-critical event dissemination

Bae

2012

Journal of the Korean Data and Information Science Society

View full text Add to dashboard Cite

show abstract

“…There are several similar efforts [25,24]. Terpstra et al [25] partition the event space among the peers in the system.…”

Section: Related Workmentioning

confidence: 99%

“…There are several similar efforts [25,24]. Terpstra et al [25] partition the event space among the peers in the system. Chord [23] is used to broadcast events and subscriptions to all nodes in the system.…”

Section: Related Workmentioning

confidence: 99%

Meghdoot: Content-Based Publish/Subscribe over P2P Networks

Gupta¹,

Şahin²,

Agrawal³

et al. 2004

Middleware 2004

175

214

View full text Add to dashboard Cite

Abstract. Publish/Subscribe systems have become a prevalent model for delivering data from producers (publishers) to consumers (subscribers) distributed across wide-area networks while decoupling the publishers and the subscribers from each other. In this paper we present Meghdoot, which adapts content-based publish/subscribe systems to Distributed Hash Table based P2P networks in order to provide scalable content delivery mechanisms while maintaining the decoupling between the publishers and the subscribers. Meghdoot is designed to adapt to highly skewed data sets, which is typical of real applications. The experimental results demonstrate that Meghdoot balances the load among the peers and the design scales well with increasing number of peers, subscriptions and events.

show abstract

“…These approaches have two main drawbacks: the lack of scalability for publish/subscribe systems that require complex subscriptions and the large number of false positives/negatives. The first problem was addressed in [17] by using multi-dimensional spaces. Terpstra et al [17] partition the event space among the peers in the system, but they broadcast the events and the subscriptions to all the peers in the system.…”

Section: Related Workmentioning

confidence: 99%

“…The first problem was addressed in [17] by using multi-dimensional spaces. Terpstra et al [17] partition the event space among the peers in the system, but they broadcast the events and the subscriptions to all the peers in the system. Consequently, the number of false positives is in the order of the number of subscriptions in the system.…”

Section: Related Workmentioning

confidence: 99%

Content-Based Publish/Subscribe Using Distributed R-Trees

Bianchi

Felber

Gradinariu

2007

Euro-Par 2007 Parallel Processing

View full text Add to dashboard Cite

Abstract. Publish/subscribe systems provide a useful paradigm for selective data dissemination and most of the complexity related to addressing and routing is encapsulated within the network infrastructure. The challenge of such systems is to organize the peers so as to best match the interests of the consumers, minimizing false positives and avoiding false negatives.In this paper, we propose and evaluate the use of R-trees for organizing the peers of a content-based routing network. We adapt three well-known variants of Rtrees to the content dissemination problem striving to minimize the occurrence of false positives while avoiding false negatives. The effectiveness and accuracy of each structure is analyzed by extensive simulations.

show abstract

A peer-to-peer approach to content-based publish/subscribe

Cited by 59 publications

References 0 publications

A GGQS-based hybrid algorithm for inter-cloud time-critical event dissemination

A GGQS-based hybrid algorithm for inter-cloud time-critical event dissemination

Meghdoot: Content-Based Publish/Subscribe over P2P Networks

Content-Based Publish/Subscribe Using Distributed R-Trees

Contact Info

Product

Resources

About