Robust data availability system having decentralized storage and multiple access paths

• US 20070078809A1
• Filed: 09/30/2005
• Published: 04/05/2007
• Est. Priority Date: 09/30/2005
• Status: Abandoned Application

• Current Assignee: Rockwell Automation Technologies Incorporated (Allen-Bradley Co., Inc.)
• Original Assignee: Rockwell Automation Technologies Incorporated (Allen-Bradley Co., Inc.)
• Inventors: Gordon, Kevin, Virji, Shafin, Dorgelo, Eric, Reichard, Douglas, Bromley, Clifton, Semkow, Marc
• Application Number:
  US11/239,823
• Publication Number:
  US 20070078809A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 11/1448 Management of the data involved in backup or backup restore
• CPC Class Codes: G06F 11/1456 Hardware arrangements for backup
• CPC Class Codes: G06F 11/1464 for networked environments
• CPC Class Codes: G06F 11/1469 Backup restoration techniques
• CPC Class Codes: G06F 16/1834 implemented based on peer-to-peer networks, e.g. gnutella p2p communication protocols H04L67/104
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1076 Resource dissemination mechanisms or network resource keeping policies for optimal resource availability in the overlay network
• CPC Class Codes: H04L 67/1095 Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes

Abstract

Architecture that provides high availability (quick, robust, redundant) data to users by the use of peer-to-peer technology, where the decentralized storage and multi-access paths provide the complete data set without dependence on a specific or pre-defined data source or access paths, including sourcing data from other users of the data applying the large file transfer techniques of file sharing. When a client requests a file the system automatically calculates all the locations of that file, and which is the quickest source to retrieve the file. The client then stores a copy of the file for instant retrieval later and to serve that file out to other clients that request it. A versioning scheme ensures that the only the newest version of files are shared on the network. A machine learning and reasoning component is provided that employs a probabilistic and/or statistical-based analysis to prognose or infer an action that a user desires to be automatically performed.

Claims

1. A system that facilitates data management, comprising:

a storage component that decentralizes data storage by storing data on a plurality of computing devices; and

an access component that facilitates peer-to-peer access of the data from any one or more of the computing devices.

2. The system of claim 1, wherein the storage component stores the data based on a more frequently accessed criterion.

3. The system of claim 2, wherein the data that is more frequently accessed is stored on a computing system that allows retrieval faster than by other systems.

4. The system of claim 1, wherein the access component determines all computing device locations of the data and calculates which of the locations provides the quickest retrieval.

5. The system of claim 1, wherein the storage component facilitates updating data stored on the plurality of computing devices.

6. The system of claim 1, further comprising a tracking component that tracks changes in the data.

7. The system of claim 1, further comprising a selection component that selects the plurality of computing devices on which the data will be stored.

8. The system of claim 7, wherein the selection component selects the plurality of computing systems based on computing power and a capability to deliver requested data quickly.

9. The system of claim 1, wherein the access component facilitates retrieval of portions of the data from several different computing systems and the portions are merged together to form a complete dataset.

10. The system of claim 1, wherein a most frequently accessed data is stored on most of the plurality of computing devices that are available for the data storage.

11. The system of claim 10, wherein a computing device is available when it is online.

12. The system of claim 1, wherein a computing device is available when storage of the data thereto does not impact a process the computing device is monitoring and/or controlling.

13. The system of claim 1, wherein a data management station is disposed on a network, the data management station comprising the storage component and the access component.

14. The system of claim 1, wherein the storage component and the access component are provided as a software client.

15. The system of claim 1, further comprising a learning and reasoning component that employs a probabilistic and/or statistical-based analysis to prognose or infer an action that a user desires to be automatically performed.

16. A system that facilitates data management, comprising:

a storage component that decentralizes data storage by storing a file on multiple access nodes;

an access component that facilitates peer-to-peer access of the data from any of the multiple access nodes; and

a selection component that facilitates selection of an access node on which to store the file and an access node from which to retrieve the file based on availability of the access node.

17. The system of claim 16, wherein the storage component stores the file on a first access node based on a more frequently accessed criterion and retrieves the file from a second access node based on a fastest communications path.

18. The system of claim 16, wherein the access component determines all access node locations that store a copy of the file and calculates which of the access node locations provides the fastest retrieval of the file.

19. The system of claim 16, wherein the storage component facilitates updating the file stored on a second access node based on a change to the file on a first access node.

20. The system of claim 19, wherein the change is updated to the second access node only after the file reaches a certain file size on the first access node.

21. The system of claim 16, wherein the selection component selects an access node for storage based on computing power of the access node.

22. The system of claim 16, wherein the access component facilitates retrieval of a first portion of the file from a first access node and a second portion of the file from a second access node.

23. The system of claim 22, wherein the first portion of the file and the second portion of the file are merged to regenerate the file at a requesting access node.

24. The system of claim 16, wherein when the selection component requests retrieval of the file from the multiple access nodes, the selection component selects an access node that responds first to the request.

25. The system of claim 16, wherein when the selection component requests retrieval of the file from the multiple access nodes, the selection component selects an access node that responds after a first response to the request.

26. The system of claim 16, the file comprises at least one of a process control screen, process control data, trend data, and a software program.

27. A computer-implemented method of managing data, comprising:

selecting data for peer-to-peer backup on multiple access nodes based on data criteria;

checking for availability of the multiple access nodes based on availability criteria;

selecting a subset of the multiple access nodes on which to store the data; and

storing the data on the subset of access nodes.

28. The method of claim 27, wherein the data criteria includes a frequency at which the data is accessed.

29. The method of claim 27, further comprising an act of prioritizing multiple types of data based on importance and backing up a most important data on the subset of access nodes.

30. The method of claim 29, further comprising an act of backing up the most important data on an access node that has a fastest access times of the subset of access nodes.

31. The method of claim 27, further comprising an act of storing the data on available nodes of the subset of access nodes and storing the data at a later time on an unavailable node of the subset of access nodes when the unavailable node becomes available.

32. The method of claim 27, further comprising an act of tracking changes to the data and performing the act of storing when the data reaches a predetermined size.

33. The method of claim 27, further comprising acts of:

checking for a failed node of one of the multiple access nodes;

requesting a copy of the data during a restore process;

checking for availability of a subset of the multiple access nodes during the restore process;

retrieving the copy of the data to the failed node; and

operating the failed node according to the copy of the data.

34. The method of claim 33, wherein the act of requesting is performed to an access node that provides the fastest retrieval of the copy of the data.

35. The method of claim 33, wherein the copy of the data is retrieved in parts, each part obtained from a different access node.

36. The method of claim 33, wherein the failed node fails due to corrupted data.

37. The method of claim 33, further comprising an act of performing the restore process during an off-peak time.

38. The method of claim 33, further comprising an act of calculating which of the multiple access nodes provides the fasts communications path for retrieving the copy of the data.

39. A computer-executable system of managing data, comprising:

means for selecting data for peer-to-peer backup on multiple access nodes based on data criteria;

means for checking for availability of the multiple access nodes based on availability criteria;

means for selecting a subset of the multiple access nodes on which to store the data;

means for storing the data on the subset of access nodes;

means for checking for a failed node of one of the multiple access nodes;

means for requesting a copy of the data during a restore process;

means for checking for availability of a subset of the multiple access nodes during the restore process;

means for retrieving the copy of the data to the failed node; and

means for operating the failed node according to the copy of the data.