We consider the problem of locating replicas in a network to minimize communications costs. Under the assumption that the READ-ONE-WRITE-ALL policy is used to ensure data consistency, an optimization problem is formulated in which the cost function estimates the total communications costs. The paper concentrates on the study of the optimal communications cost as a function of the ratio between the frequency of the read and write operations. The problem is reformulated as a zero-one linear programming problem, and its connection to the p-median problem is explained. The general problem is proved to be NP-complete. For path graphs a dynamic programming algorithm for the problem is presented.

Additional Metadata
Keywords Data replication, Dynamic programming, NP-completeness, Optimization
Persistent URL dx.doi.org/10.1007/s446-002-8031-5
Journal Distributed Computing
Cook, S.A. (Stephen A.), Pachl, J. (Jan), & Pressman, I. (2002). The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy. Distributed Computing, 15(1), 57–66. doi:10.1007/s446-002-8031-5