Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/IPDPSW.2013.20 | IPDPS Workshops |
Keywords | Field | DocType |
random variable,chunk allocation,random service capacities,parallel file download algorithm,file download time,random service capacity,chunk allocation algorithm,parallel downloading,source peers,peer-to-peer network,parallel file download,expected download time,parallel download,p2p network,probing high-capacity peers,general framework,peer-to-peer networks,file sharing system,peer-to-peer computing,efficient parallel file download,download time,expected parallel download time,servers,silicon,resource management,random variables,algorithm design and analysis | Random variable,Peer-to-peer,Computer science,Upload,Computer network,File sharing system,Download,Peer to peer computing,Allocation algorithm,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-0-7695-4979-8 | 2 | 0.38 |
References | Authors | |
12 | 1 | |