期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2007
卷号：7
期号：10
页码：273-278
出版社：International Journal of Computer Science and Network Security
摘要：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.
