Placement of data replicas for optimal data availability in ring networks

X. D. Hu; X. H. Jia; D. Z. Du; D. Y. Li; H. J. Huang

doi:10.1006/jpdc.2000.1713

Placement of data replicas for optimal data availability in ring networks

X. D. Hu
, X. H. Jia^*
, D. Z. Du
, D. Y. Li
, H. J. Huang

^*Corresponding author for this work

City University of Hong Kong

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

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.

Original language	English
Pages (from-to)	1412-1424
Number of pages	13
Journal	Journal of Parallel and Distributed Computing
Volume	61
Issue number	10
DOIs	https://doi.org/10.1006/jpdc.2000.1713
State	Published - 2001
Externally published	Yes

Keywords

Data availability
Data replication
Distributed databases
Fault tolerance
Ring networks

Access to Document

10.1006/jpdc.2000.1713

Cite this

@article{5ffe7f98dfb34362b3e852cdee0fb7bf,

title = "Placement of data replicas for optimal data availability in ring networks",

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.",

keywords = "Data availability, Data replication, Distributed databases, Fault tolerance, Ring networks",

author = "Hu, \{X. D.\} and Jia, \{X. H.\} and Du, \{D. Z.\} and Li, \{D. Y.\} and Huang, \{H. J.\}",

year = "2001",

doi = "10.1006/jpdc.2000.1713",

language = "英语",

volume = "61",

pages = "1412--1424",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "10",

}

TY - JOUR

T1 - Placement of data replicas for optimal data availability in ring networks

AU - Hu, X. D.

AU - Jia, X. H.

AU - Du, D. Z.

AU - Li, D. Y.

AU - Huang, H. J.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Data availability

KW - Data replication

KW - Distributed databases

KW - Fault tolerance

KW - Ring networks

UR - https://www.scopus.com/pages/publications/0035185061

U2 - 10.1006/jpdc.2000.1713

DO - 10.1006/jpdc.2000.1713

M3 - 文章

AN - SCOPUS:0035185061

SN - 0743-7315

VL - 61

SP - 1412

EP - 1424

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

IS - 10

ER -

Placement of data replicas for optimal data availability in ring networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this