Tolerance to unbounded Byzantine faults

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2002, Pages 22-29

  Nesterenko, Mikhail ^a   Arora, Anish ^b  

^a KENT STATE UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAM LISTINGS; DISTRIBUTED COMPUTER SYSTEMS; LARGE SCALE SYSTEMS; OPTIMAL SYSTEMS;

BYZANTINE FAULTS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0036443284     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. A. Arora and M. Gouda. Closure and convergence: A foundation of fault-tolerant computing. IEEE Transactions on Software Engineering, 19(11):1015-1027, November 1993. Special Issue on Software Reliability.
2. A. Arora and S.S. Kulkarni. Component based design of multitolerance. IEEE Transactions on Software Engineering, 24(1):63-78, 1998.
3. J. Beauquier and S. Kekkonen-Moneta. Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors. International Journal of Systems Science, 28(11):1177-1187, 1997.
4. J. Beauquier and S. Kekkonen-Moneta. On ftss-solvable distributed problems. In Proceedings of the Third Workshop on Self-Stabilizing Systems, pages 64-79. Carleton University Press, 1997.
5. M. Choy and A.K. Singh. Localizing failures in distributed synchronization:. IEEE Transactions on Parallel and Distributed Systems, 7(7):705-716, July 1996.
6. S. Dolev and T. Herman. Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science, 3(4), 1997.
7. S. Ghosh and A. Gupta. An exercise in fault-containment: self-stabilizing leader election. Information Processing Letters, 59(5):281-288, September 1996.
8. S. Ghosh, A. Gupta, T. Herman, and S.V. Pemmaraju. Fault-containing self-stabilizing algorithms. In PODC96 Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pages 45-54, 1996.
9. S. Ghosh and S.V. Pemmaraju. Tradeoffs in fault-containing self-stabilization. In Proceedings of the Third Workshop on Self-Stabilizing Systems, pages 157-169. Carleton University Press, 1997.
10. T. Herman. A comprehensive bibliography on self-stabilization. Chicago Journal of Theoretical Computer Science, working paper, started in November 1996.
11. J. Hill, R. Szewczyk, A. Woo, D. Culler, S. Hollar, and K. Pister. System architecture directions for networked sensors. ACM SIGPLAN Notices, 35(11):93-104, November 2000.
12. S.S. Kulkarni and A. Arora. Compositional design of multitolerant repetitive Byzantine agreement. In Proceedings of the 18th International Conference on the Foundations of Software Technology and Theoretical Computer Science, Kharagpur, India, 1997.
13. S. Kutten and B. Patt-Shamir. Stabilizing time-adaptive protocols. Theoretical Computer Science, 220:93-111, 1999.
14. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
15. T. Masuzawa. A fault-tolerant and self-stabilizing protocol for the topology problem. In Proceedings of the Second Workshop on Self-Stabilizing Systems, pages 1.1-1.15, 1995.
16. V.P. Nelson. Fault-tolerant computing: fundamental concepts. Computer, 23(7):19-25, July 1990.
17. M. Nesterenko and A. Arora. Dining philosophers that tolerate malicious crashes, to appear in proceedings of 22nd International Conference on Distributed Computing Systems (ICDCS 2002).
18. M. Nesterenko and A. Arora. Tolerance to unbounded byzantine faults. Technical Report OSU-CISRC-7/02-TR19, Ohio State University, 2002. ftp://ftp.cis.ohio-state.edu/pub/techreport/2002/TR19.ps.
19. P.A.G. Sivilotti, S.M. Pike, and N. Sridhar. A new distributed resource-allocation algorithm with optimal failure locality. In Proceedings of the 12th IASTED Internation Conference on Parallel and Distributed Computing and Systems, volume 2. pages 524-529. IASTED/ACTA Press, November 2000.
20. E. Styer and G.L. Peterson. Improved algorithms for distributed resource allocation. In Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing (PODC '88), pages 105-116, New York, August 1998. ACM Association for Computing Machinery.
21. Y.K. Tsay and R.L. Bagrodia. An algorithm with optimal failure locality for the dining philosophers problem. In G.Tel and P.M.B. Vitányi, editors, Distributed Algorithms, 8th International Workshop, WDAG '94, volume 857 of Lecture Notes in Computer Science, pages 296-310, Terschelling, The Netherlands, 29 September-1 October 1994. Springer.
22. 3: Scalable self-configuration and self-healing in wireless networks. to appear in the proceedings of Twenty-First ACM Symposium on Principles of Distributed Computing (PODC 2002) Monterey, CA.