219 search results - page 34 / 44 » Byzantine Quorum Systems |
CCS
2010
ACM
13 years 10 months ago
2010
ACM
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimate...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
—To harness the ever growing capacity and decreasing cost of storage, providing an abstraction of dependable storage in the presence of crash-stop and Byzantine failures is compu...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We define the "Pulse Synchronization" problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing syste...
FAST
2009
13 years 7 months ago
2009
Fault-tolerant services typically make assumptions about the type and maximum number of faults that they can tolerate while providing their correctness guarantees; when such a fau...
SOSP
2007
ACM
14 years 6 months 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...