Name
Abstract | ||
|---|---|---|
This paper discusses the problem of placing data replicas in a ring network to maximize data availability. For read-any/write-all protocol, we prove that the equally spacing placement is optimal for read-dominant systems, while the grouping placement is optimal for write-dominant systems. For majority-voting protocol, we give some necessary conditions for optimal placements. © 2001 Academic Press. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1006/jpdc.2000.1713 | Journal of Parallel and Distributed Computing |
Keywords | Field | DocType |
Data availability,Data replication,Distributed databases,Fault tolerance,Ring networks | Replication (computing),Telecommunications network,Data availability,Data transmission,Computer science,Computer network,Fault tolerance,Distributed database,Ring network,Distributed computing | Journal |
Volume | Issue | ISSN |
61 | 10 | 07437315 |
Citations | PageRank | References |
7 | 0.63 | 4 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hu Xiao-Dong | 1 | 144 | 14.06 |
| Xiaohua Jia | 2 | 4609 | 303.30 |
| D.-Z. Du | 3 | 219 | 52.53 |
| Deying Li | 4 | 1216 | 101.10 |
| Huang H | 5 | 7 | 0.63 |