Sciweavers

WDAG
2007
Springer
103views Algorithms» more  WDAG 2007»
14 years 3 months ago
Probabilistic Opaque Quorum Systems
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...
Michael G. Merideth, Michael K. Reiter
IEEEARES
2008
IEEE
14 years 4 months ago
RTQG: Real-Time Quorum-based Gossip Protocol for Unreliable Networks
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....
Bo Zhang, Kai Han, Binoy Ravindran, E. Douglas Jen...