Cost-Minimizing Algorithm for Replica Allocation and Topology Assignment Problem in WAN
- 775 Downloads
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.
Keywordsresource replication topology assignment WAN
- 1.Markowski, M., Kasprzak, A.: The Three-Criteria Servers Replication and Topology Assignment Problem in Wide Area Networks. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3982, pp. 1119–1128. Springer, Heidelberg (2006)CrossRefGoogle Scholar
- 2.Markowski, M., Kasprzak, A.: An Exact Algorithm for the Servers Allocation, Capacity and Flow Assignment Problem with Cost Criterion and Delay Constraint in Wide Area Networks. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4487, pp. 442–445. Springer, Heidelberg (2007)CrossRefGoogle Scholar