English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49378/84106 (59%)
造訪人次 : 7380467      線上人數 : 78
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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.html0KbHTML125檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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