21 search results - page 2 / 5 » Consensus with Byzantine Failures and Little System Synchron... |
OPODIS
2007
13 years 6 months ago
2007
We present a novel translation of systems that are tolerant of crash failures to systems that are tolerant of Byzantine failures in an asynchronous environment, making weaker assum...
PODC
2006
ACM
13 years 10 months ago
2006
ACM
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
PODC
1999
ACM
13 years 9 months ago
1999
ACM
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
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
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...