Reaching strong consensus in the presence of mixed failure types

Information Sciences

Volumn 108, Issue 1-4, 1998, Pages 157-180

  Siu, Hin Sing ^a   Chin, Yeh Hao ^b   Yang, Wei Pang ^c  

^a MING CHI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^c NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Byzantine agreement; Distributed consensus; Fault tolerant distributed system; Mixed failure types; Nonfully connected network; Strong consensus

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC NETWORK TOPOLOGY; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS;

BYZANTINE AGREEMENT; HYBRID FAULT MODEL;

COMPUTER SYSTEM RECOVERY;

EID: 0032117639     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(97)10054-8     Document Type: Article

References (18)

1. M. Barborak, M. Malek, A. Dahbura, The Consensus Problem in Fault-Tolerant Computing, ACM Computing Surveys 25 (2) (1993) 171-220.
2. D. Dolev, M.J. Fischer, R. Fowler, N.A. Lynch, H.R. Strong, An efficient algorithm for Byzantine agreement without authentication. Inform. Comput. 52 (1982) 257-274.
3. L. Lamport, R. Shostak, M. Pease, The Byzantine Generals Problem, ACM Trans. Prog. Lang. Syst. 4 (3) (1982) 382-401.
4. H.G. Molina, F. Pittelli, S. Davidson, Applications of Byzantine Agreement in Database Systems, ACM Trans. TODS 11 (1) (1986) 27-47.
5. M. Pease, R. Shostak, L. Lamport, Reaching agreement in presence of faults, J. ACM 27 (2) (1980) 228-234.
6. G. Neiger, Distributed Consensus revisited, Inform, Process. Lett. 49 (1994) 195-201.
7. F.J. Meyer, D.K. Pradhan, Consensus with dual failure modes, IEEE Trans. Parallel Distrib. Syst. 2 (2) (1991) 214-222.
8. A. Bar-Noy, D. Dolev, C. Dwork, R. Strong, Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement, Proceedings of the Symposium on Principle of Distributed Computing 1987, pp. 42-51.
9. D. Dolev, The Byzantine generals strike again, J. Algorithms 3 (1) (1982) 14-30.
10. P. Lincoln, J. Rushby, A formally verified algorithm for interactive consistency under a hybrid fault model, Proceedings of the Symposium on Fault-Tolerate Computing Toulouse, 1993, pp. 402-411.
11. P. Thambidurai, Y.-K. Park, Interactive Consistency with Multiple failure modes, Proc. Symp. on Reliable Distributed Systems Columbus, OH, 1988, pp. 93-100.
12. K. Shin, P. Ramanathan, Diagnosis of processors with Byzantine faults in a distributed computing systems, Proceedings of the Symposium on Fault-Tolerate Computing, 1987, pp. 55-60.
13. M. Fischer, M. Paterson, N. Lynch, Impossibility of distributed consensus with one faulty process, J. ACM 32 (4) (1985) 374-382.
14. K.Q. Yan, Y.H. Chin, S.C. Wang, Optimal agreement protocol in malicious faulty processors and faulty links, IEEE Trans. on Knowledge and Data Engrg. 4 (3) (1992) 266-280.
15. N. Deo, GRAPH THEORY with Applications to Engineering and Computer Science, Prentice-Hall, Englewood Cliffs, NJ, 1974.
16. M. Fischer, N. Lynch, A lower bound for the assure interactive consistency, Inform. Process. Lett. 14 (4) (1982) 183-186.
17. H.S. Siu, Y.H. Chin, W.P. Yang, A note on consensus on dual failure modes, IEEE Trans. Parallel Distrib. Syst. 3 (1996) 230-255.
18. R. Handel, M.N. Huber, Integrated Broadband Networks: An Introduction to ATM-based Networks, Addison-Wesley, Reading, MA, 1991.