Sciweavers

60 search results - page 8 / 12
» Self-stabilizing byzantine agreement
Sort
View
INFORMATICALT
2006
100views more  INFORMATICALT 2006»
13 years 7 months ago
Optimal Agreement in a Scale-Free Network Environment
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
Shu-Ching Wang, Kuo-Qin Yan, Mao-Lun Chiang
IAW
2003
IEEE
14 years 23 days ago
Assuring Consistency and Increasing Reliability in Group Communication Mechanisms in Computational Resiliency
— The Computational Resiliency library (CRLib) provides distributed systems with the ability to sustain operation and dynamically restore the level of assurance in system functio...
Norka B. Lucena, Steve J. Chapin, Joohan Lee
ICDCN
2009
Springer
14 years 2 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
SOSP
2007
ACM
14 years 4 months ago
Zyzzyva: speculative byzantine fault tolerance
We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond...
Ramakrishna Kotla, Lorenzo Alvisi, Michael Dahlin,...
FOCS
2006
IEEE
14 years 1 months ago
Towards Secure and Scalable Computation in Peer-to-Peer Networks
We consider the problems of Byzantine Agreement and Leader Election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary. The first problem...
Valerie King, Jared Saia, Vishal Sanwalani, Erik V...