Fault detection for Byzantine quorum systems

Dependable Computing for Critical Applications 7

Volumn , Issue , 1999, Pages 379-394

  Alvisi, Lorenzo ^a   Malkhi, Dahlia ^b   Pierce, Evelyn ^a   Reiter, Michael ^c  

^a University of Texas at Austin   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE;

ARBITRARY FAILURES; BYZANTINE QUORUM SYSTEMS; DATA SERVER; FAULTY SERVERS; REPLICATED DATA; RETURN VALUE; STATISTICAL APPROACH;

FAULT DETECTION;

EID: 85041458981     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCFTS.1999.814307     Document Type: Conference Paper

References (14)

1. [CT96] T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.
2. [DS97] A. Doudou and A. Schiper. Muteness detectors for consensus with Byzantine processes. Technical Report TR97-230, Department of Computer Science, École Polytechnic Fédérale de Lausanne, October 1997.
3. [KMM97] K. P. Kihlstrom, L. E. Moser, and P.M. Melliar-Smith. Solving consensus in a Byzantine environment using an unreliable failure detector. In Proceedings of the International Conference on Principles of Distributed Systems, pages 61-75, December 1997.
4. [KMM98] K. P. Kihlstrom, L. E. Moser and P. M. Melliar-Smith. The Secure Ring protocols for securing group communication. In Proceedings of the 31st Annual Hawaii International Conference on System Sciences, pages 317-326, January 1998.
5. [Lam86] L. Lamport. On interprocess communication (part II: algorithms). Distributed Computing 1:86-101, 1986.
6. [LRM98] M. J. Lin, A. Ricciardi and K. Marzullo. On the resilience of multicasting strategies in a failure-propagating environment. UT Austin TR-1998-003.
7. [MR95] R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.
8. [MR97a] D. Malkhi and M. Reiter. Byzantine quorum systems. Distributed Computing 11(4):203-213, 1998.
9. [MR97b] D. Malkhi and M. Reiter. Unreliable intrusion detection in distributed computation. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, pages 116-124, June 1997.
10. [MRW97] D. Malkhi, M. Reiter, and A. Wool. The load and availability of Byzantine quorum systems. In Proceedings of the 16th ACM Symposium on Principles of Distributed Computing, pages 249-257, August 1997.
11. [Rei94] 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.
12. [PG89] F. M. Pittelli and H. Garcia-Molina. Reliable scheduling in a TMR database system. ACM Transactions on Computer Systems, 7(1):25-60, February 1989.
13. [Sch90] F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299-319, December 1990.
14. [SESTT92] S. K. Shrivastava, P. D. Ezhilchelvan, N. A. Speirs, S. Tao, and A. Tully. Principal features of the VOLTAN family of reliable node architectures for distributed systems. IEEE Transactions on Computers, 41(5):542-549, May 1992.