148 search results - page 16 / 30 » Self-stabilization of Byzantine Protocols |
SOSP
2007
ACM
14 years 6 months ago
2007
ACM
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...
ESA
2005
Springer
14 years 3 months ago
2005
Springer
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
OPODIS
2007
13 years 11 months ago
2007
This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assump...
NCA
2007
IEEE
14 years 4 months ago
2007
IEEE
Open distributed systems are typically composed by an unknown number of processes running in heterogeneous hosts. Their communication often requires tolerance to temporary disconn...
NSDI
2007
14 years 5 days ago
2007
Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantee...