YKD Dyanamic Linear Voting

YKD dynamic linear voting is a protocol created by Esti Yeger Lotem, Idit Keidar and Danny Dolev. It is designed to be adaptive, altering the minimum number of nodes needed for quorum after each partition of the cluster.

For example, if a 5-node cluster split into a partition of three nodes and of two nodes, the two nodes would lose quorum and the three nodes would be quorate. They would then shift down the minimum number of nodes needed to maintain quorum from three to two. In this way, a cluster can degrade further an have some members remain quorate.

See:

• Dynamic Voting for Consistent Primary Components.

 

Any questions, feedback, advice, complaints or meanderings are welcome.
Alteeve's Niche!	Alteeve Enterprise Support	Community Support
© 2024 Alteeve. Intelligent Availability® is a registered trademark of Alteeve's Niche! Inc. 1997-2024
legal stuff: All info is provided "As-Is". Do not use anything here unless you are willing and able to take responsibility for your own actions.