Gossip-based search selection in hybrid peer-to-peer networks

Concurrency and Computation: Practice and Experience

Volumn 20, Issue 2, 2008, Pages 139-153

  Zaharia, M ^a   Keshav, S ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Global statistics; Gossip; Peer to peer systems; Search

Indexed keywords

FLOODS;

DISTRIBUTED HASH TABLES; GLOBAL STATISTICS; GOSSIP; HYBRID PEER-TO-PEER NETWORK; OPERATING ENVIRONMENT; PEER-TO-PEER SYSTEM; SEARCH; TRACE DRIVEN SIMULATION;

PEER TO PEER NETWORKS;

EID: 57249108442     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1188     Document Type: Article

References (16)

1. Loo BT, Huebsch R, Stoica I, Hellerstein JM. The case for a hybrid P2P search infrastructure. Proceedings of IPTPS (Lecture Notes in Computer Science, vol. 3279). Springer: Berlin, 2004; 141-150.
2. Loo BT, Hellerstein JM, Huebsch R, Shenker S, Stoica I. Enhancing P2P file-sharing with an Internet-scale query processor. Proceedings of the 30th VLDB Conference, 2004.
3. Reynolds P, Vahdat A. Efficient peer-to-peer keyword searching. Proceedings of Middleware, 2003.
4. Balakrishnan H, Kaashoek MF, Karger D, Morris R, Stoica I. Looking up data in P2P systems. Communications of the ACM 2003; 46(2):43-48.
5. Saroiu S. Gummadi KP, Cribble SD. Measuring and analyzing the characteristics of Napster and Gnutella hosts. Multimedia Systems Journal 2003; 9(2):170-184
6. Dwarkadas S, Tang C. Hybrid global-local indexing for efficient peer-to-peer information retrieval. Proceedings of NSDI, 2004.
7. Gnutella, http://www.gnutella.com [30 January 2007].
8. Flajolet P, Martin GN. Probabilistic counting algorithms for database applications. Journal of Computer and System Sciences 1985; 31:182-209.
9. Nath S, Gibbons P, Seshan S, Anderson Z. Synopsis diffusion for robust aggregation in sensor networks. Proceedings of SenSys, November 2004. ACM Press: New York, 2004; 250-262.
10. Kempe D, Dobra A, Gehrke J. Gossip-based computation of aggregation information. Proceedings of IEEE FOCS. IEEE Computer Society Press: Washington, DC, 2003; 482-493.
11. Boyd S, Ghosh A, Prabhakar B, Shah D. Gossip algorithms: Design, analysis, and applications. Proceedings of INFOCOM 2005, March 2005. IEEE Press: Piscataway, NJ, 2005; 1653-1664.
12. Carta D. Two fast implementations of the 'minimal standard' random number generator. Communications of the ACM 1990; 33(l):87-88.
13. Zaharia MA, Keshav S. Efficient and adaptive search in peer to peer networks. Technical Report 2004-55, University of Waterloo, 2004.
14. Gummadi KP, Dunn RJ, Saroiu S, Gribble SD, Levy HM, Zahorjan J. Measuring, modeling and analysis of a peer-to-peer file-sharing workload. Proceedings of the 19th SOSP, October 2003.
15. Demers A, Greene D, Hauser C, Irish W, Larson J. Epidemic algorithms for replicated database maintenance. Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing. ACM Press: New York, 1987; 1-12.
16. Keshav S. Efficient and approximate computation of global state. ACM Computer Communication Review 2006; 36(l):69-74.