Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30184
A P2P File Sharing Technique by Indexed-Priority Metric

Authors: Toshinori Takabatake, Yoshikazu Komano

Abstract:

Recently, the improvements in processing performance of a computer and in high speed communication of an optical fiber have been achieved, so that the amount of data which are processed by a computer and flowed on a network has been increasing greatly. However, in a client-server system, since the server receives and processes the amount of data from the clients through the network, a load on the server is increasing. Thus, there are needed to introduce a server with high processing ability and to have a line with high bandwidth. In this paper, concerning to P2P networks to resolve the load on a specific server, a criterion called an Indexed-Priority Metric is proposed and its performance is evaluated. The proposed metric is to allocate some files to each node. As a result, the load on a specific server can distribute them to each node equally well. A P2P file sharing system using the proposed metric is implemented. Simulation results show that the proposed metric can make it distribute files on the specific server.

Keywords: peer-to-peer, file-sharing system, load-balancing, dependability

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1332380

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1068

References:


[1] Ian J. Taylor, From P2P to web services and grids: Peers in a client/server world, Springer, 2005.
[2] G. Camarilla, Ed. "Peer-to-peer (P2P) architectures," draft-iab-p2parchs- 01.txt, April 18, 2009.
[3] IRTF Research Groups, Peer-to-peer research group, http://www.irtf.org/charter?getype=rg&group=p2prg, May 2009.
[4] J. Risson and T. Moors, "Survey of research towards robust peer-topeer networks: search methods," Computer Networks, vol.50, Issue 17, pp.3485-3521, Dec. 2006.
[5] E.K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, "A survey and comparison of peer-to-peer overlay network schemes," IEEE Communications Surveys and Tutorials, vol.7, Issue 2, pp.72-93, 2005.
[6] R. Hasan, Z. Anwar, W. Yurcik, L. Brumbaugh, and R. Campbell, "A survey of peer-to-peer storage techniques for distributed file systems," Proc. Int-l. Conf. Information Technology: Coding and Computing (ITCC 2005), vol.2, pp.205-213, 2005.
[7] Napster Inc., http://www.napster.com/, May 2009.
[8] Gnutella Protocol Development, http://rfcgnutella. sourceforge.net/index.html/, May 2009.
[9] The Free Network Project, http://freenetproject.org/index.html/, May 2009.
[10] Bittorrent Inc., http://www.bittorrent.com/, May 2009.
[11] Kazaa, http://www.kazaa.com/, May 2009.
[12] OpenNap, http://opennap.sourceforge.net/, May 2009.
[13] H. Balakrishnam, M.F. Kaashoek, D. Karger, R. Morris, I. Stoica, "Looking up data in P2P systems," CACM, vol.46, Issue 2, pp.43-48, Feb. 2003.
[14] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnam, "Chord: A scalable peer-to-peer lookup service for Internet applications," ACM SIGCOMM, pp.149-160, Aug. 2001.
[15] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, "A scalable content-addressable network," ACM SIGCOMM, pp.161-172, Aug. 2001.
[16] P. Maymounkova and D. Mazieres, "Kademlia: A peer-to-peer information system based on the XOR metric," Proc. 1st Int-l. Workshop Peer-to-Peer Systems, pp.53-65, 2002.
[17] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, "Tapestry: A resilient global-scale overlay for service deployment," IEEE J. Selected Areas in Communications, vol.22, no.1, pp.41-53, Jan. 2004.
[18] A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," Proc. IFIP/ACM Int-l. Conf. Distributed Systems Platforms (Middleware), pp.329-350, 2001.
[19] D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A scalable and dynamic emulation of the butterfly," Proc. 21st Annual Symp. Principles of Distributed Computing (PODC-02), pp.183-192, 2002.