A Case for Dynamic Selection of Replication and Caching Strategies

Abstract Replication and caching strategies are being used to reduce user perceived de-lay and wide area network traffic. Numerous such strategies have been pro-posed to manage replication while maintaining consistency among the replicas. In earlier research, we demonstrated that no single strategy can perform op-timal for all documents, and proposed a system where strategies are selected on a per-document basis using trace-driven simulation techniques. In this pa-per, we demonstrate the need for continuous dynamic adaptation of strategies using experiments conducted on our department Web traces. We also propose two heuristics, Simple and Transition, to perform this dynamic adaptation with reduced simulation cost. In our experiments, we find that Transition heuristic re-duces simulation cost by an order of magnitude while maintaining high accuracy in optimal strategy selection. 1