What's the practical downside of the Bully algorithm at scale?
Every election requires broadcasting messages to all higher-ID nodes and waiting for responses, which means message complexity grows with cluster size — O(n²) in the worst case across repeated elections. In a large or flaky cluster, network partitions or slow responses can trigger repeated, overlapping elections, generating a lot of coordination traffic just to agree on who's in charge.
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.