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.
Type de document :
Pré-publication, Document de travail
RR-LIP-2009-12. 2009
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger
Contributeur : Anne Benoit <>
Soumis le : vendredi 10 avril 2009 - 12:12:46
Dernière modification le : vendredi 20 avril 2018 - 15:44:24
Document(s) archivé(s) le : vendredi 12 octobre 2012 - 16:30:43


Fichiers produits par l'(les) auteur(s)


  • HAL Id : ensl-00374927, version 1



Anne Benoit. Comparison of Access Policies for Replica Placement in Tree Networks. RR-LIP-2009-12. 2009. 〈ensl-00374927〉



Consultations de la notice


Téléchargements de fichiers