PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities

DMCA

PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Francisco Matias Cuenca-acuna , Christopher Peery , Richard P. Martin , Thu D. Nguyen

Citations:

193 - 11 self

BibTeX

@INPROCEEDINGS{Cuenca-acuna03planetp:using,
    author = {Francisco Matias Cuenca-acuna and Christopher Peery and Richard P. Martin and Thu D. Nguyen},
    title = {PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities},
    booktitle = {},
    year = {2003},
    publisher = {IEEE Press}
}

OpenURL

Abstract

Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is an attractive model for information sharing between ad hoc groups of users because of its low cost of entry and explicit model for resource scaling. As communities grow, however, a key challenge becomes finding relevant information. To address this challenge, our design centers around indexing, content search, and retrieval rather than scalable name-based object location, which has been the focus of recent P2P systems. PlanetP takes the novel approach of replicating the global directory and a compact summary index at every peer using gossiping. PlanetP then leverages this information to approximate a state-of-the-art document ranking algorithm to help users locate relevant information within the large communal data set. Using a prototype implementation together with simulation, we show: (i) it is possible to design a gossiping algorithm that reliably maintains a copy of communal state at each peer yet requires only a modest amount of bandwidth, (ii) our content search and retrieval algorithm tracks the performance of the original ranking algorithm very closely, giving P2P communities a search and retrieval algorithm as good as that possible assuming a centralized server, and (iii) PlanetP’s gossiping and search and retrieval algorithms both scale well to communities of at least several thousand peers. 1

Keyphrases

content search relevant information retrieval algorithm present planetp retrieval infrastructure compact summary index share large set scalable name-based object location original ranking novel approach recent p2p system ad hoc group communal state centralized server state-of-the-art document prototype implementation scale well explicit model p2p computing attractive model key challenge design center planetp gossiping global directory modest amount low cost resource scaling large communal data set text document gossiping algorithm

DMCA