作者: Danny Dolev , Joe Halpern , H. Raymond Strong
关键词:
摘要: It is known that clock synchronization can be achieved in the presence of faulty clocks numbering more than one-third total number participating provided some authentication technique used. Without faults tolerated has been an open question. Here we show if restrict logical to running within linear function real time, then impossible, without authentication, when or processors are faulty. However, there a bound on rate at which processor generate messages, achievable, as long do not disconnect network. Finally, provide lower closeness simultaneity network transmission and processing delay properties