Sciweavers

Share
COREGRID
2007
Springer

Optimal Closest Policy with Qos and Bandwidth Constraints

9 years 1 months ago
Optimal Closest Policy with Qos and Bandwidth Constraints
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient 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. In this paper, we state that the extension of Closest/Homogeneous with QoS to bandwidth keeps polynomial. This is an important cognition, as the postulated constraints are of different nature. QoS is a constraint that belongs to a node locally, whereas bandwidth constraints have a global influence on the resources. We propose an optimal algorithm in two passes using dynamic programming.
Veronika Rehn-Sonigo
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where COREGRID
Authors Veronika Rehn-Sonigo
Comments (0)
books