Evènement pour le groupe Algorithmique Distribuée

Date 2012-07-03  14:00-15:00
TitreSome algorithms for replica placement with distance constraints in tree networks  
RésuméThe problem of replica placement in tree networks subject to server capacity and distance constraints is considered. 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. Intervenant: Hubert Larchevêque 
Lieus. 076 
OrateurHubert Larchevêque 

Aucun document lié à cet événement.

Retour à l'index