Seamless Paxos Coordinators
Gustavo M. D. Vieira, Islene C. Garcia, Luiz E. Buzato

TL;DR
This paper introduces a seamless coordinator replacement technique for Paxos that enables concurrent recovery and consensus, significantly reducing application unavailability during coordinator changes.
Contribution
The paper presents a novel method allowing Paxos coordinator replacements to occur without halting consensus, improving availability and performance during failures.
Findings
Effective in maintaining application availability during coordinator changes
Reduces recovery time by enabling concurrent state recovery and consensus
Enhances autonomous operation of replicated applications under network variability
Abstract
The Paxos algorithm requires a single correct coordinator process to operate. After a failure, the replacement of the coordinator may lead to a temporary unavailability of the application implemented atop Paxos. So far, this unavailability has been addressed by reducing the coordinator replacement rate through the use of stable coordinator selection algorithms. We have observed that the cost of recovery of the newly elected coordinator's state is at the core of this unavailability problem. In this paper we present a new technique to manage coordinator replacement that allows the recovery to occur concurrently with new consensus rounds. Experimental results show that our seamless approach effectively solves the temporary unavailability problem, its adoption entails uninterrupted execution of the application. Our solution removes the restriction that the occurrence of coordinator…
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.
