DocumentCode
3056312
Title
Measuring Availability in Optimistic Partition-Tolerant Systems with Data Constraints
Author
Asplund, Mikael ; Nadjm-Tehrani, Simin ; Beyer, Stefan ; Galdamez, Pablo
Author_Institution
Linkoping Univ., Linkoping
fYear
2007
fDate
25-28 June 2007
Firstpage
656
Lastpage
665
Abstract
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.
Keywords
data integrity; middleware; protocols; application continuous service; automatic reconciliation protocols; data constraints; optimistic partition-tolerant systems; partition-tolerant middleware; replicated systems; Availability; Books; Constraint optimization; Fault tolerance; Fault tolerant systems; Information science; Middleware; Partitioning algorithms; Protocols; Prototypes;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable Systems and Networks, 2007. DSN '07. 37th Annual IEEE/IFIP International Conference on
Conference_Location
Edinburgh
Print_ISBN
0-7695-2855-4
Type
conf
DOI
10.1109/DSN.2007.62
Filename
4273017
Link To Document