Replica Placement Algorithms with Latency Constraints in Content Distribution Networks
Jie Su, Douglas S. Reeves · 2004
Content distribution networks (CDNs) are a recent development to improve the performance of networked applications. The design of replica placement algorithms is one of the foremost problems in CDNs. Current replica placement methods do not guarantee a bound on the maximum latency to any client. In this paper, we propose several algorithms for replica placement with latency con-straints. The algorithms are compared with respect to scalability and performance under a variety of conditions, including the case where clients ’ request patterns are unknown.