English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 56848/90584 (63%)
造访人次 : 12157156      在线人数 : 68
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


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


    题名: A Recursive Byzantine-Resilient Protocol
    作者: Cheng, Chien-Fu;Tsai, Kuo-Tang
    关键词: Distributed system;Fault-tolerant;Consensus problem;Byzantine fault
    日期: 2015-02
    上传时间: 2016-01-06 10:53:16 (UTC+8)
    摘要: To solve the consensus problem, the classical consensus protocols require t+1 rounds of message exchange to tolerate t faulty processors, where t=⌊(n−1)/3⌋ and n is the total number of processors in the network. With advancement of software and hardware technologies in recent years, the “actual number of faulty processors” (fact) in a network is usually smaller than t, and fact≪t. However, the classical consensus protocols still need to execute t+1 rounds of message exchange even if there are no faulty processors in the network. To address this issue, we propose a new consensus protocol called Recursive Byzantine-Resilient protocol (RBR protocol). We integrate the concepts of parallel computing, grouping, hierarchy and recursion into this protocol to reduce its time and space complexity. Specifically, the RBR protocol can solve the consensus problem in the presence of 2h(⌊((n/4h)−1)/3⌋+1)−1 Byzantine faulty processors, where h=⌊(lg(n)−2)/2⌋. The time complexity and space complexity of RBR protocol are O(lg(n)) and O(nklg(n)) respectively. The results reveal that RBR protocol outperforms previous protocols in terms of time complexity and in terms of space complexity. In this paper, we also discuss how to enhance the fault-tolerance capability of RBR protocol in achieving consensus through repetitive execution of the protocol when the number of Byzantine faulty processors is greater than 2h(⌊((n/4h)−1)/3⌋+1)−1.
    關聯: Journal of Network and Computer Applications 48, pp.87-98
    DOI: 10.1016/j.jnca.2014.10.010
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    A recursive Byzantine-resilient protocol.pdf1858KbAdobe PDF1检视/开启
    index.html0KbHTML133检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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