Measuring Availability in Optimistic Partition-Tolerant Systems with Data Constraints

Mikael Asplund, Simin Nadjm-Tehrani, Stefan Beyer, Pablo Galdamez
2007 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)  
Replicated systems that run over partitionable environments, can exhibit increased availability if isolated partitions are allowed to optimistically continue their execution independently. This availability gain is traded against consistency, since several replicas of the same objects could be updated separately. Once partitioning terminates, divergences in the replicated state needs to be reconciled. One way to reconcile the state consists of letting the application manually solve
more » ... es. However, there are several situations where automatic reconciliation of the replicated state is meaningful. We have implemented replication and automatic reconciliation protocols that can be used as building blocks in a partition-tolerant middleware. The novelty of the protocols is the continuous service of the application even during the reconciliation process. A prototype system is experimentally evaluated to illustrate the increased availability despite network partitions.
doi:10.1109/dsn.2007.62 dblp:conf/dsn/AsplundNBG07 fatcat:fgw2eflxnzczrfpqmez2g4qvk4