Optimal placement of data replicas in distributed database with majority voting protocol
From MaRDI portal
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
- A coordinated planning model for the design of a distributed database system
- Placement of data replicas for optimal data availability in ring networks
- On replica placement in high-availability storage under correlated failure
- Algorithms for optimal replica placement under correlated failure in hierarchical failure domains
- Optimal data placements for triple replication in distributed storage systems
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)
