Sciweavers

37 search results - page 5 / 8
» Tolerating Byzantine Faulty Clients in a Quorum System
Sort
View
99
Voted
SOSP
2005
ACM
15 years 6 months ago
Fault-scalable Byzantine fault-tolerant services
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...
Michael Abd-El-Malek, Gregory R. Ganger, Garth R. ...
64
Voted
DSN
2004
IEEE
15 years 1 months ago
Efficient Byzantine-Tolerant Erasure-Coded Storage
This paper describes a decentralized consistency protocol for survivable storage that exploits local data versioning within each storage-node. Such versioning enables the protocol...
Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger,...
SOSP
2007
ACM
15 years 6 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,...
67
Voted
NSDI
2008
14 years 12 months ago
Nysiad: Practical Protocol Transformation to Tolerate Byzantine Failures
The paper presents and evaluates Nysiad,1 a system that implements a new technique for transforming a scalable distributed system or network protocol tolerant only of crash failur...
Chi Ho, Robbert van Renesse, Mark Bickford, Danny ...
SOSP
2007
ACM
15 years 6 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...