Sciweavers

67 search results - page 3 / 14
» Randomized protocols for asynchronous consensus
Sort
View
DSN
2006
IEEE
13 years 11 months ago
One-step Consensus with Zero-Degradation
In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f < n/3, this is regardless of t...
Dan Dobre, Neeraj Suri
SAC
2010
ACM
14 years 4 days 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...
CDC
2010
IEEE
150views Control Systems» more  CDC 2010»
13 years 9 days ago
Consensus on asynchronous communication networks in presence of external input
This paper presents a class of multi-agent systems where the state of each agent is driven by its own local protocol, and by exogenous time-varying input signal. These inputs may r...
C. Pilotto, K. M. Chandy, J. White
ICASSP
2011
IEEE
12 years 9 months ago
Reaching consensus in asynchronous WSNs: Algebraic approach
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
Ondrej Sluciak, Markus Rupp
DSN
2005
IEEE
13 years 11 months ago
Fast Byzantine Consensus
— We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of bo...
Jean-Philippe Martin, Lorenzo Alvisi