The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jul. 21, 1998
Filed:
Jan. 24, 1996
Danny Dolev, Jerusalem, IL;
Rudiger Karl Reischuk, Munster-Altheim, DE;
Hovey Raymond Strong, San Jose, CA (US);
International Business Machines Corporation, Armonk, NY (US);
Abstract
A computer program product, such as a floppy disk with pre-recorded software, is provided. The computer program product is for use with a computer or processing system which is to function as a node within a network. Synchronization of a local time maintained at the node with a reference time is facilitated through execution of the prerecorded software by the node. Bursts of synchronization messages containing reference time stamps are transmitted over the network, or over a communication link, according to a predetermined protocol. The node receives and time stamps the messages. Thus, times according to a first time scale and a second time scale are obtained. The protocol defines temporal relationships between certain ones of the times. In accordance with the protocol, the node determines a difference between a first time according to one of the time scales and a time related to second and third times according to the other time scale. The node then updates its local time based on the difference. This synchronization method provides a well-defined upper bound of synchronization error, and allows the node to synchronize its internal time based only on information contained in the received messages and the internally generated local time stamp marks. No 'round trip' or handshaking messages are necessary to define the needed temporal relationships between the times according to the first and second scales. Thus, it is not necessary that the reference time source know the identity of the node which is synchronizing itself. The node also maintains a global precision value, which estimates its time synchronization error, by resetting the value when the node is synchronized, and updating the value as the node operates. Responsive to the global precision exceeding various theresholds, the node requests resynchronization or sends synchronization messages based on its internal time.