Using structured P2P overlay networks to build content sensitive communities

Paul Stacey, Damon Berry, Eugene Coyle

Research output: Contribution to conferencePaperpeer-review

Abstract

This paper details a proposed peer-to-peer system, which allows a user to join communities of other like-minded users in order to exchange files. Utilising the routing capabilities of Pastry, the proposed system includes an indexing service, which will facilitate the creation of virtual rendezvous points for users with similar interests (manifested by shared keywords). Users will be described by the content they store. By using Vector Space Modelling techniques users can be grouped together to form content sensitive communities. The system is built to serve as the basis for a distributed archive of research papers. The system is designed to improve the efficiency of file searches over current p2p file sharing applications. Search requests result in a comprehensive set of relevant documents being returned as searching will be based on semantic meaning rather than literal matching.

Original languageEnglish
Pages281-288
Number of pages8
DOIs
Publication statusPublished - 2004
EventProceedings - Tenth International Conference on Parallel and Distributed Systems (ICPADS 2004) - Newport Beach, CA, United States
Duration: 7 Jul 20049 Jul 2004

Conference

ConferenceProceedings - Tenth International Conference on Parallel and Distributed Systems (ICPADS 2004)
Country/TerritoryUnited States
CityNewport Beach, CA
Period7/07/049/07/04

Keywords

  • peer-to-peer system
  • communities
  • exchange files
  • Pastry
  • indexing service
  • virtual rendezvous points
  • shared keywords
  • vector space modelling
  • content sensitive communities
  • distributed archive
  • research papers
  • file searches
  • semantic meaning

Fingerprint

Dive into the research topics of 'Using structured P2P overlay networks to build content sensitive communities'. Together they form a unique fingerprint.

Cite this