This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Algorithm | |
---------- | |
Let's say we have a cluster of nodes A < B < C where A is the leader, and B and C are | |
candidates. We want to add a new candidate D to the cluster, and we select node B as | |
the seed node. | |
When node D is started, the following happens: | |
(1) D sends a 'join' msg to B, and D starts monitoring B | |
(2) B replies with a 'hasLeader, A' message |