Full metadata record
DC FieldValueLanguage
dc.contributor.authorSiu, HSen_US
dc.contributor.authorChin, YHen_US
dc.contributor.authorYang, WPen_US
dc.date.accessioned2014-12-08T15:49:10Z-
dc.date.available2014-12-08T15:49:10Z-
dc.date.issued1998-04-01en_US
dc.identifier.issn1045-9219en_US
dc.identifier.urihttp://dx.doi.org/10.1109/71.667895en_US
dc.identifier.urihttp://hdl.handle.net/11536/32677-
dc.description.abstractIn early stage, the Byzantine agreement (BA) problem was studied with single faults on processors in either a fully connected network or a nonfully connected network. Subsequently, the single fault assumption was extended to mixed faults (also referred to as hybrid fault model) on processors. For the case of both processor and link failures, the problem has been examined in a fully connected network with a single faulty type, namely an arbitrary fault. To release the limitations of a fully connected network and a single faulty type, the problem is reconsidered in a general network. The processors and links in such a network can both be subjected to different types of fault simultaneously. The proposed protocol uses the minimum number of message exchanges and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach an agreement.en_US
dc.language.isoen_USen_US
dc.subjectByzantine agreementen_US
dc.subjectfault-tolerant distributed systemen_US
dc.subjecthybrid fault modelen_US
dc.subjectgeneral networken_US
dc.subjectsynchronizationen_US
dc.titleByzantine agreement in the presence of mixed faults on processors and linksen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/71.667895en_US
dc.identifier.journalIEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMSen_US
dc.citation.volume9en_US
dc.citation.issue4en_US
dc.citation.spage335en_US
dc.citation.epage345en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000073300300002-
dc.citation.woscount22-
Appears in Collections:Articles


Files in This Item:

  1. 000073300300002.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.