National Tsing Hua University Institutional Repository:Achieving Byzantine agreement in a processor and link fallible network
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 15038360      在线人数 : 51
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 會議論文  >  Achieving Byzantine agreement in a processor and link fallible network


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/14038


    题名: Achieving Byzantine agreement in a processor and link fallible network
    作者: Yan,K. Q.
    Chin,Y. H.
    日期: 1989
    出版者: Institute of Electrical and Electronics Engineers Inc
    关键词: Computer Networks
    Protocols
    Computer Operating Systems
    Program Processors
    Computer Systems
    Digital
    Distributed
    摘要: 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.
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/14038
    显示于类别:[資訊工程學系] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    2030204030007.pdf626KbAdobe PDF1039检视/开启


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

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