BestHub
Sign in
Tag

Leader Election

1 views collected around this technical thread.

Java Captain
Java Captain
May 28, 2025 · Fundamentals

Introduction to ZooKeeper: Design Goals, Data Model, Sessions, Watches, Consistency Guarantees, Leader Election, and Deployment

This article provides a comprehensive overview of ZooKeeper, covering its purpose as a distributed coordination service, design objectives such as consistency and reliability, hierarchical data model, session and watch mechanisms, consistency guarantees, leader election and Zab protocol, as well as practical deployment details.

ConsensusDistributed CoordinationLeader Election
0 likes · 20 min read
Introduction to ZooKeeper: Design Goals, Data Model, Sessions, Watches, Consistency Guarantees, Leader Election, and Deployment
Raymond Ops
Raymond Ops
May 7, 2025 · Operations

How Kafka Elects Leaders and Distributes Partitions: Inside the Mechanics

Kafka’s internal mechanisms for leader election, partition assignment, and file storage are explained, covering how the Controller uses ZooKeeper, the ISR-based leader selection process, partition distribution strategies, segment file structures, and the evolution of offset management from Zookeeper to the __consumer_offsets topic.

KafkaLeader ElectionOffsets
0 likes · 5 min read
How Kafka Elects Leaders and Distributes Partitions: Inside the Mechanics
Tencent Cloud Developer
Tencent Cloud Developer
Nov 14, 2024 · Cloud Native

ZooKeeper Core Knowledge and Typical Application Scenarios

Although many platforms are dropping ZooKeeper, this guide explains its CP‑oriented architecture, znode structure, watcher mechanism, Zab consensus, leader election, and common patterns such as publish/subscribe, load balancing, naming, master election, distributed locks and queues, giving architects essential fundamentals for coordination services.

Consensus AlgorithmDistributed CoordinationDistributed Systems
0 likes · 25 min read
ZooKeeper Core Knowledge and Typical Application Scenarios
Mike Chen's Internet Architecture
Mike Chen's Internet Architecture
Feb 19, 2024 · Fundamentals

Comprehensive Overview of Zookeeper: Core Features, Architecture, Protocols, and Use Cases

This article provides a detailed introduction to Zookeeper, covering its role as a distributed coordination service, core functionalities such as a file‑system‑like data model, notification and cluster management, the ZAB consensus protocol, node types, leader election, distributed lock implementation, and typical application scenarios.

Distributed CoordinationDistributed LockLeader Election
0 likes · 9 min read
Comprehensive Overview of Zookeeper: Core Features, Architecture, Protocols, and Use Cases
Sanyou's Java Diary
Sanyou's Java Diary
Jan 23, 2024 · Fundamentals

Demystifying Raft: How Nacos Uses JRaft for Strong Consistency

This article explains the Raft consensus algorithm, its request lifecycle, leader election, snapshot mechanism, and JRaft optimizations such as linear reads, learners, and multi‑raft groups, illustrating how Nacos integrates these concepts to achieve reliable distributed consistency.

JRaftLeader ElectionNacos
0 likes · 23 min read
Demystifying Raft: How Nacos Uses JRaft for Strong Consistency
System Architect Go
System Architect Go
Dec 26, 2023 · Cloud Native

Distributed Leader Election and Kubernetes Lease

Distributed leader election ensures a single node performs exclusive tasks in high‑availability systems, with common implementations like Etcd, Kafka, Elasticsearch, and Zookeeper using algorithms such as Paxos, Raft, and ZAB, while Kubernetes provides the Lease resource to manage leader election via a distributed lock.

KubernetesLeader ElectionPaxos
0 likes · 7 min read
Distributed Leader Election and Kubernetes Lease
政采云技术
政采云技术
Jul 10, 2023 · Cloud Computing

RocketMQ High Availability Mechanism: DLedger and Raft-Based Leader Election

This article explores RocketMQ's high availability mechanism, focusing on DLedger's implementation of Raft-based leader election for distributed message middleware, covering both traditional and Controller mode architectures.

Cloud ComputingDledgerHigh Availability
0 likes · 18 min read
RocketMQ High Availability Mechanism: DLedger and Raft-Based Leader Election
Wukong Talks Architecture
Wukong Talks Architecture
Apr 4, 2023 · Fundamentals

Understanding the Raft Consensus Algorithm: Roles, Leader Election, and Fault Handling

This article explains the Raft consensus algorithm, detailing its roles, leader election process, term management, fault handling, and how it ensures consistency in both single‑node and multi‑node distributed systems for modern cloud‑native applications.

ConsensusLeader ElectionRaft
0 likes · 12 min read
Understanding the Raft Consensus Algorithm: Roles, Leader Election, and Fault Handling
JD Tech
JD Tech
Feb 2, 2023 · Fundamentals

Understanding the Byzantine Generals Problem and the Raft Consensus Algorithm

This article explains the Byzantine Generals problem, its fault‑tolerance limits, and how the Raft consensus algorithm solves a simplified version of the problem through leader election, log replication, and safety mechanisms, while also comparing Raft with Paxos, ZAB, and PBFT and providing Go code examples.

Byzantine GeneralsConsensus AlgorithmLeader Election
0 likes · 20 min read
Understanding the Byzantine Generals Problem and the Raft Consensus Algorithm
JD Tech
JD Tech
Jan 19, 2023 · Fundamentals

Understanding Zookeeper Leader Election Mechanism and Its Implementation

This article explains Zookeeper's leader election process, covering the half‑majority algorithm, cluster configuration files, multi‑layer queue architecture, and detailed Java code analysis of the election workflow, illustrating how BIO communication, threads, and message queues achieve high‑performance distributed consensus.

BIOLeader ElectionQueue Architecture
0 likes · 23 min read
Understanding Zookeeper Leader Election Mechanism and Its Implementation
Efficient Ops
Efficient Ops
Jan 10, 2023 · Big Data

Why a Single Kafka Broker Failure Can Halt All Consumers – Deep Dive into HA

This article explains Kafka's multi‑replica design, ISR mechanism, leader election rules, and producer acknowledgment settings, then shows how the built‑in __consumer_offset topic with a single replica can cause a whole cluster to become unavailable when one broker crashes, and offers practical fixes.

Consumer OffsetsHigh AvailabilityISR
0 likes · 9 min read
Why a Single Kafka Broker Failure Can Halt All Consumers – Deep Dive into HA
Architect's Guide
Architect's Guide
Sep 23, 2022 · Fundamentals

Key Distributed System Design Patterns and Concepts

This article introduces essential distributed system design patterns such as Bloom filters, consistent hashing, quorum, leader‑follower architecture, heartbeat, fencing, write‑ahead logs, segmented logs, high‑water marks, leases, gossip protocol, Phi failure detection, split‑brain handling, checksums, CAP and PACELC theorems, hinted handoff, read repair, and Merkle trees, explaining their purpose and operation.

Bloom FilterCAP theoremLeader Election
0 likes · 13 min read
Key Distributed System Design Patterns and Concepts
Sohu Tech Products
Sohu Tech Products
Sep 21, 2022 · Backend Development

Understanding Kafka Partition Failover When a Broker Goes Offline

This article analyzes a real‑world Kafka outage caused by killing a broker process, explains why partitions with a replication factor of one lose their leader, and walks through the internal Zookeeper‑based failover mechanism and leader‑election logic that Kafka uses to recover from such failures.

FailoverKafkaLeader Election
0 likes · 10 min read
Understanding Kafka Partition Failover When a Broker Goes Offline
IT Architects Alliance
IT Architects Alliance
Sep 2, 2022 · Fundamentals

Key Distributed System Concepts: Bloom Filter, Consistent Hashing, Quorum, Leader/Follower, and More

This article introduces essential distributed‑system concepts—including Bloom filters, consistent hashing, quorum, leader/follower roles, heartbeats, fencing, WAL, segment logs, high‑water marks, leases, gossip protocol, Phi failure detection, CAP and PACELC theorems, hinted handoff, read repair, and Merkle trees—explaining their purpose and how they are applied in systems such as BigTable, Cassandra, Dynamo, and Kafka.

Bloom FilterCAP theoremLeader Election
0 likes · 12 min read
Key Distributed System Concepts: Bloom Filter, Consistent Hashing, Quorum, Leader/Follower, and More
Top Architect
Top Architect
Aug 30, 2022 · Fundamentals

Key Distributed System Design Patterns and Concepts

This article explains essential distributed‑system design patterns such as Bloom filters, consistent hashing, quorum, leader‑follower replication, heartbeats, fencing, write‑ahead logs, segment logs, high‑water marks, leases, CAP and PACELC theorems, hinted handoff, read‑repair, Merkle trees, and related failure‑detection mechanisms, illustrating how they improve scalability, consistency and fault tolerance.

Bloom FilterCAP theoremLeader Election
0 likes · 12 min read
Key Distributed System Design Patterns and Concepts
Code Ape Tech Column
Code Ape Tech Column
Aug 26, 2022 · Fundamentals

Understanding the Raft Consensus Algorithm: Roles, Elections, Log Replication, and Split‑Brain Scenarios

This article explains the Raft consensus algorithm in detail, covering its three node roles, leader election process, state‑machine log replication, handling of leader failures, multiple candidates, and split‑brain situations, providing clear diagrams and step‑by‑step descriptions for distributed system fundamentals.

Consensus AlgorithmLeader ElectionLog Replication
0 likes · 16 min read
Understanding the Raft Consensus Algorithm: Roles, Elections, Log Replication, and Split‑Brain Scenarios
Architecture Digest
Architecture Digest
Jul 14, 2022 · Fundamentals

Key Distributed System Concepts: Bloom Filter, Consistent Hashing, Quorum, Leader/Follower, and More

This article explains essential distributed‑system concepts such as Bloom filters, consistent hashing, quorum, leader/follower roles, heartbeats, fencing, write‑ahead logs, segmented logs, high‑water marks, leases, gossip protocols, Phi accrual failure detection, split‑brain handling, checksums, the CAP and PACELC theorems, hinted handoff, read repair, and Merkle trees, illustrating each with practical examples and diagrams.

Bloom FilterCAP theoremLeader Election
0 likes · 12 min read
Key Distributed System Concepts: Bloom Filter, Consistent Hashing, Quorum, Leader/Follower, and More
Wukong Talks Architecture
Wukong Talks Architecture
Mar 23, 2022 · Backend Development

Understanding Zookeeper's ZAB Protocol: Leader Election, Data Synchronization, and Consistency

This article explains Zookeeper's ZAB (Zookeeper Atomic Broadcast) protocol, detailing node roles, the leader election process during startup and failure, the two‑phase commit data synchronization, ordering guarantees, and scenarios of leader crash and data loss, providing clear diagrams and code examples.

Atomic BroadcastConsensusLeader Election
0 likes · 10 min read
Understanding Zookeeper's ZAB Protocol: Leader Election, Data Synchronization, and Consistency
IT Architects Alliance
IT Architects Alliance
Mar 15, 2022 · Big Data

Understanding Kafka Replication: Mechanism, Roles, ISR, and Unclean Leader Election

This article explains Apache Kafka's replication mechanism, detailing its benefits, replica definitions, leader‑follower roles, in‑sync replica (ISR) criteria, and the trade‑offs of unclean leader election, highlighting how these features affect data redundancy, scalability, and consistency in distributed systems.

High AvailabilityISRKafka
0 likes · 11 min read
Understanding Kafka Replication: Mechanism, Roles, ISR, and Unclean Leader Election