Replica placement with update latency guarantees

Content delivery networks (CDNs) are a promising new paradigm for delivering content to a pervasive client population. In such distributed networks, finding an optimal replication scheme that minimizes the amount of network traffic, given read and write frequencies for various objects, is NP-hard in general. This work aims at addressing this problem by proposing a new static centralized algorithm for replicating objects that can keep a balanced load on sites. To better meet the requirements of the dynamic nature of the CDNs and the rapid change in the access pattern of the objects, we also investigate a dynamic distributed algorithm, in the context of read queries only, where each site relies on some collected information to decide on where to replicate and migrate objects to achieve good performance and fault-tolerance levels.