White-Box Atomic Multicast (Extended Version)
Alexey Gotsman, Anatole Lefort, and Gregory Chockler

TL;DR
This paper introduces a new genuine atomic multicast protocol that significantly reduces message delays for message delivery in fault-tolerant distributed systems, outperforming existing protocols both theoretically and practically.
Contribution
It presents a novel genuine atomic multicast protocol combining Paxos and Skeen's protocol with white-box optimizations for lower latency and better performance.
Findings
Achieves as low as 3 message delays in ideal conditions
Reduces latency compared to classical and recent protocols
Demonstrates practical performance improvements
Abstract
Atomic multicast is a communication primitive that delivers messages to multiple groups of processes according to some total order, with each group receiving the projection of the total order onto messages addressed to it. To be scalable, atomic multicast needs to be genuine, meaning that only the destination processes of a message should participate in ordering it. In this paper we propose a novel genuine atomic multicast protocol that in the absence of failures takes as low as 3 message delays to deliver a message when no other messages are multicast concurrently to its destination groups, and 5 message delays in the presence of concurrency. This improves the latencies of both the fault-tolerant version of classical Skeen's multicast protocol (6 or 12 message delays, depending on concurrency) and its recent improvement by Coelho et al. (4 or 8 message delays). To achieve such low…
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.
Code & Models
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
