Exploiting semantic proximity in peer-to-peer content searching

@article{Voulgaris2004ExploitingSP,
  title={Exploiting semantic proximity in peer-to-peer content searching},
  author={Spyros Voulgaris and Anne-Marie Kermarrec and Laurent Massouli{\'e} and Maarten van Steen},
  journal={Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.},
  year={2004},
  pages={238-243}
}
  • S. Voulgaris, A. Kermarrec, M. V. Steen
  • Published 26 May 2004
  • Computer Science
  • Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004.
A lot of recent work has dealt with improving performance of content searching in peer-to-peer file sharing systems. In this paper we attack this problem by modifying the overlay topology describing the peer relations in the system. More precisely, we create a semantic overlay, linking nodes that are "semantically close", by which we mean that they are interested in similar documents. This semantic overlay provides the primary search mechanism, while the initial peer-to-peer system provides the… 

Figures from this paper

Integrating File Popularity and Peer Generosity in Proximity Measure for Semantic-based Overlays
TLDR
This paper proposes a refined proximity measure taking into account peer generosity and file popularity, and proposes an epidemic algorithm to compute in a fully decentralised fashion an estimation of files popularity.
Epidemic-Style Management of Semantic Overlays for Content-Based Searching
TLDR
This paper proposes a proactive method to build a semantic overlay based on an epidemic protocol that clusters peers with similar content, and is worth noting that this peer clustering is done in a completely implicit way, that is, without requiring the user to specify his preferences or to characterize the content of files he shares.
Expertise-Based Peer Selection
TLDR
In simulation experiments complemented with a real-world field experiment, it is shown how expertise based peer selection improves the performance of a Peer-to-Peer system with respect to precision, recall and the number of messages.
pRoute: Peer selection using shared term similarity matrices
TLDR
The pRoute system where peers advertise a short description of the content that they share, namely a set of terms, is presented, where peers remember the advertisements of related peers and thereby form a semantic overlay by which peers with similar content are grouped together.
Exploiting semantic clustering in the eDonkey P2P network
TLDR
This paper evaluates several strategies to exploit the semantic proximity between peers against a real trace collected in November 2003 in the eDonkey 2000 peer-to-peer network to confirm the presence of clustering in such networks and the interest to exploit it.
Similarity-Based Content Retrieval in Self-Organizing Peer-to-Peer Networks
TLDR
The proposed dynamic reorganization of peer-to-peer networks relies on folksonomy, which gained wide use in figuring out content similarity in various social networks, to make query routing and content retrieval efficient.
PROXSEM: Interest-Based Proximity Measure to Improve Search Efficiency in P2P Systems
  • Yann Busnel, A. Kermarrec
  • Computer Science
    Fourth European Conference on Universal Multiservice Networks (ECUMN'07)
  • 2007
TLDR
The proposed PROXSEM is evaluated by simulation against a real peer-to-peer file sharing system (eDonkey) workload and results show the effectiveness of the proposed approach.
Expertise-based peer selection in Peer-to-Peer networks
TLDR
In simulation experiments complemented with a real-world field experiment, it is shown how expertise-based peer selection improves the performance of a Peer-to-Peer system with respect to precision, recall and the number of messages.
Emerging semantic communities in peer web search
TLDR
The results suggest that 6S, despite its use of an unstructured overlay network; can effectively foster the spontaneous formation of semantic communities through local peer interactions alone.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 18 REFERENCES
Peer-to-peer information retrieval using self-organizing semantic overlay networks
TLDR
Experiments show that pSearch can achieve performance comparable to centralized information retrieval systems by searching only a small number of nodes, and techniques that help distribute the indices more evenly across the nodes are described.
Semantic Overlay Networks for P2P Systems
TLDR
The results show that SONs can significantly improve query performance while at the same time allowing users to decide what content to put in their computers and to whom to connect.
Efficient content location using interest-based locality in peer-to-peer systems
  • K. Sripanidkulchai, B. Maggs, Hui Zhang
  • Computer Science
    IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
  • 2003
TLDR
This work proposes a content location solution in which peers loosely organize themselves into an interest- based structure on top of the existing Gnutella network, and demonstrates the existence of interest-based locality in five diverse traces of content distribution applications, two of which are traces of popular peer-to-peer file-sharing applications.
Associative search in peer to peer networks: harnessing latent semantics
  • E. Cohen, A. Fiat, Haim Kaplan
  • Computer Science
    IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
  • 2003
TLDR
The design is based on unstructured architectures such as gnutella and FastTrack, and retains many of their appealing properties including support for partial match queries, and relative resilience to peer failures, and obtains orders of magnitude improvement in the efficiency of locating rare items.
Intelligent Club Management in Peer-to-Peer Networks
TLDR
This work draws on ideas from the economics literature of club goods and the information retrieval literature to propose next generation P2P file sharing architectures that rely on content-based, self organizing communities of peers to address issues of congestion, inefficiencies and cost implications.
Search and replication in unstructured peer-to-peer networks
TLDR
This paper proposes a query algorithm based on multiple random walks that resolves queries almost as quickly as Gnutella's flooding method while reducing the network traffic by two orders of magnitude in many cases.
Replication strategies in unstructured peer-to-peer networks
TLDR
A new understanding of replication is shown and it is shown that currently deployed replication strategies are far from optimal and that optimal replication is attainable by protocols that resemble existing ones in simplicity and operation.
Peer-to-Peer Membership Management for Gossip-Based Protocols
TLDR
This paper presents SCAMP (Scalable Membership protocol), a novel peer-to-peer membership protocol which operates in a fully decentralized manner and provides each member with a partial view of the group membership and proposes additional mechanisms to achieve balanced view sizes even with highly unbalanced subscription patterns.
Making gnutella-like P2P systems scalable
TLDR
This work proposes several modifications to Gnutella's design that dynamically adapt the overlay topology and the search algorithms in order to accommodate the natural heterogeneity present in most peer-to-peer systems.
Content Networks: Taxonomy and New Approaches
  • H. Kung, Chun-Hsin Wu
  • Computer Science, Business
    The Internet as a Large-Scale Complex System
  • 2005
TLDR
The proposed new content networks, called semantic content-sensitive networks, offer desirable features such as support for content-proximity searches and the use of small routing tables.
...
1
2
...