TY  -  
T1  - Self-stabilising Byzantine clock synchronisation is almost as easy as consensus 
SN  -  /  
UR  - http://hdl.handle.net/10138/232177 
T3  - Leibniz International Proceedings in Informatics (LIPIcs) 
A1  - Lenzen, Christoph; Rybicki, Joel Patrick 
A2  -  
PB  -  
Y1  - 2017 
LA  - eng 
AB  - We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of the n nodes has its own clock. Our algorithms operate in a very strong fault model: we require self-stabilisation, i.e., the initial state of the system may be arbitrary, and there can be up to f<n/3 ongoing Byzantine faults, i.e., nodes that deviate from the protocol in an arbitrary manner. Furthermore, we assume that the local clocks of the nodes may progress at different speeds (clock drift) a... 
VO  -  
IS  -  
SP  -  
OP  -  
KW  - 113 Computer and information sciences 
N1  -   
PP  -  
ER  -