http://scholars.ntou.edu.tw/handle/123456789/20305
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | S.C. Wang | en_US |
dc.contributor.author | K.Q. Yan | en_US |
dc.contributor.author | C.F. Cheng | en_US |
dc.date.accessioned | 2022-02-15T06:22:19Z | - |
dc.date.accessioned | 2022-02-15T06:22:20Z | - |
dc.date.available | 2022-02-15T06:22:19Z | - |
dc.date.available | 2022-02-15T06:22:20Z | - |
dc.date.issued | 2002-12-17 | - |
dc.identifier.isbn | 0-7695-1760-9 | - |
dc.identifier.issn | 1521-9097 | - |
dc.identifier.uri | http://scholars.ntou.edu.tw/handle/123456789/20305 | - |
dc.description.abstract | Under many circumstances, reaching a common agreement in the presence of faulty components is the central issue of fault tolerant distributed computing. So the Byzantine agreement (BA) problem has become more and more important in distributed systems. Traditionally, the BA problem was visited in a fully connected network (FCN), broadcasting network (BCN) and generalized connected network (GCN). Subsequently, malicious fault assumption with processors or communication media was extended to a hybrid fault model on both processors and communication media. However, the network structures (topologies) of FCN, BCN and GCN are not practical. In this study, we lighten restrictions of the network structure to revisit the BA problem with multicasting network (MCN). The proposed protocol uses the minimum number of rounds of message exchange and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach a common agreement in an MCN. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | Protocols | en_US |
dc.subject | Broadcasting | en_US |
dc.subject | Fault tolerance | en_US |
dc.subject | Network topology | en_US |
dc.subject | Information management | en_US |
dc.subject | Business communication | en_US |
dc.subject | Chaotic communication | en_US |
dc.subject | Distributed computing | en_US |
dc.subject | Fault tolerant systems | en_US |
dc.subject | Clocks | en_US |
dc.title | Achieving High Efficient Byzantine Agreement with Dual Components Failure Mode on a Multicasting Network. (IEEE ICPADS’02) | en_US |
dc.type | conference paper | en_US |
dc.relation.conference | Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings.,Taiwan | en_US |
dc.identifier.doi | 10.1109/ICPADS.2002.1183459 | - |
item.openairetype | conference paper | - |
item.fulltext | no fulltext | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_5794 | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | Department of Computer Science and Engineering | - |
crisitem.author.dept | College of Electrical Engineering and Computer Science | - |
crisitem.author.dept | National Taiwan Ocean University,NTOU | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | National Taiwan Ocean University,NTOU | - |
顯示於: | 資訊工程學系 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。