231 search results - page 9 / 47 » A Byzantine Fault Tolerant Distributed Commit Protocol |
78
Voted
SRDS
2007
IEEE
15 years 3 months ago
2007
IEEE
Fault tolerant distributed protocols typically utilize a homogeneous fault model, either fail-crash or fail-Byzantine, where all processors are assumed to fail in the same manner....
DSN
2005
IEEE
15 years 3 months ago
2005
IEEE
Designing a distributed fault tolerance algorithm requires careful analysis of both fault models and diagnosis strategies. A system will fail if there are too many active faults, ...
NSDI
2007
14 years 12 months 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...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
103
Voted
DIALM
2007
ACM
15 years 1 months ago
2007
ACM
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...