Publication

A High-Throughput Byzantine Fault-Tolerant Protocol

Related publications (36)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Rational Agreement in the Presence of Crash Faults

Vincent Gramoli, Alejandro Ranchal Pedrosa

Blockchain systems need to solve consensus despite the presence of rational users and failures. The notion of (k, t)-robustness is key to derive impossibility results with k rational players and t faulty players. However, these t faulty players are always ...

IEEE2021

Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus

Bryan Alexander Ford

Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. This paper attempts to simplify asynchronous consensus by building atop a novel threshold logical clock abstracti ...

2019

Making BFT Protocols Really Adaptive

Rachid Guerraoui

Many state-machine Byzantine Fault Tolerant (BFT) protocols have been introduced so far. Each protocol addressed a different subset of conditions and use-cases. However, if the underlying conditions of a service span different subsets, choosing a single pr ...

IEEE2015

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the a ...

Assoc Computing Machinery2012

S-Paxos: Offloading the Leader for High Throughput State Machine Replication

André Schiper, Zarko Milosevic, Nuno Filipe de Sousa Santos, Martin Biely

Implementations of state machine replication are prevalently using variants of Paxos or other leader-based protocols. Typically these protocols are also leader-centric, in the sense that the leader performs more work than the non-leader replicas. Such prot ...

2012

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

Achieving high-throughput State Machine Replication in multi-core systems

André Schiper, Nuno Filipe de Sousa Santos

State machine replication is becoming an increasingly popular technique among online services to ensure fault-tolerance using commodity hardware. This has led to a renewed interest in its throughput, as these services have typically a large number of users ...

2011

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

2011

Automated Vulnerability Discovery in Distributed Systems

Rachid Guerraoui, George Candea, Radu Banabic

In this paper we present a technique for automatically assessing the amount of damage a small number of participant nodes can inﬂict on the overall performance of a large distributed system. We propose a feedback-driven tool that synthesizes malicious node ...

2011

Stretching BFT

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

State-of-the-art BFT protocols remain far from the maximum theoretical throughput. Based on exhaustive eval- uation and monitoring of existing BFT protocols, we highlight few impediments to their scaling. These include the use of IP multicast, the presence ...

2010