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


Share/Save/Bookmark

Krol, Th. (1999) Interconnecting Lock-step Synchronous Fault-tolerant Systems based on Voting and Error-Correcting Codes. In: Pacific Rim International Symposium on Dependable Computing, 1999, Hong Kong (pp. pp. 62-69).

open access
[img]
Preview
PDF
356kB
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
Item Type:Conference or Workshop Item
Copyright:©1999 IEEE
Research Group:
Link to this item:http://purl.utwente.nl/publications/18874
Official URL:http://dx.doi.org/10.1109/PRDC.1999.816213
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 119396