A Semantic Overlay for Self- Peer-to-Peer Publish/Subscribe

Anceaume, Emmanuelle; Gradinariu, Maria; Datta, Anwitaman; Simon, Gwendal; Virgillito, Antonino

doi:10.1109/icdcs.2006.12

Cited by 43 publications

(52 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Second, depending on the subscription workload, the resulting tree might be heavily unbalanced with a high variance in the degree of internal nodes. Another approach consists in building one containment tree per dimension and adding a subscription to each tree for which it specifies an attribute filter [2]. This solution tends to produce flat trees with high fan-out and generates a significant number of false positives.…”

Section: Related Workmentioning

confidence: 99%

“…Content-based publish/subscribe over peer-to-peer systems has been widely addressed in recent years (e.g., [15,18,7,2,19]). Surprisingly, most of these systems aim at providing scalability and fault-tolerance but very few of them address the central problem in publish/subscribe systems: the presence of false positives and false negatives.…”

Section: Related Workmentioning

confidence: 99%

“…One of the techniques that focused on minimizing the false positives/false negatives is the organisation of subscribers based on their similarity [7,2,19]. In the first two systems, subscriptions form unbalanced trees and the publication complexity is strongly dependent on the subscription distribution.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

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

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Content-Based Publish/Subscribe Using Distributed R-Trees

Bianchi

Felber

Gradinariu

2007

Euro-Par 2007 Parallel Processing

View full text Add to dashboard Cite

show abstract

“…A slightly different approach in [2] requires the entire network to be searched for a cluster before a subscription is submitted. However, these systems remain CBNs rather than KBNs because the semantics of the message cannot be used in subscriptions and so lacks the expressiveness of the system physically evaluated in this paper.…”

Section: Related Workmentioning

confidence: 99%

Knowledge-based semantic clustering

Keeney

Jones

Roblek

et al. 2008

Proceedings of the 2008 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Users of the web are increasingly interested in tracking the appearance of new postings rather than locating existing knowledge. Coupled with this is the emergence of the Web 2.0 movement (where everyone effectively publishes and subscribes), and the concept of the "Internet of Things". These trends bring into sharp focus the need for efficient distribution of information. However to date there has been few examples of applying ontology-based techniques to achieve this. Knowledge-based networking (KBN) involves the forwarding of messages across a network based not just on the contents of the messages but also on the semantics of the associated metadata. In this paper we examine the scalability problems of such a network that would meet the needs of Internet-scale semantic-based event feeds. This examination is conducted by evaluating an implemented extension to an existing pub-sub content-based networking (CBN) algorithm to support matching of notification messages to client subscription filters using ontology-based reasoning. We also demonstrate how the clustering of ontologies leads to increased efficiencies in the subscription forwarding tables used, which in turn results in increased scalability of the network.

show abstract

“…The very structure of the overlay that emerges allows publications to reach all interested subscribers autonomously, while the system inherits the self-organization allowed by the use of gossip for its construction. DPS [67] leverages gossip-based protocols to group the nodes with overlapping interests (based on their subscriptions) and form the basis of a self-organizing matching and dissemination layer.…”

Section: Self-organizing Publish and Subscribementioning

confidence: 99%

Gossip-Based Networking for Internet-Scale Distributed Systems

Rivière

Voulgaris

2011

Lecture Notes in Business Information Processing

View full text Add to dashboard Cite

Abstract. In the era of Internet-scale applications, an increasing number of services are distributed over pools of thousands to millions of networked computers. Along with the obvious advantages in performance and capacity, such a massive scale comes also with challenges. Continuous changes in the system become the norm rather than the exception, either because of inevitable hardware failures or merely due to standard maintenance and upgrading procedures. Rather than trying to impose rigid control on the massive pools of resources, we should equip Internet-scale applications with enough flexibility to work around inevitable faults. In that front, gossiping protocols have emerged as a promising component due to their highly desirable properties: self-healing, self-organizing, symmetric, immensely scalable, and simple. Through visiting a representative set of fundamental gossiping protocols, this paper provides insight on the principles that govern their behavior. By focusing on the rationale and incentives behind gossiping protocols, we introduce the reader to the alternative way of managing massive scale systems through gossiping, and we intrigue her or his interest to delve deeper into the subject by providing an extensive list of pointers.

show abstract

A Semantic Overlay for Self- Peer-to-Peer Publish/Subscribe

Cited by 43 publications

References 17 publications

Content-Based Publish/Subscribe Using Distributed R-Trees

Content-Based Publish/Subscribe Using Distributed R-Trees

Knowledge-based semantic clustering

Gossip-Based Networking for Internet-Scale Distributed Systems

Contact Info

Product

Resources

About