The incremental agreement

Authors:
M. L. Chiang;S. C. Wang;L. Y. Tseng
Affiliations:
Department of Computer Science, National Chung-Hsing University, ROC;Graduate Institute of Informatics, Chaoyang University of Technology, ROC;Department of Computer Science, National Chung-Hsing University, ROC
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 0

Data communications, computer networks and open systems (4th ed.)

Data communications, computer networks and open systems (4th ed.)
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links

IEEE Transactions on Parallel and Distributed Systems
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Reaching Fault Diagnosis Agreement under a Hybrid Fault Model

IEEE Transactions on Computers
Reaching fault diagnosis agreement on an unreliable general network

Information Sciences—Informatics and Computer Science: An International Journal
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Quantified Score

Hi-index	0.89

Visualization

Abstract

To achieve reliable distributed systems, the fault-tolerance must be studied. One of the most important problems of fault-tolerance issues lies in the Byzantine Agreement (BA) problem. The primary issue surrounding BA is that fault-free processors must obtain common agreement even in cases where faults persist. In this field, the fault diagnosis protocol has been proposed so that each fault-free processor detects/locates a common set of faulty processors. However, in this study, the incremental agreement is invoked to make each processor able to agreement upon executing the fault diagnosis protocol using minimal rounds of message exchange in the presence of dual failure characteristics of processors.