Publications related to Rational Agreement in the Presence of Crash Faults

Beyond One Third Byzantine Failures

Rachid Guerraoui, Anne-Marie Kermarrec, Cheng Wang

The Byzantine agreement problem requires a set of

n

processes to agree on a value sent by a transmitter, despite a subset of

b

processes behaving in an arbitrary, i.e. Byzantine, manner and sending corrupted messages to all processes in the system. It ...

2015

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Zarko Milosevic

We become increasingly dependent on online services; therefore, their availability and correct behavior become increasingly important. Software replication is a popular technique for ensuring that computer systems continue to provide a correct service even ...

EPFL2013

Byzantine Agreement with Homonyms

Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert

So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general mo ...

Springer2013

A High-Throughput Byzantine Fault-Tolerant Protocol

Nikola Knezevic

State-machine replication (SMR) is a software technique for tolerating failures and for providing high availability in large-scale systems, through the use of commodity hardware. A replicated state-machine comprises a number of replicas, each of which runs ...

EPFL2012

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for \emph{the algorithms we analyzed}, in most cases, the decentralized ...

IEEE2011

Consensus when all processes may be Byzantine for some time

Martin Hutle, Martin Biely

Among all classes of faults, Byzantine faults form the most general modeling of value faults. Traditionally, in the Byzantine fault model, faults are statically attributed to a set of up to t processes. This, however, implies that in this model a process a ...

2011

Byzantine agreement with homonyms

Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert

So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general mo ...

ACM Press2011

Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis

Fatemeh Borran

Fault-tolerant computing is the art and science of building computer systems that continue to operate normally in the presence of faults. The fault tolerance field covers a wide spectrum of research area ranging from computer hardware to computer software. ...

EPFL2011

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for the algorithms we analyzed, in most cases, the decentralized variant ...

2010

Generic construction of consensus algorithms for benign and Byzantine faults

André Schiper, Zarko Milosevic, Olivier Rütti

The paper proposes a generic consensus algorithm that highlights the basic and common features of known consensus algorithms. The parameters of the generic algorithm encapsulate the core differences between various consensus algorithms, including leader-ba ...

2010

Rational Agreement in the Presence of Crash Faults

Graph Chatbot

Chat with Graph Search

Beyond One Third Byzantine Failures

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Byzantine Agreement with Homonyms

A High-Throughput Byzantine Fault-Tolerant Protocol

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

Consensus when all processes may be Byzantine for some time

Byzantine agreement with homonyms

Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

Generic construction of consensus algorithms for benign and Byzantine faults

A High-Throughput Byzantine Fault-Tolerant Protocol

Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis

Byzantine agreement with homonyms

Consensus when all processes may be Byzantine for some time

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

Beyond One Third Byzantine Failures

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Byzantine Agreement with Homonyms

Generic construction of consensus algorithms for benign and Byzantine faults

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms