Practically self-stabilizing Paxos replicated state-machine

Peva Blanchard, Shlomi Dolev, Joffroy Beauquier, Sylvie Delaët

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present the first (practically) self-stabilizing replicated state machine for asynchronous message passing systems. The scheme is based on a variant of the Paxos algorithm and ensures that starting from an arbitrary configuration, the replicated state-machine eventually exhibits the desired behaviour for a long enough execution regarding all practical considerations.

Original languageAmerican English
Title of host publicationNetworked Systems - Second International Conference, NETYS 2014, Revised Selected Papers
PublisherSpringer Verlag
Pages99-121
Number of pages23
ISBN (Print)9783319095806
DOIs
StatePublished - 1 Jan 2014
Event2nd International Conference on Networked Systems, NETYS 2014 - Marrakech, Morocco
Duration: 15 May 201417 May 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8593 LNCS

Conference

Conference2nd International Conference on Networked Systems, NETYS 2014
Country/TerritoryMorocco
CityMarrakech
Period15/05/1417/05/14

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Practically self-stabilizing Paxos replicated state-machine'. Together they form a unique fingerprint.

Cite this