Sciweavers

83 search results - page 11 / 17
» Consensus in byzantine asynchronous systems
Sort
View
PODC
2012
ACM
11 years 10 months ago
On the (limited) power of non-equivocation
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
Allen Clement, Flavio Junqueira, Aniket Kate, Rodr...
DSN
2006
IEEE
14 years 1 months ago
Randomized Intrusion-Tolerant Asynchronous Services
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
EDCC
2010
Springer
14 years 8 days ago
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
François Bonnet, Michel Raynal
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 1 months ago
Rate of Convergence for Consensus with Delays
— We study the problem of reaching a consensus in the values of a distributed system of agents with time-varying connectivity in the presence of delays. We consider a widely stud...
Pierre-Alexandre Bliman, Angelia Nedic, Asuman E. ...
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
13 years 7 months ago
A Layered Analysis of Consensus
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
Yoram Moses, Sergio Rajsbaum