Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy

This paper deals with the replica placement problem on fully homogeneous tree networks known as the Replica Placement optimization problem. The client requests are known beforehand, while the number and location of the servers are to be determined. We investigate the latter problem using the Closest access policy when adding QoS and bandwidth constraints. We propose an optimal algorithm in two passes using dynamic programming.

[1]  Magnus Karlsson,et al.  Choosing replica placement heuristics for wide-area systems , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[2]  Jianliang Xu,et al.  QoS-aware replica placement for content distribution , 2005, IEEE Transactions on Parallel and Distributed Systems.

[3]  Magnus Karlsson,et al.  A Framework for Evaluating Replica Placement Algorithms , 2002 .

[4]  Yi-Fang Lin,et al.  Optimal placement of replicas in data grid environments with locality assurance , 2006, 12th International Conference on Parallel and Distributed Systems - (ICPADS'06).

[5]  Shay Kutten,et al.  Optimal allocation of electronic content , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Yves Robert,et al.  Strategies for Replica Placement in Tree Networks , 2006, 2007 IEEE International Parallel and Distributed Processing Symposium.

[7]  Yves Robert,et al.  Impact of QoS on Replica Placement in Tree Networks , 2007, International Conference on Computational Science.