Signed quorum systems

@article{Yu2005SignedQS,
  title={Signed quorum systems},
  author={Haifeng Yu},
  journal={Distributed Computing},
  year={2005},
  volume={18},
  pages={307-323}
}
With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum systems. However, even this optimal construction requires (n+1)/2 functioning servers out of n. Furthermore, the number of probes needed to acquire a quorum is also lower bounded by (n+1)/2. Motivated by the need for a highly available and low probe complexity quorum system in the Internet, this paper proposes signed quorum systems… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…