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

Distributed Computing

Volumn 15, Issue 1, 2002, Pages 57-66

  Cook, Stephen A ^a   Pachl, Jan ^b   Pressman, Irwin S ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b FIELDS INSTITUTE   (Canada)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Data replication; Dynamic programming; NP completeness; Optimization

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; GRAPH THEORY; LINEAR PROGRAMMING; OPTIMIZATION;

DATA REPLICATION;

COMPUTER NETWORKS;

EID: 0036266373     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s446-002-8031-5     Document Type: Article

References (20)

1. Distributed network storage with quality-of-service guarantees
2. Comparative models of the file assignment problem
3. Equivalent mathematical programming formulations of monotonic tree network location problems
4. Database location in computer networks
5. Parametric search and locating supply centers in trees
6. The future of data replication
7. Weighted voting for replicated data
8. Locating replicas of a database on a network
9. Data replication for mobile computers
10. An algorithmic approach to network location problems. I: The p-centers
11. An algorithmic approach to network location problems. II: The p-medians
12. A suite of database replication protocols based on group communication primitives
13. Placement of replicated items in distributed databases
14. The optimal placement of replicas in a network using a read any - Write all policy
15. An adaptive data replication algorithm
16. Distributed algorithms for dynamic replication of data
17. The multicast policy and its relationship to replicated data placement