Replica placement in a dynamic network

We study the problem of placement of replicas of a database (or a shared resource) in a dynamic network. We develop a set of protocols that maintain a path from each site to its nearest replica such that the cost of accessing the nearest replica is below a certain threshold. The protocols determine the number of replicas needed and the sites where these replicas must be placed. This is useful in read-intensive applications which impose time constraints on read operations. The protocols reconfigure the placement in response to changes in link costs. This may involve recomputing paths and relocating, adding or removing replicas