Replication algorithms for the World-Wide Web

This paper addresses the two fundamental issues in replication, namely deciding on the number and placement of the replicas and the distribution of requests among replicas. We first introduce a static centralized algorithm for replicating objects that can keep a balanced load on servers. To better meet the requirements of the dynamic nature of the Internet traffic and the rapid change in the access pattern of the WWW, we also propose a dynamic distributed algorithm where each server relies on some collected information to decide on where to replicate and migrate objects to achieve good performance and fault-tolerance levels.