Sciweavers

30 search results - page 2 / 6
» On k-Set Consensus Problems in Asynchronous Systems
Sort
View
OPODIS
1997
13 years 8 months ago
Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector
Unreliable fault detectors can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous d...
Kim Potter Kihlstrom, Louise E. Moser, P. M. Melli...
SAC
2010
ACM
14 years 2 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
AINA
2010
IEEE
14 years 17 days ago
Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector?
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
François Bonnet, Michel Raynal
DC
1999
13 years 7 months ago
A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
Michel Hurfin, Michel Raynal
ICTAC
2005
Springer
14 years 29 days ago
Revisiting Failure Detection and Consensus in Omission Failure Environments
It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensu...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...