Kafka 4.0 introduces KRaft, a ZooKeeper‑free metadata layer built on the Raft consensus algorithm, detailing role transitions, leader election, log replication, controller and broker responsibilities, and fault‑tolerance mechanisms, enabling a more scalable and self‑managed architecture for large‑scale distributed streaming.
This article walks through the core concepts of the Raft consensus algorithm, explains why Elixir is a good fit, details the leader election and log‑replication mechanisms, and shows how to integrate a user state machine to create a fully functional distributed key‑value database with snapshots and recovery.
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.
This article explains the Paxos consensus algorithm, detailing its roles, three-phase execution process, key properties such as consistency, availability and fault tolerance, and showcases its practical applications in distributed databases, file systems, and coordination services.
This article explains the Byzantine Generals problem, its fault‑tolerant challenges in distributed systems, and how the Raft consensus algorithm addresses these issues by using leader election, log replication, and safety mechanisms, while also comparing Raft with other algorithms such as Paxos, ZAB and PBFT.
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.
This article explains the Raft consensus algorithm, detailing how it breaks consistency into leader election, log replication, and safety, and describes the roles, term handling, election rules, log matching, snapshotting, and the RPC mechanisms that ensure a reliable distributed state machine.
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.
This article explains the Paxos consensus algorithm—its origins, core concepts, roles of proposers, acceptors and learners, safety and liveness constraints, the two-phase protocol, proposal generation, and practical variations—showing why Paxos remains a foundational solution for fault‑tolerant distributed systems.
This article demystifies consensus algorithms by explaining the difference between consistency and consensus, introducing the replicated state machine concept, and providing a concise, step‑by‑step walkthrough of the Raft algorithm—including state simplification, leader election, log replication, and safety guarantees.
Understanding Paxos and other consensus algorithms, this article explains how crash‑fault‑tolerant protocols like Paxos, Raft, and ZAB achieve sequential consistency through two‑phase voting, contrasts them with Byzantine‑fault‑tolerant methods, and details Multi‑Paxos optimizations, leader election, and practical trade‑offs for distributed systems.
This article explains why distributed systems need consistency algorithms, compares weak and strong consistency, outlines the challenges of unreliable networks and clocks, and provides a detailed walkthrough of the Raft consensus protocol, its node states, state variables, RPCs, and a practical lab implementation for leader election.
This article provides a comprehensive, step‑by‑step explanation of EPaxos, a leaderless distributed consensus algorithm, covering its basic concepts, instance model, three‑phase protocol, sorting algorithm, practical case study, challenges, and key discussion points for readers familiar with Paxos or Raft.
Raft is a leader-based consensus algorithm designed to be easier to understand and implement than Paxos, decomposing consensus into leader election, log replication, and safety rules; it ensures consistent, gap‑free logs, comparable performance, and simpler deployment for distributed systems.
This article explains distributed consensus, compares Paxos, ZAB and Raft, details Raft's leader election, log replication and commit mechanics, introduces read‑optimisation techniques such as ReadIndex and Lease Read, and showcases the Java‑based SOFAJRaft library with its architecture, performance tricks and real‑world use cases.
This article explains the challenges of Raft member changes, compares the two‑phase Joint Consensus approach with single‑step changes, discusses correctness and availability pitfalls, and offers practical engineering guidelines for implementing safe and efficient cluster reconfiguration.
This article explains the evolution of backend service architectures, introduces the CAP and BASE theories, and provides detailed walkthroughs of the Paxos and Raft consensus algorithms, covering their roles, constraints, protocol steps, and practical considerations for building reliable distributed systems.
This article introduces the open‑source WPaxos project, explains the core Basic Paxos algorithm, analyzes various failure scenarios, and details the production‑level engineering optimizations and Java code implementations that enable high‑performance, reliable distributed consensus.
This article provides a comprehensive overview of the Raft consensus algorithm, detailing its strong‑leader model, node states, leader election process, log replication mechanics, consistency checks, and single‑node configuration changes, while illustrating each concept with diagrams and code examples.
Tencent Cloud Blockchain Engine delivers a high‑performance, secure, and scalable three‑layer SMR architecture that enables massive cross‑organizational collaboration through hierarchical governance, BFT consensus, homomorphic encryption, zero‑knowledge proofs, and efficient cross‑chain transaction and identity management, supporting 20,000+ TPS and diverse government, education, healthcare, and copyright use cases.
This article explains the Paxos consensus protocol, its core concepts, step‑by‑step process, common misunderstandings, and rigorous inductive and contradiction proofs, while also discussing practical engineering considerations and how large‑scale systems like WeChat implement Paxos at billions of operations per minute.
This article introduces the classic Paxos algorithm, explains why it is considered complex, and then presents the more approachable Raft consensus protocol, detailing its node roles, leader election, log replication process, and useful resources for deeper learning.
