Minimizing File Download Time in Stochastic Peer-to-Peer Networks

ABSTRACT:

The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internets band idth usage! "easurement studies sho net or# congestion or the ser$ice capacity fluctuation! %ere that a typical do nload of a file can ta#e from minutes up to se$eral hours depending on the le$el of e consider t o ma&or factors that ha$e significant impact on a$erage do nload time' namely' the spatial heterogeneity of ser$ice capacities in different source peers and the temporal fluctuation in ser$ice capacity of a single source peer! (e point out that the common approach of analy)ing the a$erage do nload time based on a$erage ser$ice capacity is fundamentally fla ed! (e rigorously pro$e that both spatial heterogeneity and temporal correlations in ser$ice capacity increase the a$erage do nload time in P2P net or#s and then analy)e a simple' distributed algorithm to effecti$ely remo$e these negati$e factors' thus minimi)ing the a$erage do nload time! (e sho net or# configurations! !isting S"stem: The early model for content distribution is a centrali)ed one' in hich the ser$ice pro$ider simply sets up a ser$er and e$ery user do nloads files from it! In this type of net or# architecture (ser$er-client)' many users ha$e to compete for limited resources in terms of bottlenec# band idth or processing po er of a single ser$er! *s a result' each user may recei$e $ery poor performance! +rom a single users perspecti$e' the duration of a do nload session' or the do nload time for that indi$idual user is the most often used performance metric! Peer to Peer technology ma#es the system distributed! through analysis and simulations that it outperforms most of other algorithms currently used in practice under $arious

,! 2! /!

-ome of the ma&or challenges facing a P2P net or# in the real selection' data search and routing!

orld include peer

.y reducing actual file transfer time' the do nload time for each user can be minimi)ed! 0o adays' the common approach for analy)e a$erage do nload time is based on *$erage -er$ice capacity! #imitations o$ A%erage Ser%ice ca&acit": .ut it contain t o ma&or significant impact a) b) -patial %eterogeneity Temporal 1orrelation

S&atial 'eterogeneit" and Tem&oral Correlation: In a P2P net or#' &ust li#e any other net or#' the ser$ice capacities from different source peers are different! There are many reasons for this heterogeneity! 2n each peer side' physical connection speeds at different peers $ary o$er a also ide range *lso' it is reasonable to assume that hose processing po ers are fast a peer can most peers in a typical P2P net or# are &ust personal computers' ser$ice others and hence limits the ser$ice capacity! There are many factors causing this fluctuation! +irst' the number of connection a source peer allo s is changing o$er time' hich creates a fluctuation in the ser$ice capacity for each user! -econd' some user applications running on a source peer (usually a P1)' such as online games' may throttle the 1P3 and impact the amount of capacity it can offer! Third' temporary congestion at any lin# in the net or# can also reduce the ser$ice capacity of all users utili)ing that lin#!

idely different! The limitation in the processing po er can limit ho

PR(P(S D S)ST M: ,! 4o nloading time can be reduced by using -imple distributed *lgorithm Information by using stochastic process! %ere analy)e the performance of ,! 2! /! 2! Parallel 4o nloading 5andom 1hun# .ased - itching 5andom Time .ased - itching ith no global

%ere the impact of stochastic $ariations of capacities on the a$erage 4o nload time of each peer in the steady state is more rather than in the impact of sources6do nloaders dynamics in the transient period! *+ $$ect o$ Parallel Downloading: Parallel do nloading impro$es the performance by reducing the file si)e o$er the 7 orst8 source peer and also may increase the ser$ice capacity one recei$es from the net or# by utili)ing 7unused8 capacities of other source peers! If a do nloader utili)es one source peer at a time' s itching around seems to be a good strategy to a$oid the 7bad8 source peer! If the file + is di$ided into 9 chun#s of e:ual si)e' and simultaneous connections are used' the capacity for this do nload session becomes c,;c2;<c#' .ut' it is here ci is the ser$ice capacity of ith connection! Intuiti$ely' this parallel do nloading seems to be optimal in all cases! orth noting that the do nload time for parallel do nloading is gi$en by ma=>t,'t2'< here ti is the do nload time of a chun# o$er ith connection! t#? rather than +@(c,;c2;<c#) ' session! Thus' e$en in the net or# ith one user' parallel do nloading may not reduce the do nload

This is because the chun# that ta#es the longest time to complete determines the entire do nload

time to the predicted $alue in all cases! Instead' the performance of parallel do nload depends upon the distribution of the underlying ser$ice capacities and could be much orse than the ideal case' indeedA it is sho n in B,CD that if e can ma#e the chun#-si)e proportional to the ser$ice capacity of each source peer' parallel do nloading can yield the optimal do nload time

,+ Random Ch-nk Based Switching: In the random chun#-based s itching scheme' the file of interest is di$ided into many small chun#s &ust as in the parallel do nload scheme! * user do nloads chun#s se:uentially one at a time! (hene$er a user completes a chun# from its current source peer' the user randomly selects a ne source peer and connects to it to retrie$e a ne ith a bad source peer' it chun#! In this ay' if the do nloader is currently stuc# ill stay there for only the amount of

time re:uired for finishing one chun#! The do nload time for one chun# is independent of that of the pre$ious chun#! Intuiti$ely' s itching source peers based on chun# can reduce the correlation in ser$ice capacity bet een chun#s and hence reduce the a$erage do nload time! %o e$er' there is another factor that has negati$e impact on the a$erage do nload time' the spatial heterogeneity! .+ Random Time Based Switching: In this section' e analy)e a $ery simple' distributed algorithm and sho that it effecti$ely remo$es correlations in the capacity fluctuation and the heterogeneity in space' thus greatly reducing the a$erage do nload time! *s the algorithm ill be implemented at each do nloading peer in a distributed fashion' throughout this section! In this setup' e can consider the follo ing t o schemesE (I) permanent connection' and (ii) ithout loss of generality' e only focus on a single do nloader

random periodic s itching! +or the first case' the source selection function does not change in time! (hen the searching phase is o$er and a list of a$ailable source peers is gi$en' the do nloader ill choose one of them randomly ith e:ual probability! +or the random periodic s itching' the do nloader randomly chooses a source peer at each time slot' independently of e$erything else!

'ardware Re/-irements F F F F F F F -G-TH" %*54 4I-9 +L2PPG 45IIH "20IT25 "23-H 5*" 9HG.2*54 E Pentium II 2!J K%) E J0 K. E ,!JJ ". E ,C IK* color E Logitech! E 2CM ". E ,,0 #eys enhanced!

So$tware Re/-irements F F F F 2perating system +ront Hnd 1oding Language 4atabase E- (indo s NP Professional E- "icrosoft Iisual -tudio !0et 200C E- *-P!0HT 2!0' 1O 2!0 E- -PL -H5IH5 2000