US 7,797,582 B1Grant
Method and system for storing data using a continuous data protection system
Issue Date:2010-09-14
•18 Claims
•7 Drawing Sheets
Abstract
A method for tracking changes on a primary volume in a continuous data protection system writes data to the primary volume. A copy of the data is written to a secondary volume, the secondary volume including all writes made to the primary volume. Each write made to the secondary volume is mapped in a data structure, such that the data structure tracks changes on the primary volume between two different points in time.
Metadata
Assignee
- NetApp, Inc.
Inventors
- Roger Keith Stager
- Don Alvin Trimmer
- Pawan Saxena
- Randall Johnson
- Craig Anthony Johnston
- Yafen Peggy Chang
- Rico Blaser
Application Information
Application Number:US 11/833,515
Filing Date:2007-08-03
Priority Date:2004-02-04
Art Unit:2114
Classifications
IPC:
G06F11/00
Patent Drawings (7 sheets)
Description
Cross Reference to Related Applications
[0001] This application is a continuation of U.S. patent application Ser. No. 10/771,613, filed Feb. 4, 2004, which claims the benefit of U.S. Provisional Application No. 60/541,626 filed Feb. 4, 2004, which is incorporated by reference as if fully set forth herein.
Field of the Invention
[0002] The present invention relates generally to continuous data protection, and more particularly, to storing data using a continuous data protection system.
Background
[0003] Hardware redundancy schemes have traditionally been used in enterprise environments to protect against component failures. Redundant arrays of independent disks (RAID) have been implemented successfully to assure continued access to data even in the event of one or more media failures (depending on the RAID Level). Unfortunately, hardware redundancy schemes are very ineffective in dealing with logical data loss or corruption. For example, an accidental file deletion or virus infection is automatically replicated to all of the redundant hardware components and can neither be prevented nor recovered from by such technologies. To overcome this problem, backup technologies have traditionally been deployed to retain multiple versions of a production system over time. This allowed administrators to restore previous versions of data and to recover from data corruption.
[0004] Backup copies are generally policy-based, are tied to a periodic schedule, and reflect the state of a primary volume (i.e. a protected volume) at the particular point in time that is captured. Because backups are not made on a continuous basis, there will be some data loss during the restoration, resulting from a gap between the time when the backup was performed and the restore point that is required. This gap can be significant in typical environments where backups are only performed once per day. In a mission-critical setting, such a data loss can be catastrophic. Beyond the potential data loss, restoring a primary volume from a backup system, can be very complicated and often takes many hours to complete. This additional downtime further exacerbates the problems associated with a logical data loss.
[0005] The traditional process of backing up data to tape media is time driven and time dependent. That is, a backup process typically is run at regular intervals and covers a certain period of time. For example, a full system backup may be run once a week on a weekend, and incremental backups may be run every weekday during an overnight backup window that starts after the close of business and ends before the next business day. These individual backups are then saved for a predetermined period of time, according to a retention policy. In order to conserve tape media and storage space, older backups are gradually faded out and replaced by newer backups. Further to the above example, after a full weekly backup is completed, the daily incremental backups for the preceding week may be discarded, and each weekly backup may be maintained for a few months, to be replaced by monthly backups over time. It is noted that the daily backups would typically not all get discarded on the same day. Instead, the Monday backup set is overwritten on Monday, the Tuesday set is overwritten on Tuesday, etc. This ensures that a backup set is available that is within 8 business hours of any corruption that may have occurred in the past week.
[0006] Despite frequent hardware failures and the necessity of ongoing maintenance and tuning, the backup creation process can be automated, while restoring data from a backup remains a manual and time-critical process. First, the appropriate backup tapes need to be located, including the latest full backup and any incremental backups made since the last full backup. In the event that only a partial restoration is required, locating the appropriate backup tape can take just as long. Once the backup tapes are located, they must be restored to the primary volume. Even under the best of circumstances, this type of backup and restore process cannot guarantee high availability of data.
[0007] Another type of data protection involves creating point in time (PIT) copies of data. A first type of PIT copy is a hardware-based PIT copy, which is a mirror of the primary volume onto a secondary volume. The main drawbacks to a hardware-based PIT copy are that the data ages quickly and that each copy takes up as much disk space as the primary volume. A software-based PIT, typically called a “snapshot,” is a “picture” of a volume at the block level or a file system at the operating system level. Various types of software-based PITs exist, and most are tied to a particular platform, operating system, or file system. These snapshots also have drawbacks, including occupying additional space on the primary volume, rapid aging, and possible dependencies on data stored on the primary volume wherein data corruption on the primary volume leads to corruption of the snapshot. In addition, snapshot systems generally do not offer the flexibility in scheduling and expiring snapshots that backup software provides.
[0008] While both hardware-based and software-based PIT techniques reduce the dependency on the backup window, they still require the traditional tape-based backup and restore process to move data from disk to tape media and to manage the different versions of data. This dependency on legacy backup applications and processes is a significant drawback of these technologies. Furthermore, like traditional tape-based backup and restore processes, PIT copies are made at discrete moments in time, thereby limiting any restores that are performed to the points in time at which PIT copies have been made.
[0009] A need therefore exists for a system that combines the advantages of tape-based systems with the advantages of snapshot systems and eliminates the limitations described above.
Summary
[0010] The present invention is a method and system where data is structured so that writes may be continuously duplicated and a protected volume may be restored to any particular point in time, as desired. Writes are continuously logged to a secondary volume in a sequential fashion and meta-data regarding the secondary volume is organized by using data structures. The data structures indicate which volume blocks were written during a particular time frame and point to the location of the actual modified data blocks that were written during the time frame.
Brief Description of the Drawings
[0011] A more detailed understanding of the invention may be had from the following description of a preferred embodiment, given by way of example, and to be understood in conjunction with the accompanying drawings wherein:
[0012] FIGS. 1A-1C are block diagrams showing a continuous data protection environment in accordance with the present invention;
[0013] FIG. 2 is a delta map in accordance with the present invention.
[0014] FIG. 3 is a hierarchy of delta maps for storing data in a continuous data protection system;
[0015] FIG. 4 illustrates how delta maps are merged and how they are used to rewind a system to a previous point in time;
[0016] FIG. 5 is a method wherein data is written to a continuous data protection system;
[0017] FIG. 6 is a flow diagram illustrating the steps involved when a write is made by a primary volume; and
[0018] FIG. 7 is an overview of the operation of the complete data protection system.
Detailed Description of the Preferred Embodiments
[0019] In the present invention, data is backed up continuously, allowing system administrators to pause, rewind, and replay live enterprise data streams. This moves the traditional backup methodologies into a continuous background process in which policies automatically manage the lifecycle of many generations of restore images.
[0020] FIG. 1A shows a preferred embodiment of a protected computer system 100 constructed in accordance with the present invention. A host computer 102 is connected directly to a primary data volume 104 (the primary data volume may also be referred to as the protected volume) and to a data protection system 106. The data protection system 106 manages a secondary data volume 108. The construction of the system 100 minimizes the lag time by writing directly to the primary data volume 104 and permits the data protection system 106 to focus exclusively on managing the secondary data volume 108. The management of the volumes is preferably performed using a volume manager. The volume manager mirrors writes so that one copy goes to the primary volume 108 and one copy goes to the data protection system 106 which in turn writes sequentially to the secondary volume 108. That is, the data protection pretends to be a regular disk/volume but when writes arrive for a specific address, the system stores them sequentially on the secondary volume 108. A volume manager is software module that runs on a server or intelligent storage switch to manage storage resources. Typical volume managers have the ability to aggregate blocks from multiple different physical disks into one or more virtual volume. Applications are not aware that they are actually writing to segments of many different disks because one large, contiguous volume is presented to them. In addition to block aggregation, volume managers usually also offer software RAID functionality. For example, they are able to split the segments of the different volumes into two groups, where one group is a mirror of the other group. This is, in a preferred embodiment, the feature the present data protection system is taking advantage of when it is implemented as shown in FIG. 1A . In many environments, the volume manager or host-based driver already mirrors the writes to two distinct primary volumes for redundancy in case of a hardware failure. The present invention is configured as a tertiary mirror target in this scenario, such that the volume manager or host-based driver also send copies of all writes to the data protection system.
[0021] It is noted that the primary data volume 104 and the secondary data volume 108 can be any type of data storage, including, but not limited to, a single disk, a disk array (such as a RAID), or a storage area network (SAN). The main difference between the primary data volume 104 and the secondary data volume 108 lies in the structure of the data stored at each location, as will be explained in detail below. It is noted that there may also be differences in terms of the technologies that are used. The primary volume is typically an expensive, very fast, highly available storage subsystem, whereas the secondary volume is typically cost-effective, high capacity and comparatively slow (for example, ATA/SATA disks). Normally, the slower secondary volume cannot be used as a synchronous mirror to the high-performance primary volume. This is because the slow response time would have an adverse impact on the overall system performance. The disclosed data protection system, however, is optimized to keep up with high-performance primary volumes. These optimizations are described in more detail below. At a high level, random writes to the primary volume are processed sequentially on the secondary storage. Sequential writes improve both the cache behavior, as well as the actual volume performance of the secondary volume. In addition, it is possible to aggregate multiple sequential writes on the secondary volume, whereas this is not possible with the random writes to the primary volume. Also note that the present invention does not require writes to the data protection system to be synchronous. However, even in the case of an asynchronous mirror, minimizing latencies is important.
[0022] FIG. 1B shows an alternate embodiment of a protected computer system 120 constructed in accordance with the present invention. The host computer 102 is directly connected to the data protection system 106, which manages both the primary data volume 104 and the secondary data volume 108. The system 120 is likely slower than the system 100 described above, because the data protection system 106 must manage both the primary data volume 104 and the secondary data volume 108. This results in a higher latency for writes to the primary volume in the system 120 and lowers the available bandwidth for use. Additionally, the introduction of a new component into the primary data path is undesirable because of reliability concerns. Nonetheless, it is a usable configuration for lower-end deployments.
[0023] FIG. 1C shows another alternate embodiment of a protected computer system 140 constructed in accordance with the present invention. The host computer 102 is connected to an intelligent switch 142. The switch 142 is connected to the primary data volume 104 and the data protection system 106, which in turn manages the secondary data volume 108. The switch 142 includes the ability to host applications and contains some of the functionality of the data protection system 106 in hardware, to assist in reducing system latency and to improve bandwidth.
[0024] It is noted that the data protection system 106 operates in the same manner, regardless of the particular construction of the protected computer system 100, 120, 140. The major difference between these deployment options is the manner and place in which a copy of each write is obtained. To those skilled in the art it is evident that other embodiments, such as the cooperation between a switch platform and an external server, are also feasible.
[0025] In practice, certain applications require continuous data protection with a block-by-block granularity, for example, to rewind individual transactions. However, the period in which such fine granularity is required is, generally, relatively short (for example two days), which is why the system can be configured to fade out data over time. The present invention discloses data structures and methods to manage this process automatically.
[0026] Because data is continuously backed-up in the present invention, reversing each write to get to a particular point in time quickly becomes unfeasible where hundreds, thousands or more writes are logged every second. The amount of data simply becomes too large to scan in a linear fashion. The present invention therefore provides data structures (i.e. delta maps) so that such voluminous amounts of backup data may be efficiently tracked and accessed, as desired.
[0027] In typical recovery scenarios, it is necessary to examine how the primary volume looked like at multiple points in time before deciding which point to recover to. For example, consider a system that was infected by a virus. In order to recover from this virus, it is necessary to examine the primary volume as it was at different points in time in order to find the latest recovery point where the system was not yet infected by the virus. In order to efficiently compare multiple potential recovery points, additional data structures are needed. Delta maps provide a mechanism to efficiently recover the primary volume as it was at a particular point in time, without the need to replay the write log in its entirety, one write at a time. In particular, delta maps are data structures that keep track of data changes between two points in time. These data structures can then be used to selectively play back portions of the write log such that the resulting point-in-time image is the same as if the log were played back one write at a time, starting at the beginning of the log.
[0028] Referring now to FIG. 2 , there is shown a delta map 150 in accordance with the present invention. While the format shown in FIG. 2 is preferred, any format may of course be used. For each write to a primary volume, a duplicate write is made, in sequential order, to a secondary volume. To create a mapping between the two volumes, it is preferable to have an originating entry and a terminating entry for each write. The originating entry includes information regarding the origination of a write. The terminating entry includes information regarding the termination of a write. For example, as shown in delta map 150, row 160 is an originating entry and row 162 is a terminating entry. Row 160 includes a field 152 for specifying the region of a primary volume wherein the first block was written to; a field 154 for specifying the block offset within that region; a field 156 for specifying where on the secondary volume the duplicate write (i.e. the copy of the primary volume write) begins; and a field 158 for specifying the physical device used to make the write persistent. Row 162 includes a field 164 for specifying the region of the primary volume wherein the last block was written to; a field 166 for specifying the block offset in a region of a primary volume at which the write ends; and a field 168 for specifying where on the secondary volume the duplicate write ends or alternatively, where the next write starts. While field 170 is provided in a terminating entry such as row 162, it is noted that such a field 170 is not necessary since there is no physical device usage associated with termination of a write. Also note that rows 160 and 162 follow the same format in this implementation. In other words, the terminating entry conforms to the same notation as the initiating entry. This is intentional because if a new block were written consecutive to the first block, the initiating entry of the second block would also be the terminating entry for the first block, thus guaranteeing a very compact and space efficient notation.
[0029] In a preferred embodiment, as explained above, each delta map contains a list of all blocks that were changed during the particular time period to which the delta map corresponds. That is, each delta map specifies a block region on the primary volume, the offset on the primary volume, and physical device information. This information can then be used to recreate the primary volume as it looked like at a previous point in time. For example, assume that a volume was brand new and that only the two writes in delta map 150 have been committed to it. The map thus contains a list of all modifications since the volume was in its original state. In order to recreate the volume as it was after these two writes (for example, after a failure of the primary volume), the system examines the first two entries in the delta map. These entries are sufficient to determine that a block of data had been written to region RO on the primary disk at offset 100 and that the length of this write was 20. In addition, fields 156 and 158 can be used to determine where the duplicate copy was written on the secondary volume. This process can then be repeated for each entry and an exact copy of the primary volume at that time can be recreated in this fashion. It is noted that other fields or a completely different mapping format may be used while still achieving the same functionality. For example, instead of dividing the primary volume into block regions, a bitmap could be kept, representing every block on the primary volume.
[0030] Referring now to FIG. 3 , there is shown a hierarchy 200 of delta maps for storing data in a continuous data protection system. Delta maps 202 are initially created from the write log, using a map engine. This could occur in real-time or after a certain number of writes or according to a time interval, etc. Additional delta maps may also be created as a result of a merge process. Such maps are referred to as merged delta maps 204 and 206 and may be created to optimize the access and restore process. The delta maps 202 are stored on the secondary volume and contain a mapping of the primary address space to the secondary address space. The mapping is kept in sorted order based on the primary address space as illustrated in FIG. 2 .
[0031] As explained above, each delta map includes information necessary to recreate the changes to the protected volume for a particular time window. For example, delta map 202t0-t1 corresponds to the change of the protected volume between time zero and time one, delta map 202t1-t2 corresponds to the change of the protected volume from time one to time two, and so forth. It is noted that these time windows do not necessarily need to be of equal size. If a primary volume is completely destroyed at time n+1, a full restore as of time n may be performed by simply using merged delta map 206t0-tn. If a loss occurs at time three, and the primary volume needs to be restored, merged delta map 202t0-0-t3 may be used. If a loss occurs at time five and the system needs to be restored to time four, merged delta map 204t0-t3 and delta map 204t3-t4 may be used.
[0032] As shown in FIG. 3 , the delta maps are chained together in chronological order. In the preferred embodiment, each delta map points to the previous delta map, a merged delta map if it exists, and, in the case of a pre-merged delta map, to the first child delta map. Other embodiments are possible, for example, where both forward and backward pointers are kept or only forward pointers are kept. The protected volume may therefore be restored using any delta map or pre-merged delta map as desired. In FIG. 3 , three levels of pre-merging are implemented. However, it is possible to create a hierarchy of fewer or more levels, as desired.
[0033] Referring now to FIG. 4 , two delta maps 450 and 452 and a merged delta map 454 are shown. In FIG. 4 , four writes 456, 458, 460, 462 have been written to a primary volume 464. Increasing reference numerals are used to denote the point in time at which each write occurred. That is, write 456 was before write 458 and so forth. As can be seen from comparing the primary and secondary volumes 464, 466, each write made to the primary volume 464 is duplicated in sequential fashion to the secondary volume 466. Duplicating the writes in sequential fashion allows the order in which writes occurred on the primary volume to be readily apparent from the layout of the secondary volume. Conversely, the original location is not apparent and needs to be stored in the delta maps, as discussed. This example illustrates the difference between block-order and time-order.
[0034] Delta map 450 includes the originating and terminating entries for writes 456 and 458 while delta map 452 includes originating and terminating entries for writes 460 and 462. In delta map 450, the two top entries are the originating and terminating entries for write 456 and the two bottom entries are the originating and terminating entries for write 458. Similarly, the two top entries in delta map 452 are the originating and terminating entries for write 460 and the two bottom entries are the originating and terminating entries for write 462. As explained above, the delta maps 450 and 452 include the specifics regarding each write that occurred during the time period covered by the particular delta map.
[0035] Delta maps 450 and 452 may be merged into a single merged map 454. One significant benefit of merging delta maps is a reduction in the number of entries that are required. Another, even more significant benefit, is a reduction in the number of blocks that need to be kept on the secondary volume once the lower-level maps are expired. It is noted, however, that this is only the case when a previous block was overwritten by a newer one. For example, in this particular scenario, it is possible to eliminate the terminating entry 468 of write 462 because writes 462 and 458 are adjacent to each other on the primary volume. That is, because there is a terminating entry 468 with the same offset (i.e. 240) as an originating offset 470, the terminating entry 468 may be eliminated in merged delta map 454. By way of further example, if a subsequent write was performed that entirely filled region two (i.e. R2), and the map containing that write was merged with map 454, all of the entries related to R2 would be replaced with the R2 originating and terminating entries for the subsequent write. In this case, it will also be possible to free up the blocks in this region once the delta maps are expired. The delta maps and the structures created by merging maps reduces the amount of overhead in maintaining the mapping between the primary and secondary volumes over time.
[0036] Referring now to FIG. 5 , there is shown a method wherein data is written to a continuous data protection system. In this implementation, the primary and secondary storage are managed by the same software, which could either be a host-based driver/software or a switch/appliance. First, it is determined in step 302 whether the system is writing to a clean region. If yes, the dirty region log is updated in step 304 and the system writes to the primary and secondary volumes in step 306. If no, the method 300 proceeds directly from step 302 to step 306.
[0037] If writing to the primary volume is complete (step 308), the method proceeds to step 310 wherein the status (i.e., an indication that the primary volume write is complete) is sent to the host. It is important to note that a “good” status can be returned without regard to whether the data made it to the secondary volume in this embodiment. This is advantageous for performance reasons. However, a synchronous embodiment is also possible as described above. The method 300 then proceeds to step 312 to check for errors in the primary volume write. If an error has occurred, an additional entry is added to the write log in step 314 reflecting the fact that an error has occurred and then the method 300 proceeds to step 316. If no error has occurred, the method 300 proceeds directly from step 312 to step 316. In step 316, it is confirmed whether writing to the secondary volume is complete. Once the write is completed, the method 300 proceeds to step 318 to check for errors in the secondary volume write. If an error has occurred, an entry reflecting the fact that an error has occurred is added to the write log (step 320).
[0038] By way of further explanation, the sequence of events performed when a host computer performs a write to a primary volume is shown in FIG. 6 . When a host performs a write 350, an entry is added to a write log buffer 352. It is noted that if the write log buffer is full, it is asynchronously flushed. When a write log buffer is flushed, the writes are written out to a secondary volume. That is, duplicated writes may be kept in a buffer and written to the secondary volume whenever the buffer gets full or at another convenient time. Non-volatile RAM can be used to increase this buffer safely.
[0039] If the write is to a clean region, a synchronous update of the dirty region log(DRL) is performed 354. Then, both the primary and secondary writes are started 356, 358. Once the primary write is completed 360, the status is returned to the host 362. If a host-based volume manager is used, this happens independently of the secondary write. If an error occurred in the primary write, it is indicated in the write log by adding an additional entry. Of course, there are two possibilities with respect to the completion of the secondary write (i.e. the duplicate write made to a secondary volume). That is, the secondary write may be completed before 364 or after 366 the completion of the primary write 360. It is noted that whether the secondary write is completed before 364 or after 366 does not affect implementation of the present invention. As with completion of the primary write, if an error occurred in the secondary write, it is indicated in a write log by adding an additional entry to the write log.
[0040] Referring now to FIG. 7 , the data protection system preferably operates according to method 400. The method 400 begins with step 402 wherein an initial full copy snapshot is created. The initial snapshot is the first snapshot taken of the data existing on the primary volume.
[0041] By way of explanation, assuming the present invention is implemented to protect a system that is currently in production. Such a system already contains important data on the primary volume at time t0. Hence, if the system starts recording the changes from this point on, the volume cannot be reconstructed at a later time unless there is a copy of the volume as it was at time t0. The initial full copy does exactly this—it initializes the secondary volume to a state where the contents of each block at time t0 are known. It is noted that in the special case when the primary volume is empty or will be formatted anyway, users have the option to disable the initial full copy. This means, however, that if they want to restore the volume back to time t0, an empty volume will be presented. To provide further explanation, assume that the primary volume already contains important data. In that case, if blocks 5, 9, and 57 are overwritten at times t1, t2, and t3 respectively, it is not possible to present a complete volume image as it was at time t2. This is because it is not known what blocks 1, 2, 3, 4, 6, 7, 8, 10, 11, etc. looked like at that time without having taken a full copy snapshot first.
[0042] Referring again to FIG. 7 , the initial snapshot establishes time zero for the secondary volume, as explained above. Once the state of the primary volume at time zero is established, each write to the primary volume is split and duplicated to the secondary volume (step 404). In step 406, it is determined whether a snapshot is triggered. If so, a marker is inserted into the secondary volume write log in step 408 and then the method proceeds to step 410. A snapshot in this context is simply a point in time to which the system can recover to at a later time. Delta maps are kept for that point in time until the snapshot expires. Note that because all data has already been stored in the write log, no data movement is necessary to take a snapshot. If no snapshot is taken, the method 400 proceeds directly to step 410.
[0043] In step 410, a delta map is created by converting the time-ordered write log entries to a block-ordered delta map. Next, in step 412, it is determined whether pre-merge optimization will be performed. If so, delta maps are periodically merged to provide a greater granularity in the data on the secondary volume. It is noted that merging of delta maps can occur at any time and according to any desired policy. In the preferred embodiment, the merging algorithm looks for adjacent delta maps with the same expiration policy and merges those. This minimizes the number of merge operations that will be required upon expiration. In a different embodiment, pre-merging occurs automatically after a certain number of writes W or after a certain time period T. Additionally, the system is capable of storing full maps of the primary volume at various points in time. This significantly accelerates the merging process later because fewer maps need to be merged. Regardless of whether pre-merge optimization is performed, the method 400 cycles back to step 404.
[0044] Although the present invention has been described in detail, it is to be understood that the invention is not limited thereto, and that various changes can be made therein without departing from the spirit and scope of the invention, which is defined by the attached claims.
Claims
What is claimed is:
1. A method comprising:
writing data from a host computer to a primary volume;
writing a copy of the data, from the host computer via a data protection system, to a secondary volume in consecutive physical locations, so that the secondary volume includes the data written to the primary volume; and
mapping each write made to the secondary volume in a data structure which tracks changes on the primary volume between two different points in time.
2. The method according to claim 1, wherein the data structure corresponds to a particular time period and includes a list of all blocks on the primary volume that have changed between the two different points in time.
3. The method according to claim 2, wherein the data structure is used to locate a recovery point for the primary volume, the recovery point corresponding to a time period covered by the data structure.
4. The method according to claim 1, wherein the data structure includes a block-based list of the data written to the primary volume.
5. The method according to claim 4, wherein the data structure includes a region of the primary volume where a write is made, a block offset within the region of the primary volume where the write is made, and a location on the secondary volume where the write begins.
6. The method according to claim 1, wherein multiple data structures are used, each data structure corresponding to a particular time period and including all writes made to the primary volume during the time period, the multiple data structures permitting a larger time period to be protected than a single data structure.
7. The method according to claim 6, wherein the multiple data structures are merged into a single merged data structure, so that the multiple time periods protected by the multiple data structures are protected by the single merged data structure.
8. The method according to claim 1, wherein the data structure can be used to selectively play back a portion of the writes made to the primary volume during the two points in time that correspond to the data structure.
9. A computer-readable storage medium storing a set of instructions for execution by a general purpose computer to track changes on a primary volume, the set of instructions comprising:
a first writing code segment for writing data from a host computer to the primary volume;
a second writing code segment for writing a copy of the data, from the host computer via a data protection system, to a secondary volume in consecutive physical locations, so that the secondary volume includes the data written to the primary volume; and
a mapping code segment for mapping each write made to the secondary volume in a data structure which tracks changes on the primary volume between two different points in time.
10. The computer-readable storage medium according to claim 9, wherein multiple data structures are used, each data structure corresponding to a particular time period and including all writes made to the primary volume during the time period, the multiple data structures permitting a larger time period to be protected than a single data structure, the set of instructions further comprising:
a merging code segment for merging multiple data structures into a single merged data structure, whereby the multiple time periods protected by the multiple data structures are protected by the single merged data structure.
11. A system comprising:
a data protection system coupled to a host computer for protecting data written from the host computer, wherein the data includes a plurality of blocks;
a primary volume configured to write the data from the host computer;
a secondary volume configured to write a copy of the data from the host computer, via the data protection system, so that the plurality of blocks are in consecutive physical locations, wherein the data protection system is configured to map writes made to the secondary volume in a data structure which tracks changes made on the primary volume between two different points in time.
12. The system according to claim 11, wherein the data structure corresponds to a particular time period and includes a list of all blocks on the primary volume that have changed between the two different points in time.
13. The system according to claim 11, wherein the data structure is used to locate a recovery point for the primary volume, the recovery point corresponding to a time period covered by the data structure.
14. The system according to claim 11, wherein the data structure includes a block-based list of the data written to the primary volume.
15. The system according to claim 14, wherein the data structure includes a region of the primary volume where a write is made, a block offset within the region of the primary volume where the write is made, and a location on the secondary volume where the write begins.
16. The system according to claim 11, wherein multiple data structures are used, each data structure corresponding to a particular time period and including all writes made to the primary volume during the time period, the multiple data structures permitting a larger time period to be protected than a single data structure.
17. The system according to claim 16, wherein the multiple data structures can be merged into a single merged data structure, so that the multiple time periods protected by the multiple data structures are protected by the single merged data structure.
18. The system according to claim 11, wherein the data structure can be used to selectively play back a portion of the writes made to the primary volume during the two points in time that correspond to the data structure.
Patent Citations (214)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4625308(A) | 1986-11-01 | Kim et al. | Applicant |
| US4635145(A) | 1987-01-01 | Horie et al. | Applicant |
| US4727512(A) | 1988-02-01 | Birkner et al. | Applicant |
| US4775969(A) | 1988-10-01 | Osterlund | Applicant |
| US5163148(A) | 1992-11-01 | Walls | Applicant |
| US5235695(A) | 1993-08-01 | Pence | Applicant |
| US5269022(A) | 1993-12-01 | Shinjo et al. | Applicant |
| US5297124(A) | 1994-03-01 | Plotkin et al. | Applicant |
| US5408470(A) | 1995-04-01 | Rothrock et al. | Applicant |
| US5438674(A) | 1995-08-01 | Keele et al. | Applicant |
| US5455926(A) | 1995-10-01 | Keele et al. | Applicant |
| US5485321(A) | 1996-01-01 | Leonhardt et al. | Applicant |
| US5555371(A) | 1996-09-01 | Duyanovich et al. | Applicant |
| US5638509(A) | 1997-06-01 | Dunphy et al. | Applicant |
| US5666538(A) | 1997-09-01 | DeNicola | Applicant |
| US5673382(A) | 1997-09-01 | Cannon et al. | Examiner |
| US5701502(A) | 1997-12-01 | Baker et al. | Applicant |
| US5774292(A) | 1998-06-01 | Georgiou et al. | Applicant |
| US5774643(A) | 1998-06-01 | Lubbers et al. | Applicant |
| US5774715(A) | 1998-06-01 | Madany et al. | Applicant |
| US5805864(A) | 1998-09-01 | Carlson et al. | Applicant |
| US5809511(A) | 1998-09-01 | Peake | Applicant |
| US5809543(A) | 1998-09-01 | Byers et al. | Applicant |
| US5835953(A) | 1998-11-01 | Ohran | Applicant |
| US5854720(A) | 1998-12-01 | Shrinkle et al. | Applicant |
| US5857208(A) | 1999-01-01 | Ofek | Applicant |
| US5864346(A) | 1999-01-01 | Yokoi et al. | Applicant |
| US5872669(A) | 1999-02-01 | Morehouse et al. | Applicant |
| US5875479(A) | 1999-02-01 | Blount et al. | Applicant |
| US5911779(A) | 1999-06-01 | Stallmo et al. | Applicant |
| US5949970(A) | 1999-09-01 | Sipple et al. | Applicant |
| US5961613(A) | 1999-10-01 | DeNicola | Applicant |
| US5963971(A) | 1999-10-01 | Fosler et al. | Applicant |
| US5974424(A) | 1999-10-01 | Schmuck et al. | Applicant |
| US6021408(A) | 2000-02-01 | Ledain et al. | Applicant |
| US6023709(A) | 2000-02-01 | Anglin et al. | Applicant |
| US6029179(A) | 2000-02-01 | Kishi | Applicant |
| US6041329(A) | 2000-03-01 | Kishi | Applicant |
| US6044442(A) | 2000-03-01 | Jesionowski | Applicant |
| US6049848(A) | 2000-04-01 | Yates et al. | Applicant |
| US6061309(A) | 2000-05-01 | Gallo et al. | Applicant |
| US6067587(A) | 2000-05-01 | Miller et al. | Applicant |
| US6070224(A) | 2000-05-01 | LeCrone et al. | Applicant |
| US6098148(A) | 2000-08-01 | Carlson | Applicant |
| US6128698(A) | 2000-10-01 | Georgis | Applicant |
| US6131142(A) | 2000-10-01 | Kamo et al. | Applicant |
| US6131148(A) | 2000-10-01 | West et al. | Applicant |
| US6134660(A) | 2000-10-01 | Boneh et al. | Applicant |
| US6163856(A) | 2000-12-01 | Dion et al. | Applicant |
| US6173293(B1) | 2001-01-01 | Thekkath et al. | Applicant |
| US6173359(B1) | 2001-01-01 | Carlson et al. | Applicant |
| US6195730(B1) | 2001-02-01 | West | Applicant |
| US6225709(B1) | 2001-05-01 | Nakajima | Applicant |
| US6247096(B1) | 2001-06-01 | Fisher et al. | Applicant |
| US6260110(B1) | 2001-07-01 | LeCrone et al. | Applicant |
| US6266784(B1) | 2001-07-01 | Hsiao et al. | Examiner |
| US6269423(B1) | 2001-07-01 | Kishi | Applicant |
| US6269431(B1) | 2001-07-01 | Dunham | Applicant |
| US6282609(B1) | 2001-08-01 | Carlson | Applicant |
| US6289425(B1) | 2001-09-01 | Blendermann et al. | Applicant |
| US6292889(B1) | 2001-09-01 | Fitzgerald et al. | Applicant |
| US6301677(B1) | 2001-10-01 | Squibb | Applicant |
| US6304880(B1) | 2001-10-01 | Kishi | Applicant |
| US6317814(B1) | 2001-11-01 | Blendermann et al. | Applicant |
| US6324497(B1) | 2001-11-01 | Yates et al. | Applicant |
| US6327418(B1) | 2001-12-01 | Barton | Applicant |
| US6336163(B1) | 2002-01-01 | Brewer et al. | Applicant |
| US6336173(B1) | 2002-01-01 | Day et al. | Applicant |
| US6339778(B1) | 2002-01-01 | Kishi | Applicant |
| US6341329(B1) | 2002-01-01 | LeCrone et al. | Applicant |
| US6343342(B1) | 2002-01-01 | Carlson | Applicant |
| US6353837(B1) | 2002-03-01 | Blumenau | Applicant |
| US6360232(B1) | 2002-03-01 | Brewer et al. | Applicant |
| US6389503(B1) | 2002-05-01 | Georgis et al. | Applicant |
| US6397307(B2) | 2002-05-01 | Ohran | Applicant |
| US6408359(B1) | 2002-06-01 | Ito et al. | Applicant |
| US6487561(B1) | 2002-11-01 | Ofek et al. | Applicant |
| US6496791(B1) | 2002-12-01 | Yates et al. | Applicant |
| US6499026(B1) | 2002-12-01 | Rivette et al. | Applicant |
| US6557073(B1) | 2003-04-01 | Fujiwara | Applicant |
| US6557089(B1) | 2003-04-01 | Reed et al. | Applicant |
| US6578120(B1) | 2003-06-01 | Crockett et al. | Applicant |
| US6615365(B1) | 2003-09-01 | Jenevein et al. | Applicant |
| US6625704(B2) | 2003-09-01 | Winokur | Applicant |
| US6654912(B1) | 2003-11-01 | Viswanathan et al. | Applicant |
| US6658435(B1) | 2003-12-01 | McCall | Applicant |
| US6694447(B1) | 2004-02-01 | Leach et al. | Applicant |
| US6725331(B1) | 2004-04-01 | Kedem | Applicant |
| US6766520(B1) | 2004-07-01 | Rieschl et al. | Applicant |
| US6779057(B2) | 2004-08-01 | Masters et al. | Applicant |
| US6779058(B2) | 2004-08-01 | Kishi et al. | Applicant |
| US6779081(B2) | 2004-08-01 | Arakawa et al. | Applicant |
| US6816941(B1) | 2004-11-01 | Carlson et al. | Applicant |
| US6816942(B2) | 2004-11-01 | Okada et al. | Applicant |
| US6834324(B1) | 2004-12-01 | Wood | Applicant |
| US6850964(B1) | 2005-02-01 | Brough et al. | Applicant |
| US6877016(B1) | 2005-04-01 | Hart et al. | Applicant |
| US6898600(B2) | 2005-05-01 | Fruchtman et al. | Applicant |
| US6915397(B2) | 2005-07-01 | Lubbers et al. | Applicant |
| US6931557(B2) | 2005-08-01 | Togawa | Applicant |
| US6950263(B2) | 2005-09-01 | Suzuki et al. | Applicant |
| US6973369(B2) | 2005-12-01 | Trimmer et al. | Applicant |
| US6973534(B2) | 2005-12-01 | Dawson | Applicant |
| US6978283(B1) | 2005-12-01 | Edwards et al. | Applicant |
| US6978325(B2) | 2005-12-01 | Gibble | Applicant |
| US7007043(B2) | 2006-02-01 | Farmer et al. | Applicant |
| US7020779(B1) | 2006-03-01 | Sutherland | Applicant |
| US7032126(B2) | 2006-04-01 | Zalewski et al. | Examiner |
| US7055009(B2) | 2006-05-01 | Factor et al. | Applicant |
| US7072910(B2) | 2006-07-01 | Kahn et al. | Applicant |
| US7096331(B1) | 2006-08-01 | Haase et al. | Applicant |
| US7100089(B1) | 2006-08-01 | Phelps | Applicant |
| US7111136(B2) | 2006-09-01 | Yamagami | Applicant |
| US7111194(B1) | 2006-09-01 | Schoenthal et al. | Applicant |
| US7127388(B2) | 2006-10-01 | Yates et al. | Applicant |
| US7127577(B2) | 2006-10-01 | Koning et al. | Applicant |
| US7152077(B2) | 2006-12-01 | Veitch et al. | Applicant |
| US7152078(B2) | 2006-12-01 | Yamagami | Applicant |
| US7155465(B2) | 2006-12-01 | Lee et al. | Applicant |
| US7155586(B1) | 2006-12-01 | Wagner et al. | Examiner |
| US7200726(B1) | 2007-04-01 | Gole et al. | Applicant |
| US7203726(B2) | 2007-04-01 | Hasegawa et al. | Applicant |
| US7251713(B1) | 2007-07-01 | Zhang | Applicant |
| US7315965(B2) | 2008-01-01 | Stager et al. | Examiner |
| US7325159(B2) | 2008-01-01 | Stager et al. | Applicant |
| US7346623(B2) | 2008-03-01 | Prahlad et al. | Applicant |
| US7406488(B2) | 2008-07-01 | Stager et al. | Applicant |
| US7426617(B2) | 2008-09-01 | Stager et al. | Applicant |
| US7490103(B2) | 2009-02-01 | Stager et al. | Applicant |
| US2001/0047447(A1) | 2001-11-01 | Katsuda | Applicant |
| US2002/0004835(A1) | 2002-01-01 | Yarbrough | Applicant |
| US2002/0016827(A1) | 2002-02-01 | McCabe et al. | Applicant |
| US2002/0026595(A1) | 2002-02-01 | Saitou et al. | Applicant |
| US2002/0091670(A1) | 2002-07-01 | Hitz et al. | Applicant |
| US2002/0095557(A1) | 2002-07-01 | Constable et al. | Applicant |
| US2002/0144057(A1) | 2002-10-01 | Li et al. | Applicant |
| US2002/0163760(A1) | 2002-11-01 | Lindsey et al. | Applicant |
| US2002/0166079(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0199129(A1) | 2002-12-01 | Bohrer et al. | Applicant |
| US2003/0004980(A1) | 2003-01-01 | Kishi et al. | Applicant |
| US2003/0005313(A1) | 2003-01-01 | Gammel et al. | Applicant |
| US2003/0037211(A1) | 2003-02-01 | Winokur | Applicant |
| US2003/0046260(A1) | 2003-03-01 | Satyanarayanan et al. | Applicant |
| US2003/0120476(A1) | 2003-06-01 | Yates et al. | Applicant |
| US2003/0120676(A1) | 2003-06-01 | Holavanahalli et al. | Applicant |
| US2003/0126136(A1) | 2003-07-01 | Omoigui | Applicant |
| US2003/0126388(A1) | 2003-07-01 | Yamagami | Applicant |
| US2003/0135672(A1) | 2003-07-01 | Yip et al. | Applicant |
| US2003/0149700(A1) | 2003-08-01 | Bolt | Applicant |
| US2003/0158766(A1) | 2003-08-01 | Mital et al. | Applicant |
| US2003/0182301(A1) | 2003-09-01 | Patterson et al. | Applicant |
| US2003/0182350(A1) | 2003-09-01 | Dewey | Applicant |
| US2003/0188208(A1) | 2003-10-01 | Fung | Applicant |
| US2003/0217077(A1) | 2003-11-01 | Schwartz et al. | Applicant |
| US2003/0225800(A1) | 2003-12-01 | Kavuri | Applicant |
| US2004/0015731(A1) | 2004-01-01 | Chu et al. | Applicant |
| US2004/0098244(A1) | 2004-05-01 | Dailey et al. | Applicant |
| US2004/0103147(A1) | 2004-05-01 | Flesher et al. | Applicant |
| US2004/0158766(A1) | 2004-08-01 | Liccione et al. | Applicant |
| US2004/0167903(A1) | 2004-08-01 | Margolus et al. | Applicant |
| US2004/0168034(A1) | 2004-08-01 | Homma et al. | Applicant |
| US2004/0168057(A1) | 2004-08-01 | Margolus et al. | Applicant |
| US2004/0181388(A1) | 2004-09-01 | Yip et al. | Applicant |
| US2004/0181707(A1) | 2004-09-01 | Fujibayashi | Examiner |
| US2004/0267836(A1) | 2004-12-01 | Armangau et al. | Applicant |
| US2005/0010529(A1) | 2005-01-01 | Zalewski et al. | Examiner |
| US2005/0044162(A1) | 2005-02-01 | Liang et al. | Applicant |
| US2005/0063374(A1) | 2005-03-01 | Rowan et al. | Applicant |
| US2005/0065962(A1) | 2005-03-01 | Rowan et al. | Applicant |
| US2005/0066118(A1) | 2005-03-01 | Perry et al. | Applicant |
| US2005/0066222(A1) | 2005-03-01 | Rowan et al. | Applicant |
| US2005/0066225(A1) | 2005-03-01 | Rowan et al. | Applicant |
| US2005/0076070(A1) | 2005-04-01 | Mikami | Applicant |
| US2005/0076261(A1) | 2005-04-01 | Rowan et al. | Applicant |
| US2005/0076262(A1) | 2005-04-01 | Rowan et al. | Applicant |
| US2005/0076264(A1) | 2005-04-01 | Rowan et al. | Applicant |
| US2005/0097260(A1) | 2005-05-01 | McGovern et al. | Applicant |
| US2005/0108302(A1) | 2005-05-01 | Rand et al. | Applicant |
| US2005/0144407(A1) | 2005-06-01 | Colgrove et al. | Applicant |
| US2005/0182910(A1) | 2005-08-01 | Stager et al. | Applicant |
| US2005/0240813(A1) | 2005-10-01 | Okada et al. | Applicant |
| US2006/0005074(A1) | 2006-01-01 | Yanai et al. | Applicant |
| US2006/0010177(A1) | 2006-01-01 | Kodama | Applicant |
| US2006/0047895(A1) | 2006-03-01 | Rowan et al. | Applicant |
| US2006/0047902(A1) | 2006-03-01 | Passerini | Applicant |
| US2006/0047903(A1) | 2006-03-01 | Passerini | Applicant |
| US2006/0047905(A1) | 2006-03-01 | Matze et al. | Applicant |
| US2006/0047925(A1) | 2006-03-01 | Perry | Applicant |
| US2006/0047989(A1) | 2006-03-01 | Delgado et al. | Applicant |
| US2006/0047998(A1) | 2006-03-01 | Darcy | Applicant |
| US2006/0047999(A1) | 2006-03-01 | Passerini et al. | Applicant |
| US2006/0143376(A1) | 2006-06-01 | Matze et al. | Applicant |
| US2006/0235907(A1) | 2006-10-01 | Kathuria et al. | Applicant |
| US2006/0259160(A1) | 2006-11-01 | Hood et al. | Applicant |
| CA2256934(A1) | 2000-06-01 | Applicant | |
| EP845733(A2) | 1998-06-01 | Applicant | |
| EP869460(A2) | 1998-10-01 | Applicant | |
| EP1058254(A2) | 2000-12-01 | Applicant | |
| EP1122910(A1) | 2001-08-01 | Applicant | |
| EP1233414(A2) | 2002-08-01 | Applicant | |
| EP1333379 | 2006-04-01 | Applicant | |
| EP1671231 | 2006-06-01 | Applicant | |
| WO99/03098 | 1999-01-01 | Applicant | |
| WO99/06912 | 1999-02-01 | Applicant | |
| WO-0118633(A1) | 2001-03-01 | Applicant | |
| WO-03067438(A2) | 2003-08-01 | Applicant | |
| WO-2004084010(A2) | 2004-09-01 | Applicant | |
| WO2005/031576 | 2005-04-01 | Applicant | |
| WO2006/023990 | 2006-03-01 | Applicant | |
| WO2006/023991 | 2006-03-01 | Applicant | |
| WO2006/023992 | 2006-03-01 | Applicant | |
| WO2006/023993 | 2006-03-01 | Applicant | |
| WO2006/023994 | 2006-03-01 | Applicant | |
| WO2006/023995 | 2006-03-01 | Applicant |
Non-Patent Literature (89)
- “Alacritus Announces Disk-Based Successor to Tape” Knapp Comm., Aug. 21, 2002.Applicant
- “Alacritus Software and Rhapsody Networks to Develop Breakthrough Backup Solutions for Storage Networks: Companies to Provide First Network-Intelligent Virtual Tape Solution Resulting in Dramatic ROI, Increases in Data Backup Performance and Scalability” Alacritus Software, Jul. 8, 2002.Applicant
- “Alacritus Software Announces Securitus I, The Industry's First Virtual Tape Library Solution: Securitus I Heralds Advent of ‘Disruptive Technology’ that Serves as Replacement to Tape Libraries” Alacritus Software, Inc., Jun. 25, 2001.Applicant
- “Alacritus Software Announces Securitus I, the Industry's First Virtual Tape Library Solution: Securitus I Heralds Advent of ‘Disruptive Technology’ that Serves as Replacement to Tape Libraries” Alacritus Software, Inc., Apr. 9, 2002.Applicant
- “Alacritus Software Announces Virtual Tape Library Support for Legato NetWorker Data Protection Solution” Alacritus Software, Inc., Jan. 8, 2002.Applicant
- “Alacritus Software FAQs” Alacritus Software, Inc., Jul. 2001.Applicant
- “Alacritus Software's Chronospan: Make Time for Continuous Data Protection” Aberdeen Group, Inc., Oct. 2003.Applicant
- “Alacritus Software's Securitus I: Pointing the Way to Virtual Tape Libraries” Aberdeen Group, Inc., Mar. 2002.Applicant
- “Alacritus Software's Securitus: Defining the Way to Virtual Tape Libraries” Aberdeen Group, Inc., Jul. 2003.Applicant
- “Alacritus, Hitachi CP and Nissho Team to Create Virtual Tape Library Appliance: Industry's First Virtual Tape Library Appliance to Replace Storage Tape Libraries” Alacritus Software, Inc., Jun. 25, 2001.Applicant
- “Alacritus, Hitachi CP and Nissho Team to Create Virtual Tape Library” internetnews.com, Jun. 25, 2001.Applicant
- “Chronospan” Alacritus Website, Oct. 2003.Applicant
- “Continuous Data Protection: Business Continuity for the Era of Networked Storage: An Executive White Paper” Aberdeen Group, Inc., Jul. 2003.Applicant
- “Customer Success” Alacritus Website, Oct. 2003.Applicant
- “Disk-Based Data Protection” Alacritus Software, Inc., Jul. 2001.Applicant
- “Disk-Based Data Protection” Alacritus Software, Inc., Sep. 2001.Applicant
- “Disk-Based Data Protection” Alacritus Software, Inc., Sep. 2002.Applicant
- “Hitachi CP, Nissho, and Alacritus Software Bring Virtual Tape Library Appliance Solution to Market: Three Companies Join to Deliver VTLA Smart Guard—A Disk Subsystem Product that Functions as a Virtual Storage Tape Library” Alacritus Software, Inc., Oct. 3, 2001.Applicant
- “Manageability: Securitus v. Tape” Alacritus Website, Oct. 2003.Applicant
- “No Changes Required: Securitus v. Tape” Alacritus Website, Oct. 2003.Applicant
- “Product Brief: Rhapsody/Alacritus-Secritus/XPath Virtual Tape in the Fabric” The Enterprise Storage Group, Aug. 2002.Applicant
- “Scalability: Securitus v. Tape” Alacritus Website, Oct. 2003.Applicant
- “Seamless Integration” Alacritus Website, Oct. 2003.Applicant
- “Securitus I White Paper: Disk Based Data Protection from Alacritus Software” Alacritus Software, Inc., Jul. 2001.Applicant
- “Securitus White Paper: Disk Based Data Protection from Alacritus Software” Alacritus Website, Oct. 2003.Applicant
- “Securitus” Alacritus Website, Oct. 2003.Applicant
- “Strengths: Securitus v. Tape ” Alacritus Website, Oct. 2003.Applicant
- “Testimonials” Alacritus Website, Oct. 2003.Applicant
- “The SNIA Data Management Forum Created to Tackle Data Protection and Information Lifecycle Management Issues: Enhanced Backup Solutions Initiative Rolls Efforts into New SNIA Forum” Storage Networking Industry Association, Oct. 13, 2003.Applicant
- “Topologies” Alacritus Website, Oct. 7, 2003.Applicant
- “Virtual Tape Library Technology Brochure” Alacritus Software, Inc., Jul. 2001.Applicant
- Baltazar, Henry “More Intelligence is on the Way” eWEEK, Sep. 15, 2003.Applicant
- Baltazar, Henry “Weaving Apps Into SAN Fabric” eWEEK, Mar. 24, 2003.Applicant
- Barrett, Alex “The Case for Network Smarts” Storage Magazine, Jun. 2003.Applicant
- Biggar, Heidi, “Alacritus Enables Disk-Based Backup” InfoStor, Sep. 2001.Applicant
- Biggar, Heidi, “Disk and Tape Forge New Partnership in Backup Arena” InfoStor, Nov. 2001.Applicant
- Camphuisen, Alicia, “Hitachi Inks OEM Deal with Legato” Knapp Comm., Jul. 17, 2002.Applicant
- Centered Systems, “Second Copy 7”, (1991-2007).Applicant
- Hill, David “Alacritus Software's Securitus: Defining the Way to Virtual Tape Libraries” Aberdeen Group, Inc., Jul. 2003.Applicant
- Komiega, Kevin, “Vendor Pushes Disk Backup Over Tape” SearchStorage.com Jan. 10, 2003.Applicant
- Payack, Paul JJ, °Alacritus Lines Up OEM Partners for Virtual Tape Library Push° The (451) Storage & Systems, Oct. 4, 2002.Applicant
- Payack, Paul JJ, “Alacritus Software Announces Continuous Data Protection with New Chronospan Technology” Oct. 28, 2003.Applicant
- Payack, Paul JJ, “Alacritus Software Announces New Customers for Securitus VTLA” Alacritus Software, Jan. 13, 2004.Applicant
- Preston, W. Curtis, “Surprise! Cheap Disks Cure Slow Backup” Storage Magazine, Jun. 1, 2002.Applicant
- Trimmer, Don, “Tape Free Backup/Recovery: Requirements and Advantages: Virtualization Technology Will Encompass Many Applications, One of the Most Significant Possibly Being Backup/Recovery” InfoStor, Mar. 2002.Applicant
- “Strengths: Securitus v. Tape” Alacritus Website, Oct. 2003.Applicant
- Joan Daemen at al., “AES Proposal: Rijndael”, The Rijndael Block Cipher, Document Version 2. Mar. 1999, 45 pages.Applicant
- Joan Daemen at al., “Note on Naming”. Rijndael. Sep. 4, 2003, 2 pages.Applicant
- Decru, “Decru Datafort E-Series Storage Security Appliances, Transparent Data Security for Network Attached Storage (NAS)”, 2004, 2 pages.Applicant
- Simon L. Garfinkel at al., “Rememberance of Data Passed: A Study of Disk Sanitization Practices”. IEEE Security and Privacy. vol. 1, No. 1, 2003 19 pages.Applicant
- Hatfield. “Write Read Verify Feature Set”. May 14, 2004.Applicant
- Chris Lueth, “WORM Storage on Magnetic Disks Using SnapLock Compliance™ and SnapLock Enterprise™”, Network Applicance, Inc., Sep. 2003, sections 1-5 13 pages.Applicant
- “Network Appliance WORM Storage Solution: SEC 17 a-4(f) Compliance Assessment”, Network Appliance, Inc., Jul. 10, 2003. pp. 1-20.Applicant
- Novell NetWare Server Disks and Storage Devices Administration Guide. Netware 5.1, Jan. 2000, pp. 1-60.Applicant
- Co-pending U.S. Appl. No. 10/772,017, filed Feb. 4, 2004.Applicant
- Co-pending U.S. Appl. No. 10/771,613, filed Feb. 4, 2004.Applicant
- Co-pending U.S. Appl. No. 10/772,642, filed Feb. 5, 2004.Applicant
- Co-pending U.S. Appl. No. 10/772,643, filed Feb. 5, 2004.Applicant
- Co-pending U.S. Appl. No. 11/051,793, filed Feb. 4, 2004.Applicant
- Co-pending U.S. Appl. No. 11/413,327, filed Apr. 28, 2006.Applicant
- “Alacritus Creates ‘Next Critical Step’ in Disaster Recovery for Patrick Air Force Base, Securitus VTL Sets the Pace”, Apr. 20, 2004.Applicant
- “Alacritus to Demo Chronospan Continuous Data Protection with the Cisco MDS 9000”, Apr. 1, 2004.Applicant
- “Alacritus and Network Appliance Deliver Advanced Virtual Tape Library, Solution Shortens Backup Windows, Accelerates Data Recovery, and Simplifies Backup Management”, Dec. 7, 2004.Applicant
- “Cisco and Storage ISVs to Demo Protocol-Based Interface between Storage Appliances and the Cisco MDS 9000”, Mar. 30, 2004.Applicant
- “Case Study Shizuoka-ken Noukyou Densan Center K.K., Reducing Management Costs Through Tapeless Backup at an iDC”, Apr. 7, 2004.Applicant
- “Alacritus to Demonstrate Chronospan CDP with the Brocade Fabric Application Platform at Storage Networking World”, Apr. 1, 2004.Applicant
- Non-Final Office Action Mailed Jul. 13, 2006 in Co-Pending U.S. Appl. No. 10/772,017, filed Feb. 4, 2004.Applicant
- Final Office Action Mailed Jan. 11, 2007 in Co-Pending U.S. Appl. No. 10/772,017, filed Feb. 4, 2004.Applicant
- Notice of Allowance Mailed Jun. 6, 2007 and Sep. 20, 2007 in Co-Pending U.S. Appl. No. 10/772,017, filed Feb. 4, 2004.Applicant
- Non-Final Office Action Mailed Jul. 14, 2006 in Co-pending U.S. Appl. No. 10/771,613, filed Feb. 4, 2004.Applicant
- Final Office Action Mailed Jan. 11, 2007 in Co-pending U.S. Appl. No. 10/771,613, filed Feb. 4, 2004.Applicant
- Notice of Allowance Mailed Jun. 14, 2007 and Sep. 28, 2007 in Co-pending U.S. Appl. No. 10/771,613, filed Feb. 4, 2004.Applicant
- Non-Final Office Action Mailed Dec. 28, 2006 in Co-pending U.S. Appl. No. 10/772,642, filed Feb. 5, 2004.Applicant
- Final Office Action Mailed Jul. 12, 2007 in Co-pending U.S. Appl. No. 10/772,642, filed Feb. 5, 2004.Applicant
- Notice of Allowance Mailed Nov. 1, 2007 in Co-pending U.S. Appl. No. 10/772,642, filed Feb. 5, 2004.Applicant
- Non-Final Office Action Mailed Jul. 26, 2006 in Co-pending U.S. Appl. No. 10/772,643, filed Feb. 5, 2004.Applicant
- Final Office Action Mailed Jan. 24, 2007 in Co-pending U.S. Appl. No. 10/772,643, filed Feb. 5, 2004.Applicant
- Non-Final Office Action Mailed Jul. 12, 2007 in Co-pending U.S. Appl. No. 10/772,643, filed Feb. 5, 2004.Applicant
- Notice of Allowance Mailed Feb. 21, 2008 in Co-pending U.S. Appl. No. 10/772,643, filed Feb. 5, 2004.Applicant
- Non-Final Office Action Mailed Aug. 24, 2007 in Co-pending U.S. Appl. No. 11/051,793, filed Feb. 4, 2004.Applicant
- Final Office Action Mailed Apr. 24, 2008 in Co-pending U.S. Appl. No. 11/051,793, filed Feb. 4, 2004.Applicant
- Non-Final Office Action Mailed Aug. 15, 2008 in Co-pending U.S. Appl. No. 11/051,793, filed Feb. 4, 2004.Applicant
- Notice of Allowance Mailed Dec. 11, 2008 in Co-pending U.S. Appl. No. 11/051,793 filed Feb. 4, 2004.Applicant
- Non-Final Office Action Mailed Mar. 21, 2008 in Co-pending U.S. Appl. No. 11/413,327, filed Apr. 28, 2006.Applicant
- Final Office Action Mailed Sep. 3, 2008 in Co-pending U.S. Appl. No. 11/413,327, filed Apr. 28, 2006.Applicant
- Non-Final Office Action Mailed Jan. 29, 2009 in Co-pending U.S. Appl. No. 11/413,327, filed Apr. 28, 2006.Applicant
- Final Office Action Mailed Jun. 30, 2009 in Co-pending U.S. Appl. No. 11/413,327, filed Apr. 28, 2006.Applicant
- Non-Final Office Action Mailed Dec. 31, 2009 in Co-pending U.S. Appl. No. 11/413,327, filed Apr. 28, 2006.Applicant
- Notice of Allowance Mailed May 6, 2010 in Co-pending U.S. Appl. No. 11/413,327, filed Apr. 28, 2006.Applicant