231 search results - page 6 / 47 » A Byzantine Fault Tolerant Distributed Commit Protocol |
DSN
2006
IEEE
15 years 3 months ago
2006
IEEE
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
80
Voted
EUROSYS
2011
ACM
14 years 29 days ago
2011
ACM
Traditional agreement-based Byzantine fault-tolerant (BFT) systems process all requests on all replicas to ensure consistency. In addition to the overhead for BFT protocol and sta...
95
Voted
WDAG
2010
Springer
14 years 7 months ago
2010
Springer
Abstract—This paper describes a method to implement faulttolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines us...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...