Optimal Closest Policy with QoS and Bandwidth Constraints for Placing Replicas in Tree Networks

Veronika Rehn-Sonigo 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 : This paper deals with the replica placement problem on fully homogeneous tree networks known as the Replica Placement optimization problem. The client requests are known beforehand, while the number and location of the servers are to be determined. We investigate the latter problem using the Closest access policy when adding QoS and bandwidth constraints. We propose an optimal algorithm in two passes using dynamic programming.
Complete list of metadatas

https://hal.inria.fr/inria-00156747
Contributor : Veronika Rehn-Sonigo <>
Submitted on : Wednesday, June 27, 2007 - 10:33:05 AM
Last modification on : Friday, April 20, 2018 - 3:44:24 PM
Long-term archiving on : Tuesday, September 21, 2010 - 1:35:34 PM

Files

rr-bandwidth.inria.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00156747, version 2
  • ARXIV : 0706.3350

Collections

Citation

Veronika Rehn-Sonigo. Optimal Closest Policy with QoS and Bandwidth Constraints for Placing Replicas in Tree Networks. [Research Report] 2007. ⟨inria-00156747v2⟩

Share

Metrics

Record views

3

Files downloads

9