This application is related to co-pending U.S. patent application Ser. No. 12/347,930 for PROBE BASED BACKUP and filed concurrently herewith, which is incorporated herein by reference for all purposes; co-pending U.S. patent application Ser. No. 12/347,933 for MULTI-FACTOR PROBE TRIGGERS and filed concurrently herewith, which is incorporated herein by reference for all purposes; and co-pending U.S. patent application Ser. No. 12/347,939 for MODULAR PROBE BACKUP and filed concurrently herewith, which is incorporated herein by reference for all purposes.
The present invention relates generally to information backup systems, and more particularly, to systems and methods of efficiently backing up information.
Backup applications take in data from sources and store copies of the data in different locations. Backing up data is important because it enables users of data to access data in the event an original copy of data is lost or destroyed.
Typically, backing up data is automated based on time. Backup applications perform a defined number of backups during a defined time interval. For example, a backup application may perform a backup once every week.
Though automated backups based on time may provide some efficiency in backing up data, such backups do not consider to what extent data has changed during a defined time interval.
There is a need, therefore, for an improved method, article of manufacture, and apparatus for backing up information.
The present invention will be readily understood by the following detailed description in conjunction with the accompanying drawings, wherein like reference numerals designate like structural elements, and in which:
A detailed description of one or more embodiments of the invention is provided below along with accompanying figures that illustrate the principles of the invention. While the invention is described in conjunction with such embodiment(s), it should be understood that the invention is not limited to any one embodiment. On the contrary, the scope of the invention is limited only by the claims and the invention encompasses numerous alternatives, modifications, and equivalents. For the purpose of example, numerous specific details are set forth in the following description in order to provide a thorough understanding of the present invention. These details are provided for the purpose of example, and the present invention may be practiced according to the claims without some or all of these specific details. For the purpose of clarity, technical material that is known in the technical fields related to the invention has not been described in detail so that the present invention is not unnecessarily obscured.
It should be appreciated that the present invention can be implemented in numerous ways, including as a process, an apparatus, a system, a device, a method, or a computer readable medium such as a computer readable storage medium containing computer readable instructions or computer program code, or as a computer program product, comprising a computer usable medium having a computer readable program code embodied therein. In the context of this disclosure, a computer usable medium or computer readable medium may be any medium that can contain or store the program for use by or in connection with the instruction execution system, apparatus or device. For example, the computer readable storage medium or computer usable medium may be, but is not limited to, a random access memory (RAM), read-only memory (ROM), or a persistent store, such as a mass storage device, hard drives, CDROM, DVDROM, tape, erasable programmable read-only memory (EPROM or flash memory), or any magnetic, electromagnetic, infrared, optical, or electrical means system, apparatus or device for storing information. Alternatively or additionally, the computer readable storage medium or computer usable medium may be any combination of these devices or even paper or another suitable medium upon which the program code is printed, as the program code can be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory. Applications, software programs or computer readable instructions may be referred to as components or modules. Applications may be hardwired or hard coded in hardware or take the form of software executing on a general purpose computer or be hardwired or hard coded in hardware such that when the software is loaded into and/or executed by the computer, the computer becomes an apparatus for practicing the invention. Applications may also be downloaded in whole or in part through the use of a software development kit or toolkit that enables the creation and implementation of the present invention. In this specification, these implementations, or any other form that the invention may take, may be referred to as techniques. In general, the order of the steps of disclosed processes may be altered within the scope of the invention.
An embodiment of the invention will be described with reference to a backup system in the form of a storage system configured to store files, but it should be understood that the principles of the invention are not limited to data storage systems. Rather, they are applicable to any system capable of storing and handling various types of objects, in analog, digital, or other form. Although terms such as document, file, object, etc. may be used by way of example, the principles of the invention are not limited to any particular form of representing and storing data or other information; rather, they are equally applicable to any object capable of representing information.
Disclosed herein are a method and system to efficiently backup information. Generally, backups are performed automatically based on defined time intervals. However, such backups do not take into account to what extent data has changed since a previous backup. For example, if a backup application was set to perform a backup of a source (client) every week, but there was no change in the client for a week, two consecutive backups would have identical information. This lowers the efficiency and usefulness of a backup system. Not only would a backup system have to transmit twice as much data as necessary, but a backup system may also unnecessarily create client downtime. Furthermore, in backup systems which store a set number of backup points, having two backup points which are identical or very similar reduces the usefulness of having multiple backup points.
The present invention allows for backup systems to automatically perform backups based on user-defined conditions. In some embodiments, user-defined conditions may include state of a backup server, network traffic, level of activity which has occurred on a client since previous backup, etc. By backing up data based on user-defined conditions, problems of time-only based backups are alleviated, and greater efficiency is achieved.
Probes are used to detect changes in their respective host. As shown by various Probes 106 in
Probes are also pluggable, meaning that a first probe may be replaced with a second probe configured to obtain information. The backup server does not have to know the details of what the probes are monitoring, and may be configured to receive only an indication of whether a condition has been met. This allows for a modular framework. In some embodiments, the second probe may be configured to obtain information different than the first probe.
Probe groups 102 are used to group Probes 106 together. Probe groups are defined by the user and are very customizable. As shown in
A modular framework may be implemented using probe groups, although a modular frame work may be implemented without using probe groups. Probe groups separate probes from backup servers, so backup servers do not know what probes are doing. In some embodiments, probes send to probe groups an affirmative or a negative (e.g. proceed with a backup, or do not proceed with a backup). Probe groups may then send an affirmative or a negative to a probe manager, which in turn may send an affirmative or negative to a backup server.
The Probe manager 108 receives the results from Probe groups 102. In some embodiments, depending on a user's preferences, Probe manager 108 will instruct Backup servers 104 to perform a backup of Clients 100. In some embodiments, a user may require that a backup be performed only if there has been sufficient activity on clients since the most recent backup, and if the network is not too busy. Following the above example, if three out of five client-based probes detected a requisite level of activity, its probe group would report an affirmative signal to a probe manager to perform a backup. However, if there was another probe group consisting of server-based probes, and server based probes did not detect a requisite level of bandwidth available on backup servers, its probe group would report a negative signal to a probe manager. In this example, a user required an affirmative signal from both probe groups, so a probe manager would not inform backup servers to perform a backup.
As illustrated above, probe managers and probe groups allow for great flexibility in backup systems. The above example used only one layer of logic, involving only a logical function “AND.” However, users are not limited to one layer or one logical function. Users may apply a wide variety of logic, including use of logical functions “AND,” “OR,” “NOT,” Boolean operations, “IF,” “THEN,” “ELSE,” “WHILE” etc. Depending on a user's needs, the level of logic required to determine when to perform a backup may be quite sophisticated.
It should be understood that one need not follow the examples given above. In some embodiments, probes may send more detailed information to a probe group. Such detailed information may include the date and time which a database was modified, the importance of data (e.g. an important accounting excel sheet compared to an outdated marketing document), etc. Probe groups may use information obtained from probes to perform its own analysis to whether or not a backup should proceed. In some embodiments, probe groups may not analyze information obtained from probes and instead pass it directly to a probe manager. The process for determining whether a condition has been met may be done on a backup server, on a client being probed, or on a different client. The level of customization may be quite high. Furthermore, information obtained from probes may be used to select what kind of data to backup. For example, if a probe detected that a hard disk may be in danger of failing, a backup server may backup critical data on the hard disk.
Furthermore, in some embodiments, it may be preferable to have probes report directly to probe managers, and not utilize probe groups. This may be the case in which there are a small number of probes. Similarly, it may be preferable to have probe groups report directly to a backup server, without utilizing a probe manager.
In some embodiments, probe groups are used to decide whether a user-defined condition has been met. For example, in a system with five clients and their respective probes, a user may set that a condition will be met if three out of five client probes detects that there has been a sufficient amount of data activity. In some embodiments, all of the probes in a probe group must detect a condition before a backup will be performed. In some embodiments, some of the probes in a probe group must detect a condition before a backup will be performed. In some embodiments, only one probe needs to detect a condition before a backup will be performed. In some embodiments, conditions must be detected by some probes and other conditions must not be detected by other probes before a backup will be performed. Users may decide how many probes need to detect a condition before a backup will be performed.
Backup systems may consist of many clients and servers, so it may not be feasible for probes to constantly report back to probe groups or probe managers. In some embodiments, it may be preferable that probes report during set time intervals, such as when polled by backup systems, and the frequency of polling may be referred to as probe frequency. For example, a user may program probes to wake up, monitor conditions (e.g. client activity, network traffic, etc.) for thirty minutes, and then sleep for an hour before a next wake-up. In some embodiments, users may define a start time and an end time for probes to poll their host.
In some embodiments, users may define a time interval or probe frequency. In some embodiments, a backup system can use previous probe results to determine the length of the next time interval. For example, if a probe returned a negative signal (e.g. do not backup) ten times consecutively, a backup system may “learn” that the probe does may not need to be probing as often and may increase the probe's time interval or lower the probe's probe frequency. Similarly, if a probe returned a positive signal (e.g. do perform a backup) ten times consecutively, a backup system may learn that the probe may need to be probing more often and decrease the probe's time interval or increase the probe's probe frequency.
Furthermore, in some embodiments, a probe interval may be adjusted according to information obtained from another probe. For example, if a first probe obtained information that a backup server was overloaded (e.g. did not have any bandwidth to perform additional functions), a backup system could increase other probes' time intervals so that the load on a backup server would be reduced. In some embodiments, modifying probes' time intervals may be universal (e.g. all probes' time intervals may be increased 20%). In some embodiments, modifying probes' time intervals may be variable (e.g. time intervals of probes monitoring legal documents may be unchanged, while time intervals of probes monitoring CPU usage may be increased). This may be the case where different data classifications or priorities exist. For example, legal documents are in a classification that is different than marketing documents. Recent financial statements may have a higher priority than ten year old financial statements.
A backup system may also use relationships between databases to determine time interval adjustments. For example, if a backup system reduced a time interval of a probe monitoring accounting records, a backup system may accordingly reduce a time interval of a probe monitoring financial records since both types of records have a close correlation (e.g. if accounting records change, financial records are very likely to change).
For the sake of clarity, the processes and methods herein have been illustrated with a specific flow, but it should be understood that other sequences may be possible and that some may be performed in parallel, without departing from the spirit of the invention. Additionally, steps may be subdivided or combined. As disclosed herein, software written in accordance with the present invention may be stored in some form of computer-readable medium, such as memory or CD-ROM, or transmitted over a network, and executed by a processor.
Though the above has been described with reference to the term “backup” for illustrative purposes, the present invention is equally applicable to all forms of data duplication. These forms of data duplication include replication and archiving, among others.
All references cited herein are intended to be incorporated by reference. Although the present invention has been described above in terms of specific embodiments, it is anticipated that alterations and modifications to this invention will no doubt become apparent to those skilled in the art and may be practiced within the scope and equivalents of the appended claims. More than one computer may be used, such as by using multiple computers in a parallel or load-sharing arrangement or distributing tasks across multiple computers such that, as a whole, they perform the functions of the components identified herein; i.e. they take the place of a single computer. Various functions described above may be performed by a single process or groups of processes, on a single computer or distributed over several computers. Processes may invoke other processes to handle certain tasks. A single storage device may be used, or several may be used to take the place of a single storage device. The present embodiments are to be considered as illustrative and not restrictive, and the invention is not to be limited to the details given herein. It is therefore intended that the disclosure and following claims be interpreted as covering all such alterations and modifications as fall within the true spirit and scope of the invention.
Number | Name | Date | Kind |
---|---|---|---|
5566339 | Perholtz et al. | Oct 1996 | A |
5778165 | Saxon | Jul 1998 | A |
5966730 | Zulch | Oct 1999 | A |
6157931 | Cane et al. | Dec 2000 | A |
6532535 | Maffezzoni et al. | Mar 2003 | B1 |
6754664 | Bush | Jun 2004 | B1 |
7024390 | Mori et al. | Apr 2006 | B1 |
7024529 | Yamada et al. | Apr 2006 | B2 |
7225250 | Harrop | May 2007 | B1 |
7415585 | Rossi | Aug 2008 | B1 |
7437523 | Ting et al. | Oct 2008 | B1 |
7734951 | Balasubramanian et al. | Jun 2010 | B1 |
7746771 | Croak et al. | Jun 2010 | B1 |
20020184398 | Orenshteyn | Dec 2002 | A1 |
20040098423 | Chigusa et al. | May 2004 | A1 |
20050132257 | Gold et al. | Jun 2005 | A1 |
20060059253 | Goodman et al. | Mar 2006 | A1 |
20060094419 | Katou | May 2006 | A1 |
20060198373 | Hasegawa et al. | Sep 2006 | A1 |
20060253905 | Mansel | Nov 2006 | A1 |
20070136541 | Herz et al. | Jun 2007 | A1 |
20070143851 | Nicodemus et al. | Jun 2007 | A1 |
20070192378 | Atchison | Aug 2007 | A1 |
20070198609 | Black et al. | Aug 2007 | A1 |
20080046483 | Lehr et al. | Feb 2008 | A1 |
20080052326 | Evanchik et al. | Feb 2008 | A1 |
20080154979 | Saitoh et al. | Jun 2008 | A1 |
20080250085 | Gray et al. | Oct 2008 | A1 |
20080263103 | McGregor et al. | Oct 2008 | A1 |
20090019492 | Grasset | Jan 2009 | A1 |
20090063193 | Barton et al. | Mar 2009 | A1 |
20090220088 | Lu et al. | Sep 2009 | A1 |
20090240698 | Shukla et al. | Sep 2009 | A1 |
20090248755 | Watanabe et al. | Oct 2009 | A1 |
20090299650 | Nelson et al. | Dec 2009 | A1 |
20090327362 | Shah et al. | Dec 2009 | A1 |
20090328119 | Kan et al. | Dec 2009 | A1 |
20100121820 | Thapa | May 2010 | A1 |
20100131946 | Degaonkar et al. | May 2010 | A1 |
Number | Date | Country |
---|---|---|
WO 9849626 | Nov 1998 | WO |