Algorithms for Selecting Multiple Mirror Sites for Parallel Download

Summary In this paper, we present a mathematical model that describes the problem of parallel download from multiple mirror sites. Based on the model, we present algorithms for selecting the best subset of mirror sites for parallel download. The versions of brutal force algorithms and genetic algorithms are implemented. Performance of these algorithms on the simulated network topology as well as a real-world network topology is presented.

[1]  Vern Paxson,et al.  Measurements and analysis of end-to-end Internet dynamics , 1997 .

[2]  Ellen W. Zegura,et al.  Application-layer anycasting: a server selection architecture and use in a replicated Web service , 2000, TNET.

[3]  G. Clark,et al.  Reference , 2008 .

[4]  李幼升,et al.  Ph , 1989 .

[5]  Vidroha Debroy,et al.  Genetic Programming , 1998, Lecture Notes in Computer Science.

[6]  Pablo Rodriguez,et al.  Parallel-access for mirror sites in the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  Mary Baker,et al.  Nettimer: A Tool for Measuring Bottleneck Link Bandwidth , 2001, USITS.