Highly adaptable dynamic quorum schemes for managing replicated data

Specification and Analytical Evaluation of Heterogeneous Dynamic Quorum-Based Data Replication Schemes

“…Heterogeneous dynamic data replication schemes [Storm, 2006;Storm and Theel, 2006] overcome this restriction as they allow different quorum system construction schemes to be utilized for different stages of the dynamics. In case of Dynamic Voting, for example, the quorum systems for every stage 1 ≤ n ≤ n of the dynamics are built in a Majority Consensus Voting-manner according to the rule that write quorums consist of (n + 1) / 2 processes and read quorums consist of n / 2 processes.…”

“…Heterogeneous dynamic data replication schemes [Storm, 2006;Storm and Theel, 2006] overcome this limitation by allowing different quorum system construction rules (in terms of a different static data replication scheme) to be utilized per stage of the dynamics. Hence, the scheme-specific deficiencies can be countered by employing the respective best-option structured or unstructured static data replication scheme per stage of the dynamics for a concrete application scenario.…”

“…Unfortunately, existing frameworks that support heterogeneous dynamic data replication schemes [Storm, 2006;Storm and Theel, 2006] are reliant on an actual implementation of the quorum system construction rules complying to the static data replication schemes to be used in the different stages of the dynamics. Hence, the adoption to changing application scenarios or the integration of new static data replication schemes involves modifying the framework's code which may be tedious and costly but certainly is an error-prone task.…”

“…The concept of Voting Structure Generators [Storm, 2006;Storm and Theel, 2006] employs a number of explicitly stated voting structure construction algorithms that can generate voting structures for arbitrary numbers of processes at run-time, each for a specific data replication scheme whose inherent quorum system construction rules are embodied in the construction algorithm. The concept of Voting Structure Generators [Storm, 2006;Storm and Theel, 2006] employs a number of explicitly stated voting structure construction algorithms that can generate voting structures for arbitrary numbers of processes at run-time, each for a specific data replication scheme whose inherent quorum system construction rules are embodied in the construction algorithm.…”

“…This can be realized, for example, as described in [Storm, 2006;Storm and Theel, 2006] for Voting Structure Generators with the algorithms not generating tree-shaped voting structures but instead concrete function allocations. Thus, the frame multiplicity function for quorum system construction rules expressed in a path-based manner is best described by an algorithm that specifies the appropriate function allocations per number of processes for which to generate treeshaped voting structures.…”