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

Department of Computer Science

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

8 Citations (Scopus)

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.

Original language	English
Pages (from-to)	1412-1424
Journal	Journal of Parallel and Distributed Computing
Volume	61
Issue number	10
DOIs	https://doi.org/10.1006/jpdc.2000.1713
Publication status	Published - 2001

Research Keywords

Data availability
Data replication
Distributed databases
Fault tolerance
Ring networks

Access Output

10.1006/jpdc.2000.1713

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{a1febcd2bfa243e3a50632c2834aa886,

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. {\textcopyright} 2001 Academic Press.",

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 = "English",

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. © 2001 Academic Press.

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. © 2001 Academic Press.

KW - Data availability

KW - Data replication

KW - Distributed databases

KW - Fault tolerance

KW - Ring networks

UR - http://www.scopus.com/inward/record.url?scp=0035185061&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0035185061&origin=recordpage

U2 - 10.1006/jpdc.2000.1713

DO - 10.1006/jpdc.2000.1713

M3 - RGC 21 - Publication in refereed journal

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

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this