Publication
Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements
Related publications (49)
Planetary-Scale Byzantine Fault Tolerance
The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...
EPFL2024As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!
Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert
In a non-synchronous system with n processes, no t(0)-resilient (deterministic or probabilistic) Byzantine consensus protocol can prevent a disagreement among correct processes if the number of faulty processes is > n - 2t(0). Therefore, the community defi ...
ACADEMIC PRESS INC ELSEVIER SCIENCE2023Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony!
Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Manuel José Ribeiro Vidigueira, Vincent Gramoli, Seth Gilbert
The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic communication complexity in the worst case. While it has been shown that the bound is tight in synchronous environments, it is still unknown whether ...
Dagstuhl Publishing2022Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus
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 ...
2019Abstractions for Solving Consensus and Related Problems with Byzantine Faults
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 ...
EPFL2013Distal: A Framework for Implementing Fault-tolerant Distributed Algorithms
André Schiper, Pamela Isabel Delgado Borda, Zarko Milosevic, Martin Biely
We introduce Disal, a new framework that simplifies turning pseudocode of fault tolerant distributed algorithms into efficient executable code. Without proper tool support, even small amounts of pseudocode normally ends up in several thousands of lines of ...
2013Definitive Consensus for Distributed Data Inference
Inference from data is of key importance in many applications of informatics. The current trend in performing such a task of inference from data is to utilise machine learning algorithms. Moreover, in many applications that it is either required or is pref ...
EPFL2011Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis
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. ...
EPFL2011Distributed classification of multiple observation sets by consensus
Pascal Frossard, Effrosyni Kokiopoulou
We consider the problem of distributed classification of multiple observations of the same object that are collected in an ad hoc network of vision sensors. Assuming that each sensor captures a different observation of the same object, the problem is to cl ...
Institute of Electrical and Electronics Engineers2011Automated 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 inflict on the overall performance of a large distributed system. We propose a feedback-driven tool that synthesizes malicious node ...
2011