Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2011

Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks

Abstract

In this paper, we study the problem of replica placement in tree networks subject to server capacity and distance constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. The Single policy enforces that all requests of a client are served by a single server in the tree, while in the Multiple policy, the requests of a given client can be processed by multiple servers, thus distributing the processing of requests over the platform. For the Single policy, we prove that all instances of the problem are NP-hard, and we propose approximation algorithms. The problem with the Multiple policy was known to be NP-hard with distance constraints, but we provide a polynomial time optimal algorithm to solve the problem in the particular case of binary trees when no request exceeds the server capacity.
Fichier principal
Vignette du fichier
RR-7750.pdf (626.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00630292 , version 1 (08-10-2011)
inria-00630292 , version 2 (03-02-2012)

Identifiers

  • HAL Id : inria-00630292 , version 2

Cite

Anne Benoit, Hubert Larchevêque, Paul Renaud-Goud. Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks. [Research Report] RR-7750, INRIA. 2011, pp.26. ⟨inria-00630292v2⟩
417 View
221 Download

Share

Gmail Facebook X LinkedIn More