Abstract
Even though recent research has identified many different uses for peer-to-peer (P2P) architectures, file sharing remains the dominant (by far) P2P application on the Internet. Despite various legal problems, the number of users participating in these file-sharing systems, and number of files transferred, continues to grow at a remarkable pace. Filesharing applications are thus becoming an increasingly important feature of the Internet landscape and, as such, the scalability of these P2P systems is of paramount concern. While the peer-to-peer nature of data storage and data transfer in these systems is inherently scalable, the scalability of file location and query resolution is much more problematic.
The Freenet system is what we would call a “loosely structured” system; file placement is affected by routing hints that are based on the object’s identifiers; these locations are not precisely specified and so not all searches succeed.
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
Adamic, L., Huberman, B., Lukose, R., AND Puniyani, A. Search in power law networks. Physical Review. E 64 (2001), 46135–46143.
Clarke, I., Sandberg, O., Wiley, B., AND Hong, T. Freenet: A Distributed Anonymous Information Storage and Retrieval System. ICSI Workshop on Design Issues in Anonymity and Unobservability, July 2000.
Cohen, E., AND Shenker, S. Optimal replication in random search networks. preprint, 2001.
Infrasearch. http://www.infrasearch.com.
Kazaa. http://www.kazaa.com.
Krishnamurthy, B., AND Wang, J. On network-aware clustering of web clients. In Proceedings of SIGCOMM’ 00 (Stockholm, Sweden, Aug. 2000).
Krishnamurthy, B., Wang, J., AND Xie, Y. Early measurements of a cluster-based architecture for p2p systems. In ACM SIGCOMM Internet Measurement Workshop (San Francisco, Nov. 2001).
Lv, Q., Cao, P., Cohen, E., Li, K., AND Shenker, S. Search and replication in unstructured peer-to-peer networks. preprint, 2001.
Ratnasamy, S., Francis, P., Handley, M., Karp, R., AND Shenker, S. A Scalable Content-Addressable Network. In Proceedings of SIGCOMM 2001 (Aug. 2001).
Rowstron, A., AND Druschel, P. Storage management and caching in PAST, a largescale, persistent peer-to-peer storage utility. In Proceedings of the Eighteenth SOSP (2001), ACM.
Saroiu, S., Gummadi, K., AND Gribble, S. A measurement study of peer-to-peer file sharing systems. In Proceedings of Multimedia Conferencing and Networking (San Jose, Jan. 2002).
Sripanidkulchai, K. The popularity of gnutella queries and its implications on scalability. In O’Reilly’s www.openp2p.com (Feb. 2001).
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., AND Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of SIGCOMM 2001 (Aug. 2001).
Witten, I. H., Moffat, A., AND Bell, T. C. Managing Gigabytes: Compressing and Indexing Documents and Images, second ed. Morgan Kaufmann, 1999.
Zhao, B., Kubiatowicz, J., AND Joseph, A. Tapestry: An infrastructure for faulttolerant wide-area location and routing. UCB Technical Report, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lv, Q., Ratnasamy, S., Shenker, S. (2002). Can Heterogeneity Make Gnutella Scalable?. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds) Peer-to-Peer Systems. IPTPS 2002. Lecture Notes in Computer Science, vol 2429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45748-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-45748-8_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44179-3
Online ISBN: 978-3-540-45748-0
eBook Packages: Springer Book Archive