Comparison of Access Policies for Replica Placement in Tree Networks

Anne Benoit 1, 2
Abstract : In this paper, we discuss and compare several policies to place replicas in tree networks subject to server capacity. The server capacities and 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 :
Chapitre d'ouvrage
Sips, Henk and Epema, Dick and Lin, Hai-Xiang. Euro-Par 2009 Parallel Processing, 5704, Springer Berlin Heidelberg, pp.253-264, 2009, 978-3-642-03868-6. 〈10.1007/978-3-642-03869-3_26〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01062577
Contributeur : Equipe Roma <>
Soumis le : mercredi 10 septembre 2014 - 10:00:30
Dernière modification le : mardi 16 janvier 2018 - 15:35:39

Identifiants

Collections

Citation

Anne Benoit. Comparison of Access Policies for Replica Placement in Tree Networks. Sips, Henk and Epema, Dick and Lin, Hai-Xiang. Euro-Par 2009 Parallel Processing, 5704, Springer Berlin Heidelberg, pp.253-264, 2009, 978-3-642-03868-6. 〈10.1007/978-3-642-03869-3_26〉. 〈hal-01062577〉

Partager

Métriques

Consultations de la notice

47