<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

🏛️國立陽明交通大學機構典藏

Author: search.filters.author.Yang, WPSubject: search.filters.subject.hybrid fault model

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item type:Item,
    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.
  • Thumbnail Image
    Item type:Item,
    Reaching fault diagnosis agreement under a hybrid fault
    (2000-09-01)
    Hsiao, HS
    ;
    Chin, YH
    ;
    Yang, WP
    ;
    資訊工程學系
    ;
    Department of Computer Science
    The goal of the fault diagnosis agreement (FDA) problem is to make each fault-free processor detect/locate a common set of faulty processors. The problem is examined on processors with mixed fault model (also referred to as hybrid fault model). An evidence-based fault diagnosis protocol is proposed to solve the FDA problem. The proposed protocol first collects the messages which have accumulated in the Byzantine agreement protocol as the evidence. By examining the collected evidence, a fault-free processor can detect/locate which processor is faulty. Then, the network can be reconfigured by removing the detected faulty processors and the links connected to these processors from the network. The proposed protocol can detect/locate the maximum number of faulty processors to solve the FDA problem.
  • Thumbnail Image
    Item type:Item,
    Reaching strong consensus in a general network
    (2002-07-01)
    Hsiao, HS
    ;
    Chin, YH
    ;
    Yang, WP
    ;
    資訊工程學系
    ;
    Department of Computer Science
    The strong consensus (SC) problem is a variant of the conventional distributed consensus problem (also known as the Byzantine agreement problem). The SC problem requires that the agreed value among fault-free processors be one of the fault-free processor's initial values. Originally, the problem was studied in a fully connected network with malicious faulty processors. In this paper, the SC problem is re-examined in a general network, in which the components (processors and communication links) may be subjected to different faulty types simultaneously (also called the hybrid fault model or mixed faulty types) and the network topology does not have to be fully connected. The proposed protocol can tolerate the maximum number of tolerable faulty components such that each fault-free processor obtains a common value for the SC problem in a general network.
  • Thumbnail Image
    Item type:Item,
    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.