返回
Scalable atomic broadcast: A leaderless hierarchical algorithm
DOI:10.1016/j.jpdc.2023.104789.png)
摘要
En 中文
Atomic Broadcast is an essential broadcast primitive as it ensures the consistency of distributed replicas. However, it is notoriously non-scalable. In this work, we introduce the Leaderless Hierarchical Atomic Broadcast (LHABcast) algorithm, which has two properties to improve scalability. First, it is a fully decentralized algorithm that does not rely on a sequencer/leader, which is often a significant bottleneck. Processes running LHABcast send messages with local sequence numbers and order messages received from other processes using timestamps inspired on Lamport's logical clocks. A process that receives the required set of timestamps can make a decision about the overall sequence of message delivery. Second, the algorithm is hierarchical: processes are organized on a vCube logical overlay network, which has several logarithmic properties and allows the construction of autonomous spanning trees. vCube also works as a failure detector, assuming crash faults and an asynchronous system model. In this paper, LHABcast is described, specified, and proven to be correct. Both simulation and experimental results are presented. A comparison with an all-to-all strategy shows that the number of messages sent by LHABcast is significantly lower in both fault-free and faulty scenarios. An implementation of LHABcast in Akka.io achieved up to 3.9 times higher throughput in fault-free scenarios than an implementation of the Raft-based Apache Ratis.
Keyword:
Distributed systems
Fault tolerance
vCube
Atomic broadcast
Dependability
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
The missing piece: a distributed system-level diagnosis model for the implementation of unreliable failure detectors
COMPUTING
IF2.8
A silicon-tethered tandem radical cyclisation–trapping strategy to the fully substituted cyclopentene ring in viridenomycin
Tetrahedron
IF0
没有更多内容

