Optimal placement of data replicas in distributed database with majority voting protocol

DOI10.1016/S0304-3975(00)00161-4MaRDI QIDQ5941207zbMATH OpenOpenAlexFDO

Authors S. Shekhar, Weili Wu

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(00)00161-4

zbMATH Keywords

cycle and treedistributed databasemajority voting protocoloptimal placement of data replicas

Mathematics Subject Classification ID

Database theory (68P15)

Review text

In a distributed database system, data replicas are placed at different locations of a network to achieve the high data availability in presence of link failure. Optimal placements of data replicas have been studied extensively in the literature for various protocol. In this paper, we present a sufficient and necessary condition for optimality of a placement of odd number of data replicas in a ring network with majority voting protocol. As a corollary, we give a proof of a recent conjecture of \textit{X.-D. Hu, H.-J. Huang, X. H.Jia} and \textit{D.-Y. Li} [Placement of data replicas for optimal data availability in ring networks,manuscript (1999)]. Moreover, we also give a simple algorithm to find optimal placements in tree network with majority voting protocol.

Recommendations

• Placement of data replicas for optimal data availability in ring networks
• Optimal allocation for partially replicated database systems on tree- based networks
• An optimal voting scheme for minimizing the overall communication cost in replicated data management
• Locating replicas of a database on a network
• The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy

Cites work

• Complexity of Network Reliability and Optimal Resource Placement Problems
• Locating A Broadcast Facility In An Unreliable Network
• Location of facilities on a network subject to a single‐edge failure
• Optimal allocation for partially replicated database systems on tree- based networks
• Placement of data replicas for optimal data availability in ring networks

Cited in

(7)

• Optimal allocation for partially replicated database systems on tree- based networks
• An optimal voting scheme for minimizing the overall communication cost in replicated data management
• Algorithms for optimal replica placement under correlated failure in hierarchical failure domains
• On replica placement in high-availability storage under correlated failure
• Placement of data replicas for optimal data availability in ring networks
• Optimal data placements for triple replication in distributed storage systems
• A coordinated planning model for the design of a distributed database system

This page was built for publication: Optimal placement of data replicas in distributed database with majority voting protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941207)