Interconnecting Lock-step Synchronous Fault-tolerant Systems based on Voting and Error-Correcting Codes

Th. Krol

doi:10.1109/PRDC.1999.816213

Interconnecting Lock-step Synchronous Fault-tolerant Systems based on Voting and Error-Correcting Codes

Th. Krol

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

188 Downloads (Pure)

Abstract

The correctness of the behavior of a fault-tolerant system depends among other things on the correct distribution of the data descending from unreliable I/O devices over the modules of the fault-tolerant system, the so-called input-problem. More generally, a maliciously behaving system, whether it is fault-tolerant or not, should never defeat a correctly functioning fault-tolerant system, i.e. a system which does not contain more faulty modules than it is designed to tolerate. This paper presents a new class of synchronous deterministic non-authenticated algorithms for reaching Byzantine agreement on data descending from other (fault-tolerant) devices. The algorithms are based on voting and error-correcting codes and require considerably less data communication than the existing algorithms, whereas the number of rounds and the number of modules meet the minimum bounds

Original language	Undefined
Title of host publication	Pacific Rim Int. Symp. on Dependable Computing
Place of Publication	Los Alamitos, California
Publisher	IEEE
Pages	62-69
Number of pages	8
ISBN (Print)	0-7695-0371-3
DOIs	https://doi.org/10.1109/PRDC.1999.816213
Publication status	Published - Dec 1999
Event	Pacific Rim Int. Symp. on Dependable Computing - Hong Kong, China Duration: 1 Dec 1999 → 1 Dec 1999

Publication series

Name
Publisher	IEEE

Conference

Conference	Pacific Rim Int. Symp. on Dependable Computing
Period	1/12/99 → 1/12/99

Keywords

IR-18874
METIS-119396
EWI-1028

Access to Document

10.1109/PRDC.1999.816213

00816213

Cite this

@inproceedings{3219e281a0164f0a9d6516c2d89c74b1,

title = "Interconnecting Lock-step Synchronous Fault-tolerant Systems based on Voting and Error-Correcting Codes",

abstract = "The correctness of the behavior of a fault-tolerant system depends among other things on the correct distribution of the data descending from unreliable I/O devices over the modules of the fault-tolerant system, the so-called input-problem. More generally, a maliciously behaving system, whether it is fault-tolerant or not, should never defeat a correctly functioning fault-tolerant system, i.e. a system which does not contain more faulty modules than it is designed to tolerate. This paper presents a new class of synchronous deterministic non-authenticated algorithms for reaching Byzantine agreement on data descending from other (fault-tolerant) devices. The algorithms are based on voting and error-correcting codes and require considerably less data communication than the existing algorithms, whereas the number of rounds and the number of modules meet the minimum bounds",

keywords = "IR-18874, METIS-119396, EWI-1028",

author = "Th. Krol",

note = "Imported from DIES; Pacific Rim Int. Symp. on Dependable Computing ; Conference date: 01-12-1999 Through 01-12-1999",

year = "1999",

month = dec,

doi = "10.1109/PRDC.1999.816213",

language = "Undefined",

isbn = "0-7695-0371-3",

publisher = "IEEE",

pages = "62--69",

booktitle = "Pacific Rim Int. Symp. on Dependable Computing",

address = "United States",

}

TY - GEN

T1 - Interconnecting Lock-step Synchronous Fault-tolerant Systems based on Voting and Error-Correcting Codes

AU - Krol, Th.

N1 - Imported from DIES

PY - 1999/12

Y1 - 1999/12

N2 - The correctness of the behavior of a fault-tolerant system depends among other things on the correct distribution of the data descending from unreliable I/O devices over the modules of the fault-tolerant system, the so-called input-problem. More generally, a maliciously behaving system, whether it is fault-tolerant or not, should never defeat a correctly functioning fault-tolerant system, i.e. a system which does not contain more faulty modules than it is designed to tolerate. This paper presents a new class of synchronous deterministic non-authenticated algorithms for reaching Byzantine agreement on data descending from other (fault-tolerant) devices. The algorithms are based on voting and error-correcting codes and require considerably less data communication than the existing algorithms, whereas the number of rounds and the number of modules meet the minimum bounds

AB - The correctness of the behavior of a fault-tolerant system depends among other things on the correct distribution of the data descending from unreliable I/O devices over the modules of the fault-tolerant system, the so-called input-problem. More generally, a maliciously behaving system, whether it is fault-tolerant or not, should never defeat a correctly functioning fault-tolerant system, i.e. a system which does not contain more faulty modules than it is designed to tolerate. This paper presents a new class of synchronous deterministic non-authenticated algorithms for reaching Byzantine agreement on data descending from other (fault-tolerant) devices. The algorithms are based on voting and error-correcting codes and require considerably less data communication than the existing algorithms, whereas the number of rounds and the number of modules meet the minimum bounds

KW - IR-18874

KW - METIS-119396

KW - EWI-1028

U2 - 10.1109/PRDC.1999.816213

DO - 10.1109/PRDC.1999.816213

M3 - Conference contribution

SN - 0-7695-0371-3

SP - 62

EP - 69

BT - Pacific Rim Int. Symp. on Dependable Computing

PB - IEEE

CY - Los Alamitos, California

T2 - Pacific Rim Int. Symp. on Dependable Computing

Y2 - 1 December 1999 through 1 December 1999

ER -