The paper deals with the problem of simultaneously assignment of network topology and server's replica placement in the wide area network in order to minimize the criterion composed of the leasing capacity cost and the building cost of the network. An exact algorithm, based on the branch and bound method, is proposed to solve the problem. Algorithm takes into account the problem of ensuring the reliability of the network. Some interesting features, observed during the computational experiments are reported. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Markowski, M., & Kasprzak, A. (2008). Cost-minimizing algorithm for replica allocation and topology assignment problem in WAN. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5101 LNCS, pp. 549–558). https://doi.org/10.1007/978-3-540-69384-0_60
Mendeley helps you to discover research relevant for your work.