Selected results from the latest decade of quorum systems research

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5959 LNCS, Issue , 2010, Pages 185-206

  Merideth, Michael G ^a   Reiter, Michael K ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BYZANTINE FAULT; BYZANTINE QUORUMS; DISPERSION PROPERTIES; DISTRIBUTED SYSTEMS; NON-TRADITIONAL; PROBABILISTIC QUORUM SYSTEM; QUORUM SYSTEMS; STATE-MACHINE; BYZANTINE QUORUM SYSTEMS;

WIDE AREA NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS;

NETWORK PROTOCOLS; WIDE AREA NETWORKS;

EID: 77951132926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11294-2_10     Document Type: Conference Paper

References (31)

1. Abd-El-Malek, M., Ganger, G.R., Goodson, G.R., Reiter, M.K., Wylie, J.J.: Fault-scalable byzantine fault-tolerant services. In: Proceedings of the 20th ACM Symposium on Operating Systems Principles, pp. 59-74 (2005)
2. Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. Journal of the ACM 32(4), 824-840 (1985)
3. Cachin, C., Poritz, J.A.: Secure intrusion-tolerant replication on the Internet. In: International Conference on Dependable Systems and Networks, pp. 167-176 (2002)
4. Castro,M., Liskov, B.: Practical Byzantine fault tolerance and proactive recovery. ACMTransactions on Computer Systems 20(4), 398-461 (2002)
5. Fu, A.W.: Delay-optimal quorum consensus for distributed systems. IEEE Transactions on Parallel and Distributed Systems 8(1), 59-69 (1997)
6. Gilbert, S., Malewicz, G.: The quorum deployment problem. In: Proceedings of the 8th International Conference on Principles of Distributed Systems (2004)
7. Golovin, D., Gupta, A.,Maggs, B.M.,Oprea, F., Reiter,M.K.:Quorum placement in networks: Minimizing network congestion. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing, pp. 16-25 (2006)
8. Goodson, G.R., Wylie, J.J., Ganger, G.R., Reiter, M.K.: Efficient Byzantine-tolerant erasurecoded storage. In: International Conference on Dependable Systems and Networks (2004)
9. Guerraoui, R., Vukolic, M.: Refined quorum systems. In: Symposium on Principles of Distributed Computing, pp. 119-128 (2007)
10. Gupta, A., Maggs, B.M., Oprea, F., Reiter, M.K.: Quorum placement in networks to minimize access delays. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing, pp. 87-96 (2005)
11. Herlihy, M., Wing, J.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3), 463-492 (1990)
12. Kobayashi, N., Tsuchiya, T., Kikuno, T.: Minimizing the mean delay of quorum-based mutual exclusion schemes. Journal of Systems and Software 58(1), 1-9 (2001)
13. Kotla, R., Alvisi, L., Dahlin,M., Clement, A.,Wong, E.: Zyzzyva: Speculative Byzantine fault tolerance. In: Symposium on Operating Systems Principles, pp. 45-58. ACMPress, New York (2007), http://doi.acm.org/10.1145/ 1294261.1294267
14. Kotla, R., Dahlin,M.: High throughput Byzantine fault tolerance. In: International Conference on Dependable Systems and Networks, p. 575 (2004)
15. Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3), 382-401 (1982)
16. Lin, X.: Delay optimizations in quorum consensus. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.2223, pp. 575-586. Springer, Heidelberg (2001)
17. Liskov, B., Rodrigues, R.: Tolerating Byzantine faulty clients in a quorum system. In: International Conference on Distributed Computing Systems (2006)
18. Malkhi, D., Reiter, M.: Byzantine quorum systems. Distributed Computing 11(4), 203-213 (1998)
19. Malkhi, D., Reiter, M.K., Wool, A.: The load and availability of Byzantine quorum systems. SIAM Journal of Computing 29(6), 1889-1906 (2000)
20. Malkhi, D., Reiter, M.K.,Wool, A., Wright, R.N.: Probabilistic quorum systems. Information and Computation 170(2), 184-206 (2001)
21. Martin, J.P., Alvisi, L.: Fast Byzantine consensus. IEEE Transactions on Dependable and Secure Computing 3(3), 202-215 (2006)
22. Merideth, M.G., Reiter, M.K.: Probabilistic opaque quorum systems. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.4731, pp. 403-419. Springer, Heidelberg (2007)
23. Merideth,M.G., Reiter, M.K.:Write markers for probabilistic quorum systems. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.5401, pp. 5-21. Springer, Heidelberg (2008)
24. Naor, M., Wool, A.: The load, capacity and availability of quorum systems. SIAM Journal of Computing 27(2), 423-447 (1998)
25. Oprea, F.: Quorum placement on wide-area networks. Ph.D. thesis, Electrical & Computer Engineering Department, Carnegie Mellon University (2008)
26. Oprea, F., Reiter, M.K.: Minimizing response time for quorum-system protocols over widearea networks. In: Proceedings of the 37th International Conference on Dependable Systems and Networks, pp. 409-418 (2007)
27. Reiter, M.K.: Secure agreement protocols: Reliable and atomic group multicast in Rampart. In: Conference on Computer and Communication Security, pp. 68-80 (1994)
28. Rodrigues, R., Castro, M., Liskov, B.: BASE: Using abstraction to improve fault tolerance. In: Symposium on Operating Systems Principles (2001)
29. Song, Y.J., van Renesse, R., Schneider, F.B., Dolev, D.: The building blocks of consensus. In: Proceedings of the 9th International Conference on Distributed Computing and Networking (2008)
30. Tsuchiya, M., Yamaguchi, M., Kikuno, T.: Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes. IEEE Transactions on Parallel and Distributed Systems 10(4), 337-345 (1999)
31. Yin, J.,Martin, J.P., Venkataramani, A., Alvisi, L., Dahlin,M.: Separating agreement from execution for Byzantine fault tolerant services. In: Symposium on Operating Systems Principles, pp. 253-267 (2003)