| Obtaining Consistent Good/Bad Plan Set in the Presence of Faults | |
|---|---|
| 學年 | 101 |
| 學期 | 2 |
| 發表日期 | 2013-04-07 |
| 作品名稱 | Obtaining Consistent Good/Bad Plan Set in the Presence of Faults |
| 作品名稱（其他語言） | |
| 著者 | Cheng, C.F. |
| 作品所屬單位 | 淡江大學資訊工程學系 |
| 出版者 | |
| 會議名稱 | IEEE Wireless Communications and Networking Conference (IEEE WCNC 2013) |
| 會議地點 | Shanghai, China |
| 摘要 | 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. |
| 關鍵字 | |
| 語言 | en |
| 收錄於 | EI |
| 會議性質 | 國際 |
| 校內研討會地點 | |
| 研討會時間 | 20130407~20130410 |
| 通訊作者 | |
| 國別 | CHN |
| 公開徵稿 | Y |
| 出版型式 | 電子版 |
| 出處 | Proceedings of 2013 IEEE Wireless Communications and Networking Conference (WCNC 2013), pp.286-290 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/100273 ) |
GoogleAnalytics