---
answer: direct
beat: system-design
source: 1 article · updated: November 17, 2026
---

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 Leader

Leader election is a distinct problem from consensus. The Bully and Ring algorithms solve 'who's in charge' with nothing but timeouts and node IDs.

Crashtech Editorial November 17, 2026 System Design & Architecture

Read the full analysis

Other questions this article answers

More system design & architecture questions

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.