Probabilistic Clock Synchronization in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
WE PRESENT A NEW AVERAGING PROBABLISTIC CLOCK SYNCHRONIZATION ALGORITHM, BASED ON THE REDUNDANT TRANSMISSION OF MULTIPLE SYNCHRONIZATION MESSAGES, THAT CAN GUARANTEE A MUCH LOWER UPPER BOUND ON THE DEVIATION BETWEEN CLOCKS THAN MOST EXISTING ALGORITHMS. OUR ALGORITHM IS PROBABLISTIC IN THE SENSE THAT THE UPPER BOUND ON THE DEVIATION THAT IT GUARANTEES HAS A PROBABILITY OF INVALIDITY ASSOCIATED WITH IT. THE PROBABILITY OF INVALIDITY, I.E., THE PROBABILITY THAT THE DEVIATION EXCEEDS THE GUARANTEED MAXIMUM DEVIATION, MAY HOWEVER BE MADE EXTREMELY SMALL BY SUFFICIENTLY INCREASING THE NUMBER OF MESSAGES TRANSMITTED. WE PROVE THAT AN UPPER BOUND ON THE PROBABILITY OF INVALIDITY DECREASES EXPONENTIALLY WITH THE NUMBER OF MESSAGES, I.E., THE PROBABILITY OF INVALIDITY ITSELF DECREASES EXPONENTIALLY OR BETTER.