Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy

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.
Fichier principal
Vignette du fichier
RR-6233.pdf (216.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00156747 , version 1 (22-06-2007)
inria-00156747 , version 2 (27-06-2007)
inria-00156747 , version 3 (27-06-2007)
inria-00156747 , version 4 (28-06-2007)
inria-00156747 , version 5 (28-06-2007)

Identifiers

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

Cite

Veronika Rehn-Sonigo. Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy. [Research Report] RR-6233, INRIA. 2007. ⟨inria-00156747v5⟩
109 View
113 Download

Altmetric

Share

Gmail Facebook X LinkedIn More