Browsing by Author "Siu, HS"

Now showing 1 - 3 of 3

A note on consensus on dual failure modes
(1996-03-01)
Siu, HS
;
Chin, YH
;
Yang, WP
;
資訊工程學系
;
Department of Computer Science
Meyer and Pradhan proposed the MS (for ''mixed-sum'') algorithm to solve the Byzantine Agreement (BA) problem with dual failure modes: arbitrary faults (Byzantine faults) and dormant faults (essentially omission faults and timing faults) [3]. Our study indicates that this algorithm uses an inappropriate method to eliminate the effects of dormant faults and that the bound on the number of allowable faulty processors is overestimated. This paper corrects the algorithm and gives a new bound for the allowable faulty processors.
Byzantine agreement in the presence of mixed faults on processors and links
(1998-04-01)
Siu, HS
;
Chin, YH
;
Yang, WP
;
資訊工程學系
;
Department of Computer Science
In early stage, the Byzantine agreement (BA) problem was studied with single faults on processors in either a fully connected network or a nonfully connected network. Subsequently, the single fault assumption was extended to mixed faults (also referred to as hybrid fault model) on processors. For the case of both processor and link failures, the problem has been examined in a fully connected network with a single faulty type, namely an arbitrary fault. To release the limitations of a fully connected network and a single faulty type, the problem is reconsidered in a general network. The processors and links in such a network can both be subjected to different types of fault simultaneously. The proposed protocol uses the minimum number of message exchanges and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach an agreement.
Reaching strong consensus in the presence of mixed failure types
(1998-07-01)
Siu, HS
;
Chin, YH
;
Yang, WP
;
資訊工程學系
;
Department of Computer Science
The Strong Consensus (SC) is a variant of the conventional distributed consensus problem. The protocol designed for the SC problem requires that the agreed value among fault-free processors be one of the fault-free processor's initial value. The SC problem is re-examined with the assumption of mixed failure types (also referred to as the hybrid fault model). Compared with the features of the existing protocols, the underlying network topologies of the proposed protocol do not have to be fully connected, the mixed failure types can be tolerated, and no prior information of the system's faulty status is required. The proposed protocol can tolerate a maximum number of faults to enable each fault-free processor to reach an agreement with a minimum number of message exchanges. (C) 1998 Published by Elsevier Science Inc. All rights reserved.