36 search results - page 1 / 8 » Consensus When All Processes May Be Byzantine for Some Time |
SSS
2009
Springer
13 years 10 months ago
2009
Springer
OPODIS
2007
13 years 6 months ago
2007
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...
OPODIS
2010
13 years 3 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...
DSN
2006
IEEE
13 years 11 months ago
2006
IEEE
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...
NCA
2007
IEEE
13 years 11 months ago
2007
IEEE
Open distributed systems are typically composed by an unknown number of processes running in heterogeneous hosts. Their communication often requires tolerance to temporary disconn...