[Back]

J. Osrael, L. Froihofer, N. Chlaupek, K. Göschka:
"Availability and Performance of the Adaptive Voting Replication Protocol";
Talk: Second International Conference on Availability, Reliability and Security (ARES 2007), Wien, Österreich; 04-10-2007 - 04-13-2007; in: "Proceedings of the Second International Conference on Availability, Reliability and Security", IEEE Computer Society, P2775 (2007), ISBN: 0-7695-2775-2; 53 - 60.

Replication is used to enhance availability and performance in distributed systems. Replica consistency and data integrity (constraint consistency) are correctness criteria for data-centric distributed systems. If consistency needs to be ensured all time, such systems soon become (partially) unavailable if node and link failures occur. However, some applications exist (e.g. in control engineering) where consistency can be temporarily relaxed durind degradation in order to achieve higher availability. Recently we proposed Adaptive Voting (AV), a novel replication protocol based on traditional quotum consensus (voting) that allows the configuration of this trade-off. AV allows non-critical operations (that cannot violate critical constraints) even if no quorum exists. Since this might impose replica conflicts and data integrity violations, different reconcialiation policies are needed to re-establish correctness ín repair time.
The contribution of this paper is two-fold: First, we present an availability analysis of AV. Second, we present performance measurements of AV from our .NET based proof-of-concept implementation. The availability analysis shows that AV provides better availability than traditional voting if (i) some data integrity constraints are relaxable and (ii) reconciliation time is shorter than degradation time. The performance results indicate that a read-one / write-all configuration of AV is fastest for write operations that involve checking of inter-object constraints and thus implicitly include read operations.

http://dx.doi.org/10.1109/ARES.2007.50