Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal allocation of electronic content
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic Replica Placement for Scalable Content Delivery
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
QoS-Aware Replica Placement for Content Distribution
IEEE Transactions on Parallel and Distributed Systems
Optimal Placement of Replicas in Data Grid Environments with Locality Assurance
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A QoS-Aware Heuristic Algorithm for Replica Placement
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
| Hi-index | 0.00 |
This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. We study three strategies. The first two strategies assign each client to a unique server while the third allows requests of a client to be processed by multiple servers. The main contribution of this paper is to assess the impact of QoS constraints on the total replication cost. In this paper, we establish the NP-completeness of the problem on homogeneous networks when the requests of a given client can be processed by multiple servers. We provide several efficient polynomial heuristic algorithms for NP-complete instances of the problem.