33 search results - page 2 / 7 » Probabilistic Byzantine Quorum Systems |
OPODIS
2008
14 years 11 months ago
2008
Probabilistic quorum systems can tolerate a larger fraction of faults than can traditional (strict) quorum systems, while guaranteeing consistency with an arbitrarily high probabi...
DSN
2000
IEEE
15 years 2 months ago
2000
IEEE
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of...
104
click to vote
IEEEARES
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider scheduling real-time tasks in the presence of message loss and Byzantine node failures in unreliable networks. We present scheduling algorithms called RTQG and RTQG-B....
OTM
2009
Springer
15 years 4 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...
OPODIS
2007
14 years 11 months ago
2007
This paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are...