Computer systems contain large amounts of information. This information includes personal information, such as financial information, customer/client/patient contact information, business information, audio/visual information, and much more. This information also includes information related to the correct operation of the computer system, such as operating system files, application files, user settings, and so on. With the increased reliance on computer systems to store critical information, the importance of protecting information has grown. Traditional storage systems receive an identification of a file to protect, and then create one or more secondary copies, such as backup files, containing the contents of the file. These secondary copies can then later be used to restore the original data should anything happen to the original data.
In corporate environments, protecting information is generally part of a routine process that information technologists perform for many computer systems within an organization. For example, a company might back up critical computing systems related to e-commerce such as databases, file servers, web servers, and so on as part of a daily, weekly, or monthly maintenance schedule. The company may also protect computing systems used by each of its employees, such as those used by an accounting department, marketing department, engineering department, and so forth.
Continuous data protection (CDP), also sometimes called continuous data replication (CDR) or continuous backup, refers to protecting computer data by automatically saving a copy of every change made to that data, essentially capturing every version of the data that a user or process saves. CDP allows the user or an administrator to restore data to any point in time, at the point of any change. There are multiple methods known in the art for capturing the continuous changes involving different technologies that serve different needs. CDP-based solutions can provide fine granularities of restorable objects ranging from disk images to logical data objects such as files, mailboxes, messages, database files, and database logs. CDP is different from traditional backup in that it is not necessary to specify the point in time to which to recover data until a restore is about to be performed. Traditional backups can only restore data to the point at which the backup was taken. With CDP, there are no backup schedules. When data is written to disk, it is also asynchronously written to a second location, usually another computer over the network. In many situations, CDP requires less space on backup media (e.g., disk or tape) than traditional backup. Most CDP solutions save byte or block-level differences rather than file-level differences. This means that if a change is made to one byte of a 100 GB file, only the changed byte or block is backed up, whereas traditional incremental and differential backups make copies of entire files when those files change.
CDP typically relies upon a highly reliable, continuous connection between the computer system containing data to be protected and the data storage system so that each change to data can be replicated between the computer system and the data storage system when it happens. However, many computers in an organization are not continuously connected, but still contain important data that needs protection. For example, laptops, cell phones, tablet PCs, smart appliances, and other types of portable computer systems may only be connected to the network once a day or once a week, such as after a business trip or when the user is at a wireless hot spot. Even when these computer systems are connected, CDP is often a poor choice for protecting data because the input/output (I/O) performance for constantly replicating writes from these devices is very bad. Typically, such computer systems are either not protected or are protected through slower or less convenient data protection technologies, such as disk imaging, traditional full or incremental backups, and so forth. The use of different types of data protection throughout an organization leads to additional administrative burden for already overloaded information technology (IT) personnel and resources.
The foregoing examples of some existing limitations are intended to be illustrative and not exclusive. Other limitations will become apparent to those of skill in the art upon a reading of the Detailed Description below. These and other problems exist with respect to data storage management systems.
In the drawings, the same reference numbers and acronyms identify elements or acts with the same or similar functionality for ease of understanding and convenience. To easily identify the discussion of any particular element or act, the most significant digit or digits in a reference number refer to the Figure number in which that element is first introduced (e.g., element 100 is first introduced and discussed with respect to
The headings provided herein are for convenience only and do not necessarily affect the scope or meaning of the claimed invention.
Overview
Described in detail herein is a portable data protection system for protecting, transferring or copying data using CDP over intermittent or occasional connections between a computer system containing the data to be protected, transferred or copied, called a data source, and one or more computer systems that receive the data, called a data target. For example, the portable data protection system provides methods for protecting, transferring or copying data on laptops using a traditional data storage server.
One problem with traditional CDP is that it requires a data source to be continuously connected to a network so that data can be continuously transferred and replicated to a data target. With laptops or other mobile devices that are only sporadically connected to a network, traditional CDP may not work. This is because traditional CDP would typically store in a buffer or cache a queue of data that is to be protected, transferred or copied to the data target. For example, if a traditional CDP filter is installed on a laptop and if the buffer or cache size is fixed, then the buffer or cache storing the queue of data could fill up too quickly if the laptop is not coupled to the network often enough. If the buffer or cache is filled, then the advantages offered by CDP would be lost, because the laptop would no longer be able to queue data that is to be protected, transferred or copied to the data target. As another example, if a traditional CDP filter is installed on a laptop and if the buffer or cache is configured to grow in size, then the buffer or cache could grow to consume all or a substantial portion of all available storage space on the laptop if the laptop is not coupled to the network often enough. This may interfere with other use of the laptop.
The portable data protection system overcomes I/O performance problems associated with constantly replicating writes in portable or other intermittently connected devices. In some embodiments, the portable data protection system employs a CDP filter, program code or module to minimally monitor a particular file or files, and to journal or track changes such that only the most recent changes to the particular file or files are retained within the buffer or cache. For example, the portable data protection system may employ a bitmap or bit-level log of changes to journal or track changes to the particular file or files on the portable device. Then, when the portable device is coupled to the network, the portable data protection system uses the bitmap or bit-level log of changes to determine the particular file or files that have been changed. The portable data protection system then provides those recent changes using CDP functionality to the data target. Because the portable data protection system journals or tracks only the most recent changes to the particular file or files, the portable data protection system can reduce the amount of data to be queued in the buffer or cache that is to be replicated to the data target. The portable data protection system can avoid filling up the buffer or cache, thereby saving storage space on the portable device.
The invention will now be described with respect to various embodiments. The following description provides specific details for a thorough understanding of, and enabling description for, these embodiments of the invention. However, one skilled in the art will understand that the invention may be practiced without these details. In other instances, well-known structures and functions have not been shown or described in detail to avoid unnecessarily obscuring the description of the embodiments of the invention.
The terminology used in the description presented below is intended to be interpreted in its broadest reasonable manner, even though it is being used in conjunction with a detailed description of certain specific embodiments of the invention. Certain terms may even be emphasized below; however, any terminology intended to be interpreted in any restricted manner will be overtly and specifically defined as such in this Detailed Description section.
System Components
Aspects of the invention can be embodied in a special purpose computer or data processor that is specifically programmed, configured, or constructed to perform one or more of the computer-executable instructions explained in detail herein. Aspects of the invention can also be practiced in distributed computing environments where tasks or modules are performed by remote processing devices, which are linked through a communications network, such as a Local Area Network (LAN), Wide Area Network (WAN), or the Internet. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
Aspects of the invention may be stored or distributed on computer-readable media, including magnetically or optically readable computer discs, hard-wired or preprogrammed chips (e.g., EEPROM semiconductor chips), nanotechnology memory, biological memory, or other data storage media. Indeed, computer implemented instructions, data structures, screen displays, and other data under aspects of the invention may be distributed over the Internet or over other networks (including wireless networks), on a propagated signal on a propagation medium (e.g., an electromagnetic wave(s), a sound wave, etc.) over a period of time, or they may be provided on any analog or digital network (packet switched, circuit switched, or other scheme). Those skilled in the relevant art will recognize that portions of the invention may reside on a server computer, while corresponding portions reside on a client computer such as a mobile or portable device, and thus, while certain hardware platforms are described herein, aspects of the invention are equally applicable to nodes on a network.
The data source 110 contains a data store 115, a communication component 120, and a portable data manager 125. The data store 115 stores source data. The source data may include files, application-specific data, databases, or other physical or logical data objects. The data store 115 may be a hard drive, optical disk, flash drive, solid state drive, semiconductor memory, or any other device that stores data or provides access to stored data. The communication component 120 is a device, such as an Ethernet card, wireless device, modem, ISDN terminal adapter or the like, that allows the data source 110 to communicate with the data target 150. The communication component 120 forms a connection over the network 190, which may be a public network, such as the Internet, a private network, such as a local area network (LAN), or a combination of the two, such as a tunneled private connection over a public network (e.g., using the Point to Point Tunneling Protocol (PPTP)).
The portable data manager 125 contains a change detection component 130, a change log component 135, an intermediate version cache 140 and a change replication component 145. The portable data manager 125, described in further detail herein, is a software and/or hardware component that detects changes to source data, keeps a log of the changes, keeps a copy of the original data prior to the change and interacts with the data target 150 when a connection is available to protect, copy or transfer the changed data. The change detection component 130 detects changes to data in the data store 115. For example, if a user edits a document or changes operating system settings, then a file (or a portion of a file, e.g., a data block) on the hard drive or at a memory location may be modified. The change detection component 130 may use snapshot software (e.g., built into the operating system), journaling software, a file system filter driver, an application event, or other common method of detecting changes to data, as described in greater detail below.
When the change detection component 130 detects a change to data in the data store 115, the change log component 135 stores a record of the change, such as a name or an identifier of the changed data, an offset within the changed data beginning at which the change is made, and the bytes that changed. The intermediate file cache component 140 stores any intermediate data so that a user can recover data at any point in time. In some embodiments, the change log component 135 stores the latest version of the changed data and the intermediate file cache component 140 stores any previous versions of the changed data. In some embodiments, the portable data protection system 100 does not store the original version of the data prior to the first change under the assumption that the data target 150 already has this original version of the data from the last time the data source 110 was connected to the data target 150.
In some embodiments, the portable data protection system 100 may not store the version of the data after the most recent change (e.g., the last change before the data source 110 is connected or reconnected to the data target 150) because this version of the data is available from the data store 115 of the data source 110. The portable data protection system 100 may implement this by caching a version of the data after each change to the data. When the data is changed again (i.e., creating a subsequent version of the data), the portable data protection system 100 flushes the version of the data in the cache to the intermediate file cache component 140 and then caches the subsequent version of the data. When the data source 110 is connected or reconnected to the data target 150, the portable data protection system 100 can empty the data in the cache.
When the data source 110 is connected to the network 190, the change replication component 145 copies information stored by the change log component 135 and the intermediate version cache component 140 to the data target 150. In some embodiments, in order to save data storage space on the data source 110, the data source 110 does not include the intermediate version cache component 140 and therefore, the data source 110 does not store any previous versions of the changed data. In some embodiments, the data source 110 includes the intermediate version cache component 140, but limits its storage capacity to a threshold storage limit. For example, the data source 110 may limit the intermediate version cache component 140 to storing the first 100 MB or last 100 MB of changes to data in the data store 115.
In some embodiments, the data management computer system 180 determines when the data source 110 is accessible (i.e., when the data source 110 is connected to the network 190), and manages the copying of data from the data source 110 to the data target 150. For example, the data management computer system 180 may receive an indication from the portable data manager 125 when the data source 110 is connected to the network 190 (e.g., to a corporate network) The data management computer system 180 may then direct the data source 110 to transfer or copy any changed data to the data target 150. The data source 110 may do this by exporting the contents of the change log 135 and the intermediate version cache 140.
CDP can be broken down logically into two phases: 1) detecting changes to data on a data source and 2) replicating the changes to a data target. The portable data protection system uses a method that performs the first phase continuously or near continuously on the data source, and the second phase when a connection is available between the data source and the data target.
Detecting Changes
This section describes the first phase of the CDP process, detecting changes. Under the present system, a CDP filter, program code or module on the data source 110 tracks bit-level changes to a file or volume. For example, the CDP filter, program code or module employs snapshot functionality (i.e., the CDP filter, program code or module creates a snapshot at every instant in time a modification to the file or volume occurs, either just prior to or just after the modification) to track bit-level changes to a file or volume. The CDP filter, program code or module employs a bitmap to track and identify which blocks have been changed on various locally stored files or volumes. Notably, the portable data protection system 100 sets flags for files that have been modified and tracks recent changes, including overwriting old changes with new changes, so as to not fill up the change log component 135.
An administrator (or other user) may configure for how long the portable data protection system 100 is to track changes to files or volumes. For example, an administrator may configure the portable data protection system 100 to only track the 100 most recent changes for a particular file. When the particular file has been changed for the 101st time, the portable data protection system 100 would discard the first change to the particular file, and upon the 102nd change, the portable data protection system 100 would discard the second change to the particular file. As another example, an administrator may configure the portable data protection system 100 to only track changes to a file that have occurred in the past three days of no network connectivity. If the data source 110 is offline for a fourth day and if the file was changed subsequent to the first day, then the portable data protection system 100 would discard changes that occurred to the file on the first day. If the data source 110 is offline for the fourth day and if the file had not changed subsequent to the first day, then the data protection system 100 would not discard changes that occurred to the file on the first day. Because the portable data protection system 100 tracks only recent changes to the files, the portable data protection system 100 can reduce the amount of data to be stored in the change log component 135 that is to be replicated to the data target. The portable data protection system can avoid filling up the change log component 135, thereby saving storage space on the data source 110.
Then, when the data source 110 connects to the network 190, the data target 150 may provide a message to the data source 110 indicating a last modification time of a file that has been changed. In response, the CDP process retrieves changes in the change log component 135 from the last modification time to the present and provides those changes to the data target 150. The flag, for example, can be a single bit that represents a 16K to 32K block that has been changed, and then the change replication component 145 assesses the data store 115 for files to pick up or copy changed blocks based on those flags and provides them to the destination data store 150.
As noted above, one data structure, a bitmap, may indicate changed blocks, whereas another data structure may track the offsets and block lengths that were changed, so that only changed blocks or changed portions of blocks are copied to the data target 150.
In some embodiments, the portable data protection system 100 may employ snapshot functionality to track changes to a file or volume, at the block-level, byte-level or bit-level. For example, the portable data protection system 100 may create a snapshot at every instant in time a modification to the file or volume occurs. The portable data protection system 100 may create the snapshot just prior to or subsequent to the modification to the file or volume. The portable data protection system 100 may then perform block, byte or bit comparisons of snapshots to determine the changed blocks, bytes or bits of the file or volume. For example, the portable data protection system 100 may create a first snapshot of a file prior to any modifications to the file. After a first modification, the portable data protection system 100 may create a second snapshot and compare the first and second snapshots to determine that a first set of bytes within the file has changed. The portable data protection system 100 can then discard the first snapshot but retain the first set of bytes. Alternatively, the portable data protection system 100 can retain the first snapshot.
After a second modification, the portable data protection system 100 may create a third snapshot and compare the second and third snapshots to determine that a second set of bytes within the file has changed. The portable data protection system 100 can then discard the second snapshot, but retain the second set of bytes. Alternatively, the portable data protection system 100 can retain the second snapshot. The portable data protection system 100 can then determine that the union of the first and second sets of bytes comprise the changed bytes for the file. The portable data protection system 100 can then use a data structure (e.g., a bitmap) to store an indication of the changed bytes. The usage of snapshots by the portable data protection system 100 in this manner enables the portable data protection system 100 to save storage space on the data source 110.
The portable data protection system 100 may use snapshots in other manners, such as by taking snapshots on a periodic basis or other basis. For example, the portable data protection system 100 may create a first snapshot of a file prior to any modifications to the file. The portable data protection system 100 may take a second snapshot of the file when the data source 110 is connected to the network 190 and to the data target 150. The portable data protection system 100 may then compare the first and second snapshots to determine the set of bytes within the file that have changed. The portable data protection system 100 can then use a data structure (e.g., a bitmap) to store an indication of the changed bytes.
In some embodiments, the portable data protection system 100 limits the amount of data stored on the data source 110 to avoid filling up the data storage available to the data source 110. For example, an administrator may configure the portable data protection system 100 to limit the size of the change log component 135 that stores data to be replicated to the data target 150. A data source 110 such as a laptop may have numerous files to be tracked, with an average of 100 modifications to the files per day and the average modification to a file being 1 MB. An administrator may configure the laptop to have a 200 MB change log component 135 for storing changed files. Each day that the laptop is not connected to the network will result in 100 MB of modifications to be stored in the change log component 135 (100 modifications×1 MB/modification=100 MB of modifications) on average. This means that the laptop can only store two days worth of modifications before filling up the change log component 135. However, such a size limitation of the change log component 135 may be preferable to tracking all changes to data on the laptop, which may result in consuming all available storage space on the laptop (depending upon the size and frequency of modifications, the length of time of no connectivity, and perhaps other factors).
As another example of how portable data protection system 100 limits the amount of data stored on the data source 110, the portable data protection system 100 may only keep a bitmap indicating changed blocks without a separate log of changes within blocks. This causes more data to be sent when the data source 110 is reconnected to the network 190 but uses less space when the data source 110 is not connected to the network 190. Other space saving measures may also be used, such as not storing the previous data of a changed block, using a larger block size in the bitmap to reduce the size of the bitmap, and not tracking all changes (e.g., for operating system files that should not change or less important data files). These space saving measures may be configurable by an administrator or user, and may be set to take effect only when needed. For example, the portable data protection system 100 may keep comprehensive information regarding all changes to files or volumes as long as space on the data store 115 is not low, but then incrementally apply space saving measures when space on the data store 115 is scarcer.
As another example of how portable data protection system 100 saves storage space on the data source 110, an administrator may configure the priority of files to be tracked. For example, a data source 110 such as a laptop may have its hard disk drive partitioned into two volumes, one for storing operating system files (e.g., files in the C:\Windows directory), and the second for storing user data (e.g., user-created spreadsheets, word processing documents, etc.). An administrator may configure the portable data protection system 100 to only journal or track the files on the second volume, as they are likely to be of higher priority and likely to change more frequently. As another example, the portable data protection system 100 may index files in the data store 115 and determine which files are to be journaled or tracked based upon information obtained during the indexing. The portable data protection system 100 may determine that files containing certain keywords (e.g., financial terms, names of key individuals, projects or departments) or files that have certain associated metadata (e.g., file metadata such as the creator of the file, by whom the file was last modified, etc.) are always to be journaled or tracked. Therefore, the portable data protection system 100 would store in the change log component 135 all changes to such files, and only store minimal or no changes to files that are deemed to be of lower priority.
Replicating Changes
As noted previously, CDP can be broken down logically into two phases: 1) detecting changes to data on a data source and 2) replicating the changes to a data target. The portable data protection system uses a method that performs the first phase continuously on the data source, and the second phase when a connection is available between the data source and data target. This section describes the second phase.
Under the present system, when the data source 110, after having been disconnected from the network 190, is reconnected to the network 190, the data source 110 copies changed data from the data source 110 to the data target 150. For example, the data source 110 may be a laptop computer or other portable computer system that is used by an employee of a company implementing the portable data protection system 100 while that employee travels or when the employee goes home each night. When the employee returns to work and connects the laptop to the network 190 (or when the employee has connectivity to the network 190 from afar), the portable data protection system 100 copies the changes from the laptop to a company data storage system (the data target 150). The data target 150 may be as simple as a backup disk or as complicated as an integrated data storage system including one or more media libraries and offsite facilities, and anything in between, such as a federated storage system or storage area network (SAN).
In some embodiments, the portable data protection system 100 may operate in a dual mode. If the data source 110 is continually and consistently connected to the network 190 for a given period, then the data source 110 may switch to a traditional CDP mode where changes are sent continuously to the data target 150. When the data source 110 is disconnected from the network 190, the data source 110 switches to an intermittent CDP mode utilizing the other methods described herein and caches the changes locally at the data source 110 until the data source 110 is reconnected to the network 190.
The portable data protection system 100 may track information regarding how often and for how much time the data source 110 is disconnected from the network 190, in order to ascertain how and when to switch between a traditional CDP mode and the intermittent CDP mode. For example, based upon such monitoring the portable data protection system 100 may determine that the data source 110 is frequently disconnected from the network 190 every five days, for two days at a time (e.g, connected to the network 190 during the business week, but disconnected on the weekend.) Based upon this determination, the portable data protection system 100 may configure the portable data protection system 100 to use a traditional CDP mode during the five days that the data source 110 is connected to the network 190 and to switch to an intermittent CDP mode during the two days that the data source 110 is disconnected from the network 190.
The portable data protection system 100 may also track information about the connection to the network 190 (e.g., the speed and/or quality of the connection, whether the connection is through a tunneled private connection, whether the connection is directly to the same private or internal network as the data target 150, etc.), in order to aid in determining how and when to switch modes. For example, the data source 110 may have a low-speed connection to the network 190 (e.g., a dial-up connection or otherwise low-speed connection), and therefore the portable data protection system 100 should remain in the intermittent CDP mode. As another example, the data source 110 may have a tunneled private connection to the network 190 that is not suitable for a traditional CDP mode, and therefore the portable data protection system 100 should remain in the intermittent CDP mode. Those of skill in the art will understand that the portable data protection system 100 may consider other factors in determining how and when to switch modes.
The filter driver 605 determines which volume contains the file, the file itself, the offset where the change begins, and the size of the change (in bytes, e.g., in approximately 4K increments). The filter driver 605 then writes this information (the volume, file, offset and size information) to the change journal component 615. For example, the application 600 may change a file on the file system 610 a first time and then subsequently, a second time. The filter driver 605 tracks both changes by tracking the blocks corresponding to the portions of the file that have changed and stores this information in the change journal 615. One advantage of the filter driver 605 and the change journal component 615 is that they can track multiple changes to a file on the block-level (i.e., changes to multiple blocks) and store such information in the change journal component 615, instead of merely tracking that the file has changed and recording such change.
The filter driver 605 can also track metadata about the changed file and store such metadata in the change journal component 615. For example, the filter driver 605 can track which application or process changed the file, the credentials (e.g., security or authentication information) of the user utilizing the application or the credentials (e.g., security or authentication information) of the process that changed the file, the time of the change or other metadata. The filter driver 605 can then store such metadata in the change journal component 615 for use in protecting, transferring or copying data using CDP to the data target 150.
From the foregoing, it will be appreciated that specific embodiments of the portable data protection system have been described herein for purposes of illustration, but that various modifications may be made without deviating from the spirit and scope of the invention. For example, although using the portable data protection system 100 has been described herein with reference to portable devices, the portable data protection system 100 can be used equally well with other systems for which connectivity is occasionally impaired or disk space for saving changes is limited. For example, even desktop systems in an organization may occasionally be disconnected from the network, and the portable data protection system 100 can be used to keep an up-to-date log of all changes that can be sent to the data target 150 when connectivity is restored. Thus, the portable data protection system 100 may apply not only to laptops, but also to wireless devices (e.g., cell phones/mobile phones, pocket computers, tablet computers, portable media players, handheld game devices, etc.), desktop devices for which network connectivity may be an issue, to other systems for which storage space is limited, or to other computing systems. Accordingly, the invention is not limited except as by the appended claims.
Unless the context clearly requires otherwise, throughout the description and the claims, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense, as opposed to an exclusive or exhaustive sense; that is to say, in the sense of “including, but not limited to.” The word “coupled,” as generally used herein, refers to two or more elements that may be either directly connected, or connected by way of one or more intermediate elements. Additionally, the words “herein,” “above,” “below,” and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application. Where the context permits, words in the above Detailed Description using the singular or plural number may also include the plural or singular number respectively. The word “or” in reference to a list of two or more items, that word covers all of the following interpretations of the word: any of the items in the list, all of the items in the list, and any combination of the items in the list.
The above detailed description of embodiments of the invention is not intended to be exhaustive or to limit the invention to the precise form disclosed above. While specific embodiments of, and examples for, the invention are described above for illustrative purposes, various equivalent modifications are possible within the scope of the invention, as those skilled in the relevant art will recognize. For example, while processes or blocks are presented in a given order, alternative embodiments may perform routines having steps, or employ systems having blocks, in a different order, and some processes or blocks may be deleted, moved, added, subdivided, combined, and/or modified. Each of these processes or blocks may be implemented in a variety of different ways. In addition, while processes or blocks are at times shown as being performed in series, these processes or blocks may instead be performed in parallel, or may be performed at different times.
The teachings of the invention provided herein can be applied to other systems, not necessarily the system described above. The elements and acts of the various embodiments described above can be combined to provide further embodiments.
These and other changes can be made to the invention in light of the above Detailed Description. While the above description details certain embodiments of the invention and describes the best mode contemplated, no matter how detailed the above appears in text, the invention can be practiced in many ways. Details of the system may vary considerably in implementation details, while still being encompassed by the invention disclosed herein. As noted above, particular terminology used when describing certain features or aspects of the invention should not be taken to imply that the terminology is being redefined herein to be restricted to any specific characteristics, features, or aspects of the invention with which that terminology is associated. In general, the terms used in the following claims should not be construed to limit the invention to the specific embodiments disclosed in the specification, unless the above Detailed Description section explicitly defines such terms. Accordingly, the actual scope of the invention encompasses not only the disclosed embodiments, but also all equivalent ways of practicing or implementing the invention under the claims.
While certain aspects of the invention are presented below in certain claim forms, the inventors contemplate the various aspects of the invention in any number of claim forms. For example, while only one aspect of the invention is recited as embodied in a computer-readable medium, other aspects may likewise be embodied in a computer-readable medium. Accordingly, the inventors reserve the right to add additional claims after filing the application to pursue such additional claim forms for other aspects of the invention.
This application is a continuation of U.S. patent application Ser. No. 13/454,947 filed Apr. 24, 2012, now U.S. Pat. No. 8,380,957, entitled “CONTINUOUS DATA PROTECTION OVER INTERMITTENT CONNECTIONS, SUCH AS CONTINUOUS DATA BACKUP FOR LAPTOPS OR WIRELESS DEVICES,” which is a continuation of U.S. patent application Ser. No. 12/167,933 filed on Jul. 3, 2008, now U.S. Pat. No. 8,166,263, entitled “CONTINUOUS DATA PROTECTION OVER INTERMITTENT CONNECTIONS, SUCH AS CONTINUOUS DATA BACKUP FOR LAPTOPS OR WIRELESS DEVICES,” each of which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4686620 | Ng | Aug 1987 | A |
4995035 | Cole et al. | Feb 1991 | A |
5005122 | Griffin et al. | Apr 1991 | A |
5093912 | Dong et al. | Mar 1992 | A |
5133065 | Cheffetz et al. | Jul 1992 | A |
5193154 | Kitajima et al. | Mar 1993 | A |
5212772 | Masters | May 1993 | A |
5226157 | Nakano et al. | Jul 1993 | A |
5239647 | Anglin et al. | Aug 1993 | A |
5241668 | Eastridge et al. | Aug 1993 | A |
5241670 | Eastridge et al. | Aug 1993 | A |
5276860 | Fortier et al. | Jan 1994 | A |
5276867 | Kenley et al. | Jan 1994 | A |
5287500 | Stoppani, Jr. | Feb 1994 | A |
5321816 | Rogan et al. | Jun 1994 | A |
5333315 | Saether et al. | Jul 1994 | A |
5347653 | Flynn et al. | Sep 1994 | A |
5410700 | Fecteau et al. | Apr 1995 | A |
5437012 | Mahajan | Jul 1995 | A |
5448724 | Hayashi | Sep 1995 | A |
5491810 | Allen | Feb 1996 | A |
5495607 | Pisello et al. | Feb 1996 | A |
5504873 | Martin et al. | Apr 1996 | A |
5544345 | Carpenter et al. | Aug 1996 | A |
5544347 | Yanai et al. | Aug 1996 | A |
5559957 | Balk | Sep 1996 | A |
5619644 | Crockett et al. | Apr 1997 | A |
5638509 | Dunphy et al. | Jun 1997 | A |
5673381 | Huai et al. | Sep 1997 | A |
5699361 | Ding et al. | Dec 1997 | A |
5729743 | Squibb | Mar 1998 | A |
5742792 | Yanai et al. | Apr 1998 | A |
5751997 | Kullick et al. | May 1998 | A |
5758359 | Saxon | May 1998 | A |
5761677 | Senator et al. | Jun 1998 | A |
5764972 | Crouse et al. | Jun 1998 | A |
5778395 | Whiting et al. | Jul 1998 | A |
5812398 | Nielsen | Sep 1998 | A |
5813008 | Benson et al. | Sep 1998 | A |
5813009 | Johnson et al. | Sep 1998 | A |
5813017 | Morris | Sep 1998 | A |
5822780 | Schutzman | Oct 1998 | A |
5875478 | Blumenau | Feb 1999 | A |
5887134 | Ebrahim | Mar 1999 | A |
5901327 | Ofek | May 1999 | A |
5924102 | Perks | Jul 1999 | A |
5940833 | Benson | Aug 1999 | A |
5950205 | Aviani, Jr. | Sep 1999 | A |
5974563 | Beeler, Jr. | Oct 1999 | A |
5990810 | Williams | Nov 1999 | A |
6021415 | Cannon et al. | Feb 2000 | A |
6026414 | Anglin | Feb 2000 | A |
6052735 | Ulrich et al. | Apr 2000 | A |
6076148 | Kedem | Jun 2000 | A |
6094416 | Ying | Jul 2000 | A |
6125369 | Wu et al. | Sep 2000 | A |
6131095 | Low et al. | Oct 2000 | A |
6131190 | Sidwell | Oct 2000 | A |
6148412 | Cannon et al. | Nov 2000 | A |
6154787 | Urevig et al. | Nov 2000 | A |
6161111 | Mutalik et al. | Dec 2000 | A |
6167402 | Yeager | Dec 2000 | A |
6212512 | Barney et al. | Apr 2001 | B1 |
6260069 | Anglin | Jul 2001 | B1 |
6269431 | Dunham | Jul 2001 | B1 |
6275953 | Vahalia et al. | Aug 2001 | B1 |
6301592 | Aoyama et al. | Oct 2001 | B1 |
6311252 | Raz | Oct 2001 | B1 |
6324544 | Alam et al. | Nov 2001 | B1 |
6324581 | Xu et al. | Nov 2001 | B1 |
6328766 | Long | Dec 2001 | B1 |
6330570 | Crighton | Dec 2001 | B1 |
6330642 | Carteau | Dec 2001 | B1 |
6343324 | Hubis et al. | Jan 2002 | B1 |
RE37601 | Eastridge et al. | Mar 2002 | E |
6356801 | Goodman et al. | Mar 2002 | B1 |
6389432 | Pothapragada et al. | May 2002 | B1 |
6418478 | Ignatius et al. | Jul 2002 | B1 |
6421711 | Blumenau et al. | Jul 2002 | B1 |
6487561 | Ofek et al. | Nov 2002 | B1 |
6513051 | Bolosky et al. | Jan 2003 | B1 |
6519679 | Devireddy et al. | Feb 2003 | B2 |
6538669 | Lagueux, Jr. et al. | Mar 2003 | B1 |
6564228 | O'Connor | May 2003 | B1 |
6609157 | Deo et al. | Aug 2003 | B2 |
6609183 | Ohran | Aug 2003 | B2 |
6609187 | Merrell et al. | Aug 2003 | B1 |
6658526 | Nguyen et al. | Dec 2003 | B2 |
6704730 | Moulton et al. | Mar 2004 | B2 |
6745304 | Playe | Jun 2004 | B2 |
6757699 | Lowry | Jun 2004 | B2 |
6757794 | Cabrera et al. | Jun 2004 | B2 |
6795903 | Schultz et al. | Sep 2004 | B2 |
6810398 | Moulton | Oct 2004 | B2 |
6865655 | Andersen | Mar 2005 | B1 |
6868417 | Kazar et al. | Mar 2005 | B2 |
6901493 | Maffezzoni | May 2005 | B1 |
6912645 | Dorward et al. | Jun 2005 | B2 |
6928459 | Sawdon et al. | Aug 2005 | B1 |
6952758 | Chron et al. | Oct 2005 | B2 |
6959368 | St. Pierre et al. | Oct 2005 | B1 |
6976039 | Chefalas et al. | Dec 2005 | B2 |
6993162 | Stephany et al. | Jan 2006 | B2 |
7017113 | Bourbakis et al. | Mar 2006 | B2 |
7035880 | Crescenti et al. | Apr 2006 | B1 |
7035943 | Yamane et al. | Apr 2006 | B2 |
7085904 | Mizuno et al. | Aug 2006 | B2 |
7089383 | Ji et al. | Aug 2006 | B2 |
7089395 | Jacobson et al. | Aug 2006 | B2 |
7111173 | Scheidt | Sep 2006 | B1 |
7117246 | Christenson et al. | Oct 2006 | B2 |
7143091 | Charnock et al. | Nov 2006 | B2 |
7191290 | Ackaouy et al. | Mar 2007 | B1 |
7200604 | Forman et al. | Apr 2007 | B2 |
7246272 | Cabezas et al. | Jul 2007 | B2 |
7272606 | Borthakur et al. | Sep 2007 | B2 |
7287252 | Bussiere et al. | Oct 2007 | B2 |
7320059 | Armangau et al. | Jan 2008 | B1 |
7325110 | Kubo et al. | Jan 2008 | B2 |
7330997 | Odom | Feb 2008 | B1 |
7343459 | Prahlad et al. | Mar 2008 | B2 |
7383462 | Osaki et al. | Jun 2008 | B2 |
7395282 | Crescenti et al. | Jul 2008 | B1 |
7444382 | Malik | Oct 2008 | B2 |
7444387 | Douceur et al. | Oct 2008 | B2 |
7478113 | De Spiegeleer et al. | Jan 2009 | B1 |
7487245 | Douceur et al. | Feb 2009 | B2 |
7490207 | Amarendran et al. | Feb 2009 | B2 |
7493314 | Huang et al. | Feb 2009 | B2 |
7496604 | Sutton, Jr. et al. | Feb 2009 | B2 |
7519726 | Palliyil et al. | Apr 2009 | B2 |
7568080 | Prahlad et al. | Jul 2009 | B2 |
7613748 | Brockway et al. | Nov 2009 | B2 |
7617297 | Bruce et al. | Nov 2009 | B2 |
7631194 | Wahlert et al. | Dec 2009 | B2 |
7647462 | Wolfgang et al. | Jan 2010 | B2 |
7657550 | Prahlad et al. | Feb 2010 | B2 |
7661028 | Erofeev | Feb 2010 | B2 |
7668884 | Prahlad et al. | Feb 2010 | B2 |
7676590 | Silverman et al. | Mar 2010 | B2 |
7685126 | Patel et al. | Mar 2010 | B2 |
7685177 | Hagerstrom et al. | Mar 2010 | B1 |
7685459 | De Spiegeleer et al. | Mar 2010 | B1 |
7698699 | Rogers et al. | Apr 2010 | B2 |
7721292 | Frasier et al. | May 2010 | B2 |
7747579 | Prahlad et al. | Jun 2010 | B2 |
7788230 | Dile et al. | Aug 2010 | B2 |
7814142 | Mamou et al. | Oct 2010 | B2 |
7818287 | Torii et al. | Oct 2010 | B2 |
7818495 | Tanaka et al. | Oct 2010 | B2 |
7831795 | Prahlad et al. | Nov 2010 | B2 |
7840537 | Gokhale et al. | Nov 2010 | B2 |
7856414 | Zee | Dec 2010 | B2 |
7865678 | Arakawa et al. | Jan 2011 | B2 |
7870105 | Arakawa et al. | Jan 2011 | B2 |
7870486 | Wang et al. | Jan 2011 | B2 |
7873599 | Ishii et al. | Jan 2011 | B2 |
7873806 | Prahlad et al. | Jan 2011 | B2 |
7882077 | Gokhale et al. | Feb 2011 | B2 |
7921077 | Ting et al. | Apr 2011 | B2 |
7953706 | Prahlad et al. | May 2011 | B2 |
7962452 | Anglin | Jun 2011 | B2 |
8037028 | Prahlad et al. | Oct 2011 | B2 |
8054765 | Passey et al. | Nov 2011 | B2 |
8055618 | Anglin | Nov 2011 | B2 |
8055745 | Atluri | Nov 2011 | B2 |
8086799 | Mondal et al. | Dec 2011 | B2 |
8108429 | Sim-Tang et al. | Jan 2012 | B2 |
8112357 | Mueller et al. | Feb 2012 | B2 |
8131687 | Bates et al. | Mar 2012 | B2 |
8140786 | Bunte et al. | Mar 2012 | B2 |
8156092 | Hewett et al. | Apr 2012 | B2 |
8156279 | Tanaka et al. | Apr 2012 | B2 |
8161003 | Kavuri | Apr 2012 | B2 |
8165221 | Zheng et al. | Apr 2012 | B2 |
8166263 | Prahlad et al. | Apr 2012 | B2 |
8170994 | Tsaur et al. | May 2012 | B2 |
8190823 | Waltermann et al. | May 2012 | B2 |
8190835 | Yueh | May 2012 | B1 |
8219524 | Gokhale | Jul 2012 | B2 |
8234444 | Bates et al. | Jul 2012 | B2 |
8271992 | Chatley et al. | Sep 2012 | B2 |
8285683 | Prahlad et al. | Oct 2012 | B2 |
20020055972 | Weinman | May 2002 | A1 |
20020099806 | Balsamo et al. | Jul 2002 | A1 |
20020107877 | Whiting et al. | Aug 2002 | A1 |
20030110190 | Achiwa et al. | Jun 2003 | A1 |
20030167318 | Robbin et al. | Sep 2003 | A1 |
20040148306 | Moulton et al. | Jul 2004 | A1 |
20040230817 | Ma | Nov 2004 | A1 |
20050033756 | Kottomtharayil et al. | Feb 2005 | A1 |
20050066190 | Martin | Mar 2005 | A1 |
20050177603 | Shavit | Aug 2005 | A1 |
20050203864 | Schmidt et al. | Sep 2005 | A1 |
20050234823 | Schimpf | Oct 2005 | A1 |
20050262097 | Sim-Tang et al. | Nov 2005 | A1 |
20060047715 | Parizeau | Mar 2006 | A1 |
20060047894 | Okumura | Mar 2006 | A1 |
20060053262 | Prahlad et al. | Mar 2006 | A1 |
20060056623 | Gligor et al. | Mar 2006 | A1 |
20060095470 | Cochran et al. | May 2006 | A1 |
20060174112 | Wray | Aug 2006 | A1 |
20060224846 | Amarendran et al. | Oct 2006 | A1 |
20070022145 | Kavuri | Jan 2007 | A1 |
20070136200 | Frank et al. | Jun 2007 | A1 |
20070255758 | Zheng et al. | Nov 2007 | A1 |
20070271316 | Hollebeek | Nov 2007 | A1 |
20080005141 | Zheng et al. | Jan 2008 | A1 |
20080098083 | Shergill et al. | Apr 2008 | A1 |
20080162320 | Mueller et al. | Jul 2008 | A1 |
20080162518 | Bollinger et al. | Jul 2008 | A1 |
20080243914 | Prahlad et al. | Oct 2008 | A1 |
20090049260 | Upadhyayula | Feb 2009 | A1 |
20090063528 | Yueh | Mar 2009 | A1 |
20090106480 | Chung | Apr 2009 | A1 |
20090112870 | Ozzie et al. | Apr 2009 | A1 |
20090144285 | Chatley et al. | Jun 2009 | A1 |
20090177719 | Kavuri | Jul 2009 | A1 |
20090192978 | Hewett et al. | Jul 2009 | A1 |
20090204649 | Wong et al. | Aug 2009 | A1 |
20090235022 | Bates et al. | Sep 2009 | A1 |
20090268903 | Bojinov et al. | Oct 2009 | A1 |
20090271402 | Srinivasan et al. | Oct 2009 | A1 |
20090319534 | Gokhale | Dec 2009 | A1 |
20090319585 | Gokhale | Dec 2009 | A1 |
20100070715 | Waltermann et al. | Mar 2010 | A1 |
20100082672 | Kottomtharayil et al. | Apr 2010 | A1 |
20100088296 | Periyagaram et al. | Apr 2010 | A1 |
20100094817 | Ben-Shaul et al. | Apr 2010 | A1 |
20100161554 | Datuashvili et al. | Jun 2010 | A1 |
20100169287 | Klose | Jul 2010 | A1 |
20100223441 | Lillibridge et al. | Sep 2010 | A1 |
20100250549 | Muller et al. | Sep 2010 | A1 |
20100299490 | Attarde et al. | Nov 2010 | A1 |
20110035357 | Ting et al. | Feb 2011 | A1 |
20110125720 | Jayaraman | May 2011 | A1 |
20120023070 | Prahlad et al. | Jan 2012 | A1 |
20120084524 | Gokhale et al. | Apr 2012 | A1 |
20120179656 | Bunte et al. | Jul 2012 | A1 |
20120271793 | Gokhale | Oct 2012 | A1 |
20130006946 | Prahlad et al. | Jan 2013 | A1 |
Number | Date | Country |
---|---|---|
0259912 | Mar 1988 | EP |
0405926 | Jan 1991 | EP |
0467546 | Jan 1992 | EP |
0774715 | May 1997 | EP |
0809184 | Nov 1997 | EP |
0899662 | Mar 1999 | EP |
0981090 | Feb 2000 | EP |
WO-9513580 | May 1995 | WO |
WO-9912098 | Mar 1999 | WO |
Entry |
---|
Armstead et al., “Implementation of a Campus-wide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, 1995, pp. 190-199. |
Arneson, “Mass Storage Archiving in Network Environments,” Digest of Papers, Ninth IEEE Symposium on Mass Storage Systems, Oct. 31-Nov. 3, 1988, pp. 45-50, Monterey, CA. |
Cabrera et al., “ADSM: A Multi-Platform, Scalable, Backup and Archive Mass Storage System,” Digest of Papers, Compcon '95, Proceedings of the 40th IEEE Computer Society International Conference, Mar. 5-Mar. 9, 1995, pp. 420-427, San Francisco, CA. |
Commvault Systems, Inc., “Continuous Data Replicator 7.0,” Product Data Sheet, 2007, 6 pages. |
CommVault Systems, Inc., “Deduplication—How to,” <http://documentation.commvault.com/commvault/release—8—0—0/books—online—1/english—US/features/single—instance/single—instance—how—to.htm>, earliest known publication date: Jan. 26, 2009, 7 pages. |
CommVault Systems, Inc., “Deduplication,” <http://documentation.commvault.com/commvault/release—8—0—0/books—online—1/english—US/features/single—instance/single—instance.htm>, earliest known publication date: Jan. 26, 2009, 9 pages. |
Diligent Technologies “HyperFactor,” <http://www.diligent.com/products:protecTlER-1:HyperFactor-1>, Internet accessed on Dec. 5, 2008, 2 pages. |
Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, Jun. 12-16, 1994, pp. 124-126. |
Federal Information Processing Standards Publication 180-2, “Secure Hash Standard”, Aug. 1, 2002, <http://csrc.nist.gov/publications/fips/fips1 80-2/fips 1 80-2withchangenotice. pdf>, 83 pages. |
International Search Report and Written Opinion, International Application No. PCT/US2009/58137, Mail Date Dec. 23, 2009, 14 pages. |
Jander, M., “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4 (Mar. 21, 1998), pp. 64-72. |
Jason Gait, “The Optical File Cabinet: A Random-Access File System for Write-Once Optical Disks,” IEEE Computer, vol. 21, No. 6, pp. 11-22 (Jun. 1988). |
Kornblum, Jesse, “Identifying Almost Identical Files Using Context Triggered Piecewise Hashing,” www.sciencedirect.com, Digital Investigation 3S (2006), pp. S91-S97. |
Lortu Software Development, “Kondar Technology-Deduplication,” <http://www.lortu.com/en/deduplication.asp>, Internet accessed on Dec. 5, 2008, 3 pages. |
Menezes et al., “Handbook of Applied Cryptography”, CRC Press, 1996, <http://www.cacr.math.uwaterloo.ca/hac/aboutIchap9.pdf>, 64 pages. |
Microsoft, “Computer Dictionary”, Fifth Edition, 2002, 3 pages. |
Overland Storage, “Data Deduplication,” <http://www.overlandstorage.com/topics/data—deduplication.html>, Internet accessed on Dec. 5, 2008, 2 pages. |
Quantum Corporation, “Data De-Duplication Background: A Technical White Paper,” May 2008, 13 pages. |
Rosenblum et al., “The Design and Implementation of a Log-Structured File System,” Operating Systems Review SIGOPS, vol. 25, No. 5, New York, US, pp. 1-15 (May 1991). |
SearchStorage, “File System”, Nov. 1998, <http://searchstorage.techtarget.com/definition/file-system>, 10 pages. |
Webopedia, “Data Duplication”, Aug. 31, 2006, <http://web.archive.org/web/20060913030559/http://www.webopedia.com/TERMID/data—deduplication.html>, 2 pages. |
Number | Date | Country | |
---|---|---|---|
20130159652 A1 | Jun 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13454947 | Apr 2012 | US |
Child | 13767585 | US | |
Parent | 12167933 | Jul 2008 | US |
Child | 13454947 | US |