Comparison of Access Policies for Replica Placement in Tree Networks

Anne Benoit 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 sub ject to server capacity. 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 a single server in the tree (Single). One major contribution of this paper is to assess the impact of a new policy in which requests of a given client can be processed by multiple servers (Multiple), thus distributing the processing of requests over the platform. We characterize problem instances for which Multiple cannot be more than two times better than the optimal Single solution, if this latter exists. For such instances, we provide a procedure which builds a Single solution with a guarantee on its cost. This is a very interesting result for applications which do not accept multiple servers for a given client, since it might be more difficult to implement such a complex strategy.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00374927
Contributor : Anne Benoit <>
Submitted on : Friday, April 10, 2009 - 12:12:46 PM
Last modification on : Friday, April 20, 2018 - 3:44:24 PM
Long-term archiving on : Friday, October 12, 2012 - 4:30:43 PM

File

rr2009-12.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00374927, version 1

Collections

Citation

Anne Benoit. Comparison of Access Policies for Replica Placement in Tree Networks. 2009. ⟨ensl-00374927⟩

Share

Metrics

Record views

247

Files downloads

155