loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)
Measuring Availability in Optimistic Partition-Tolerant Systems with Data Constraints
Edinburgh, UK
June 25-June 28
ISBN: 0-7695-2855-4
Mikael Asplund, Linkoping University, Sweden
Simin Nadjm-Tehrani, Linkoping University, Sweden
Stefan Beyer, Universidad Politcnica de Valencia, Spain
Pablo Galdamez, Universidad Politcnica de Valencia, Spain
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 inconsistencies. 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.
Citation:
Mikael Asplund, Simin Nadjm-Tehrani, Stefan Beyer, Pablo Galdamez, "Measuring Availability in Optimistic Partition-Tolerant Systems with Data Constraints," dsn, pp.656-665, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.