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

Abstract : This paper deals with the replica placement problem on fully homogeneous tree networks known as the \REP 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.
Document type :
Reports
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02101772
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:05:53 AM
Last modification on : Wednesday, November 20, 2019 - 2:54:28 AM

File

RR2007-10.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101772, version 1

Collections

Citation

Veronika Rehn. Optimal Closest Policy with QoS and Bandwidth Constraints for Placing Replicas in Tree Networks.. [Research Report] LIP RR-2007-10, Laboratoire de l'informatique du parallélisme. 2007, 2+11p. ⟨hal-02101772⟩

Share

Metrics

Record views

3

Files downloads

7