The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
IEEE Transactions on Parallel and Distributed Systems
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
File and Object Replication in Data Grids
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Placement of Read-Write Web Proxies in the Internet
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
An Overview of Data Replication on the Internet
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Object replication strategies in content distribution networks
Computer Communications
Constrained mirror placement on the Internet
IEEE Journal on Selected Areas in Communications
Placement problems for transparent data replication proxy services
IEEE Journal on Selected Areas in Communications
Designing cost-effective content distribution networks
Computers and Operations Research
Computers and Operations Research
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Designing content distribution networks for optimal cost and performance
Information Technology and Management
Hi-index | 0.01 |
This paper investigates the problem of optimally replicating objects at the candidate proxies in content distribution network. In our model, each proxy in the set of candidates has a finite storage capacity for replicating objects and charges fee for use. The optimization problem is to find a set of proxies from candidates set for replicating objects at them such that the total access cost is minimized, subject to the constraints that the objects placed at a proxy should not exceed the storage capacity of the proxy and the total fees charged by the proxies should not exceed a pre-specified budget. We formulate this problem as a combinational optimization problem and show that this optimization problem is NP complete. We propose two heuristics and evaluate them by simulation. The simulation results show that these two heuristics could significantly reduce the access cost.