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


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


    题名: Obtaining Consistent Good/Bad Plan Set in the Presence of Faults
    作者: Cheng, C.F.
    贡献者: 淡江大學資訊工程學系
    日期: 2013-04-07
    上传时间: 2015-02-13 21:05:35 (UTC+8)
    摘要: In a cooperative network, we need a mechanism that allows all correct processors to reach a common agreement. Hence, more and more attention has been drawn on the agreement related problems (Byzantine Agreement (BA) problem and Consensus problem). In previous results, the goal of BA and Consensus is obtaining a common value no matter this value is good or bad. To address this problem, Correia, Bessani and Veríssimo proposed the Byzantine Generals with Alternative Plans (BGAP) protocol that requires the common value come from the good plan set. BGAP is a graceful and practical protocol. They also pointed out that the BA problem with alternative plans is unsolvable if correct processors have different good plans and bad plans. In this paper, we propose the Plan_Consensus Protocol (PCP) to ensure that all correct processors obtain a consistent good plan set and a consistent bad plan set in the network.
    關聯: Proceedings of 2013 IEEE Wireless Communications and Networking Conference (WCNC 2013), pp.286-290
    显示于类别:[資訊工程學系暨研究所] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML293检视/开启

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

    TAIR相关文章

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