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

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

2007-06-22

arxiv.org/abs/0706.3350v3

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-188034