An Approximate Algorithm for the servers replication problem with two cost constraints in WAN

The paper deals with the problem of simultaneously assignment of servers replica location, topology, channel capacities and flow routes in the wide area network. Two important cost constraints have been considered during the optimization process: server cost constraint and capacity cost (supporting cost of the network) constraint. In the paper an approximate algorithm for this widespread problem is proposed. Some computational experiments are reported in order to present the quality of the approximate solutions and to show some properties of the considered problem.

[1]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2002, IEEE J. Sel. Areas Commun..

[2]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[3]  Kaushal Chari,et al.  Resource allocation and capacity assignment in distributed systems , 1996, Comput. Oper. Res..

[4]  Chung Gu Kang,et al.  Combined channel allocation and routing algorithms in packet switched networks , 1997, Comput. Commun..

[5]  Doan B. Hoang,et al.  Joint Optimization of Capacity and Flow Assignment in a Packet-Switched Communications Network , 1987, IEEE Trans. Commun..

[6]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Marcin Markowski,et al.  The Web Replica Allocation and Topology Assignment Problem in Wide Area Networks: Algorithms and Computational Results , 2005, ICCSA.

[8]  Krzysztof Walkowiak,et al.  Unsplittable Anycast Flow Problem: Formulation and Algorithms , 2006, International Conference on Computational Science.