Apparatus for data depoting and method therefor

• US 6,772,158 B1
• Filed: 12/14/1999
• Issued: 08/03/2004
• Est. Priority Date: 12/14/1999
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Giammaria, Alberto
• Primary Examiner(s): Coby, Frantz
• Application Number:
  US09/460,855
• Time in Patent Office: 1,694 Days
• Field of Search: 707/10, 707/103.R, 709/223, 709/224, 370/501, 370/389, 370/16, 385/24
• US Class Current: 1/1
• CPC Class Codes: H04L 41/042 comprising distributed management centres cooperatively managing the network
• CPC Class Codes: H04L 41/044 comprising hierarchical management structures
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
• 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 67/561 Adding application-functional data or data for application control, e.g. adding metadata
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching
• 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/99944 Object-oriented database structure

Abstract

An apparatus and method by which repeaters are able to temporarily or permanently store data in a local repository called a depot. Two uses for the depots are checkpoint restart functionality and the ability to store commonly installed software distributions on nodes closer to their destinations. Large software programs such as Office 95™ can be stored on local repeaters for fast and efficient distribution. A particular distribution can be stored in more than one depot. Depots will provide an interface to allow administrators to list the contents of a depot, store new distributions and delete old distributions. Data may be added to a depot by either an explicit administrator command or by retaining data sent as part of a distribution. Applications can decide what data is appropriate for depoting, and mark those distribution segments as “storable”.

Claims

1. A data processing system for distributing bulk data on a network comprising:

at least one source subsystem providing bulk data to be distributed; and

one or more repeater subsystems for receiving said bulk data and storing said bulk data for transmission to one or more endpoint systems, wherein each of said at least one source subsystem includes circuitry operable for generating control information for controlling the storage of said bulk data on said one or more repeater subsystems and circuitry for including said control information in a transmission of said bulk data to said one or more repeater subsystems, and wherein each of said one or more repeater subsystems include circuitry operable for controlling said storing of said bulk data in response to said control information.

2. The data processing system of claim 1 wherein said control information is set to a first predetermined value when said bulk data is to be permanently stored and a second predetermined value when said bulk data is to be temporarily stored.

3. The data processing system of claim 2 wherein said control information is set to a selected one of said first and second values in response to an administrator command.

4. The data processing system of claim 2 wherein said control information is set to a selected one of said first and second values in response to a distribution request from an application on at least one of said one or more endpoint subsystems.

5. The data processing system of claim 1 wherein each of said one or more source subsystems further includes circuitry operable for including lifetime information in said bulk data, wherein each of said one or more repeater subsystems further include circuitry operable for deleting stored bulk data in response to said lifetime information.

6. A method of distributing data on a network comprising the steps of:

generating control information for controlling storage of distributed data;

receiving said data at a network node distributed; and

storing said distributed data in said network node wherein said storing is permanent if said control information has a first predetermined value and temporarily if said control information has a second predetermined value.

7. The method of claim 6 further comprising the step of including lifetime information in said distributed data, said lifetime information for controlling a duration of said storing of distributed data.

8. The method of claim 6 further comprising the step of deleting said distributed data from said network node after all endpoint subsystems requesting said distributed data have received said distributed data, if said control information has said second predetermined value.

9. The method of claim 6 wherein said control information is operable for setting to a selected one of said first and second predetermined values in response to an administrator command.

10. The method of claim 6 wherein said control information is operable for setting in response to an application requesting said distributed data.

11. The method of claim 7 further comprising the step of deleting said distributed data from storage after a time interval corresponding to said lifetime information has expired.

12. The method of claim 6 further comprising the steps of:

receiving a delete request in response to an administrator command; and

deleting said distributed data from storage in response to said delete request.

13. The method of claim 8 wherein said step of deleting said distributed data after all endpoint systems have received said distributed data includes the steps of:

initializing a reference counter to a preselected number of endpoints subsystems requesting said distributed data;

decrementing said reference counter in response to a successful transmission of said distributed data to an endpoint subsystem;

testing said reference counter, and if said reference counter is not zero, repeating said decrementing step; and

if said reference counter is zero, deleting said distributed data from said network node.

14. A computer program product embodied in a machine-readable storage medium including programming for distributing data on a network, the programming comprising:

programming for generating control information for controlling storage of distributed data;

programming for receiving said distributed data a network node; and

programming for storing said distributed data in said network node, wherein said storing is permanent if said control information has a first predetermined value and temporary if said control information has a second predetermined value.

15. The computer program product of claim 14 further comprising programming for including lifetime information in said distributed data, said lifetime information for controlling a duration of said storing of distributed data.

16. The program product of claim 14 further comprising programming for deleting said distributed data from said network node after all endpoint subsystems requesting said distributed data have received said distributed data, if said control information has said second predetermined value.

17. The program product of claim 14 wherein said control information is operable for setting to a selected one of said first and second predetermined values in response to an administrator command.

18. The program product of claim 14 wherein said control information is operable for setting in response to an application requesting said distributed data.

19. The program product of claim 15 further comprising programming for deleting said distributed data from storage after a time interval corresponding to said lifetime information has expired.

20. The program product of claim 14 wherein said programming for deleting said distributed data after all endpoint subsystems have received said distributed data includes:

programming for initializing a reference counter to a preselected number of endpoint subsystems requesting said distributed data;

programming for decrementing said reference counter in response to a successful transmission of said distributed data to an endpoint subsystem;

programming for testing said reference counter, and if said reference counter is not zero, repeating said decrementing steps; and

if said reference counter is zero, deleting said distributed data from said network node.