Issue No. 12 - December (2008 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.25
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. The standard approach in the literature is to enforce that all requests of a client be served by the closest server in the tree. We introduce and study two new policies. In the first policy, all requests from a given client are still processed by the same server, but this server can be located anywhere in the path from the client to the root. In the second policy, the requests of a given client can be processed by multiple servers. One major contribution of this paper is to assess the impact of these new policies on the total replication cost. Another important goal is to assess the impact of server heterogeneity. In this paper, we establish several new complexity results, and provide several efficient polynomial heuristics for NP-complete instances of the problem. The absolute performance of these heuristics is assessed by comparison with the optimal solution provided by the formulation of the problem in terms of the solution of an integer linear program.
Parallelism and concurrency, Sequencing and scheduling, Reducibility and completeness
V. Rehn-Sonigo, A. Benoit and Y. Robert, "Replica Placement and Access Policies in Tree Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 1614-1627, 2008.