The Community for Technology Leaders
RSS Icon
Issue No.03 - June (1992 vol.4)
pp: 266-280
<p>Traditionally, the problems of Byzantine agreement, consensus, and interactive consistency are studied in a fully connected network with processors in malicious failure only. Such problems are reexamined with the assumption of malicious faults on both processors and links. The proposed protocols use the minimum number of message exchanges and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach a common agreement for the cases of processor failure, link failure, or processor and link failure.</p>
optimal agreement protocol; fault tolerant computing; malicious faulty processors; faulty links; Byzantine agreement; consensus; interactive consistency; fault tolerant computing; protocols
K.-Q. Yan, Y.H. Chin, S.-C. Wang, "Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links", IEEE Transactions on Knowledge & Data Engineering, vol.4, no. 3, pp. 266-280, June 1992, doi:10.1109/69.142017
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool