Abstract
A hint-based file locating & routing mechanism was proposed to improve the performance of peer-to-peer file sharing systems. The framework was based on the Freenet document routing model with file location hints to enhance the performance of file searching and downloading. Experiment shows that the proposed mechanism improves the system performance by saving disk space, as well as reduces file transfer latency and alleviates network load.
The Project Supported by Zhejiang Provincial Natural Science Foundation of China (No.602032)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Internet2 NetFlow Reports (August 2003), http://netflow.internet2.edu/weekly/20030825/
The KaZaA home page (August 2003), http://www.kazaa.com
The Morpheus home page (August 2003), http://www.morpheus.com
Download.Com Site (August 2003), http://download.com.com
InformaticsOnlineWebSite, http://www.infomaticsonline.co.uk/News/1134977
The Napster home page, http://www.napster.com
Bordignon, F.R.A., et al.: Gnutella: Distributed System for Information Storage and Searching Model Description. Journal of Internet Technology 2(5), , Taipei, Taiwan
Ritter, J.: Why Gnutella Can’t Scale. No, Really (2001)
Markatos, E.P.: Tracing a large-scale Peer to Peer System: an hour in the life of Gnutella. In: 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (2002)
Clarke, I., et al.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. LNCS (2000)
Ratnasamy, S., et al.: A Scalable Content-Addressable Network. In: Proceedings of the ACM SIGCOMM (2001)
Stoicay, I., et al.: Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications. In: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (2001)
Zhao, B.Y., et al.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. U.C.Berkeley Technical Report, UCB//CSD-01-1141 (April 2000)
Rowstron, A., et al.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, November 2001, pp. 329–350 (2001)
Ohaha, Smart decentralized peer-to-peer sharing, http://www.ohaha.com/design.html
Ripeanu, M., et al.: Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal 6(1) (2002)
Sripanidkulchai, K.: The popularity of gnutella queries and its implications on scaling (2001)
Crespo, A., et al.: Routing Indices For Peer-to-Peer Systems. In: International Cofenrence on Distributed Computer Systems (July 2002)
Milojicic, D.S., et al.: Peer-to-Peer Computing. Hewlett-Packard Internal Document (March 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jin, H., Li, S., Ma, T., Qian, L. (2004). A Hint-Based Locating and Routing Mechanism in Peer-to-Peer File Sharing Systems. In: Li, M., Sun, XH., Deng, Qn., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24679-4_70
Download citation
DOI: https://doi.org/10.1007/978-3-540-24679-4_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21988-0
Online ISBN: 978-3-540-24679-4
eBook Packages: Springer Book Archive