Ring Paxos: High-Throughput Atomic Broadcast
Parisa Jalili Marandi, Marco Primi, Nicolas Schiper, Fernando Pedone

TL;DR
This paper introduces M-Ring Paxos and U-Ring Paxos, two high-throughput atomic broadcast protocols based on Paxos, demonstrating their efficiency and performance advantages through detailed analysis and comparison.
Contribution
It presents two novel Paxos-based atomic broadcast protocols, optimized for high throughput and efficiency, with comprehensive performance evaluation.
Findings
M-Ring Paxos and U-Ring Paxos achieve high throughput.
The protocols outperform existing atomic broadcast methods.
Detailed performance analysis confirms efficiency gains.
Abstract
Atomic broadcast is an important communication primitive often used to implement state-machine replication. Despite the large number of atomic broadcast algorithms proposed in the literature, few papers have discussed how to turn these algorithms into efficient executable protocols. This paper focuses on a class of atomic broadcast algorithms based on Paxos, with its corresponding desirable properties: safety under asynchrony assumptions, liveness under weak synchrony assumptions, and resiliency-optimality. The paper presents two protocols, M-Ring Paxos and U-Ring Paxos, derived from Paxos. The protocols inherit the properties of Paxos and can be implemented very efficiently. We report a detailed performance analysis of M-Ring Paxos and U-Ring Paxos and compare them to other atomic broadcast protocols.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Age of Information Optimization · Optimization and Search Problems
