National Tsing Hua University Institutional Repository:Achieving Byzantine agreement in a processor and link fallible network
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 15038223      Online Users : 96
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    NTHUR > College of Electrical Engineering and Computer Science > Department of Computer Science > CS Conference Papers >  Achieving Byzantine agreement in a processor and link fallible network

    Please use this identifier to cite or link to this item:

    Title: Achieving Byzantine agreement in a processor and link fallible network
    Authors: Yan,K. Q.
    Chin,Y. H.
    Date: 1989
    Publisher: Institute of Electrical and Electronics Engineers Inc
    Keywords: Computer Networks
    Computer Operating Systems
    Program Processors
    Computer Systems
    Abstract: Traditionally, the Byzantine Agreement (BA) problem is solved in a fully connected network with processor failure only. Here, the BA problem is reexamined under the syndrome of malicious fault on both processor and link. The proposed protocol FGEN can solve the BA problem for the failure of processor/link. The authors also prove that the protocol requires the minimum number of rounds and can tolerate the maximum number of allowable faulty components.
    Appears in Collections:[Department of Computer Science] CS Conference Papers

    Files in This Item:

    File Description SizeFormat
    2030204030007.pdf626KbAdobe PDF1039View/Open


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback