Optimism and consistency in partitioned distributed database systems
ACM Transactions on Database Systems (TODS)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Detection of mutual inconsistency in distributed systems
Distributed systems, Vol. II: distributed data base systems
SDE 5 Proceedings of the fifth ACM SIGSOFT symposium on Software development environments
Disconnected operation in the Coda File System
ACM Transactions on Computer Systems (TOCS)
A critique of ANSI SQL isolation levels
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
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
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Operational transformation in real-time group editors: issues, algorithms, and achievements
CSCW '98 Proceedings of the 1998 ACM conference on Computer supported cooperative work
The IceCube approach to the reconciliation of divergent replicas
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
An algebraic approach to file synchronization
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Aspects for Improvement of Performance in Fault-Tolerant Software
PRDC '04 Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)
Transaction-centric reconciliation in disconnected client-server databases
Mobile Networks and Applications
ACM Computing Surveys (CSUR)
Formalising reconciliation in partitionable networks with distributed services
Rigorous Development of Complex Fault-Tolerant Systems
| Hi-index | 0.00 |
This paper addresses design exploration for protocols that are employed in systems with availability-consistency tradeoffs. Distributed data is modelled as states of objects replicated across a network, and whose updates require satisfaction of integrity constraints over multiple objects. Upon detection of a partition, such a network will continue to provide delivery of services in parallel partitions; but only for updates with non-critical integrity constraints. Once the degraded mode ends, the parallel network partitions are reconciled to arrive at one partition.Using a formal treatment of the reconciliation process, three algorithms are proposed and studied in terms of their influence on service outage duration. The longer the reconciliation time, the lower is system availability; since the interval in which no services are provided is longer. However, the reconciliation time in turn is affected by the time to construct the post-partition system state. The shorter the construction time the higher is the number of updates that took place in the degraded mode but that will not be taken up in the reconciled partition. This will lead to a longer interval for rejecting/redoing these operations and thereby increase reconciliation time.