Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Understanding fault-tolerant distributed systems
Communications of the ACM
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Design and evaluation of a conit-based continuous consistency model for replicated services
ACM Transactions on Computer Systems (TOCS)
AQuA: An Adaptive Architecture that Provides Dependable Distributed Objects
IEEE Transactions on Computers
Mobile Transaction Management in Mobisnap
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Reconciling Replication and Transactions for the End-to-End Reliability of CORBA Applications
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Fault-tolerance in a distributed management system: a case study
Proceedings of the 25th International Conference on Software Engineering
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Neko: A Single Environment to Simulate and Prototype Distributed Algorithms
ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
ACM Computing Surveys (CSUR)
A System Architecture for Enhanced Availability of Tightly Coupled Distributed Systems
ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security
Trading Integrity for Availability by Means of Explicit Runtime Constraints
COMPSAC '06 Proceedings of the 30th Annual International Computer Software and Applications Conference - Volume 02
| Hi-index | 0.00 |
Data replication is a primary means to achieve fault tolerance in distributed systems Data integrity is one of the correctness criteria of data-centric distributed systems If data integrity needs to be strictly maintained even in the presence of network partitions, the system becomes (partially) unavailable since no potentially conflicting updates are allowed on replicas in different partitions Availability can be enhanced if data integrity can be temporarily relaxed during degraded situations Thus, data integrity can be balanced with availability. In this paper, we contribute with a new replication protocol based on traditional quorum consensus (voting) that allows the configuration of this trade-off The key idea of our Adaptive Voting protocol is to allow non-critical operations (that cannot violate critical constraints) even if no quorum exists Since this might impose replica conflicts and data integrity violations, different reconciliation policies are needed to re-establish correctness at repair time An availability analysis and an experimental evaluation show that Adaptive Voting provides better availability than traditional voting if (i) some data integrity constraints of the system are relaxable and (ii) reconciliation time is shorter than degradation time.