231 search results - page 11 / 47 » A Byzantine Fault Tolerant Distributed Commit Protocol |
161
click to vote
SOSP
2007
ACM
16 years 25 days ago
2007
ACM
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
131
click to vote
ICDCS
2006
IEEE
15 years 10 months ago
2006
IEEE
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzan...
118
Voted
OTM
2009
Springer
15 years 10 months ago
2009
Springer
Byzantine Quorum Systems is a replication technique used to ensure availability and consistency of replicates data even in presence of arbitrary faults. This paper presents a Byzan...
117
click to vote
PODC
2005
ACM
15 years 9 months ago
2005
ACM
— We consider the problem of reliable broadcast in an infinite grid (or finite toroidal) radio network under Byzantine and crash-stop failures. We present bounds on the maximum...
122
Voted
SOSP
2009
ACM
16 years 25 days ago
2009
ACM
The UpRight library seeks to make Byzantine fault tolerance (BFT) a simple and viable alternative to crash fault tolerance for a range of cluster services. We demonstrate UpRight ...