US 11,983,074 B2
Leader election in a distributed system based on node weight and leadership priority based on network performance
Diman Zad Tootaghaj, Milpitas, CA (US); Puneet Sharma, Milpitas, CA (US); Faraz Ahmed, Milpitas, CA (US); and Michael Zayats, Santa Clara, CA (US)
Assigned to Hewlett Packard Enterprise Development LP, Spring, TX (US)
Filed by Hewlett Packard Enterprise Development LP, Spring, TX (US)
Filed on Feb. 27, 2023, as Appl. No. 18/175,091.
Application 18/175,091 is a continuation of application No. 17/136,563, filed on Dec. 29, 2020, granted, now 11,593,210.
Prior Publication US 2023/0222034 A1, Jul. 13, 2023
Int. Cl. G06F 11/30 (2006.01); G06F 9/50 (2006.01); G06F 11/14 (2006.01); G06F 18/23213 (2023.01); G06F 11/18 (2006.01)
CPC G06F 11/1425 (2013.01) [G06F 9/5072 (2013.01); G06F 9/5077 (2013.01); G06F 9/5083 (2013.01); G06F 18/23213 (2023.01); G06F 11/187 (2013.01); G06F 2209/505 (2013.01); G06F 2209/508 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
categorizing a plurality of nodes into at least two clusters based on at least one of a geographic location of the plurality of nodes or a round trip time (RTT) between the plurality of nodes, wherein the plurality of nodes is coupled in communication via a network in a distributed computer system;
setting a leadership priority for each node based at least in part on a respective cluster of the at least two clusters, each node having a vote weight based at least in part on the leadership priority of the node, a vote of each node being biased by the vote weight of the node; and
selecting one of the plurality of nodes to become a leader node during an election, the selected leader node receiving a number of votes higher than a maximum possible number of votes biased by respective vote weights received by any other node in the cluster.