Proactive gossip‐based management of semantic overlay networks

Voulgaris, Spyros; Steen, Maarten van; Iwanicki, Konrad

doi:10.1002/cpe.1225

Cited by 33 publications

(32 citation statements)

References 13 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each node was running CYCLON and, in the case of RINGCAST, VICINITY too, as described above, with view length 20 for each protocol ( cyc = vic = 20). The view lengths are not crucial for the behavior of these algorithms ( [20]). Nodes were initially supplied with a certain single contact in their CYCLON views, forming a star topology.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Hybrid Dissemination: Adding Determinism to Probabilistic Multicasting in Large-Scale P2P Systems

Voulgaris

Steen

2007

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Epidemic protocols have demonstrated remarkable scalability and robustness in disseminating information on internet-scale, dynamic P2P systems. However, popular instances of such protocols suffer from a number of significant drawbacks, such as increased message overhead in push-based systems, or low dissemination speed in pull-based ones.In this paper we study push-based epidemic dissemination algorithms, in terms of hit ratio, communication overhead, dissemination speed, and resilience to failures and node churn. We devise a hybrid push-based dissemination algorithm, combining probabilistic with deterministic properties, which limits message overhead to an order of magnitude lower than that of the purely probabilistic dissemination model, while retaining strong probabilistic guarantees for complete dissemination of messages. Our extensive experimentation shows that our proposed algorithm outperforms that model both in static and dynamic network scenarios, as well as in the face of large-scale catastrophic failures. Moreover, the proposed algorithm distributes the dissemination load uniformly on all participating nodes.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Such links are maintained using a proximity-based topology construction epidemic protocol, here we use VICINITY [20]. The basic idea is that nodes maintain short views of the network of length vic .…”

Section: Deterministic Ring Links (D-links)mentioning

confidence: 99%

Hybrid Dissemination: Adding Determinism to Probabilistic Multicasting in Large-Scale P2P Systems

Voulgaris

Steen

2007

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…One way of solving this, is to use results of queries to know remote contents and create links [7,18,19]. A second approach is to use gossiping to distribute information about contents, so that remote peers can introduce links [21]. Yet another approach is to consider interest, for example by considering overlap in query results or cache contents [3,20].…”

Section: Related Workmentioning

confidence: 99%

Efficient search based on content similarity over self-organizing P2P networks

Doulkeridis¹,

Vlachou²,

Nørvåg³

et al. 2009

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

The advent of the World Wide Web has made an enormous amount of information available to everyone and the widespread use of digital equipment enables end-users (peers) to produce their own digital content. This vast amount of information requires scalable data management systems. Peer-to-peer (P2P) systems have so far been well established in several application areas, with file-sharing being the most prominent. The next challenge that needs to be addressed is (more complex) data sharing, management and query processing, thus facilitating the delivery of a wide spectrum of novel data-centric applications to the end-user, while providing high Quality-of-Service. In this paper, we propose a self-organizing P2P system that is capable to identify peers with similar content and intentionally assign them to the same super-peer. During content retrieval, fewer super-peers need to be contacted and therefore efficient similarity search is supported, in terms of reduced network traffic and contacted peers. Our approach increases the responsiveness and reliability of a P2P system and we demonstrate the advantages of our approach using large-scale simulations.

show abstract

“…Emphasising on protocols, Voulgaris et al [29] propose an epidemic protocol 5 that implicitly clusters peers with similar content. In [18], Penzo et al propose a strategy for incremental clustering of semantically related peers.…”

Section: Related Workmentioning

confidence: 99%

“…SON-based systems apply a periodic rewiring protocol to cluster peers with similar interests [10,29] and a fireworks-like technique [16,27] is used to route queries within the network. Peer interests may vary from descriptions of document collections [13,20], to topics in a hierarchy [8], schema synopses [7], or ontology concepts [23].…”

Section: Overviewmentioning

confidence: 99%

Rewiring strategies for semantic overlay networks

Raftopoulou

Petrakis

Tryfonopoulos

2009

Distrib Parallel Databases

View full text Add to dashboard Cite

Semantic overlay networks cluster peers that are semantically, thematically or socially close into groups, by means of a rewiring procedure that is periodically executed by each peer. This procedure establishes new connections to similar peers and disregards connections to peers that are dissimilar. Retrieval effectiveness is then improved by exploiting this information at query time (as queries may address clusters of similar peers). Although all systems based on semantic overlay networks apply some rewiring technique, there is no comprehensive study showing the effect of rewiring on system's performance. In this work, a framework for studying the attribution of rewiring strategies in semantic overlay networks is proposed. A generic approach to rewiring is presented and several variants of this approach are reviewed and evaluated. We show how peer organisation is affected by the different design choices of the rewiring mechanism and how these choices affect the performance of the system overall (both in terms of communication overhead and retrieval effectiveness). Our experimental evaluation with real-word data and queries confirms the dependence between rewiring strategies and retrieval performance, and gives insights on the trade-offs involved in the selection of a rewiring strategy.

show abstract

Proactive gossip‐based management of semantic overlay networks

Cited by 33 publications

References 13 publications

Hybrid Dissemination: Adding Determinism to Probabilistic Multicasting in Large-Scale P2P Systems

Hybrid Dissemination: Adding Determinism to Probabilistic Multicasting in Large-Scale P2P Systems

Efficient search based on content similarity over self-organizing P2P networks

Rewiring strategies for semantic overlay networks

Contact Info

Product

Resources

About