Placement of Data Replicas for Optimal Data Availability in Ring Networks

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

Full description

Saved in:
Bibliographic Details
Published in:Journal of parallel and distributed computing 2001-10, Vol.61 (10), p.1412-1424
Main Authors: Hu, X.-D., Jia, X.-H., Du, D.-Z., Li, D.-Y., Huang, H.-J.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Computer systems performance. Reliability
data availability
data replication
distributed databases
Exact sciences and technology
fault tolerance
Information systems. Data bases
Memory organisation. Data processing
ring networks
Software
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0743-7315
1096-0848
DOI:10.1006/jpdc.2000.1713