A note on consensus on dual failure modes

Hin Sing Siu, Yeh Hao Chin, Wei Pang Yang

Research output: Contribution to journalArticle

50 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)225-230
Number of pages6
JournalIEEE Transactions on Parallel and Distributed Systems
Volume7
Issue number3
DOIs
Publication statusPublished - 1996 Dec 1

Fingerprint

Failure modes

Keywords

  • Byzantine Agreement
  • Consensus problem
  • Distributed systems
  • Dual failure modes
  • Fault tolerance
  • Hybrid fault model

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

A note on consensus on dual failure modes. / Siu, Hin Sing; Chin, Yeh Hao; Yang, Wei Pang.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 3, 01.12.1996, p. 225-230.

Research output: Contribution to journalArticle

Siu, Hin Sing ; Chin, Yeh Hao ; Yang, Wei Pang. / A note on consensus on dual failure modes. In: IEEE Transactions on Parallel and Distributed Systems. 1996 ; Vol. 7, No. 3. pp. 225-230.
@article{e46bb81f9f5e47828acbc88fbbc3cf99,
title = "A note on consensus on dual failure modes",
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.",
keywords = "Byzantine Agreement, Consensus problem, Distributed systems, Dual failure modes, Fault tolerance, Hybrid fault model",
author = "Siu, {Hin Sing} and Chin, {Yeh Hao} and Yang, {Wei Pang}",
year = "1996",
month = "12",
day = "1",
doi = "10.1109/71.491575",
language = "English",
volume = "7",
pages = "225--230",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "3",

}

TY - JOUR

T1 - A note on consensus on dual failure modes

AU - Siu, Hin Sing

AU - Chin, Yeh Hao

AU - Yang, Wei Pang

PY - 1996/12/1

Y1 - 1996/12/1

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

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

KW - Byzantine Agreement

KW - Consensus problem

KW - Distributed systems

KW - Dual failure modes

KW - Fault tolerance

KW - Hybrid fault model

UR - http://www.scopus.com/inward/record.url?scp=0030107093&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030107093&partnerID=8YFLogxK

U2 - 10.1109/71.491575

DO - 10.1109/71.491575

M3 - Article

AN - SCOPUS:0030107093

VL - 7

SP - 225

EP - 230

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 3

ER -