PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities
Authors:
- F.M. Cuenca-AcunaFCF.M. Cuenca-Acuna
- C. PeeryCPC. Peery
- R.P. MartinRMR.P. Martin
- T.D. NguyenTNT.D. Nguyen
- 24 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 236-246
Abstract
We introduce PlanetP, a content addressable publish/subscribe service for unstructured peer-to-peer (P2P) communities. PlanetP supports content addressing by providing: (1) a gossiping layer used to globally replicate a membership directory and an extremely compact content index, and (2) a completely distributed content search and ranking algorithm that helps users find the most relevant information. PlanetP is a simple, yet powerful system for sharing information. PlanetP is simple because each peer must only perform a periodic, randomized, point-to-point message exchange with other peers. PlanetP is powerful because it maintains a globally content-ranked view of the shared data. Using simulation and a prototype implementation, we show that PlanetP achieves ranking accuracy that is comparable to a centralized solution and scales easily to several thousand peers while remaining resilient to rapid membership changes.Keywords
This publication has 15 references indexed in Scilit:
- Searchable words on the WebInternational Journal on Digital Libraries, 2005
- AstrolabeACM Transactions on Computer Systems, 2003
- Analysis of the evolution of peer-to-peer systems2002
- A scalable content-addressable network2001
- Chord2001
- Resource discovery in distributed networks1999
- Searching distributed collections with inference networks1995
- The effectiveness of GIOSS for the text database discovery problemACM SIGMOD Record, 1994
- Epidemic algorithms for replicated database maintenance1987
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970