Load and availability of Byzantine quorum systems

SIAM Journal on Computing

Volumn 29, Issue 6, 2000, Pages 1889-1906

  Malkhi, Dahlia ^a   Reiter, Michael K ^b   Wool, Avishai ^b  

^a AT AND T LABS RESEARCH   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SET THEORY;

BYZANTINE QUORUM SYSTEMS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0034482383     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797325235     Document Type: Article

References (42)

1. D. AGRAWAL AND A. EL-ABBADI, An efficient and fault-tolerant solution for distributed mutual exclusion, ACM Trans. Comput. Systems, 9 (1991), pp. 1-20.
2. M. AIZENMAN, J. T. CHAYES, L. CHAYES, J. FRÖHLICH, AND L. RUSSO, On a sharp transition from area law to perimeter law in a system of random surfaces, Comm. Math. Phys., 92 (1983), pp. 19-69.
3. D. BARBARA AND H. GARCIA-MOLINA. The vulnerability of vote assignments, ACM Trans. Comput. Systems, 4 (1986), pp. 187-213.
4. D. BARBARA AND H. GARCIA-MOLINA, The reliability of vote mechanisms, IEEE Trans. Comput., C-36 (1987), pp. 1197-1208.
5. R. E. BARLOW AND F. PROSCHAN, Statistical Theory of Reliability and Life Testing, Holt, Rinehart and Winston, New York, 1975.
6. R. A. BAZZI, Planar quorums, in Proceedings of the 10th International Workshop on Dist. Algorithms, Bologna, Italy, 1996, Lecture Notes in Comput. Sci. 1151, Springer-Verlag, New York, 1996, pp. 251-268.
7. R. A. BAZZI, Planar quorums, in Proceedings of the 10th International Workshop on Dist. Algorithms, Bologna, Italy, 1996, Lecture Notes in Comput. Sci. 1151, Springer-Verlag, New York, 1996, pp. 251-268.
8. S. Y. CHEUNG, M. H. AMMAR, AND M. AHAMAD, The grid protocol: A high performance scheme for maintaining replicated data, IEEE Trans. Knowledge Data Engrg., 4 (1992), pp. 582-592.
9. N. CONDORCET, Essai sur l'application de l'analyse à la probabilité des decisions rendues à la pluralite des voix, Paris, 1785.
10. A. EL-ABBADI AND S. TOUEG, Maintaining availability in partitioned replicated databases, ACM Trans. Database Systems, 14 (1989), pp. 264-290.
11. J. A. GARAY AND K. J. PERRY, A continuum of failure models for distributed computing, in Proceedings of the 6th International Workshop on Dist. Algorithms, Lecture Notes in Comput. Sci. 647, Springer-Verlag, Berlin, New York, 1992.
12. H. GARCIA-MOLINA AND D. BARBARA, How to assign votes in a distributed, system, J. ACM, 32 (1985), pp. 841-860.
13. D. K. GIFFORD, Weighted voting for replicated data, in Proceedings of the 7th Annual ACM Symposium Oper. Sys. Principles, 1979, pp. 150-159.
14. G. R. GRIMMETT, Percolation, Springer-Verlag, Berlin, New York, 1989.
15. M. HALL, Combinatorial Theory, 2nd ed., John Wiley, 1986.
16. M. HERLIHY, A quorum-consensus replication method for abstract data types, ACM Trans. Comput. Systems, 4 (1986), pp. 32-53.
17. R. HOLZMAN, Y. MARCUS, AND D. PELEG, Load balancing in quorum systems, SIAM J. Discrete Math., 10 (1997), pp. 223-245.
18. H. KESTEN, The critical probability of bond percolation on the square lattice equals 1/2, Comm. Math. Phys., 71 (1980), pp. 41-59.
19. H. KESTEN, Percolation Theory for Mathematicians, Birkhäuser, Boston, 1982.
20. A. KUMAR, Hierarchical quorum consensus: A new algorithm for managing replicated data, IEEE Trans. Comput., 40 (1991), pp. 996-1004.
21. A. KUMAR AND S. Y. CHEUNG, A high availability √n hierarchical grid algorithm for replicated data, Inform. Process. Lett., 40 (1991), pp. 311-316.
22. A. KUMAR, M. RABINOVICH, AND R. K. SINHA, A performance study of general grid structures for replicated data, in Proceedings of the 13th International Conference on Distributed Computing Systems, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 178-185.
23. P. LINCOLN AND J. RUSHBY, A formally verified algorithm for interactive consistency under a hybrid fault model, in Proceedings of the 23rd IEEE Symposium on Fault-Tolerant Computing, Toulouse, France, 1993, pp. 402-411.
24. P. LINCOLN AND J. RUSHBY, Formal verification of an interactive consistency algorithm for the Draper FTP architecture under a hybrid fault model, in Proceedings of the 9th IEEE Conference on Computer Assurance, Gaithersburg, MD, 1994, pp. 107-120.
25. M. MAEKAWA, A √n algorithm for mutual exclusion in decentralized systems, ACM Trans. Comput. Systems, 3 (1985), pp. 145-159.
26. D. MALKHI AND M. K. REITER, Byzantine quorum, systems, Distrib. Comput., 11 (1998), pp. 203-213.
27. D. MALKHI AND M. K. REITER, Secure and scalable replication in Phalanx, in Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems, West Lafayette, IN, 1998, pp. 51-58.
28. D. MALKHI AND M. K. REITER, Survivable consensus objects, in Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems, West Lafayette, IN, 1998, pp. 271-279.
29. D. MALKHI, M. K. REITER, A. WOOL, AND R. N. WRIGHT, Probabilistic Byzantine Quorum Systems, Tech. Report 98.7, AT&T Research, 1998; also available online from http://www.research.att.com/library/trs/TRs/98/98.7/98.7.1.body.ps.gz.
30. Y. MARCUS AND D. PELEG, Construction Methods for Quorum Systems, Tech. Report CS92-33, The Weizmann Institute of Science, Rehovot, Israel, 1992.
31. M. V. MENSHIKOV, Coincidence of critical points in percolation problems, Soviet Math. Dokl., 33 (1986), pp. 856-859.
32. M. NAOR AND A. WOOL, The load, capacity, and availability of quorum systems, SIAM J. Comput., 27 (1998), pp. 423-447.
33. M. L. NEILSEN, Quorum Structures in Distributed Systems, Ph.D. thesis, Department of Computing and Information Sciences, Kansas State University, 1992.
34. M. L. NEILSEN AND M. MIZUNO, Coterie join algorithm, IEEE Trans. Parallel Distrib. Systems, 3 (1992), pp. 582-590.
35. D. PELEG AND A. WOOL, The availability of quorum systems, Inform. and Comput., 123 (1995), pp. 210-223.
36. D. PELEG AND A. WOOL, The availability of crumbling wall quorum systems, Discrete Appl. Math., 74 (1997), pp. 69-83.
37. D. PELEG AND A. WOOL, Crumbling walls: A class of practical and efficient quorum systems, Distrib. Comput., 10 (1997), pp. 87-98.
38. S. RANGARAJAN, S. SETIA, AND S. K. TRIPATHI, A fault-tolerant algorithm for replicated data management, in Proceedings of the 8th IEEE International Conference on Data Engineering, Tempe, AZ, 1992, pp. 230-237.
39. M. K. REITER AND K. P. BIRMAN, How to securely replicate services, ACM Trans. Prog. Lang. Systems, 16 (1994), pp. 986-1009.
40. R. H. THOMAS, A majority consensus approach to concurrency control for multiple copy databases, ACM Trans. Database Systems, 4 (1979), pp. 180-209.
41. A. WOOL, Quorum Systems for Distributed Control Protocols, Ph.D. thesis, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1996.
42. C. WU AND G. G. BELFORD, The triangular lattice protocol: A highly fault tolerant protocol for replicated data, in Proceedings of the 11th IEEE Symposium on Reliable Distributed Systems, 1992, pp. 66-73.