Skip to content
Book Open access

Integrating 2PC with Consensus for Fast Replication

Aug 2026 · Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · pp. 1330-1343 · 0 citations · 40 references
Computer Science

TL;DR

This work proposes to decouple low latency from fault tolerance, and design a hybrid solution that seamlessly integrates client-coordinated two-phase commit (2PC) with consensus, respectively to reduce latency in normal situations and tolerate faults in faulty situations, and designs xRaft, which can adaptively switch between the Fast and Consensus modes.

Abstract

Fast consensus protocols, such as CURP-Q and NOPaxos, have coupled objectives of reducing latency and tolerating faults, but doing so incurs considerable processing overhead and/or necessitates complex changes to existing architectures. Our insight is that when no adverse execution conditions (including operation conflicts, node failures, and network failures) occur, replication can be done safely without consensus at all. Rather than pursuing one single consensus protocol for fast and fault-tolerant replication, we propose to decouple low latency from fault tolerance, and design a hybrid solution that seamlessly integrates client-coordinated two-phase commit (2PC) with consensus, respectively to reduce latency in normal situations and tolerate faults in faulty situations. In the absence of faults, the system enters the Fast mode, where the client directly broadcasts its requests to all replicas with 2PC completing all updates in the first phase, i.e., in one RTT. Otherwise, the system enters the Consensus mode, which resorts to a consensus protocol to tolerate faults. We have applied the hybrid solution to the widely-used Raft consensus protocol to design xRaft, which can adaptively switch between the Fast and Consensus modes, ensuring correctness with minimal switching overhead. Evaluation shows that xRaft significantly outperforms state-of-the-art consensus protocols.

Read PDF

Similar papers

Jul 2026

Orca: Flexible Quorums Meet Dynamic Quorums

Large-scale data management systems rely on fault-tolerant protocols to ensure availability and consistency in the presence of node failures. However, standard protocols require majority quorums in every phase, making them impractical in environments with frequent failures, such as IoT networks. This paper presents O...

Kevin Dharmawan, Prajwal Annigeri, Mohammad Javad Amiri · 0 citations
Preprint Aug 2026

Scalable datacenter replication with mostly-synchronous consensus on hardware

Consistent replication of data among distributed processes -- a task involving the well-known consensus problem -- is notoriously expensive and hard to scale, affecting especially datacenter services with stringent performance requirements. To mitigate this problem, we introduce scalable replication in-hardware ( scarH...

Davide Rovelli, Philipp Berdesinski, R. Otoni et al. · 0 citations
Book Open access Sep 2026

BigBFT: Scaling BFT without Compromising Fault Tolerance via State Sharding

Scalability remains a major challenge for Byzantine fault tolerance (BFT) systems, whose throughput is often limited by sequential transaction processing at each node. Prior work has attempted to address this challenge by full sharding or by replacing total ordering with serializable concurrent execution, but these app...

Guang-Da Sun, Jialin Li · 0 citations
Preprint Sep 2026

KCensus: Synthesizing Latency-Optimal Consensus Fast Paths (Extended Version)

Strongly consistent geo-replication often relies on fast paths to reduce latency in the common case of no failures or contention. Existing fast-path schemes, however, are ad hoc and restrictive: each corresponds to a point in a broad design space shaped by network topology, workload, and latency objective, so no single...

Clément Burgelin, Antoine Murat, G. Sela et al. · 0 citations
Preprint Sep 2026

Breaking Fault Lines: Unifying TEE-Assisted BFT Consensus in Partially Trusted Worlds

This paper revisits TEE-assisted BFT under a universal partial-TEE model, where an arbitrary subset of replicas execute inside TEEs while the remaining replicas operate without hardware trust guarantees. We show that heterogeneous trust changes the structure of quorum formation and fault tolerance. In particular, we de...

Xiao-Qing Wen, Tong Liu, Jian-Yu Niu et al. · 0 citations
Preprint Sep 2026

Exploring Adaptive Byzantine Quorum Systems to Improve Latency in the WAN

Quorum systems enforce strict consistency in Byzantine fault-tolerant (BFT) state machine replication: Before a value is decided, a subset of replicas (called quorum) must exchange votes for the value. In wide-area networks, the size and composition of a quorum determines the speed at which replicas can make progress a...

Linus Gnan, R. Kapitza, Christian Berger · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.