46 search results - page 1 / 10 » Dynamic Byzantine Quorum Systems |
DSN
2000
IEEE
13 years 9 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...
SRDS
2005
IEEE
13 years 10 months ago
2005
IEEE
Quorum protocols offer several benefits when used to maintain replicated data but techniques for reducing overheads associated with them have not been explored in detail. It is d...
IEEEARES
2008
IEEE
13 years 11 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....
WDAG
2007
Springer
13 years 10 months ago
2007
Springer
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocol...
PODC
1997
ACM
13 years 8 months ago
1997
ACM
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...