Obtaining Consistent Good/Bad Plan Set in the Presence of Faults

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 會議論文 > Item 987654321/100273

請使用永久網址來引用或連結此文件: 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 Verí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.html		0Kb	HTML	236	檢視/開啟

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

TAIR相關文章