From byzantine agreement to practical survivability

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2002, Pages 374-379

  Malkhi, Dahlia ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

REPLICATION SYSTEMS;

COMMUNICATION SYSTEMS; DATA PROCESSING; FAILURE ANALYSIS; MULTICASTING; NETWORK PROTOCOLS; SERVERS;

DATA REDUCTION;

EID: 0036443318     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RELDIS.2002.1180213     Document Type: Conference Paper

References (50)

1. M. Aguilera, W. Chen and S. Toueg. Using the Heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks. Theoretical Computer Science 220(1):3-30, June 1999.
2. Y. Amir, G.V. Chockler, D. Dolev and R. Vitenberg. Efficient state transfer in partitionable environments. In Proceedings of the European Research Seminar on Advances in Distributed Systems (ERSADS97), pages 183-191, Switzerland, March 1997.
3. Y. Amir, D. Dolev, S. Kramer, and D. Malki. Membership algorithms for multicast communication groups. In Proceedings of the 6th Intl. Workshop on Distributed Algorithms (WDAG-6), (LNCS, 647) Haifa, Israel, Nov. 1992, pp. 292-312.
4. K. Birman and T. Joseph. Exploiting virtual synchrony in distributed systems. In Proceedings of the 11 th Annual Symposium on Operating Systems Principles, pages 123-138, November 1987.
5. R. Boichat, P. Dutta, S. Frolund and R. Guerraoui. Deconstructing Paxos. Technical Report DSC ID:200106, Communication Systems Department (DSC), École Polytechnic Fédérale de Lausanne (EPFL), January 2001. Available at http://dscwww.epfl.ch/EN/publications/documents/tr01_006.pdf.
6. G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM 32(4):824-840, October 1985.
7. M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation - 0SDI'99, February, 1999, New Orleans, LA.
8. T.D. Chandra, V. Hadzilacos and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM 43(4):685-722, July 1996.
9. T.D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2):225-267, March 1996.
10. G. Chockler, D. Dolev and D. Malkhi. A quorum based approach to CORBA fault-tolerance. In Proceedings of the European Research Seminar on Advances in Distributed Systems (Ersads 2001), Bologna, Italy, May 2001.
11. G.V. Chockler, I. Keidar and R. Vitenberg. Group communication specifications: A comprehensive study. ACM Computing Surveys 33(4):1-43, December 2001.
12. G. Chockler, D. Malkhi. Active disk Paxos with infinitely many processes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC '02), August 2002. To appear.
13. G. Chockler, D. Malkhi, and M.K. Reiter. Backoff protocols for distributed mutual exclusion and ordering. In Proceedings of the 21st International Conference on Distributed Computing Systems, pages 11-20, April 2001.
14. B. Chor and C. Dwork. Randomization in Byzantine agreement. Advances in Computing Research, Randomness in Computation, volume 5, JAI Press, edited by S. Micali, pp. 443-497, 1989.
15. F. Cristian and C. Fetzer. The Timed Asynchronous distributed system model. In Proceedings of the 28th Annual International Symposium on Fault-Tolerant Computing, June 1998.
16. R. DePrisco, B. Lampson and N. Lynch. Fundamental study: Revisiting the Paxos algorithm. Theoretical Computer Science 243:35-91, 2000.
17. D. Dolev, C. Dwork and L. Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM 34(1):77-97, January 1987.
18. D. Dolev, D. Malki and R. Strong, Framework for partitionable operation. Brief announcement in Proceeding of the 15th ACM Symposium on the Principles of Distributed Computing (PODC 96), Philadelphia, 1996, page 343. Full version available as TR-CS 95-4, Hebrew University of Jerusalem, February 1995.
19. C. Fetzer and F. Cristian. Fail-awareness: An approach to construct fail-safe applications. Journal of Real-Time Systems, to appear.
20. M.J. Fischer, N.A. Lynch, and M.S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2):374-382, April 1985.
21. E. Gafni and L. Lamport. Disk Paxos. In Proceedings of 14th International Symposium on Distributed Computing (DISC'2000), pages 330-344, October 2000.
22. G.A. Gibson, D.F. Nagle, K. Amiri, J. Butler, F.W. Chang, H. Gobioff, C. Hardin, E. Riedel, D. Rochberg and J. Zelenka. A cost-effective high-bandwidth storage architecture. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), October 1998.
23. G.A. Gibson, D.F. Nagle, K. Amiri, F.W. Chang, H. Gobioff, E. Riedel, D. Rochberg and J. Zelenka. Filesystems for network-attached secure disks. Technical Report CMU-CS-97-118, July 1997.
24. M.P. Herlihy and J.M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3):463-492, July 1990.
25. I. Keidar and D. Dolev. Totally ordered broadcast in the face of network partitions: exploiting group communication for replication in partitionable networks. In Dependable Network Computing, Chapter 3, D. Avresky Editor, Kluwer Academic Publications. January 2000.
26. I. Keidar and S. Rajsbaum. On the cost of fault-tolerant consensus when there are no faults - a tutorial. MIT Technical Report MIT-LCS-TR-821, May 24, 2001. (Preliminary version in SIGACT News 32(2), Distributed Computing column, pages 45-63, June 2001.
27. K.P. Kihlstrom, L.E. Moser, and P.M. Melliar-Smith. The SecureRing protocols for securing group communication. In Proceedings of the 31st Annual Hawaii International Conference on System Sciences, 1998.
28. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. OceanStore: An Architecture for Global-Scale Persistent Storage. In Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000.
29. L. Lamport. Time, clocks, and the ordering of events in distributed systems. Communications of the ACM 21 (7):558-565, July 1978.
30. L. Lamport. The part-time parliament. ACM Transactions on Computer Systems 16(2):133-169, May 1998.
31. L. Lamport. Paxos made simple. Distributed Computing Column of SIGACT News 32(4):34-58, December 2001.
32. L. Lamport, R. Shostak and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3):382-401, July 1982.
33. B.W. Lampson. How to build a highly available system using Consensus. In Proceedings of the 10th International Workshop on Distributed Algorithms (WDAG), Springer-Verlag LNCS 1151:1-17, Berlin, 1996.
34. E.K. Lee and C. Thekkath. Petal: Distributed virtual disks. In Proceedings of the 7th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VII), pages 84-92, October 1996.
35. W.K. Lo and V. Hadzilacos. Using failure detectors to solve consensus in asynchronous shared-memory systems. In Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG), Springer-Verlag LNCS 857:280-295, Berlin, 1994.
36. N. Lynch and A. Shvartsman. RAMBO: A reconfigurable atomic memory service for dynamic networks. In Proceedings of the 16th International Symposium on DIStributed Computing (DISC) October 2002, Toulouse, France. To Appear.
37. D. Malkhi. Quorum systems. Chapter in The Encyclopedia of Distributed Computing, Joseph Urban and Partha Dasgupta, editors, Kluwer Academic Publishers. To be published, http://www.cs.huji.ac.il/̃dalia/pubs/quorums.ps.gz.
38. D. Malkhi and M. Reiter, Byzantine quorum systems. The Journal of Distributed Computing 11 (4):203-213, 1998.
39. D. Malkhi and M.K. Reiter. An architecture for survivable coordination in large-scale systems. IEEE Transactions on Knowledge and Data Engineering 12(2): 187-202, March/April 2000.
40. D. Malkhi, M.K. Reiter, D. Tulone and E. Ziskind. Persistent objects in the Fleet system. In Proceedings of DARPA's second DARPA Information Survivability Conference and Exposition (DISCEX II), 2001.
41. D. Malkhi, M. Reiter and A. Wool. The load and availability of Byzantine quorum systems. SIAM Journal of Computing 29(6):1889-1906, 2000.
42. J.P. Martin, L. Alvisi, M. Dahlin. Minimal byzantine storage. In Proceedings of the 16th International Symposium on DIStributed Computing (DISC) October 2002, Toulouse, France. To Appear.
43. F. Pedone, A. Schiper, P. Urban and D. Cavin. Solving agreement problems with weak ordering oracles. Technical Report IC/2002/010, Ecole Polytechnique Federale de Lausanne, Switzerland, March 2002.
44. D. Powell, editor. Group communication. Communications of the ACM 39(4), April 1996.
45. M.K. Reiter. Secure agreement protocols: Reliable and atomic group multicast in Rampart. In Proceedings of the 2nd ACM Conference on Computer and Communications Security, pages 68-80, November 1994.
46. M.D. Skeen. Nonblocking commit protocols. In SIGMOD International Conference Management of Data, 1981.
47. M.D. Skeen. Crash recovery in a distributed database system. PhD thesis, UC Berkeley, May 1982.
48. F.B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys 22(4):299-319, December 1990.
49. C. Thekkath, T. Mann and E.K. Lee. Frangipani: A scalable distributed file system. In Proceedings of the 16th ACM Symposium on Operating Systems Principles, pages 224-237, October 1997.
50. M. Waldman, A. Rubin and L. Crabor. Publius, A robust, tamper-evident and censorship-resistant web publishing system. In Proceedings of the 9th USENIX Security Symposium, August, 2000.