Sciweavers

21 search results - page 1 / 5
» Consensus with Byzantine Failures and Little System Synchron...
Sort
View
DSN
2006
IEEE
13 years 10 months ago
Consensus with Byzantine Failures and Little System Synchrony
We study consensus in a message-passing system where only some of the Ò¾ links exhibit some synchrony. This problem was previously studied for systems with process crashes; we n...
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, H...
OPODIS
2007
13 years 5 months ago
Byzantine Consensus with Few Synchronous Links
This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assump...
Moumen Hamouma, Achour Mostéfaoui, Gilles T...
SAC
2010
ACM
13 years 11 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...
WDAG
2010
Springer
184views Algorithms» more  WDAG 2010»
13 years 2 months ago
Fast Asynchronous Consensus with Optimal Resilience
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...
Ittai Abraham, Marcos Kawazoe Aguilera, Dahlia Mal...
OPODIS
2008
13 years 5 months ago
Byzantine Consensus with Unknown Participants
Abstract. Consensus is a fundamental building block used to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being ...
Eduardo Adílio Pelinson Alchieri, Alysson N...