Using structured P2P overlay networks to build content sensitive communities

Author

Stacey, Paul ; Berry, Damon ; Coyle, Eugene

Author_Institution

Sch. of Control Syst. & Electr. Eng., Dublin Inst. of Technol., Ireland

fYear

2004

fDate

7-9 July 2004

Firstpage

281

Lastpage

288

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 facilitates the creation of virtual rendezvous points for users with similar interests (manifested by shared keywords). Users are 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 are based on semantic meaning rather than literal matching.

Keywords

Internet; electronic data interchange; indexing; information retrieval; peer-to-peer computing; P2P file sharing applications; content sensitive communities; content storage; distributed paper archive; file exchange; file searches; indexing service; literal matching; peer-to-peer system; search requests; semantic meaning; shared keywords; structured P2P overlay networks; using vector space modelling; Control systems; Indexing; Internet; Network servers; Peer to peer computing; Routing; Scalability; Surges; Web server; Web sites;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Systems, 2004. ICPADS 2004. Proceedings. Tenth International Conference on

ISSN

1521-9097

Print_ISBN

0-7695-2152-5

Type

conf

DOI

10.1109/ICPADS.2004.1316106

Filename

1316106