Publication | Closed Access
Limitations on database availability when networks partition
53
Citations
11
References
1986
Year
Unknown Venue
Cluster ComputingAvailabilityNetwork ScienceComponent FailureEngineeringAvailability IssueDistributed DatabaseConsistency TechnologyCloud ComputingManagementNetwork AnalysisData IntegrationHigh AvailabilityAvailability (System)Fault-tolerant MessagingDatabase ConsistencyData ManagementDatabase Availability
Fault‑tolerant distributed databases aim to remain highly available even when components fail. The study investigates software methods for maintaining high availability during network partitions. The authors analyze replicated‑data protocols that preserve consistency while trying to boost availability during partitions. They find that all protocols are limited by a theoretical bound, though specialized protocols may improve availability for specific distributions. KR.
Abstract : In designing fault-tolerant distributed database, a frequent goal is making the system highly available despite component failure. We examine software approaches to achieving high availability in the presence of partitions. In particular, we consider various replicated-data management protocols that maintain database consistency and attempt to increase database availability when networks partition. We conclude that no protocol does better than a bound we have determined. Our conclusions hold under the assumption. There may be some particular distribution for which specialized protocols can increase availability. (KR)
| Year | Citations | |
|---|---|---|
Page 1
Page 1