22 search results - page 1 / 5 » Asynchronous Byzantine consensus with 2f 1 processes |
SAC
2010
ACM
13 years 12 months ago
2010
ACM
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...
OPODIS
2010
13 years 2 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
WDAG
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
ISPDC
2006
IEEE
13 years 11 months ago
2006
IEEE
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
DSN
2005
IEEE
13 years 10 months ago
2005
IEEE
— We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of bo...