• Publications
  • Influence
Communication-based prevention of useless checkpoints in distributed computations
TLDR
This paper proves two properties related to integer timestamps which are associated with each local checkpoint and proposes a general communication-induced checkpointing protocol that defines a family of timestamp-based communication- induced checkpointing protocols.
A communication-induced checkpointing protocol that ensures rollback-dependency trackability
TLDR
A protocol that forces processes to take some additional local checkpoints in order to satisfy the Rollback Dependency Trackability (RDT) property, which states that all dependencies between local checkpoints are on-line trackable by using a transitive dependency vector is developed.
Signature-free asynchronous byzantine consensus with t < n/3 and o(n2) messages
TLDR
This paper presents a new round-based asynchronous consensus algorithm that copes with up to t<n/3 Byzantine processes, where n is the total number of processes and the main target when designing this algorithm was to obtain a cheap and simple algorithm.
Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach
TLDR
The generic dimension and the surprising design simplicity of the proposed protocol provide a better understanding of the basic algorithmic structures and principles that allow to solve the Consensus problem with the help of unreliable failure detectors.
Consensus in One Communication Step
TLDR
This paper presents a very simple consensus protocol that converges in a single communication step in favorable circumstances when "enough" processes propose the same value and if all the processes that propose a value do propose theSame value, the protocol always terminates in one communication step.
Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time
TLDR
This article is on broadcast and agreement in asynchronous message-passing systems made up of n processes, and where up to t processes may have a Byzantine Behavior, a powerful, yet simple, all-to-all broadcast communication abstraction suited to binary values.
Asynchronous implementation of failure detectors
TLDR
A new look at the implementation of failure detectors and more specifically at Chandra-Toueg’s failure detectors is proposed, based on a query-response mechanism and assumes that the query/response messages exchanged obey a pattern where the responses from some processes to a query arrive among the first ones.
Evaluating the condition-based approach to solve consensus
TLDR
This paper presents an evaluation of the condition-based approach to solve consensus and shows that this approach is particularly attractive and very efficient when the probability of process crashes is low (a common fact in practice).
Fault-tolerant Total Order Multicast to asynchronous groups
TLDR
The paper proposes a protocol based on two underlying building blocks, namely, Uniform Reliable Multicast and Uniform Consensus, based on which only the sender of a message and processes of its destination groups have to participate in the multicast of the message.
From static distributed systems to dynamic systems
TLDR
The paper adapts an eventual leader protocol designed for the static model, and proves that the resulting protocol is correct within the proposed dynamic model, showing that simple modifications to existing protocols can allow them to work in dynamic systems.
...
1
2
3
4
5
...