Byzantine fault tolerant execution of long-running distributed applications

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

Volumn , Issue , 2006, Pages 528-534

  Pallemulle, Sajeeva L ^a   Wehrman, Ian ^a   Goldman, Kenneth J ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Autonomous distributed applications; Byzantine agreement; Fault tolerant systems

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FAULT TOLERANCE; NETWORK PROTOCOLS; SERVERS;

AUTONOMOUS DISTRIBUTED APPLICATIONS; BYZANTINE AGREEMENT; FAULT ISOLATION; MACHINE REPLICATION; MESSAGE COMPLEXITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38049112695     PISSN: 10272658     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. M. Castro and B. Liskov. Practical Byzantine Fault Tolerance. In Proc. 3rd Symp. on Operating Systems Design and Implementation, pages 173-186, 1999.
2. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-Tolerant Erasure-Coded Storage. In Proc. 5th Intl. Conf. on Dependable Systems and Networks, pages 135-144, 2004.
3. D. Malkhi and M. Reiter. Byzantine quorum systems. In Proc. 29th Symp. on Theory of Computing, pages 569-578, 1997.
4. A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R P. Wattenhofer. Farsite: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. ACM Operating Systems Review, 36(SI): 1-14, 2002.
5. J. P. Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine Storage. In Proc. 16th Intl. Conf. on Distributed Computing, pages 311-325, 2002.
6. W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, 22(6): 644-654, 1976.
7. B. Prenel and P. van Oorschot. MDx-MAC and Building Fast MACs from Hash Functions. In Proc. 15th Conf. on Advances in Cryptology, pages 1-14, 1995.
8. R. Rivest. RFC 1321: The MD5 Message-Digest Algorithm, 1992.
9. H. D. Thorvaldsson and K. J. Goldman. Dynamic Evolution in a Survivable Application Infrastructure. In Proc. 18th IASTED Intl. Conf. on Paralel and Distributed Computing and Systems, 2006.
10. S. L. Pallemulle, H. D. Thorvaldsson, and K. J. Goldman. Preserving Performance of Byzantine Fault Tolerant Replica Groups in the Presence of Malicious Clients. Technical Report WUCSE-2006-52, Washington University, 2006.
11. M. G. Merideth, A. Iyengar, T. Mikalsen, S. Tai, I. Rouvellou, and P. Narasimhan. Thema: ByzantineFault-Tolerant Middleware forWeb-Service Applications. In Proc. 24th Symp. on Reliable Distributed Systems, pages 131-140, 2005.
12. S. Ahmed. A Scalable Byzantine Fault Tolerant Secure Domain Name System, 2001. Master's thesis, Massachusetts Institute of Technology.
13. C Fry and M. Reiter. Nested Objects in a Byzantine Quorum-Replicated System. In Proc. 23rd Intl. Symp. on Reliable Distributed Systems, pages 79-89, 2004.
14. P. Narasimhan, K. P. Kihlstrom, L. E. Moser, and P. M. Melliar-Smith. Providing Support for Survivable CORBA Applications with the Immune System. In Proc. 19th Intl. Conf. on Distributed Computing Systems, pages 507-516, 1999.
15. K. P. Kihlstrom, L. E. Moser, and P. M. Melliar-Smith. The SecureRing group communication system. ACM Transactions on Information and System Security, 4(4):371-406, 2001.
16. N. Lynch and M. Tuttle. Introduction to Input/Output Automata. CWI Quarterly, 2(3):219-246, 1989.
17. I. Wehrman, S. L. Pallemulle, and K. J. Goldman. Extending Byzantine Fault Tolerance to Replicated Clients. Technical Report WUCSE-2006-7, Washington University, 2006.