1986
DOI: 10.1145/12476.12477
|View full text |Cite
|
Sign up to set email alerts
|

Byzantine clock synchronization

Abstract: Abstrac tAn informal description is given of three fault-toleran t clock-synchronization algorithms . These algorithms wor k in the presence of arbitrary kinds of failure, including "twofaced" clocks . Two of the algorithms are derived fro m Byzantine Generals solutions .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

1991
1991
2015
2015

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(8 citation statements)
references
References 8 publications
0
8
0
Order By: Relevance
“…1(f). After that, all fault-free processors must delete the messages in the fourth level of the ms-tree [7], and then the remaining messages in the three level of ms-tree will not be influenced by the malicious faulty links anymore. After finish removing the influence caused by the malicious links, all fault-free processors can find out the reliable processors by examining the values stored in the second and third level of the ms-tree.…”
Section: The Details Of the Ngba Protocolmentioning
confidence: 99%
See 1 more Smart Citation
“…1(f). After that, all fault-free processors must delete the messages in the fourth level of the ms-tree [7], and then the remaining messages in the three level of ms-tree will not be influenced by the malicious faulty links anymore. After finish removing the influence caused by the malicious links, all fault-free processors can find out the reliable processors by examining the values stored in the second and third level of the ms-tree.…”
Section: The Details Of the Ngba Protocolmentioning
confidence: 99%
“…However, the previous works [1], [7], [8], [11], [14] only consider the agreement problem when there exists processors fault only, and the faulty transmission media are treated as faulty processors. As a result, the treatment ignores the fact that the processor connected with a faulty transmission medium, which was called innocent processor, is still in correct.…”
Section: Introductionmentioning
confidence: 99%
“…Synchrony of FTDF makes this check unnecessary. Clearly the execution platform must contain the implementation of a synchronization algorithm [21].…”
Section: Replica Determinismmentioning
confidence: 99%
“…Synchrony of FTDF makes this check unnecessary. Clearly a synchronization algorithm must be implemented in the execution platform, see in example [17].…”
Section: Replica Determinismmentioning
confidence: 99%