Variable Chunk Based Parallel Switching To Minimizing File Download Time in P2P Network
The Peer-to-peer (P2P) computing has been one
of the emerging technologies in distributed file sharing.
Experimental studies show that for a file download,
service capacity fluctuation takes minutes to several hours.
For a P2P one of the fundamental performances metric is
the average download time. The common approach to
analyse the average download time is average service
capacity. Heterogeneity and fluctuation have significant
impact on service capacity and hence the averages
download time. Random Chunk Based Switching is one of
the file downloading scheme where, the file to be
downloaded is divided into many chunks but the short
comes of this scheme are user sequentially download one
chunk at a time, also if user gets stuck in a low service
capacity peer, downloading a fixed amount of bytes from
that peer may take a long time and here chunk size
remains fixed and it does not change with time. We
propose a new approach where chunk size changes with
time and our model provides no. Of parallel connections
which changes with hardware utilization which overcomes
the shortcomings of Random Chunk Based Switching.
Keywords: Service Capacity, P2P Connection
Download Full-Text
