Abstract
The peer-to-peer (P2P) file sharing applications have gained a tremendous popularity and now they have millions of users worldwide, since they were introduced in 1999. Due to chaotic structure, achieved scale and network dynamics, they mostly employ a flooding-based search to locate required files and therefore they are the main source of Internet traffic. Thus, the study and development of P2P systems is an important research challenge.
This article presents a survey of existing approaches to organize operations of P2P file sharing systems. It gives a classification of existing protocols and discusses the advantages and disadvantages of each technique. It shows that both network structure and search algorithm influence the operations of P2P applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shirky, C.: What is P2P ...and what isn’t? The O’Reilly Network (2000), http://www.openp2p.com/pub/a/p2p/2000/11/24/shirky1-whatisp2p.html
Daswani, N., Garcia-Molina, H., Yang, B.: Open problems in data-sharing peerto- peer systems. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 232–241. Springer, Heidelberg (2002)
Internet2: Weekly reports (2003), http://netflow.internet2.edu/weekly/
Ripeanu, M., Foster, I.: Mapping the Gnutella network: Macroscopic properties of large-scale peer-to-peer systems. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 85–93. Springer, Heidelberg (2002)
Gnutella (2002), http://www.gnutellanews.com
A.: The Gnutella protocol specification v0.4. (2003) 1 In the current version of algorithms. For practical realization, a peer can analyze passing messages, each carrying the content summary of its starting peer, from http://www.LimeWire.com
Wikipedia: FastTrack (2004), http://en.wikipedia.org/wiki/FastTrack
Kazaa (2003), http://www.kazaa.com
Leibowitz, N., Ripeanu, M., Wierzbicki, A.: Deconstructing the Kazaa network. In: 3rd IEEE Workshop on Internet Applications (WIAPP 2003), San Jose, CA, pp. 112–119 (2003)
Lv, C., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: ACM, SIGMETRICS 2002 (2002)
Adamic, L., Huberman, B., Lukose, R., Puniyani, A.: Search in power law networks. Physical Review E 64 (2001), 46135–46143 (2001)
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)
Unger, H., Wulff, M.: Cluster-building in p2p-community networks. In: Akl, S., Gonzalez, T. (eds.) Parallel and Distributed Computing and Systems, Cambridge, USA, pp. 685–690. ACTA Press (2002)
Jain, A.K., Dube, R.C.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)
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)
Rohrs, C.: Query routing for the Gnutella network (2001), http://rfc-gnutella.sourceforge.net
Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communication of ACM 13(7), 422–426 (1970)
Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: 22 nd International Conference on Distributed Computing Systems (ICDCS 2002), Vienna, Austria, pp. 23–33 (2002)
Tsoumakos, D., Roussopoulos, N.: Adaptive probabilistic search for peer-to-peer networks. In: Third International Conference on Peer-to-Peer Computing (P2P 2003), Linköping, Sweden, pp. 102–110 (2003)
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)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of ACM SIGCOMM 2001 (2001)
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, pp. 149–160 (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley (2001)
Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in p2p systems. Communications of the ACM 46, 43–48 (2003)
Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for DHTs: Some open questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 45–51. Springer, Heidelberg (2002)
Chu, J., Labonte, K., Levine, B.: Availability and locality measurements of peer-topeer file systems. In: SPIE ITCom: Scalability and Traffic Control in IP Networks, vol. 4868 (2002)
Sakaryan, G., Unger, H., Lechner, U.: About the value of virtual communities in P2P networks. In: Ramos, F.F., Unger, H., Larios, V. (eds.) ISSADS 2004. LNCS, vol. 3061, Springer, Heidelberg (2004)
Sakaryan, G., Unger, H.: Self-organization in peer to peer communitites. Technical Report UR-TR-0403, University of Rostock, Computer Science Dept. (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakaryan, G., Wulff, M., Unger, H. (2006). Search Methods in P2P Networks: A Survey. In: Böhme, T., Larios Rosillo, V.M., Unger, H., Unger, H. (eds) Innovative Internet Community Systems. IICS 2004. Lecture Notes in Computer Science, vol 3473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553762_6
Download citation
DOI: https://doi.org/10.1007/11553762_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28880-0
Online ISBN: 978-3-540-33995-3
eBook Packages: Computer ScienceComputer Science (R0)