Placement of mirrored web servers in ring networks with budget constraint

This paper investigates the placement problem of mirrored web servers in ring networks, where each client accesses the closest mirrored server. Without budget constraint, we propose an efficient algorithm that computes the optimal placement with time complexity O(|C|/sup 2/ /spl times/ |V|). With budget constraint, if all candidate servers charge the same fee, we propose an algorithm to compute the optimal placement in time O(k/sup 2/|C|/sup 3/|V|) by using dynamic programming; if candidates charge different fees, we prove the problem is NP-hard, and further propose two heuristic algorithms. The performance of the proposed placement schemes is evaluated with the traffic-reduction ratio and the budget-usage ratio over a wide range of system parameters.

[1]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[2]  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).

[3]  Michael Mitzenmacher,et al.  Accessing multiple mirror sites in parallel: using Tornado codes to speed up downloads , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Peter A. Dinda,et al.  Performance characteristics of mirror servers on the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[7]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[8]  Deying Li,et al.  Optimal Placement of Web Proxies for Replicated Web Servers in the Internet , 2001, Comput. J..

[9]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[10]  Deying Li,et al.  Placement of Data Replicas for Optimal Data Availability in Ring Networks , 2001, J. Parallel Distributed Comput..

[11]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[12]  Ouri Wolfson,et al.  The multicast policy and its relationship to replicated data placement , 1991, TODS.

[13]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.