Placement of data replicas for optimal data availability in ring networks
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 1412-1424 |
| Journal / Publication | Journal of Parallel and Distributed Computing |
| Volume | 61 |
| Issue number | 10 |
| Publication status | Published - 2001 |
Link(s)
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.
Research Area(s)
- Data availability, Data replication, Distributed databases, Fault tolerance, Ring networks
Citation Format(s)
Placement of data replicas for optimal data availability in ring networks. / Hu, X. D.; Jia, X. H.; Du, D. Z.; Li, D. Y.; Huang, H. J.
In: Journal of Parallel and Distributed Computing, Vol. 61, No. 10, 2001, p. 1412-1424.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
