A note on consensus on dual failure modes

doi:10.1109/71.491575

Full metadata record

DC Field	Value	Language
dc.contributor.author	Siu, HS	en_US
dc.contributor.author	Chin, YH	en_US
dc.contributor.author	Yang, WP	en_US
dc.date.accessioned	2014-12-08T15:02:46Z	-
dc.date.available	2014-12-08T15:02:46Z	-
dc.date.issued	1996-03-01	en_US
dc.identifier.issn	1045-9219	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/71.491575	en_US
dc.identifier.uri	http://hdl.handle.net/11536/1403	-
dc.description.abstract	Meyer and Pradhan proposed the MS (for ''mixed-sum'') algorithm to solve the Byzantine Agreement (BA) problem with dual failure modes: arbitrary faults (Byzantine faults) and dormant faults (essentially omission faults and timing faults) [3]. Our study indicates that this algorithm uses an inappropriate method to eliminate the effects of dormant faults and that the bound on the number of allowable faulty processors is overestimated. This paper corrects the algorithm and gives a new bound for the allowable faulty processors.	en_US
dc.language.iso	en_US	en_US
dc.subject	Byzantine Agreement	en_US
dc.subject	consensus problem	en_US
dc.subject	distributed systems	en_US
dc.subject	dual failure modes	en_US
dc.subject	fault tolerance	en_US
dc.subject	hybrid fault model	en_US
dc.title	A note on consensus on dual failure modes	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1109/71.491575	en_US
dc.identifier.journal	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS	en_US
dc.citation.volume	7	en_US
dc.citation.issue	3	en_US
dc.citation.spage	225	en_US
dc.citation.epage	230	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1996UF31800001	-
dc.citation.woscount	35	-
Appears in Collections:	Articles

Files in This Item:

A1996UF31800001.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.