English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14781374      Online Users : 63
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
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 會議論文  >  Achieving Byzantine agreement in a generalized network model

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/14054

    Title: Achieving Byzantine agreement in a generalized network model
    Authors: Wang,S. C.
    Chin,Y. H.
    Yan,K. Q.
    Date: 1989
    Publisher: Institute of Electrical and Electronics Engineers Inc
    Keywords: Computer Networks
    Computer Architecture
    Abstract: Traditionally, the Byzantine agreement (BA) problem has been studied either in a fully connected network or in a broadcast network. Here, a generalized network model for BA is proposed. The conventional fully connected network or broadcast network is a special case of the new network architecture. A BA problem with the processor in a malicious fault is studied in the model. The proposed protocol incorporates the previous protocols developed for a fully connected network or a broadcast network, solves a BA problem by using the minimum number of rounds, and can tolerate the maximum number of faulty processors.
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/14054
    Appears in Collections:[資訊工程學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    2030204030005.pdf645KbAdobe PDF960View/Open


    SFX Query


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