---
title: "When Bully and Ring algorithms suit"
subject: "Distributed System"
chapter: 6
key: "semester_7/distributed_system:bully-ring-suitability"
source: https://www.bctengineer.com/q/semester_7/distributed_system/bully-ring-suitability
site: BCT Engineering
---

# When Bully and Ring algorithms suit

Distributed System · Chapter 6: Coordination and Agreement

- Asked in: Model question
- Video: [Bully and Ring Election Algorithm Explained  | Distributed System & Computing Lectures ✅](https://www.youtube.com/watch?v=vKpc0y_Ik3E) — Last moment tuitions
- Answer checked by Claude Opus 5.5 (high effort) on 2026-10-14
- Page: https://www.bctengineer.com/q/semester_7/distributed_system/bully-ring-suitability
- Whole chapter: https://www.bctengineer.com/md/semester_7/distributed_system/chapter-6

## Question

In what situations are the following election algorithms suitable? A) Bully B) Ring

## Short answer

Bully is suitable for small-to-medium systems with full connectivity, fast recovery, and highest-ID coordination. Ring is suitable for logical ring topologies where processes only know successors, providing predictable 2N messages and tolerating slower elections and non-fully connected networks.

## Answer

#### A) Bully algorithm is suitable when
- The system is **small to medium** and all processes **know the ids of all others** and can communicate directly (fully connected or a reliable network).
- **Fast recovery** is wanted: when the failure is detected by a high-id process, the election completes quickly with few messages.
- The system has **reliable, bounded-delay (synchronous) communication**, so a timeout reliably indicates a crashed process.
- The **highest priority/id** process (the most powerful or reliable machine) should always be coordinator; a recovering strong node should take over (it "bullies" its way in).
- A message overhead of O(N²) in the worst case is acceptable.
Examples: a LAN cluster with a primary database server, replicated file servers.

#### B) Ring algorithm is suitable when
- Processes are already organised in a **logical ring** (for example, token ring systems), and each knows only its **successor** (the full membership list is not known).
- The number of messages should be **predictable** and bounded (about 2N) regardless of who starts, or many processes may start elections simultaneously (all get the same result).
- The network is **not fully connected**, or point-to-point links to all processes are expensive.
- Slower elections are acceptable, since the message goes around the full ring, and the ring can be repaired by skipping failed nodes.
Examples: token ring networks, ring-structured peer-to-peer overlays, and token regeneration in a token-ring mutual exclusion system.

## Check yourself

The answer's key points as multiple-choice questions, with the correct option and why.

1. Bully algorithm is suitable when
   A. Processes know only their successor
   B. The network is unreliable and asynchronous
   C. All process ids are known, communication is reliable and bounded so timeouts detect crashes
   D. Messages must be exactly 2N
   Answer: C. Bully needs knowledge of higher ids and timeout-based failure detection. (Key point: Bully suitability)

2. Ring algorithm is suitable when
   A. Fast election with few messages is needed
   B. Every process knows all others
   C. Highest-id machine must always bully its way in
   D. Processes are in a logical ring and know only their successor, and predictable messages are wanted
   Answer: D. Ring uses about 2N messages regardless of who starts. (Key point: Ring suitability)

3. What is the cost the bully algorithm accepts?
   A. O(N^2) worst-case messages
   B. Slow full ring traversal
   C. Need for a token
   D. No failure detection
   Answer: A. Many processes may start elections, giving O(N^2) in the worst case. (Key point: Bully cost trade-off)

## Related in Distributed System

- [Bully algorithm vs ring algorithm](https://www.bctengineer.com/question.md?key=semester_7%2Fdistributed_system%3Aelection-bully-ring) — Distributed System, chapter 6