89 search results - page 6 / 18 » Fast Byzantine Consensus |
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract—This work considers the problem of reaching consensus in an unreliable linear consensus network. A solution to this problem is relevant for several tasks in multi-agent ...
110
Voted
PODC
1999
ACM
15 years 4 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...
103
click to vote
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—To achieve higher reliability, safety, and faulttolerance, many mission-critical detection and decision systems implement consensus algorithms that force the systems’ ...
109
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
DSN
2002
IEEE
15 years 5 months 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...