Quality of Service White Papers

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

Overview 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. The latter problem is investigated using the Closest access policy when adding QoS and bandwidth constraints. The paper proposes an optimal algorithm in two passes using dynamic programming.

Further White Paper Details
PublisherFrench National Institute for Research in Computer Science and Control File FormatPDF
Date PublishedJune 2007
FormatWhite Papers   
Topics

Quick Sitemap Links: