Title :
Revisit consensus problem on dual link failure modes
Author :
Wang, S.C. ; Yan, K.Q.
Author_Institution :
Inst. of Inf. Manage., Chao Yang Univ. of Technol., Taiwan, China
Abstract :
Traditionally, the consensus problem was solved in a fully connected network with node failure assumption. The link failure was unfairly treated as node failure. The paper revisits the consensus problem with the assumption of link failure on dormant faults and malicious faults. A simple and efficient protocol is proposed. The complexity of information exchange required by the protocol is O(n2 ). The protocol uses a minimum number of rounds to achieve a consensus and can tolerate a maximum number of allowable faulty components
Keywords :
communication complexity; distributed processing; fault tolerant computing; protocols; allowable faulty components; complexity; consensus problem; dormant faults; dual link failure modes; efficient protocol; fully connected network; information exchange; malicious faults; node failure assumption; Chaos; Computer crashes; Councils; Delay; Fault diagnosis; Fault tolerant systems; Information management; Protocols; Working environment noise;
Conference_Titel :
Computer Software and Applications Conference, 1998. COMPSAC '98. Proceedings. The Twenty-Second Annual International
Conference_Location :
Vienna
Print_ISBN :
0-8186-8585-9
DOI :
10.1109/CMPSAC.1998.716642