Replica placement design with static optimality and dynamic maintainability

We propose a static replica placement algorithm that places replicas to sites by optimizing average response time and a dynamic replica maintenance algorithm that re-allocates replicas to new candidate sites if a performance metric degrades significantly over last K time periods. Simulation results demonstrate that the dynamic maintenance algorithm with static placement decisions performs best in dynamic environments like data grids.