Cost-Driven Data Replication with Predictions: An Online Algorithm with Theoretical Guarantees

The authors propose an online algorithm that uses simple binary predictions about inter-request times to dynamically create and delete data copies in a multi-server system, in order to minimize the total storage and network cost of serving a sequence of data access requests.