Publication

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran
2010
Report or working paper

Abstract

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 of the algorithm shows a better worst-case execution time. Moreover, for the practically relevant case t

Official source

https://infoscience.epfl.ch/record/150215?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

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.

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

Graph Chatbot

Chat with Graph Search

Planetary-Scale Byzantine Fault Tolerance

Towards General-Purpose Decentralized Computing with Permissionless Extensibility

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

Towards General-Purpose Decentralized Computing with Permissionless Extensibility

Planetary-Scale Byzantine Fault Tolerance

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search