On the correctness of Egalitarian Paxos

06/26/2019
by   Pierre Sutra, et al.
0

This paper identifies a problem in both the TLA+ specification and the implementation of the Egalitarian Paxos protocol. It is related to how replicas switch from one ballot to another when computing the dependencies of a command. The problem may lead replicas to diverge and break the linearizability of the replicated service.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2017

Verification of Design Decisions in Communication Protocol by Evaluation of Temporal Logic Formulas

During the project of a communication protocol, many design decisions in...
research
11/13/2015

Specifying a Realistic File System

We present the most interesting elements of the correctness specificatio...
research
09/23/2018

Kishon's Poker Game

We present an approach for proving the correctness of distributed algori...
research
12/27/2021

Multiagent Transition Systems with Faults: Protocol-Stack Mathematics for Distributed Computing

Presently, the practice of distributed computing is such that problems e...
research
03/30/2020

Analysis of an Extension Dynamic Name Service – A discussion on DNS compliance with RFC 6891

Domain Name Service (DNS) resolution is a mechanism that resolves the sy...
research
10/24/2022

Understanding Inconsistency in Azure Cosmos DB with TLA+

Beyond implementation correctness of a distributed system, it is equally...
research
05/16/2023

A simple protocol to automate the executing, scaling, and reconfiguration of Cloud-Native Apps

We propose a simple protocol for Service Mesh management. The protocol s...

Please sign up or login with your details

Forgot password? Click here to reset