High Throughput Replication with Integrated Membership Management
Pedro Fouto, Nuno M. Preguiça, João Leitão
Abstract
This paper introduces ChainPaxos, a new distributed consensus algorithm for high throughput replication. ChainPaxos organizes nodes in a chain, allowing for a pipeline communication pattern that maximizes throughput, by minimizing the number of messages transmitted. While other proposals have explored such patterns, ChainPaxos is the first that can execute linearizable reads in any replica with no communication overhead, relying only on information used to process updates. These techniques build on a fully specified integrated membership management solution, allowing ChainPaxos's fault-tolerance to be independent of an external coordination service, often used in other solutions, which can lead to possible safety violations in the presence of network partitions.
Our evaluation shows that, when compared with alternative Paxos variants, ChainPaxos exhibits significantly higher throughput and scalability with negligible latency impact. Compared to other solutions with similar communication patterns, besides avoiding the costs of an external coordination service, ChainPaxos's high throughput tends to increase with the ratio of read-only operations.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ff96e3d3-1a67-4977-ab9e-801d7925f905Cited by top-tier papers4
- IONIA: High-Performance Replication for Modern Disk-based KV StoresYi Xu, Henry Zhu, Prashant Pandey, Alex Conway et al.FAST 2024 · 13 citations
- HoliPaxos: Towards More Predictable Performance in State Machine ReplicationZhiying Liang, Vahab Jabrayilov, Abutalib Aghayev, Aleksey CharapkoVLDB 2025 · 2 citations
- In Link We Trust: BFT at the Speed of CFT using SwitchesLior Zeno, Naama Ben-David, Mark SilbersteinNSDI 2026 · 1 citation
- Bodega: Localized Linearizable Reads at Anywhere Anytime via Roster LeasesGuanzhou Hu, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-DusseauOSDI 2026
Builds on2
- State-machine replication for planet-scale systemsVitor Enes, Carlos Baquero, Tuanir França Rezende, Alexey Gotsman et al.EuroSys 2020 · 41 citations
- Toward a Generic Fault Tolerance Technique for Partial Network PartitioningMohammed Alfatafta, Basil Alkhatib, Ahmed Alquraan, Samer Al-KiswanyOSDI 2020 · 30 citations
Related papers
- SpotLess: Concurrent Rotational Consensus Made Practical Through Rapid View SynchronizationDakai Kang, Sajjad Rahnama, Jelle Hellings, Mohammad SadoghiICDE 2024 · 10 citations
- A Weak Consensus Algorithm and Its Application to High-Performance BlockchainQin Wang, Rujia LiINFOCOM 2021 · 27 citations
- A Decentralized Blockchain with High Throughput and Fast ConfirmationChenxing Li, Peilun Li, Dong Zhou, Zhe Yang et al.USENIX ATC 2020 · 172 citations
- RapidChain: Scaling Blockchain via Full ShardingMahdi Zamani, Mahnush Movahedi, Mariana RaykovaCCS 2018 · 1,084 citations
- PigPaxos: Devouring the Communication Bottlenecks in Distributed ConsensusAleksey Charapko, Ailidani Ailijiang, Murat DemirbasSIGMOD 2021 · 55 citations
