Exploiting semantic proximity in peer-to-peer content searching

Voulgaris, Spyros; Kermarrec, Anne-Marie; Massoulié, Laurent

doi:10.1109/ftdcs.2004.1316622

Cited by 64 publications

(70 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Performance of P2P search for such files can be greatly improved if we exploit interest-based locality [16,7,18]: if two peers share interests, (in other words if the contents of their cache overlap significantly) the search mechanism can be significantly improved by having these peers connect to one another and first send their requests to each other. 2 The main country is defined as the country where the majority of replicas are hosted.…”

Section: Geographical Clustering and Video Filesmentioning

confidence: 99%

Clustering in Peer-to-Peer File Sharing Workloads

Fessant

Handurukande

Kermarrec

et al. 2005

Lecture Notes in Computer Science

116

135

View full text Add to dashboard Cite

Peer-to-peer file sharing systems now generate a significant portion of Internet traffic. A good understanding of their workloads is crucial in order to improve their scalability, robustness and performance. Previous measurement studies on Kazaa and Gnutella were based on monitoring peer requests, and mostly concerned with peer and file availability and network traffic. In this paper, we take different measurements: instead of passively recording requests, we actively probe peers to get their cache contents information. This provides us with a map of contents, that we use to evaluate the degree of clustering in the system 1 , and that could be exploited to improve significantly the search process.

show abstract

Section: Geographical Clustering and Video Filesmentioning

confidence: 99%

Clustering in Peer-to-Peer File Sharing Workloads

Fessant

Handurukande

Kermarrec

et al. 2005

Lecture Notes in Computer Science

116

135

View full text Add to dashboard Cite

show abstract

“…For example, application-level multicast might need carefully controlled random networks or trees, depending on the multicast approach [1,2]. Similarly, decentralized search applications benefit from special overlay network structures such as random or scale-free graphs [3,4], superpeer networks [5], networks that are organized based on proximity and/or capacity of the nodes [6,7], or distributed hash tables (DHT-s), for example, [8,9].…”

Section: Introductionmentioning

confidence: 99%

T-Man: Gossip-based fast overlay topology construction

2009

View full text Add to dashboard Cite

Large-scale overlay networks have become crucial ingredients of fully-decentralized applications and peer-to-peer systems. Depending on the task at hand, overlay networks are organized into different topologies, such as rings, trees, semantic and geographic proximity networks. We argue that the central role overlay networks play in decentralized application development requires a more systematic study and effort towards understanding the possibilities and limits of overlay network construction in its generality. Our contribution in this paper is a gossip protocol called T-MAN that can build a wide range of overlay networks from scratch, relying only on minimal assumptions. The protocol is fast, robust, and very simple. It is also highly configurable as the desired topology itself is a parameter in the form of a ranking method that orders nodes according to preference for a base node to select them as neighbors. The paper presents extensive empirical analysis of the protocol along with theoretical analysis of certain aspects of its behavior. We also describe a practical application of T-MAN for building Chord distributed hash table overlays efficiently from scratch.

show abstract

“…Voulgaris et al [11] describe a peer-to-peer overlay network which exploits the structure of the underlying information and proposes methods to semantically group them. In our approach, we use the existing semantic model and form groups based on the relationship between similar concepts.…”

Section: Gossiping Mechanisms In Sensor Middlewarementioning

confidence: 99%

A mediated gossiping mechanism for large-scale sensor networks

Ganz

Barnaghi

Carrez

et al. 2011

2011 IEEE GLOBECOM Workshops (GC Wkshps)

View full text Add to dashboard Cite

Abstract-Gateways in sensor networks are used to relay, aggregate and communicate information from capillary networks to more capable (e.g. IP-based) networks. However Gateway-toGateway (G2G) communication to exchange and update information among the gateways in large-scale sensor networks for query processing, data fusion and other similar tasks has been less discussed in recent works. The requirements for large-scale sensor networks such as dynamic topology and update strategies to reduce the overall network load makes G2G communications an important aspect in the network design. In this paper, we introduce a mediated gossip-based G2G communication mechanism. The proposed solution leverages the publish/subscribe approach and uses high-level context assigned to publish/subscribe channels to enable the information discovery and G2G communications. Gateways store/aggregate sensor observation and measurement data according to specific context which is defined based on features such as spatial and temporal attributes, observed phenomena (i.e. feature of interest) and sensor device features. The gateways communicate with each other to exchange data and also to forward related queries for data aggregation in cases that the data should be aggregated from two different sources. The proposed solution also facilitates reliable sensor service provisioning by enabling gateways to communicate and/or forward requests to other gateways when a resource fails or a sensor node becomes unavailable. We compare our results to probabilistic gossiping algorithms and run benchmarks on different dynamic network topologies based on indicators such as number of sent messages and dissemination delay.

show abstract

Exploiting semantic proximity in peer-to-peer content searching

Cited by 64 publications

References 14 publications

Clustering in Peer-to-Peer File Sharing Workloads

Clustering in Peer-to-Peer File Sharing Workloads

T-Man: Gossip-based fast overlay topology construction

A mediated gossiping mechanism for large-scale sensor networks

Contact Info

Product

Resources

About