The web replica allocation and topology assignment problem in wide area networks: Algorithms and computational results

Abstract

This paper studies the problem of designing wide area networks. In the paper the web replica allocation and topology assignment problem with budget constraint is considered. The goal is select web replica allocation at nodes, network topology, channel capacities and flow routes in order to minimize average delay per packet and web replica connecting cost at nodes subject to budget constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Also an approximate algorithm is presented. Some computational results are reported. Based on computational experiments, several properties of the considered problem are formulated. © Springer-Verlag Berlin Heidelberg 2005.