Dual link fault diagnosis agreement

Authors:
S. C. Wang;K. Q. Yan
Affiliations:
Department of Information Management, Chaoyang University of Technology, 168 Gifeng E. Rd., Wufeng 413, Taichung County, Taiwan, ROC;Department of Business Administration, Chaoyang University of Technology, 168 Gifeng E. Rd., Wufeng 413, Taichung County, Taiwan, ROC
Venue:
Journal of Systems and Software
Year:
2004

Citing 9
Cited 0

The consensus problem in fault-tolerant computing

ACM Computing Surveys (CSUR)
Data communications, computer networks and open systems (4th ed.)

Data communications, computer networks and open systems (4th ed.)
Bounds on information exchange for Byzantine agreement

Journal of the ACM (JACM)
A Note on Consensus on Dual Failure Modes

IEEE Transactions on Parallel and Distributed Systems
Consensus under unreliable transmission

Information Processing Letters
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
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
Consensus With Dual Failure Modes

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Previously, most Byzantine Agreement protocols can reach an agreement by the way of fault masking. Few, of them can detect and locate the faulty components. And on the other hand, the most fault diagnosis algorithms can detect and locate faulty components but few of them can make all fault free processors reach an agreement. This study analyzes the messages received at the period of reaching agreement, and then, to detect and to locate the faulty links of the network. Finally, the proposed protocol can further make all fault free processors agree on the common failure report of the synchronous fully connected network. The symptoms of the faults include the malicious fault and the dormant fault.