English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51258/86283 (59%)
Visitors : 8029476      Online Users : 50
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/100273


    Title: Obtaining Consistent Good/Bad Plan Set in the Presence of Faults
    Authors: Cheng, C.F.
    Contributors: 淡江大學資訊工程學系
    Date: 2013-04-07
    Issue Date: 2015-02-13 21:05:35 (UTC+8)
    Abstract: 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.
    Relation: Proceedings of 2013 IEEE Wireless Communications and Networking Conference (WCNC 2013), pp.286-290
    Appears in Collections:[資訊工程學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML141View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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