Reaching strong consensus in a general network

檔案

本條目沒有附加檔案。

日期

2002-07-01

類型

期刊名稱

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING

卷期與頁次

第 18 卷第 4 期,頁 601–625

ISSN

1016-2364

語言

英文

摘要

The strong consensus (SC) problem is a variant of the conventional distributed consensus problem (also known as the Byzantine agreement problem). The SC problem requires that the agreed value among fault-free processors be one of the fault-free processor's initial values. Originally, the problem was studied in a fully connected network with malicious faulty processors. In this paper, the SC problem is re-examined in a general network, in which the components (processors and communication links) may be subjected to different faulty types simultaneously (also called the hybrid fault model or mixed faulty types) and the network topology does not have to be fully connected. The proposed protocol can tolerate the maximum number of tolerable faulty components such that each fault-free processor obtains a common value for the SC problem in a general network.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Hsiao, H., Chin, Y., & Yang, W. (2002). Reaching strong consensus in a general network. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 18(4), 601–625. https://ir.lib.nycu.edu.tw/handle/11536/28712

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/28712