83 search results - page 9 / 17 » Consensus in byzantine asynchronous systems |
SOSP
2005
ACM
14 years 4 months ago
2005
ACM
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
ACTA
2007
13 years 7 months ago
2007
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
DSN
2002
IEEE
14 years 13 days ago
2002
IEEE
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure det...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...
DSN
2006
IEEE
14 years 1 months ago
2006
IEEE
In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f < n/3, this is regardless of t...