The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy

Authors:
Stephen A. Cook;Jan K. Pachl;Irwin S. Pressman
Affiliations:
Department of Computer Science, University of Toronto, 10 King's College Road, Toronto, Ontario, Canada M5S 3G4;The Fields Institute for Research in Mathematical Sciences, 222 College Street, Toronto, Ontario, Canada M5T 3J1;School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada K1S 5B6
Venue:
Distributed Computing
Year:
2002

Citing 10
Cited 8

The multicast policy and its relationship to replicated data placement

ACM Transactions on Database Systems (TODS)
Distributed algorithms for dynamic replication of data

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data replication for mobile computers

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
An adaptive data replication algorithm

ACM Transactions on Database Systems (TODS)
Database Location in Computer Networks

Journal of the ACM (JACM)
Comparative Models of the File Assignment Problem

ACM Computing Surveys (CSUR)
Placement of Replicated Items in Distributed Databases

EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
Weighted voting for replicated data

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A Suite of Database Replication Protocols based on Group Communication Primitives

ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
The optimal placement of replicas in a network using a READ ANY - WRITE ALL policy

CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2

Stabilizing ring clustering

Journal of Systems Architecture: the EUROMICRO Journal
Allocating Fragments in Distributed Databases

IEEE Transactions on Parallel and Distributed Systems
Self-Stabilizing Clustering of Tree Networks

IEEE Transactions on Computers
Comparison and analysis of ten static heuristics-based Internet data replication techniques

Journal of Parallel and Distributed Computing
A stabilizing algorithm for clustering of line networks

EURASIP Journal on Wireless Communications and Networking
Replicating data objects in large distributed database systems: an axiomatic game theoretic mechanism design approach

Distributed and Parallel Databases
Research of power-aware dynamic adaptive replica allocation algorithm in mobile ad hoc networks

ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Quality-aware data abstraction layer for collaborative 2-tier sensor network applications

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.