Small Byzantine Quorums
For re- liable asynchronous communication, the eventual delivery of all messages sent by a correct client to correct servers is assured, and the write operation can complete at the client without gathering information from the servers to which the write messages have been sent.
We show how to extend an existing Byzantine quorum protocol to eliminate its dependency on reliable networking and to handle message loss and retransmission ...
In this paper, we present two new quorum systems, one for generic data and the other for self-verifying data, that need only servers and servers, respectively, ...
We show how to extend an existing Byzantine Quorum protocol to eliminate its dependency on reliable networking and to handle message loss and retransmission ...
Intuitively, a quorum system tolerant of Byzantine failures is a collection of subsets of servers, each pair of which intersect in a set containing ...
A quorum system, a family of subsets of the set of processes with the property that any two subsets in the family overlap.
smallest quorum of Q. Theorem 4.5 If Q is a quorum system over a universe of n. elements, then L(Q) maxf 1.
Quorum Bystems are well-known tools for ensuring the con- sistency and availability of replicated data despite the be- nign failure of data repositones.
More precisely, a b-maaking quorum system is one in which any two quorums intersect in 2b+ 1 servers, which suf- fices to ensure consistency in the system if at ...
A quorum system S is f-disseminating if (1) the intersection of two different quorums always contains f + 1 nodes, and (2) for any set of f byzantine nodes, ...