Reaching strong consensus in a general network

Hsien Sheng Hsiao, Yeh Hao Chin, Wei Pang Yang

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)601-625
Number of pages25
JournalJournal of Information Science and Engineering
Volume18
Issue number4
Publication statusPublished - 2002 Jul

Fingerprint

Telecommunication links
Topology
Values
communication

Keywords

  • Byzantine agreement
  • Fault-tolerant distributed system
  • General network
  • Hybrid fault model
  • Strong consensus

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Computational Theory and Mathematics
  • Library and Information Sciences

Cite this

Reaching strong consensus in a general network. / Hsiao, Hsien Sheng; Chin, Yeh Hao; Yang, Wei Pang.

In: Journal of Information Science and Engineering, Vol. 18, No. 4, 07.2002, p. 601-625.

Research output: Contribution to journalArticle

Hsiao, Hsien Sheng ; Chin, Yeh Hao ; Yang, Wei Pang. / Reaching strong consensus in a general network. In: Journal of Information Science and Engineering. 2002 ; Vol. 18, No. 4. pp. 601-625.
@article{d7efeac543f3429280585190a0a2c59f,
title = "Reaching strong consensus in a general network",
abstract = "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.",
keywords = "Byzantine agreement, Fault-tolerant distributed system, General network, Hybrid fault model, Strong consensus",
author = "Hsiao, {Hsien Sheng} and Chin, {Yeh Hao} and Yang, {Wei Pang}",
year = "2002",
month = "7",
language = "English",
volume = "18",
pages = "601--625",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "4",

}

TY - JOUR

T1 - Reaching strong consensus in a general network

AU - Hsiao, Hsien Sheng

AU - Chin, Yeh Hao

AU - Yang, Wei Pang

PY - 2002/7

Y1 - 2002/7

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

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

KW - Byzantine agreement

KW - Fault-tolerant distributed system

KW - General network

KW - Hybrid fault model

KW - Strong consensus

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

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

M3 - Article

AN - SCOPUS:0036646606

VL - 18

SP - 601

EP - 625

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 4

ER -