Search methods in P2P networks: A survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3473 LNCS, Issue , 2006, Pages 59-68

  Sakaryan, German ^a   Wulff, Markus ^a   Unger, Herwig ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INTERNET; NETWORK PROTOCOLS; TELECOMMUNICATION TRAFFIC; USER INTERFACES;

NETWORK DYNAMICS; P2P SYSTEMS; SEARCH ALGORITHMS;

COMPUTER NETWORKS;

EID: 33744800249     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11553762_6     Document Type: Conference Paper

References (29)

1. Shirky, C.: What is P2P ...and what isn't? The O'Reilly Network. http://www.openp2p.com/pub/a/p2p/2000/11/24/shirky1-whatisp2p.html (2000)
2. Daswani, N., Garcia-Molina, H., Yang, B.: Open problems in data-sharing peer-to-peer systems. In: Database Theory-ICDT 2003, 9th International Conference. Volume 2572 of Lecture Notes in Computer Science., Siena, Italy, Springer (2003) 232-241
3. Internet2: Weekly reports, http://netflow.internet2.edu/weekly/ (2003)
4. Ripeanu, M., Foster, I.: Mapping the Gnutella network: Macroscopic properties of large-scale peer-to-peer systems. In: Peer-to-Peer Systems, First International Workshop, IPTPS 2002, Revised Papers. Volume 2429 of Lecture Notes in Computer Science., Cambridge, MA, USA, Springer-Verlag, Berlin (2002) 85-93
5. Gnutella: http://www.gnutellanews.com (2002)
6. from http://www.LimeWire.com, A.: The Gnutella protocol specification v0.4. (2003)
7. Wikipedia: FastTrack. http://en.wikipedia.org/wiki/FastTrack (2004)
8. Kazaa: http://www.kazaa.com (2003)
9. Leibowitz, N., Ripeanu, M., Wierzbicki, A.: Deconstructing the Kazaa network. In: 3rd IEEE Workshop on Internet Applications (WIAPP'03), San Jose, CA (2003) 112-119
10. Lv, C., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: ACM, SIGMETRICS 2002. (2002)
11. Adamic, L., Huberman, B., Lukose, R., Puniyani, A.: Search in power law networks, Physical Review E 64 (2001) (2001) 46135-46143
12. Deo, N., Gupta, P.: World Wide Web: A graph-theoretic perspective. Technical Report CS-TR-01-001, School of Computer Science, University of Central Florida, Orlando, FL 32816, USA (2001)
13. Unger, H., Wulff, M.: Cluster-building in p2p-community networks. In Akl, S., Gonzalez, T., eds.: Parallel and Distributed Computing and Systems, Cambridge, USA, ACTA Press (2002) 685-690
14. Jain, A.K., Dube, R.C.: Algorithms for Clustering Data. Prentice Hall (1988)
15. Krishnamurthy, B., Wang, J., Xie, Y.: Early measurements of a cluster-based architecture for P2P systems. In: ACM SIGCOMM Internet Measurement Workshop, San Francisco, USA (2001)
16. Rohrs, C.: Query routing for the Gnutella network. http://rfc-gnutella. sourceforge.net (2001)
17. Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communication of ACM 13(7) (1970) 422-426
18. Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: 22 nd International Conference on Distributed Computing Systems (ICDCS'02), Vienna, Austria (2002) 23-33
19. Tsoumakos, D., Roussopoulos, N.: Adaptive probabilistic search for peer-to-peer networks. In: Third International Conference on Peer-to-Peer Computing (P2P'03), Linköping, Sweden (2003) 102-110
20. Tsoumakos, D., Roussopoulos, N.: A comparison of peer-to-peer search methods. In: Sixth International Workshop on the Web and Databases., San Diego, USA (2003)
21. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of ACM SIGCOMM 2001. (2001)
22. Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: Proceedings of ACM SIGCOMM 2001, (2001) 149-160
23. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). (2001) 329-350
24. Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley (2001)
25. Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in p2p systems. Communications of the ACM 46 (2003) 43-48
26. Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for DHTs: Some open questions. In: Peer-to-Peer Systems, First International Workshop, IPTPS 2002, Revised Papers. Volume 2429 of Lecture Notes in Computer Science., Cambridge, MA, USA, Springer-Verlag, Berlin (2002) 45-51
27. Chu, J., Labonte, K., Levine, B.: Availability and locality measurements of peer-to-peer file systems. In: SPIE ITCom: Scalability and Traffic Control in IP Networks. Volume 4868. (2002)
28. Sakaryan, G., Unger, H., Lechner, U.: About the value of virtual communities in P2P networks. In: 4th IEEE International Symposium and School on Advanced Distributed Systems (ISSADS 2004), Guadalajara,Mexico (2004)
29. Sakaryan, G., Unger, H.: Self-organization in peer to peer communitites. Technical Report UR-TR-0403, University of Rostock, Computer Science Dept. (2003)