Dynamically Distributed Parallel Permanent connection - D2P for minimizing file download time in Peer-to-Peer networks

The peer-to-peer (P2P) networks is heavily used for content distribution applications and are becoming increasingly popular for Internet file sharing. Generally the download of a file can take from minutes up to several hours depending on the level of network congestion or the service capacity fluctuation. In this paper, we consider two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a single source peer. We prove that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then analyze a simple, distributed algorithm to minimize the file download time. Here, we have designed a new distributed algorithm namely dynamically distributed parallel permanent (D2P) connection that effectively removes the negative factors of the existing parallel downloading, chunk based switching, periodic switching, thus minimizing the average download time. In our design, the downloader randomly chooses multiple source peers and divides the file randomly into chunks and download happens in parallel for the fixed time slot t and source selection function does not change for that fixed time slot. Our dynamically distributed parallel permanent (D2P) connection effectively removes correlations in the capacity fluctuation and the heterogeneity in space, thus greatly reducing the average download time.