Title :
Parallel File Download in Peer-to-Peer Networks with Random Service Capacities
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York, New Paltz, NY, USA
Abstract :
It is well known that the method of parallel downloading can be used to reduce file download times in a peer-to-peer (P2P) network. There has been little investigation on parallel download and chunk allocation for source peers with random service capacities. The main contribution of this paper is to address the problem of efficient parallel file download in P2P networks with random service capacities. A precise analysis of the expected download time is given when the service capacity of a source peer is a random variable. A general framework is developed for analyzing the expected download time of a parallel download and chunk allocation algorithm, and is applied to the analysis of several algorithms. Two chunk allocation algorithms for parallel download are proposed. It is observed that the performance of parallel download can be significantly improved by using the method of probing high-capacity peers. One such algorithm is proposed and its expected parallel download time is analyzed. The performance of these parallel file download algorithms in P2P networks with random service capacities are compared.
Keywords :
peer-to-peer computing; P2P network; chunk allocation algorithm; download time; general framework; parallel file download; peer-to-peer networks; probing high-capacity peers; random service capacities; random variable; source peers; Algorithm design and analysis; IP networks; Peer-to-peer computing; Random variables; Resource management; Servers; Silicon; Chunk allocation; download time; file sharing system; parallel downloading; peer-to-peer network; random service capacity;
Conference_Titel :
Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2013 IEEE 27th International
Conference_Location :
Cambridge, MA
Print_ISBN :
978-0-7695-4979-8
DOI :
10.1109/IPDPSW.2013.20
