Why is the Bully algorithm called 'bully'?
Because the node with the highest ID always wins, unconditionally — when a node notices the leader is unresponsive, it challenges every node with a higher ID, and if any respond, they take over the election; if the highest-ID node in the cluster is reachable, it always ends up as leader, regardless of any other consideration. The 'strongest' node bullies its way into leadership every time, which is exactly what gives the algorithm its name.
Answered in
Before Raft: How the Bully and Ring Algorithms Elect a LeaderLeader election is a distinct problem from consensus. The Bully and Ring algorithms solve 'who's in charge' with nothing but timeouts and node IDs.
Read the full analysisOther questions this article answers
More system design & architecture questions
- How much spare capacity should a gateway keep?
- Why are bounded queues important for availability?
- Should a load balancer always move requests away from an unhealthy server?
- Can a circuit breaker prevent every cascading failure?
- Why does pagination improve API performance beyond just 'smaller responses'?
- Why is asynchronous logging faster than writing logs synchronously?
- When does caching actually help API performance, and when doesn't it?
- Why does payload compression trade CPU time for network time, and when is that worth it?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design & Architecture beat.