A Feature-Oriented Fault Diagnosis Agreement Protocol in Distributed SystemsFeature-Oriented Fault Diagnosis Agreement Protocol • September 25th, 2019
Contract Type FiledSeptember 25th, 2019Hui-Ching Hsieh1, Mao-Lun Chiang2, Wen-Chung Tsai2, Yen-Chiu Chen3 1 Department of Information Communication, Hsing Wu University, Taiwan
A Feature-Oriented Fault Diagnosis Agreement Protocol in Distributed SystemsFeature-Oriented Fault Diagnosis Agreement Protocol • December 11th, 2018
Contract Type FiledDecember 11th, 2018Understanding the fault-tolerance of distributed systems is crucial for achieving reliability. One of the most important issues surrounding fault-tolerance is the Byzantine Agreement (BA) problem. It requires a set of processors to agree on a common value even though some components are corrupted. Fault Diagnosis Agreement (FDA) has also been proposed so that each fault-free processor detects/locates a common set of faulty processors. In general, the BA protocol needs ⎣(n-1)/3⎦+1 rounds of message exchange to reach agreement, and FDA protocols need ⎣(n-1)/3⎦+2 rounds of message exchange to detect/locate faulty components, regardless of the presence or absence of faulty processors. However, the number of messages produced results in a large protocol overhead. To solve the BA and FDA problems simultaneously and efficiently, a novel concept of feature value is proposed in our algorithm to reach agreement using the minimum constant number of rounds characterized by the presence of dual fai