System for sending small positive data notification messages over a network to indicate that a recipient node should obtain a particular version of a particular data item

• US 5,842,216 A
• Filed: 05/03/1996
• Issued: 11/24/1998
• Est. Priority Date: 05/03/1996
• Status: Expired due to Term

• Current Assignee: Mitsubishi Electric Research Laboratories, Inc. (Mitsubishi Electric Corporation)
• Original Assignee: Mitsubishi Electric Information Technology Center America, Inc. (Mitsubishi Electric Corporation)
• Inventors: Anderson, David, Waters, Richard C.
• Primary Examiner(s): Kim, Kenneth S.
• Application Number:
  US08/642,345
• Time in Patent Office: 935 Days
• Field of Search: 395/185.01, 395/200.18, 395/617, 395/200.33, 395/712, 707/201, 707/203
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2329 using versioning
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: H04L 1/1678 where the control information is for timing, e.g. time stamps
• CPC Class Codes: H04L 67/34 involving the movement of software or configuration parameters network booting or remote initial program loading [RIPL] G06F9/4416
• CPC Class Codes: H04L 69/28 Timers or timing mechanisms used in protocols
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols
• CPC Class Codes: Y10S 707/99952 Coherency, e.g. same view to multiple users
• CPC Class Codes: Y10S 707/99954 Version management

Abstract

A system is provided for eliminating time-consuming, unnecessary transfersf data over networks such as the the World Wide Web while at the same time guaranteeing timeliness of the data used by recipients. Timeliness is assured by immediately sending small data-notification messages whenever data becomes relevant or changes. Efficiency is guaranteed by transmitting the data itself only when requested by the recipient of a data-notification message. In particular, recipients are alerted to the presence of, and changes in, data they might use by data-notification messages containing a timestamp, the data location, and a checksum. Based on the timestamp, the recipient can determine whether the data-notification message contains timely information or should be ignored. Based on the data location and checksum, the recipient can determine whether it already has the current version of the data in question, for example stored in a cache.

Claims

1. A system for eliminating time consuming unnecessary transfers of data over a network, while at the same time guaranteeing timeliness of data used by a recipient node of said network, comprising:

a source of data coupled to said network,

means at said source for sending a command in the form of a small positive data-notification message over said network for each version of said data to indicate that a recipient node should obtain a particular version of a particular data item;

means at said recipient node and responsive to said small data-notification message for determining whether the data corresponding to said small data-notification message is already present; and

,

means at said recipient node for fetching the data specified by said small data positive notification message if not already present at said recipient node, whereby said source commands via said small positive data-notification message that appropriate new data be fetched and available at said recipient node if not already there.

2. The system of claim 1, wherein said small data-notification message includes a checksum and data location.

3. The system of claim 2, and further including means at said recipient node and responsive to said checksum for ascertaining the validity of the corresponding data fetched over said network.

4. The system of claim 2, wherein said network is the World Wide Web and wherein said data location is a uniform resource locator URL.

5. The system of claim 2, wherein said determining means at said recipient node includes means at said recipient node for storing a previous small data-notification message and the corresponding data.

6. The system of claim 5, wherein said determining means at said recipient node further includes means for ascertaining whether for a received small data-notification message there exists a stored small data-notification message with the same data location and checksum, this being true indicating that the corresponding data is already available at said recipient node.

7. The system of claim 5, wherein said determining means at said recipient node further includes means for ascertaining whether for a received small data-notification message there exists a stored small data-notification message with the same data location and a different checksum, this being true indicating that the corresponding data has changed and needs to be refetched.

8. The system of claim 5, wherein said determining means at said recipient node further includes means for ascertaining whether for a received small data-notification message there exists a stored small data-notification message with the same data location, this being false indicating that the corresponding data is new and needs to be fetched.

9. The system of claim 5, wherein said small data-notification message includes a timestamp and wherein said determining means at said recipient node further includes means for ascertaining whether for a received small data-notification message there exists a stored small data-notification message with the same data location and a later timestamp, this being true indicating that said received small data-notification message is not timely and should be ignored.