Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Strategies for Replica Placement in Tree Networks

Yves Robert 1, 2 Anne Benoit 1, 2 Veronika Rehn 1, 2 
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and 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, both from a theoretical and a practical perspective. In this paper, we establish several new complexity results, and provide several efficient polynomial heuristics for NP-complete instances of the problem. These heuristics are compared to an absolute lower bound provided by the formulation of the problem in terms of the solution of an integer linear program.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, December 8, 2006 - 1:43:08 PM
Last modification on : Wednesday, October 26, 2022 - 8:14:24 AM




Yves Robert, Anne Benoit, Veronika Rehn. Strategies for Replica Placement in Tree Networks. [Research Report] RR-6012, LIP RR-2006-30, INRIA, LIP. 2006, pp.39. ⟨inria-00111963v2⟩



Record views


Files downloads