Restoring active areas of a logical unit

Information

  • Patent Grant
  • 10324798
  • Patent Number
    10,324,798
  • Date Filed
    Thursday, September 25, 2014
    9 years ago
  • Date Issued
    Tuesday, June 18, 2019
    5 years ago
Abstract
In one aspect, a method includes reading metadata for a logical unit (LU) to restore, restoring active read areas to the LU identified in the metadata and exposing the LU to a host after restoring the active read areas of the LU. In another aspect, an apparatus includes electronic hardware circuitry configured to reading metadata for a LU to restore, restoring active read areas to the LU identified in the metadata and exposing the LU to a host after restoring the active read areas of the LU. In a further aspect, an article includes a non-transitory computer-readable medium that stores computer-executable instructions. The instructions cause a machine to read metadata for a LU to restore, restore active read areas to the LU identified in the metadata and expose the LU to a host after restoring the active read areas of the LU.
Description
BACKGROUND

Computer data is vital to today's organizations and a significant part of protection against disasters is focused on data protection. As solid-state memory has advanced to the point where cost of memory has become a relatively insignificant factor, organizations can afford to operate with systems that store and process terabytes of data.


Conventional data protection systems include tape backup drives, for storing organizational production site data on a periodic basis. Another conventional data protection system uses data replication, by generating a copy of production site data of an organization on a secondary backup storage system, and updating the backup with changes. The backup storage system may be situated in the same physical location as the production storage system, or in a physically remote location. Data replication systems generally operate either at the application level, at the file system level, or at the data block level.


SUMMARY

In one aspect, a method includes reading metadata for a logical unit to restore, restoring active read areas to the logical unit identified in the metadata and exposing the logical unit to a host after restoring the active read areas of the logical unit. In another aspect, an apparatus includes electronic hardware circuitry configured to reading metadata for a logical unit to restore, restoring active read areas to the logical unit identified in the metadata and exposing the logical unit to a host after restoring the active read areas of the logical unit. In a further aspect, an article includes a non-transitory computer-readable medium that stores computer-executable instructions. The instructions cause a machine to read metadata for a logical unit to restore, restore active read areas to the logical unit identified in the metadata and expose the logical unit to a host after restoring the active read areas of the logical unit.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of an example of a data protection system.



FIG. 2 is an illustration of an example of a journal history of write transactions for a storage system.



FIG. 3 is a block diagram of an example of a system to initialize a backup snapshot.



FIG. 4 is a flowchart of an example of a process to initialize a backup snapshot.



FIG. 5 is a block diagram of an example of a system to initialize a backup snapshot.



FIG. 6 is a block diagram of an example of a system to synthesize new backup snapshots.



FIG. 7 is a flowchart of an example of a process to synthesize new backup snapshots.



FIG. 7A is a flowchart of an example, of a process to generate a synthesis plan.



FIG. 8 is a block diagram of an example of a system to recover point-in-time data.



FIG. 9 is a flowchart of an example, of a process to recover point-in-time data.



FIG. 10 is a simplified diagram depicting data protection windows providing backup granularity.



FIG. 11 is a flowchart of an example of a process to apply data protection windows.



FIG. 12 is a block diagram of an example of a system to mount a recovery snapshot.



FIG. 13 is a flowchart of an example of a process to mount a recovery snapshot.



FIG. 13A is a flowchart of an example of a process to recover data for a corrupt source data system.



FIG. 14 is a block diagram of an example of a system to receive application I/Os from multiple data protection appliances.



FIG. 15 is a flowchart of an example of a process to receive application I/Os from multiple data sources.



FIG. 16 is a simplified block diagram of FIG. 17 is a flowchart of an example of a process to recover data from a logical unit (LUN).



FIG. 18 is a flowchart of an example of a process to read data while recovering a logical unit (LUN).



FIG. 19 is a simplified block diagram of an example of a computer on which any of the processes of FIGS. 4, 7, 7A, 9, 11, 13, 13A, 15, 17 and 18 may be implemented.





DETAILED DESCRIPTION

Described herein are techniques to continue replication of data from a first volume to a second volume while the first volume is also being migrated to a third volume. The techniques are performed independent of storage type.


The following definitions may be useful in understanding the specification and claims.


BACKUP SITE—a facility where replicated production site data is stored; the backup site may be located in a remote site or at the same location as the production site; a backup site may be a virtual or physical site.


BOOKMARK—a bookmark is metadata information stored in a replication journal which indicates a point in time.


CDP—Continuous Data Protection, a full replica of a volume or a set of volumes along with a journal which allows any point in time access, the CDP copy is at the same site, and maybe the same storage array of the production site.


DATA PROTECTION APPLIANCE (DPA)—a computer or a cluster of computers, or a set of processes that serve as a data protection appliance, responsible for data protection services including inter alia data replication of a storage system, and journaling of I/O requests issued by a host computer to the storage system. The DPA may be a physical device, a virtual device running, or may be a combination of a virtual and physical device.


DEDUPLICATED STORAGE SYSTEM—any storage system capable of storing deduplicated or space reduced data, and in some examples, is an EMC® DataDomain® system. Deduplicated data may also be any data that is processed to remove redundant data.


HOST—at least one computer or networks of computers that runs at least one data processing application that issues I/O requests to one or more storage systems; a host is an initiator with a SAN.


HOST DEVICE—an internal interface in a host, to a logical storage unit.


IMAGE—a copy of a logical storage unit at a specific point in time.


INITIATOR—a node in a SAN that issues I/O requests.


I/O REQUEST—an input/output request (sometimes referred to as an I/O or IO), which may be a read I/O request (sometimes referred to as a read request or a read) or a write I/O request (sometimes referred to as a write request or a write).


JOURNAL—a record of write transactions issued to a storage system; used to maintain a duplicate storage system, and to roll back the duplicate storage system to a previous point in time.


LOGICAL UNIT—a logical entity provided by a storage system for accessing data from the storage system. The logical disk may be a physical logical unit or a virtual logical unit.


LUN—a logical unit number for identifying a logical unit.


PHYSICAL LOGICAL UNIT—a physical entity, such as a disk or an array of disks, for storing data in storage locations that can be accessed by address.


PRODUCTION SITE—a facility where one or more host computers run data processing applications that write data to a storage system and read data from the storage system.


REMOTE ACKNOWLEDGEMENTS—an acknowledgement from remote DPA to the local DPA that data arrived at the remote DPA (either to the appliance or the journal).


SNAPSHOT—a snapshot is an image or differential representations of an image, i.e., the snapshot may have pointers to the original volume, and may point to log volumes for changed locations. Snapshots may be combined into a snapshot array, which may represent different images over a time period.


SPLITTER/PROTECTION AGENT—is an agent running either on a production host a switch or a storage array which can intercept I/Os and split them to a DPA and to the storage array, fail I/Os, redirect I/Os or do any other manipulation to the I/O; the splitter or protection agent may be used in both physical and virtual systems. The splitter may be in the I/O stack of a system and may be located in the hypervisor for virtual machines. In some examples, a splitter may be referred to as an Open Replicator Splitter (ORS).


SPLITTER ACKNOWLEDGEMENT—an acknowledgement from a DPA to the protection agent (splitter) that data has been received at the DPA; this may be achieved by an SCSI status command.


SAN—a storage area network of nodes that send and receive an I/O and other requests, each node in the network being an initiator or a target, or both an initiator and a target.


SOURCE SIDE—a transmitter of data within a data replication workflow, during normal operation a production site is the source side; and during data recovery a backup site is the source side, sometimes called a primary side. Source side may be a virtual or physical site.


STORAGE SYSTEM—a SAN entity that provides multiple logical units for access by multiple SAN initiators.


STREAMING—transmitting data in real time, from a source to a destination, as the data is read or generated.


SYNTHESIZE—generating a new file, for example, using pointers from existing files, without actually copying the referenced data. In one particular example, a new file representing a volume at a points-in-time may be generated using pointers to a file representing a previous point-in-time, as well pointers to journal representing changes to the volume.


TARGET—a node in a SAN that replies to I/O requests.


TARGET SIDE—a receiver of data within a data replication workflow; during normal operation a back site is the target side, and during data recovery a production site is the target side, sometimes called a secondary side. The target side may be a virtual or physical site.


THIN PROVISIONING—thin provisioning involves the allocation of physical storage when it is needed rather than allocating the entire physical storage in the beginning. Thus, use of thin provisioning is known to improve storage utilization.


THIN LOGICAL UNIT—a thin logical unit is a logical unit that uses thin provisioning.


VIRTUAL LOGICAL UNIT—a virtual storage entity which is treated as a logical unit by virtual machines.


WAN—a wide area network that connects local networks and enables them to communicate with one another, such as the Internet.


A description of journaling and some techniques associated with journaling may be described in the patent titled “METHODS AND APPARATUS FOR OPTIMAL JOURNALING FOR CONTINUOUS DATA REPLICATION” and with U.S. Pat. No. 7,516,287, which is hereby incorporated by reference.


Referring to FIG. 1, a data protection system 100 includes two sites; Site I, which is a production site, and Site II, which is a backup site or replica site. Under normal operation the production site is the source side of system 100, and the backup site is the target side of the system. The backup site is responsible for replicating production site data. Additionally, the backup site enables roll back of Site I data to an earlier pointing time, which may be used in the event of data corruption of a disaster, or alternatively in order to view or to access data from an earlier point in time.



FIG. 1 is an overview of a system for data replication of either physical or virtual logical units. Thus, one of ordinary skill in the art would appreciate that in a virtual environment a hypervisor, in one example, would consume logical units and generate a distributed file system on them such as VMFS generates files in the file system and expose the files as logical units to the virtual machines (each VMDK is seen as a SCSI device by virtual hosts). In another example, the hypervisor consumes a network based file system and exposes files in the NFS as SCSI devices to virtual hosts.


During normal operations, the direction of replicate data flow goes from source side to target side. It is possible, however, for a user to reverse the direction of replicate data flow, in which case Site I starts to behave as a target backup site, and Site II starts to behave as a source production site. Such change of replication direction is referred to as a “failover”. A failover may be performed in the event of a disaster at the production site, or for other reasons. In some data architectures, Site I or Site II behaves as a production site for a portion of stored data, and behaves simultaneously as a backup site for another portion of stored data. In some data architectures, a portion of stored data is replicated to a backup site, and another portion is not.


The production site and the backup site may be remote from one another, or they may both be situated at a common site, local to one another. Local data protection has the advantage of minimizing data lag between target and source, and remote data protection has the advantage is being robust in the event that a disaster occurs at the source side.


The source and target sides communicate via a wide area network (WAN) 128, although other types of networks may be used.


Each side of system 100 includes three major components coupled via a storage area network (SAN); namely, (i) a storage system, (ii) a host computer, and (iii) a data protection appliance (DPA). Specifically with reference to FIG. 1, the source side SAN includes a source host computer 104, a source storage system 108, and a source DPA 112. Similarly, the target side SAN includes a target host computer 116, a target storage system 120, and a target DPA 124. As well, the protection agent (sometimes referred to as a splitter) may run on the host, or on the storage, or in the network or at a hypervisor level, and that DPAs are optional and DPA code may run on the storage array too, or the DPA 124 may run as a virtual machine.


Generally, a SAN includes one or more devices, referred to as “nodes”. A node in a SAN may be an “initiator” or a “target”, or both. An initiator node is a device that is able to initiate requests to one or more other devices; and a target node is a device that is able to reply to requests, such as SCSI commands, sent by an initiator node. A SAN may also include network switches, such as fiber channel switches. The communication links between each host computer and its corresponding storage system may be any appropriate medium suitable for data transfer, such as fiber communication channel links.


The host communicates with its corresponding storage system using small computer system interface (SCSI) commands.


System 100 includes source storage system 108 and target storage system 120. Each storage system includes physical storage units for storing data, such as disks or arrays of disks. Typically, storage systems 108 and 120 are target nodes. In order to enable initiators to send requests to storage system 108, storage system 108 exposes one or more logical units (LU) to which commands are issued. Thus, storage systems 108 and 120 are SAN entities that provide multiple logical units for access by multiple SAN initiators.


Logical units are a logical entity provided by a storage system, for accessing data stored in the storage system. The logical unit may be a physical logical unit or a virtual logical unit. A logical unit is identified by a unique logical unit number (LUN). Storage system 108 exposes a logical unit 136, designated as LU A, and storage system 120 exposes a logical unit 156, designated as LU B.


LU B is used for replicating LU A. As such, LU B is generated as a copy of LU A. In one example, LU B is configured so that its size is identical to the size of LU A. Thus, for LU A, storage system 120 serves as a backup for source side storage system 108. Alternatively, as mentioned hereinabove, some logical units of storage system 120 may be used to back up logical units of storage system 108, and other logical units of storage system 120 may be used for other purposes. Moreover, there is symmetric replication whereby some logical units of storage system 108 are used for replicating logical units of storage system 120, and other logical units of storage system 120 are used for replicating other logical units of storage system 108.


System 100 includes a source side host computer 104 and a target side host computer 116. A host computer may be one computer, or a plurality of computers, or a network of distributed computers, each computer may include inter alia a conventional CPU, volatile and non-volatile memory, a data bus, an I/O interface, a display interface and a network interface. Generally a host computer runs at least one data processing application, such as a database application and an e-mail server.


Generally, an operating system of a host computer generates a host device for each logical unit exposed by a storage system in the host computer SAN. A host device is a logical entity in a host computer, through which a host computer may access a logical unit. Host device 104 identifies LU A and generates a corresponding host device 140, designated as Device A, through which it can access LU A. Similarly, host computer 116 identifies LU B and generates a corresponding device 160, designated as Device B.


In the course of continuous operation, host computer 104 is a SAN initiator that issues I/O requests (write/read operations) through host device 140 to LU A using, for example, SCSI commands. Such requests are generally transmitted to LU A with an address that includes a specific device identifier, an offset within the device, and a data size. Offsets are generally aligned to 512 byte blocks. The average size of a write operation issued by host computer 104 may be, for example, 10 kilobytes (KB); i.e., 20 blocks. For an I/O rate of 50 megabytes (MB) per second, this corresponds to approximately 5,000 write transactions per second.


System 100 includes two data protection appliances, a source side DPA 112 and a target side DPA 124. A DPA performs various data protection services, such as data replication of a storage system, and journaling of I/O requests issued by a host computer to source side storage system data. As explained in detail herein, when acting as a target side DPA, a DPA may also enable roll back of data to an earlier point in time, and processing of rolled back data at the target site. Each DPA 112 and 124 is a computer that includes inter alia one or more conventional CPUs and internal memory.


For additional safety precaution, each DPA is a cluster of such computers. Use of a cluster ensures that if a DPA computer is down, then the DPA functionality switches over to another computer. The DPA computers within a DPA cluster communicate with one another using at least one communication link suitable for data transfer via fiber channel or IP based protocols, or such other transfer protocol. One computer from the DPA cluster serves as the DPA leader. The DPA cluster leader coordinates between the computers in the cluster, and may also perform other tasks that require coordination between the computers, such as load balancing.


In the architecture illustrated in FIG. 1, DPA 112 and DPA 124 are standalone devices integrated within a SAN. Alternatively, each of DPA 112 and DPA 124 may be integrated into storage system 108 and storage system 120, respectively, or integrated into host computer 104 and host computer 116, respectively. Both DPAs communicate with their respective host computers through communication lines such as fiber channels using, for example, SCSI commands or any other protocol.


DPAs 112 and 124 are configured to act as initiators in the SAN; i.e., they can issue I/O requests using, for example, SCSI commands, to access logical units on their respective storage systems. DPA 112 and DPA 124 are also configured with the necessary functionality to act as targets; i.e., to reply to I/O requests, such as SCSI commands, issued by other initiators in the SAN, including inter alia their respective host computers 104 and 116. Being target nodes, DPA 112 and DPA 124 may dynamically expose or remove one or more logical units.


As described hereinabove, Site I and Site II may each behave simultaneously as a production site and a backup site for different logical units. As such, DPA 112 and DPA 124 may each behave as a source DPA for some logical units, and as a target DPA for other logical units, at the same time.


Host computer 104 and host computer 116 include protection agents 144 and 164, respectively. Protection agents 144 and 164 intercept SCSI commands issued by their respective host computers, via host devices to logical units that are accessible to the host computers. A data protection agent may act on an intercepted SCSI commands issued to a logical unit, in one of the following ways: send the SCSI commands to its intended logical unit; redirect the SCSI command to another logical unit; split the SCSI command by sending it first to the respective DPA; after the DPA returns an acknowledgement, send the SCSI command to its intended logical unit; fail a SCSI command by returning an error return code; and delay a SCSI command by not returning an acknowledgement to the respective host computer.


A protection agent may handle different SCSI commands, differently, according to the type of the command. For example, a SCSI command inquiring about the size of a certain logical unit may be sent directly to that logical unit, while a SCSI write command may be split and sent first to a DPA associated with the agent. A protection agent may also change its behavior for handling SCSI commands, for example as a result of an instruction received from the DPA.


Specifically, the behavior of a protection agent for a certain host device generally corresponds to the behavior of its associated DPA with respect to the logical unit of the host device. When a DPA behaves as a source site DPA for a certain logical unit, then during normal course of operation, the associated protection agent splits I/O requests issued by a host computer to the host device corresponding to that logical unit. Similarly, when a DPA behaves as a target device for a certain logical unit, then during normal course of operation, the associated protection agent fails I/O requests issued by host computer to the host device corresponding to that logical unit.


Communication between protection agents and their respective DPAs may use any protocol suitable for data transfer within a SAN, such as fiber channel, or SCSI over fiber channel. The communication may be direct, or via a logical unit exposed by the DPA. Protection agents communicate with their respective DPAs by sending SCSI commands over fiber channel.


Protection agents 144 and 164 are drivers located in their respective host computers 104 and 116. Alternatively, a protection agent may also be located in a fiber channel switch, or in any other device situated in a data path between a host computer and a storage system or on the storage system itself. In a virtualized environment, the protection agent may run at the hypervisor layer or in a virtual machine providing a virtualization layer.


What follows is a detailed description of system behavior under normal production mode, and under recovery mode.


In production mode DPA 112 acts as a source site DPA for LU A. Thus, protection agent 144 is configured to act as a source side protection agent; i.e., as a splitter for host device A. Specifically, protection agent 144 replicates SCSI I/O write requests. A replicated SCSI I/O write request is sent to DPA 112. After receiving an acknowledgement from DPA 124, protection agent 144 then sends the SCSI I/O write request to LU A. After receiving a second acknowledgement from storage system 108 host computer 104 acknowledges that an I/O command complete.


When DPA 112 receives a replicated SCSI write request from data protection agent 144, DPA 112 transmits certain I/O information characterizing the write request, packaged as a “write transaction”, over WAN 128 to DPA 124 on the target side, for journaling and for incorporation within target storage system 120.


DPA 112 may send its write transactions to DPA 124 using a variety of modes of transmission, including inter alia (i) a synchronous mode, (ii) an asynchronous mode, and (iii) a snapshot mode. In synchronous mode, DPA 112 sends each write transaction to DPA 124, receives back an acknowledgement from DPA 124, and in turns sends an acknowledgement back to protection agent 144. Protection agent 144 waits until receipt of such acknowledgement before sending the SCSI write request to LU A.


In asynchronous mode, DPA 112 sends an acknowledgement to protection agent 144 upon receipt of each I/O request, before receiving an acknowledgement back from DPA 124.


In snapshot mode, DPA 112 receives several I/O requests and combines them into an aggregate “snapshot” of all write activity performed in the multiple I/O requests, and sends the snapshot to DPA 124, for journaling and for incorporation in target storage system 120. In snapshot mode DPA 112 also sends an acknowledgement to protection agent 144 upon receipt of each I/O request, before receiving an acknowledgement back from DPA 124.


For the sake of clarity, the ensuing discussion assumes that information is transmitted at write-by-write granularity.


While in production mode, DPA 124 receives replicated data of LU A from DPA 112, and performs journaling and writing to storage system 120. When applying write operations to storage system 120, DPA 124 acts as an initiator, and sends SCSI commands to LU B.


During a recovery mode, DPA 124 undoes the write transactions in the journal, so as to restore storage system 120 to the state it was at, at an earlier time.


As described hereinabove, LU B is used as a backup of LU A. As such, during normal production mode, while data written to LU A by host computer 104 is replicated from LU A to LU B, host computer 116 should not be sending I/O requests to LU B. To prevent such I/O requests from being sent, protection agent 164 acts as a target site protection agent for host Device B and fails I/O requests sent from host computer 116 to LU B through host Device B.


Target storage system 120 exposes a logical unit 176, referred to as a “journal LU”, for maintaining a history of write transactions made to LU B, referred to as a “journal”. Alternatively, journal LU 176 may be striped over several logical units, or may reside within all of or a portion of another logical unit. DPA 124 includes a journal processor 180 for managing the journal.


Journal processor 180 functions generally to manage the journal entries of LU B. Specifically, journal processor 180 enters write transactions received by DPA 124 from DPA 112 into the journal, by writing them into the journal LU, reads the undo information for the transaction from LU B. updates the journal entries in the journal LU with undo information, applies the journal transactions to LU B, and removes already-applied transactions from the journal.


Referring to FIG. 2, which is an illustration of a write transaction 200 for a journal. The journal may be used to provide an adaptor for access to storage 120 at the state it was in at any specified point in time. Since the journal includes the “undo” information necessary to roll back storage system 120, data that was stored in specific memory locations at the specified point in time may be obtained by undoing write transactions that occurred subsequent to such point in time.


Write transaction 200 generally includes the following fields: one or more identifiers; a time stamp, which is the date & time at which the transaction was received by source side DPA 112; a write size, which is the size of the data block; a location in journal LU 176 where the data is entered; a location in LU B where the data is to be written; and the data itself.


Write transaction 200 is transmitted from source side DPA 112 to target side DPA 124. As shown in FIG. 2, DPA 124 records the write transaction 200 in the journal that includes four streams. A first stream, referred to as a DO stream, includes new data for writing in LU B. A second stream, referred to as an DO METADATA stream, includes metadata for the write transaction, such as an identifier, a date & time, a write size, a beginning address in LU B for writing the new data in, and a pointer to the offset in the DO stream where the corresponding data is located. Similarly, a third stream, referred to as an UNDO stream, includes old data that was overwritten in LU B; and a fourth stream, referred to as an UNDO METADATA, include an identifier, a date & time, a write size, a beginning address in LU B where data was to be overwritten, and a pointer to the offset in the UNDO stream where the corresponding old data is located.


In practice each of the four streams holds a plurality of write transaction data. As write transactions are received dynamically by target DPA 124, they are recorded at the end of the DO stream and the end of the DO METADATA stream, prior to committing the transaction. During transaction application, when the various write transactions are applied to LU B, prior to writing the new DO data into addresses within the storage system, the older data currently located in such addresses is recorded into the UNDO stream. In some examples, the metadata stream (e.g., UNDO METADATA stream or the DO METADATA stream) and the data stream (e.g., UNDO stream or DO stream) may be kept in a single stream each (i.e., one UNDO data and UNDO METADATA stream and one DO data and DO METADATA stream) by interleaving the metadata into the data stream.



FIGS. 3 to 5 depict systems and processes for initializing a backup snapshot on deduplicated storage consistent. Before deduplicated storage can provide continuous backup protection, it may be necessary to generate an initial backup snapshot of the source storage system. This initial backup snapshot may represent the earliest point-in-time backup that may be restored. As changes are made to the source storage system, journal files and/or new backups may be updated and/or synthesized to provide continuous protection. In some examples, the initial backup snapshot may be generated by streaming I/Os from a storage system scan to a data protection appliance, or by taking an initial snapshot of the storage system and transmitting the entire snapshot to deduplicated storage.



FIG. 3 depicts a system for generating an initial backup snapshot by scanning a source storage system and streaming I/Os to the deduplicated storage. Data protection application 300 may include journal processor 302, and may be in communication with deduplicated storage 304. In one example, deduplicated storage 304 may be target side storage residing at a backup site. Data protection appliance 300 may be similar to data protection appliance 112 and/or 124, and may be responsible for streaming I/Os to deduplicated storage 304.


In one example, a source storage system may be scanned and individual offsets may be streamed to data protection appliance 300. The offsets streamed from the scanned system may be referred to as initialization I/Os, and may be streamed sequentially to data protection appliance 300. For example, the scanned system may include offsets 0, 1, 2, and 3, comprising data A, B, C, and D. The initial scan may start at the beginning of the system, and transmit offset 0, followed by offset 1, and so forth.


As data protection appliance 300 receives the initialization I/Os, journal processor 302 may identify the offset data and metadata, and may stream the I/Os to metadata journal 306 and/or data journal 308 residing on deduplicated storage 304. Data journal 308 may include data stored within an offset, and metadata 306 may include metadata associated with that offset Metadata could include, for example, an offset identifier, size, write time, and device ID. These journals may then be used to synthesize a backup snapshot on deduplicated storage 304, as described herein.


In some examples, a scanned storage system may operate in a live environment. As a result, applications may be writing to the storage concurrently with the scan process. If an application writes to a location that has already been streamed, the journal files and ultimately the synthesized snapshot may be out of date. To address this issue, application I/Os may be streamed concurrently with the initialization I/Os if the application I/Os are to an offset that has already been scanned. For example, consider Table 1:














Offset











Time
t0
t1
t2
t3





0
A


A′


1
B
B′




2
C





3
D

D′









Table 1 depicts four different offsets, denoted as 0, 1, 2, and 3, and four times, t0, t1, t2, and t3. Letters A, B, C, and D may represent the data stored at the offsets. Time t0 may represent the offsets as they exist when the scan begins. These offsets may be streamed to data protection appliance 300 sequentially from 0 to 3. At time t1, however, the data at offset 1 is modified by an application from B to B′. Similarly, at t2 the data at offset 3 changes from D to D′, and at t3 the data at offset 0 changes from A to A′. If the scan transmits the data at offset 1 before t1, B′ may be missed since the change occurred after offset 1 was scanned and B was transmitted. Similarly, if the scan has not reached offset 3 before t2, only D′ will be transmitted since D no longer exists. It may therefore be beneficial to transmit application I/Os to data protection appliance 300 if those I/Os write to an offset that has already been scanned. If the offset has not been scanned, it may not be necessary to transmit the application I/Os because the change will be transmitted when the scan reaches that offset.


Referring back to FIG. 3 and with continued reference to Table 1, offset metadata journal entries 310 and offset data journal entries 312 depict the state of metadata journal 306 and data journal 308 after the initial scan is complete. While there are only four offsets on the scanned storage system, there are six entries in the journal because the data in offset 0 and 1 was modified by an application after they were scanned. They each therefore have two entries: B and B′. Segment D was modified after the scan began, but before it was reached. Segment D therefore only has one entry: D′.


Metadata journal entries 310 and data journal entries 312 may include all of the data necessary to synthesize a backup snapshot of the scanned storage system. Data journal entries 312 may include the actual data from the storage system: A, B, B′ C, A′ and D′. Note that data D is not in the data journal 308 since it was modified on the storage system before its offset was scanned and transmitted. Metadata journal entries 310 may include metadata about the offsets. For example, metadata journal entries 310 may include an offset identifier, offset length, and write time, and volume/device ID. In the present example, metadata journal entries may include the entries shown in Table 2:














Offset










Time
Volume
Offset
Time














0
A
0

t0


1
A
8
kb
t0


2
A
8
kb
t1


3
A
16
kb
t0


4
A
0

t3


5
A
24
kb
t2









Table 2's metadata entries may correspond to the states shown in Table 1. The offset at location 0 may be offset 0, the offset at 8 kb may be offset 1, the offset at 16 kb may be offset 2, and the offset at 24 kb may be offset 3. The subscript of each journal entries 310 also identifies the offset associated with that metadata entry.


Deduplicated storage may use metadata journal 306 and data journal 308 to synthesize initial backup snapshot 314. First, metadata journal 306 may be queried to identify the most recent data associated with each offset. Next, the data may be retrieved from journal data file 308 and synthesized into backup snapshot 314. In some examples, synthesizing the backup snapshot may include generating and/or copying pointers rather than copying entire data blocks. This could be, for example, using a product such as EMC® DataDomain® Boost™


For example, once the initial scan is complete, data journal 308 includes data A, B, B′, C, A′, and D′. A′ and B′ are the result of application I/Os occurring during the scan process, and therefore represent the present state of offsets 0 and 1. To generate backup snapshot 314, deduplicated storage may therefore retrieve A′, B′, C, and D′ from the data journal 308 and synthesize them together.


Once initial backup snapshot 314 is synthesized, journal entries 310 and 312 may no longer be needed. In some examples, they may be removed from deduplicated storage 304 in order to conserve space. Alternatively, they may remain in the journals.


The systems and processes described in reference to FIG. 3 enable a system to generate an initial backup snapshot. Once the initial snapshot is generated, additional processes may enable continuous data protection and point-in-time recovery.


Referring to FIG. 4, an example of a process to generate an initial backup snapshot is a process 400, which includes processing blocks 401, 402, 404, 406, 408, 410, 412, 414 and 416. At block 401, sequential initialization I/Os are received from a scanned storage volume. These I/Os could be, for example, received at a data protection appliance, such as data protection appliance 300. In some examples, the initialization I/Os are read from the scanned storage volume by the data protection appliance.


At block 402, the initialization I/Os are streamed to a deduplicated storage. In an example, the deduplicated storage may be substantially similar to deduplicated storage 304. In some examples, the initialization I/Os are streamed to a data journal using a data stream, and to a metadata journal using a metadata stream. Each stream may be a file in the deduplicated storage. Additionally or alternatively, writes to the journal files may be done though the EMC® Data Domain® Boost™ API or any other API.


At block 404, the initialization I/Os may be written to a journal on the deduplicated storage. This journal may be, for example, similar to metadata journal 306 and/or data journal 308. In an example, these journals may be in the same journal files. Alternatively, these may be separate files on the deduplicated storage system.


At block 406, application I/Os comprising writes to offsets on the scanned storage volume may be received. These application I/Os may also be received at a data protection appliance, such as data protection appliance 300.


At block 408, an offset associated with a specific application I/O is identified, and at block 410 it is determined whether the offset has already been streamed to the deduplicated storage.


This determination could be made on data protection appliance 300 using journal processor 302. If the offset has already been streamed, it must have already been scanned and included in an initialization I/O. If the offset has not been streamed, the storage volume scan may not have reached the offset on the storage volume.


At block 412, the application I/O is streamed to the deduplicated storage if its offset was included in a previously streamed initialization I/O. In an example, the application I/O is only streamed when its offset was included a previously streamed initialization I/O. Streaming the application I/O when its offset was included in a previous initialization I/O ensures that writes to the scanned volume are not missed during the initialization processes. In some examples, the application I/Os are streamed to a data journal using a data stream, and to a metadata journal using a metadata stream.


In an example, application I/Os are not streamed if they comprise writes to an offset that has not yet been scanned and streamed in an initialization I/O. This is because the data generated by the write will be included in the initialization I/O once the scan reaches that offset. This may reduce traffic between the data protection appliance and the deduplicated storage, and may reduce the workload on the deduplicated because the data will only be processed once.


At block 414, the application I/O is written to the journal. This journal may be the same journal as the initialization I/Os, or it may be a separate journal. In an example, the journal is data journal 308 and/or metadata journal 306.


At block 416, a backup snapshot is synthesized from the initialization I/Os and the application I/Os. This snapshot may be substantially similar to snapshot 314. In an example, the snapshot is synthesized by generating data pointers in a new file on the deduplicated storage. Additionally or alternatively, the pointers may be copied from the data journal. These pointers may point to the data referenced and/or included in the journal. Synthesizing the snapshot using pointers may improve performance, as the data may not need to be replicated.



FIG. 5 depicts an additional or alternative example for initializing a backup snapshot. The system shown in FIG. 5 may include data protection appliance 500, journal processor 502, and deduplicated storage 504. These elements may be substantially similar to those described in reference to FIG. 3.


Data protection appliance 500 may take a snapshot of a storage system and transmit that snapshot to deduplicated storage 504 for storage as a file. In an example, this is different than streaming initialization I/Os and synthesizing a snapshot from journal files.


Rather than generating the snapshot on the deduplicated storage, the backup snapshot is generated using the data protection appliance and transmitted to deduplicated storage to be stored as backup snapshot 514.


In an example, journal processor 502 may stream application I/Os to deduplicated storage, and those application I/Os may be stored in metadata journal 506 and data journal 508. Like the journals of FIG. 3, metadata journal 506 may include metadata journal entries 510, and data journal 508 may include data journal entries 512. These journals may be used to synthesize a second backup snapshot or enable point-in-time recovery, as described below.


The systems and processes described in reference to FIGS. 3 to 5 enable a system to generate an initial backup snapshot. Once the initial snapshot is generated, additional processes may enable continuous data protection and point-in-time recovery.


Referring to FIG. 6, a system and process for maintaining backups using continuous data replication is described. As datasets increase in size, backing them up to remote or local backup devices becomes increasingly costly and complex. Additionally, traditional backup processes may not allow point-in-time recovery since the backups occur on a periodic, rather than continuous, basis. The methods and systems described herein provide continuous backup protection as writes are made to a source device, thereby reducing backup cost and complexity, and may allowing point-in-time recovery for backed up files.


The system of FIG. 6 includes a data protection appliance 600, a journal processor 602, and a deduplicated storage 604. These elements may be substantially similar to those described in reference to FIG. 3. Deduplicated storage 604 may include a backup snapshot 614, a metadata journal file 606, and a data journal file 608. In one example, backup snapshot file 614 is synthesized in a manner substantially similar to backup snapshot 314, and may be generated using metadata journal entries 610 and data journal entries 612.


As users, applications, and other processes access and use the source storage system, data on that system may change and/or new data may be generated. As a result, initial backup snapshot 614 may become stale. If the source storage system should fail, there is a chance that any new or modified data may be lost. To address this concern, data protection appliance 600 may receive and stream application I/Os to deduplicated storage system 604 on a continuous basis, even after initial backup snapshot 614 is synthesized. Streaming the application I/Os allows the backups on deduplicated storage 604 to remain up-to-date, without needing to perform additional backups of large datasets. This may reduce network traffic, reduce workloads, and conserve space on deduplicated storage 604.


For example, new metadata entries 611 and new data journal entries 613 represent I/Os made after initial backup snapshot 614 was synthesized. These entries may be written to metadata journal 606 and data journal 608, as shown in FIG. 6, or they may be written to separate journal files. In FIG. 6, data A′ and C were modified on the source storage device, and the journal entries therefore include A″ and C′.


Periodically, new backup snapshots may be synthesized from a previous backup snapshot and new journal entries. For example, second backup snapshot 616 may be synthesized from initial backup snapshot 614, new metadata journal entries 611, and new data journal entries 613. Second backup snapshot 616 may be used to restore source storage system up to the point-in-time the last journal entry was received. That is, backup snapshot 616 represents a backup of the source storage system at a later timestamp than initial backup snapshot 614.


In one example, synthesizing second backup journal entry 616 may be substantially similar to synthesizing the initial backup snapshot 614. Rather than synthesizing all of the data from data journal 608, however, unchanged data may be synthesized from initial backup snapshot 614. In one example, this synthesis may include copying and/or generating a data pointer. For example, in FIG. 6 the solid arrows between initial backup snapshot 614 and second backup snapshot 616 represent unchanged data that is common between the two. In this case, only B′ and D′ remain unchanged. The dashed arrows represent new or changed data that needs to be synthesized into second backup snapshot 616. In FIG. 6, A′ is changed to A″, C is change to C′. Synthesizing the data into second backup snapshot 616 therefore results in A″, B′, C′, D′.


Additionally or alternatively, second backup snapshot 616 may be synthesized entirely from journal entries. Rather than synthesizing unchanged data from initial backup 614, deduplicated storage 604 may retrieve the unchanged data from data journal entries 612. For example, B′ and D′ may be synthesized from data journal entries 612 rather than from initial backup snapshot 614.


Additional backup snapshots, such as second backup snapshot 616, may be generated periodically or on demand. For example, a user policy may specify that new snapshots should be generated every week. Additionally or alternatively, a user may be preparing to perform some risky operations on the source storage system, and may demand that a snapshot be generated in case something goes wrong. These policies may be maintained and applied using data protection appliance 600, deduplicated storage 604, and/or an external system.


Referring to FIG. 7, an example of a process to maintain backup snapshots using continuous data replication is a process 700, which includes processing blocks 701, 702, 704, 706, 708 and 710. At block 701, an initial snapshot of a source storage system may be generated. This initial snapshot may be substantially similar to initial backup snapshot 614, and may be generated using any one of the processes described in reference to FIGS. 3 to 5. Additionally or alternatively, the initial snapshot may be any previously generated snapshot. For example, the initial snapshot may be similar to second backup snapshot 616, and may be used in conjunction with journal files to generate a third backup snapshot.


At block 702, application I/Os comprising writes to the source storage system may be received. These writes may update existing data or generate new data. In some examples, the application I/Os may be received by a data protection appliance, such as data protection appliance 600.


At block 704, the application I/Os may be written to a journal file. This journal file may be substantially similar to metadata journal file 606 and/or data journal file 608. In some examples, the application I/Os may be written to one or more existing journals. Alternatively, application I/Os arriving after a snapshot is synthesized may be written to their own unique journals. This may be beneficial, for example, when maintaining different levels of backup granularity, as described below.


In some examples, the application I/Os are sequentially written to the journal as they are received. For example, if application I/Os arrive in order B, C, A, their corresponding entries in the journal will also be B, C, A.


At block 706, a second snapshot may be synthesized from the initial backup snapshot and the journal. The second snapshot may be substantially similar to second backup snapshot 616, and the synthesis process may be similar to that depicted by the solid and dashed lines. In some examples, the second snapshot may be synthesized entirely from journal files rather than use the initial backup snapshot.


During and/or after the synthesis process, additional application I/Os may be received at block 708. These application I/Os could be used, for example, to generate the third backup snapshot in the future, and may be processed in a manner similar to all the other application I/Os described herein.


At block 710 the additional application I/Os may be written to a journal file. They may be written to the same journal as the previous I/Os, or they may be written to a new journal file.


Referring to FIG. 7A, an example of a process to synthesize snapshots used for continuous data replication is a process 712, which includes processing blocks 713, 714, 716 and 718. At block 712, a metadata journal may be read. This metadata journal could be, for example, metadata journal file 606. In some examples, the metadata journal may be read using a journal processor on a data protection appliance. Additionally or alternatively, the read operation may be local to the deduplicated storage device.


At block 714, the latest I/Os for each offset may be identified. For example, metadata journal file 606 includes journal entries 610 and 611. The latest entry for offset 0 is A″, 1 is B′, 2 is C′, and 3 is D′. In some examples, journal entries 610 and 611 may be written to different journals. In such some examples, the only I/Os identified would be A″ and C′ since we are synthesizing a snapshot from initial backup snapshot 614.


At block 716, a synthesis plan may be generated. This plan may identify where each I/O should be synthesized from. For example, the synthesis plan may only identify A″ and C′ for synthesis from data journal 608. The B′ and D′, in contrast, may be obtained from initial backup snapshot 614 since they have not changed.


At block 718, the backup snapshot may be synthesized. This backup snapshot could be, for example, substantially similar to backup snapshot 616.


The system and processes described herein may enable additional backup snapshots to be synthesized from journal entries and existing snapshots. In some examples, the journal entries may be application I/Os which are continuously streamed to a data protection appliance. While these snapshots may provide additional data protection, they may only allow data that exists in the snapshots to be recovered. Combining snapshots and journal files may, however, allow any point-in-time recovery.


When datasets are backed-up on a periodic rather than continuous basis, data recovery may only be available for specific time intervals. For example, if a dataset is backed up at the end of every business day, the only data that is available for recovery is the data as it exists at the end of the day. Continuous backups, however, may allow recovery of data at any, or nearly any, point-in-time. By transmitting application I/Os to a backup location as they occur, an interim snapshot may be synthesized between scheduled snapshots and data may be recovered.



FIGS. 8 and 9 depict a system and process to synthesize an interim snapshot for point-in-time recovery. In one example, the system may include data protection appliance 800, journal processor 802, and deduplicated storage 804. The system may also include metadata journal file 806, comprising metadata journal entries 810 and 811, and data journal file 808, comprising data journal entries 812 and 813.


Data protection appliance 800 may receive application I/Os as they are made to a source storage system. In some examples, journal processor 802 may write those I/Os to metadata journal file 806 and data journal file 808. Initialization journal entries 810 and 812 may be used to synthesize initial backup snapshot 814. Metadata entries 811 and data journal file entries 813 may be application I/Os made to the source storage volume after or while initial backup snapshot 814 was synthesized. These elements may be substantially similar to those described in reference to FIG. 6.


In one example, metadata journal entries 811 and data journal entries 813 may be used to synthesize interim snapshot 816. Interim snapshot 816 may then be used as a source for point-in-time recovery. For example, application I/Os A″ and C′ may be streamed to deduplicated storage as they are made to the source storage system. A user may then decide they wish recover data from the point-in-time immediately after application I/O A″ was streamed. When the user's request arrives, the most recent snapshot may be initial backup snapshot 814, which does not include A″ or C′. To respond to the user's request, deduplicated storage 804 may synthesize interim snapshot 816. This snapshot may include unchanged data from initial backup snapshot 814, as shown by the solid black arrows, and application I/O A″ synthesized from data journal file 808, as shown by the dashed arrow. Note that interim snapshot 816 does not include C′. This is because the user requested data recovery at a point-in-time before C′ was made.


In one example, the data from interim snapshot 816 may be transmitted back to the source storage system and recovered. Additionally or alternatively, it may be exposed to a host as LUN, as described in reference to FIGS. 12 and 13. Interim snapshot 816 may be deleted after recovery, or may be retained. In some examples, if interim snapshot 816 is generated at a point-in-time sufficiently close to a scheduled synthesis time, the scheduled synthesis may be cancelled and interim snapshot 816 may be treated as second backup snapshot 616.


Referring to FIG. 9, an example of a process to perform recovery for a point-in-time is a process 900, which includes processing blocks 901, 902, 904, 906 and 908. At block 901, a request to recover some data is received. This request could be, for example, received at data protection appliance 800 and/or deduplicated data storage 804. In one example, the request may specify a file representing a LUN to recover, or it may be a request to recover an entire system. Additionally or alternatively, the request may specify a point-in-time for the recovery. The point-in-time may be a date, event, or any other mechanism to identify a specific time. In some examples, the point-in-time may be between snapshots.


At block 902, a snapshot nearest the point-in-time may be identified. The snapshot could be, for example, initial backup snapshot 814.


At block 906, a recovery snapshot may be synthesized. This recovery snapshot could be, for example, substantially similar to interim snapshot 816. If the recovery snapshot is synthesized using a snapshot from an earlier point-in-time, I/Os stored in a journal file may be applied to synthesize the recovery snapshot.


At block 908 the recovery snapshot may be provided in response to the request. For example, the recovery snapshot may be exposed as a LUN and mounted on a host computer, or exposed as a network file system share. Additionally or alternatively, the recovery snapshot may be transmitted back to the source storage system. In some examples, only a portion of the snapshot, such as a specific file, may be provided.


Combining backup snapshots, journals, and continuous data replication may provide point-in-time recovery capabilities. As more data is written to and/or modified on a source storage system, however, the number of journals and snapshots may increase. In some examples, data protection windows may be used to manage this data growth.


As the number of snapshots and journals on the deduplicated storage grows, more space may be required. Deleting snapshots and journals may result in important information being lost, and adding to space to the deduplicated storage may be expensive. To address these concerns, backup windows and policies may be defined. Backup windows may be defined intervals designating which snapshot and journals should be stored, and for how long.



FIGS. 10 and 11 depict a system and process to define backup granularity using data protection windows. FIG. 10 shows seventeen snapshot files, labeled S1 through S17, stored on a deduplicated storage device. These snapshots may be generated and maintained in a manner substantially similar to that described above. The deduplicated storage device may also include six journal files, labeled J1 through J6, which may be used to synthesize new snapshots or perform point-in-time recovery.



FIG. 10 also includes three data protection windows: short-term protection window 1000, mid-term protection window 1002, and long term protection window 1004. Each of these protection windows may have an associated policy specifying actions to take on any snapshot and/or journal file within the protection window. For example, one policy may be “delete all journals within this protection window.” While the examples described herein address deletion and/or retention policies, any other policy which may be applied to the journals and/or snapshots is consistent with this disclosure.


Short-term protection window 1000 may be defined to protect both snapshots and journal files allowing for point-in-time recovery. This window may be particularly beneficial for snapshots that were generated recently and/or were generated on demand by a user. On demand generation may signify that the snapshot is more important than a scheduled snapshot because a user must go out of their way to generate it. Further, it may be more likely that a user needs to recover data which was modified or generated recently.


Mid-term protection window 1002 may include only snapshot files. As time progresses and journal files move from short-term protection window 1000 into mid-term protection window 1002, they may be deleted. While deleting journal files may prevent most point-in-time recovery, the snapshots may be maintained in mid-term protection window. As a result, some level of point-in-time recovery is preserved. Specifically, any data included in one of the maintained snapshots may be recovered. Mid-term protection window therefore balances storage needs with recovery needs.


As snapshots move from mid-term protection 1002 window into long-term protection window 1004, certain snapshots may be deleted. Point-in-time recovery may be less important for long-term backups because of their age. The deleted snapshots may be chosen based on a policy, such as size or a user assigned priority. Additionally or alternatively, they may be arbitrarily chosen (for example, only retaining every fifth snapshot).


In some examples, data protection windows may be defined and maintained using a data protection appliance, a deduplicated storage device, and/or an external system. For example, if the data protection window is defined using a deduplicated storage device, that device may delete the journals and/or snapshots as the move from one data protection window into another. In some examples, the data protection windows may change dynamically based on available space on the deduplicated storage device. For example, if there is a large amount of available space the short-term protection window may be very large, and/or the mid-term and long-term protection windows may not exist. Similarly, if there is not much available space the long-term protection window may be very long.


Referring to FIG. 11, an example, of a process to define and apply data protection windows is a process 1100, which includes processing blocks, 1101, 1102, 1104, 1106, 1108, 1110, 111, 1112, 1114 and 1116. At block 1101, a plurality of backup snapshots may be initialized on a deduplicated storage. These snapshots may be initialized or generated using any of the systems or methods described herein.


At block 1102, a plurality of journals may be initialized on the deduplicated storage device. These journals may be generated from application I/Os received from source side storage, and may provide point-in-time recovery. In some examples, any of the processes described herein for generating and/or maintaining journals may be used.


At block 1104, a first backup window comprising a first time range may be defined. The time range may specify the amount of time snapshots and/or journals remain inside the backup window. In some examples, the time range is dynamically based on the available storage on a deduplicated storage device.


At block 1106, the first backup window may be applied to the backup snapshots and journals. In some examples, the first backup window may be defined to maintain all of the snapshots and journals it covers. This may permit point-in-time recovery of data from those files. In some examples, the first backup window is substantially similar to the short-term backup window described above.


At block 1108, second backup window comprising a second time range may be defined. This second backup window may include a second time range similar to the first window's time range. In some examples, the second backup window only applies to journals, and may be substantially similar to mid-term backup widow 1002.


At block 1110, the second backup window may be applied to the journals. This may occur as the journals move from the first backup window into the second backup window. For example, as time progresses the journal files may move outside the time range defined in the first protection window. This may be, for example, because the time range is shorter than the journals age. The journal may move into the time range specified in the second backup window, and that backup window may be applied.


At block 1111, as journals move into the second time range the may be deleted. In some examples, this may mean deleting every journal inside the second time range.


Additionally or alternatively, only select journals may be deleted. For example, the data protection window may have an associated policy specifying that only every second journal should be deleted.


At 1112, a third backup window comprising a third time range may be defined. This third backup window may be substantially similar to long-term window described above. In some examples, the third time range may be a catch-all, meaning it applies to any journal and/or backup snapshot not covered by the first backup window or the second backup window.


At 1114, the third backup window may be applied to any remaining snapshots and/or journals. In some examples, the journals have all been deleted and the third backup window is only applied to snapshot files.


At block 1116, a number of snap shots inside the third time range may be deleted. The number of snapshots to delete may be based on a policy, such as only retain every tenth snapshot, in some examples only a daily snapshot may be kept, or any other policy may be applied (for instance keep ten daily snapshots and then ten weekly snapshots and then ten monthly snapshots, and so forth).


The data protection windows described herein may provide varying degree of backup granularity. More recent and/or important information may include both snapshots and journal files, which longer term backups may only include periodic backup snapshots.


Data backups are only useful if they can be accessed and/or retrieved when needed. Accessing backup snapshots may allow a user or system to retrieve data needed for recovery. For a system-wide recovery, the entire backup snapshot may be retrieved. In some examples, however, it may be beneficial to allow a user to access the snapshot directly to retrieve discrete pieces of data.



FIGS. 12 and 13 depict a system and process for providing access to data snapshots. The system of FIG. 12 may include data protection appliance 1200 comprising journal processor 1202, deduplicated storage 1204, and host 1222. In some examples, deduplicated storage may include metadata journal 1206, data journal 1208, backup snapshot 1214, and recovery snapshot 1216. Recovery snapshot 1216 may be a synthesized snapshot for point-in-time recovery, as described in reference to FIG. 8. Metadata journal 1206 may include metadata journal entries 1210 and 1211, and data journal 1208 may include data journal entries 1212 and 1213. In some examples, these elements may be substantially similar to those described in reference to the figures above.


In some examples, a user may need to recover data from recovery snapshot 1216. Transmitting the entire snapshot over a network, however, may be inefficient given the snapshot's size. For example, if recovery snapshot is several gigabytes, and a user wishes to recover a file on the snapshot that is only a few megabytes, transferring the entire recovery snapshot 1216 may consume an unnecessary amount of network bandwidth.


Rather than transmitting recovery snapshot 1216 over a network, deduplicated storage 1204 may generate block LUN 1218 on top of the snapshot. LUN 1218 may be exposed and mounted on host 1222 as device 1220. A user may access LUN 1218 through device 1220, and could thereby browse the snapshot for the data they wish to recover. Once the data is located, it may be transmitted to the source storage system directly, through data protection appliance 1200, or through host 1222.


In some examples, the source storage system may be down for a prolonged period of time, but a user may still need to access their data. In such an example, the user may mount LUN 1218 as device 1220. Rather than merely recovering data, however, the user may make writes to the recovery snapshot 1216 through LUN 1218. The writes may be tracked, for example using metadata journal 1206 and data journal 1208. Once the source storage system is accessible again, a difference between the latest point in time of the volume at the storage array and the current data at recovery snapshot 1216 may be taken. The results of the difference may indicate which data has changed, and those changes may be communicated back to the source storage system. This may allow a user to continue to access and make changes to their data, even while the source storage system is down.


In one example block LUN 1218 may not be generated and mounted on host 1222. Instead, the recovery snapshot may be exposed as a network file system (“NFS”) share. Host 1222 may accessed the NFS share, retrieve data, and/or perform write operations.


In some examples, recovery snapshot 1216 may include a virtual machine disk (“VMDK”) file. The VMDK file may be, for example, accessed directly by an NFS mount and the virtual machine may boot using the VMDK file. Host 1222 may interact with the VMDK, and may make changes in the process. The VMDK may be transferred to the source side storage when it is available. In some examples, the transfer may occur while the VMDK is running.


Referring to FIG. 13, an example of a process to expose a recovery snapshot as a logical unit is a process 1300, which includes processing blocks 1301, 1302, 1304, 1306, 1308 and 1310. At block 1301, a recovery snapshot may be exposed as a LUN. This exposure could occur, for example, by generating a block LUN on top of the snapshot. In some examples, the snapshot resides on a deduplicated storage, and the block LUN is generated on that storage.


At block 1302, the LUN may be mounted on a host device. Once mounted, the host device may access and interact with the LUN as if it were a local drive. For example, the host device may make read and/or write requests to the LUN.


At block 1304, the deduplicated storage may receive I/Os for the LUN from the host device. These I/Os could be, for example, read and/or write requests.


At block 1306, the I/Os may be applied to the recovery snapshot to generate a modified recovery snapshot. For example, the I/Os could modify recovery snapshot 1216 to change data E to E′.


At block 1308, a difference between the modified recovery snapshot and a backup snapshot may be identified. This difference could be identified, for example, using API's native to the deduplicated storage device.


At block 1310, the difference may be transmitted to a recovery device. In some examples, the recovery device may be a source storage system. Additionally or alternatively, the difference may be transmitted in response to a request. For example, a user may access the system and request the difference between the modified recovery snapshot and a backup snapshot.


Referring to FIG. 13A, an example of a process to recover a logically corrupted source storage system is a process 1312, which includes processing blocks 1313, 1314, 1316, 1318, 1320, 1322, 1324, 1326 and 1328. In some examples, a user may wish to recover the data on the corrupted system. The user may identify a point-in-time where the system is believed to not be corrupt, and synthesize a snapshot comprising data between that point-in-time and the latest point on the storage system. This snapshot may be applied to the system to recover the corrupt data.


At block 1312, a request may be received from a user to recover data. The request may include a point-in-time identifying a time when the user believes the data was not corrupt. In some examples, the data between the point-in-time and the present time must be recovered because it is corrupt on the source storage system. Since the application I/Os are made to the deduplicated storage in real time, however, the data on that location may be correct.


At block 1314, a recovery snapshot may be synthesized for the point-in-time. This recovery snapshot could be, for example, synthesized in a manner substantially similar to the described above.


At block 1316, a difference may be identified between the recovery snapshot and the latest backup snapshot. The latest backup snapshot may be a snapshot for a point-in-time later than the recover snapshot. For example, if the recovery snapshot includes A, B, C, D, and E, and the latest backup snapshot includes A′, B, C′, D, and E, the difference may be A′ and C′. In some examples, the difference is identified on a deduplicated storage device and may use native APIs.


At block 1318, the difference may be added to a recovery list as entries in that recovery list. In some examples, the entries may be metadata associated with the difference. For example, the recovery list may include metadata entries for A′ and C′.


At block 1320, metadata entries in the latest journal file may be identified. The metadata entries may include metadata that is not included in the latest synthesized backup. For example, they may include application I/Os that arrived after the latest backup snapshot was synthesized. This identification process could occur, for example, at a journal processor.


At block 1322, the metadata journal entries may be added to the recovery list. For example, if the entries include A″ and D′, the new recovery list may include A″, C′, and D′. At block 1324, additional metadata entries may be identified in a data protection appliance memory. In some examples, these entries may be for application I/Os which have arrived at the data protection appliance, but have not yet been transmitted and/or written to the journal file.


At block 1326, the additional metadata entries may be added to the recovery list. For example, if the data protection appliance's memory includes B′, the recovery list may include A″, B′, and D′.


At block 1318 data associated with the metadata entries may be identified and transmitted back to the source storage system for recovery. If the metadata includes pointers, for example, the data pointed to by the pointers may be transmitted back to the source storage system.


For large, heavily used source storage systems, the volume of application and/or initialization I/Os may be too great for a single data protection appliance to maintain. If a data protection appliance is overburdened, journal files may not be up-to-date and valuable data may be lost if the source storage system fails. Using multiple data protection appliances may alleviate this risk.



FIGS. 14 and 15 show a system and method for generating backup snapshots using multiple data protection appliances. The system depicted in FIG. 15 includes data protection appliance 1400 and data protection appliance 1401. In some examples, each of these data protection appliances is responsible for protecting specific portions of a LUN in a source storage system. For example, data protection appliance 1400 may be responsible for protecting a first chunk of a LUN in a common storage array, and data protection appliance 1401 may be responsible for protecting a second chunk in a LUN of the common storage array. If an application I/O is made to the first chunk, it is received by data protection appliance 1400 and written to journal file 1406 using journal processor 1402. Similarly, if an application I/O is made to the second chunk it may be received by data protection appliance 1401 and written to journal file 1407 using journal processor 1403. In this manner, all of the application I/Os may be written to a journal using two data protection appliances.


While there are only two data protection appliances shown in FIG. 14, it should be appreciated that any number of data protection appliances is consistent with this disclosure. For example, the source storage system may be divided into five sections or chunks which are protected by five separate and distinct data protection appliances.


In some examples, there is no overlap between the chunks protected by different data protection appliances. For example, data protection appliance 1400 will not protect a chunk that is also protected by data protection appliance 1401. Alternatively, there may be protection overlap for redundancy.


In some examples, the chunks of the LUN may not consist of continuous parts. For instance, a first chunk may include 1 MB portions which start at an offset which is 2N MB, while chunk 2 includes 1 MB portions starting an offset of 2(N+1)MB.


Journals 1406 and 1407 may be separate journal files accessible only by their associated data protection appliance. Alternatively, they may be the same journal file accessible by both data protection appliances. Additionally, journals 1406 and 1407 may include both a metadata journal file and a data journal file, as described above. The metadata journal and data journals are not shown in FIG. 14 for ease of illustration, but they may still be part of journal file 1406 and 1407.


Journals files 1406 and 1407 may be used by deduplicated storage 1404 to synthesize snapshots for each of the regions their respective data protection appliances protect. For example, suppose source storage system includes data A, B, C, D, and E. Data protection appliance 1400 may be responsible for protecting A, B, and C, and data protection appliance 1401 may be responsible for protecting D and E. As a result, journal 1406 includes data and metadata for A, B, and C, but not D or E. Similarly, journal 1407 includes data and metadata for D and E, but not A, B, or C.


Since each journal only includes data associated with specific regions of the source storage system, neither journal alone can synthesize a complete backup snapshot. First snapshot 1408 may be synthesized using the data and metadata from journal file 1406.


Snapshot 1408 may include A′, B, and C′, but does not include data for D or E as shown by the hash marks in the Figure. Similarly, second snapshot 1409 includes data D′ and E′, but no data for A, B, or C. Neither of these snapshots therefore represents a complete backup snapshot of the source storage system.


Backup snapshot 1410 may be synthesized by merging first snapshot 1408 and second snapshot 1409. Backup snapshot 1410 may include a complete backup of the source storage system. In some examples, this synthesis may be accomplished by synthesis data from each snapshot 1408 and 1409 into snapshot 1410. Alternatively, first snapshot 1408 may be merged into second snapshot 1409 to generated backup snapshot 1410. Once backup snapshot 1410 is synthesized, snapshots 1408 and 1409 may be deleted to conserve space, or retained for redundancy.


In some examples, first snapshot 1408 and second snapshot 1409 may never be generated. Instead, backup snapshot 1410 may synthesize the necessary data directly from journal files 1406 and 1407.


Referring to FIG. 15, an example of a process to flow chart to synthesize a backup snapshot from data received from multiple data protection appliances is a process 1500, which includes processing blocks 1501, 1502, 1504, 1506 and 1508. At block 1501, a first set of sequential I/Os may be streamed from a data protection appliance to a deduplicated storage device. The I/Os could be, for example, sequential I/Os. In some examples, the I/Os may be for a specific section, chunk, or region of the source storage system.


At block 1502, a second set of sequential I/Os may be streamed from a second data protection appliance to the deduplicated storage. In some examples, these I/Os may be for a separate section of the source storage system than those streamed from the first data protection appliance. While the first set of sequential I/Os and the second set of sequential I/Os may be for different regions of a source storage system, such as a data array, they may both be made to the same source data system. In other words, the application I/Os may be made to a common source, which is divided into chunks protected by separate data protection appliances.


At block 1504, a first snapshot may be synthesized from the first journal file. This snapshot could be, for example, snapshot 1408. In some examples, the first snapshot only includes data included in the first journal.


At block 1506, a second snapshot may be synthesized from the second journal. This snapshot could be substantially similar to snapshot 1409, and may only include data from the second journal file.


At block 1508 the first snapshot and the second snapshot may be merged to generate a backup snapshot. This could be, for example, backup snapshot 1410.


Referring to FIG. 16, a replication system includes a data protection appliance (DPA) 1602, a storage array 1604, a backup device 1608 and a host 1610. The storage array includes a logical unit (LU1) 1612a and a logical unit (LU2) 1612b.


The DPA 1602 backs up the storage array 1604 to the backup device 1608. In particular, the backup device 1608 backs up data for each device in files at different points in time. For example, the logical unit 1612a is backed up to the backup device 1608 in files at different points in time (e.g., LU1 at a first time (T1) 1622a, LU1 at a second time (T2) 1622b and LU1 at a third time (T3) 1622c). In another example, the logical unit 1612b is backed up in files to the backup device 1608 at different points in time (e.g., LU2 at a first time (T1) 1642a, LU2 at a second time (T2) 1642b and LU2 at a third time (T3) 1642c).


The backup device 1608 also stores metadata information for each point-in-time. For example, the metadata stored FAST (Fully Automated Storage Tiering) statistics (e.g., information about the access pattern and active/non-active areas in a logical unit). In particular, the metadata includes data on each region such as how often is the region read and how often is the region written. In some examples, a region is a set of blocks of the volume. In some examples, a region may be 10 MB. For example, the metadata stores statistics of the active read blocks, the active write blocks and the blocks with no activity.


There is a metadata file for each point-in-time for each logical unit. For example, for the point-in-time data for logical unit 1612a at times T1, T2 and T3, 1622a-1622c there is metadata files 1632-1632c respectively and for the point-in-time data for logical unit 1612b at times T1, T2 and T3, 1642a-1642c there is metadata files 1642-1642c respectively.


Referring to FIG. 17, an example of a process to recover a logical unit is a process 1700. Process 1700 receives a notification to restore a logical unit at a point-in-time (1702). For example, a notification is received to restore data from the logical unit (LU1) 1612a at a second time (T2).


Process 1700 reads point-in-time metadata for the logical unit (1712). For example, if the logical unit (LU1) 1612a at a second time (T2) is to be restored then the T2 metadata for LU1 1632b is accessed.


Process 1700 restores active read areas of the logical unit (1728). In one example, the top 10% of the read active portions of the logical unit is restored. In other examples the top 5% of the read active portions of the logical unit are restored.


Process 1700 exposes the logical unit to the host (1732). For example, if the logical unit (LU1) 1612a is being restored, the host 1610 will now have access to the logical unit 1612a.


Process 1700 continues to restore data from the backup device (1734). For example, the remaining active read areas are restored followed by the write active areas of the logical unit. In other examples, a combination of read and write active areas are restored. In other examples, the areas of the logical disk with no activity are restored last.


Referring to FIG. 18, an example of a process to read data while while recovering a logical unit (LUN) (e.g., using the process 1700). Process 1800 receives a read request (1802). For example, an application request to access data from a LUN that is being a recovered. Process 1800 determines if the data may be read from the logical unit being recovered (1804). If process 1800 can read the data from the logical unit being recovered, process 1800 reads the data (1806). If process 1800 cannot read the data from the recovered logical unit, process 1800 moves the data from the backup device to the logical unit (1808). In other examples, the data is read directly from the backup device and sent to the read requestor.


Referring to FIG. 19, in one example, a computer 1900 includes a processor 1902, a volatile memory 1904, a non-volatile memory 1906 (e.g., hard disk) and the user interface (UI) 1908 (e.g., a graphical user interface, a mouse, a keyboard, a display, touch screen and so forth). The non-volatile memory 1906 stores computer instructions 1912, an operating system 1916 and data 1918. In one example, the computer instructions 1912 are executed by the processor 1902 out of volatile memory 1904 to perform all or part of the processes described herein (e.g., processes 400, 700, 712, 900, 1100, 1300, 1312, 1500, 1700 and 1800).


The processes described herein (e.g., processes 400, 700, 712, 900, 1100, 1300, 1312, 1500, 1700 and 1800) are not limited to use with the hardware and software of FIG. 19; they may find applicability in any computing or processing environment and with any type of machine or set of machines that is capable of running a computer program. The processes described herein may be implemented in hardware, software, or a combination of the two. The processes described herein may be implemented in computer programs executed on programmable computers/machines that each includes a processor, a non-transitory machine-readable medium or other article of manufacture that is readable by the processor (including volatile and non-volatile memory and/or storage elements), at least one input device, and one or more output devices. Program code may be applied to data entered using an input device to perform any of the processes described herein and to generate output information.


The system may be implemented, at least in part, via a computer program product, (e.g., in a non-transitory machine-readable storage medium such as, for example, a non-transitory computer-readable medium), for execution by, or to control the operation of, data processing apparatus (e.g., a programmable processor, a computer, or multiple computers). Each such program may be implemented in a high level procedural or object-oriented programming language to communicate with a computer system. However, the programs may be implemented in assembly or machine language. The language may be a compiled or an interpreted language and it may be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program may be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network. A computer program may be stored on a non-transitory machine-readable medium that is readable by a general or special purpose programmable computer for configuring and operating the computer when the non-transitory machine-readable medium is read by the computer to perform the processes described herein. For example, the processes described herein may also be implemented as a non-transitory machine-readable storage medium, configured with a computer program, where upon execution, instructions in the computer program cause the computer to operate in accordance with the processes. A non-transitory machine-readable medium may include but is not limited to a hard drive, compact disc, flash memory, non-volatile memory, volatile memory, magnetic diskette and so forth but does not include a transitory signal per se.


The processes described herein are not limited to the specific examples described. For example, the processes 400, 700, 712, 900, 1100, 1300, 1312, 1500, 1700 and 1800 are not limited to the specific processing order of FIGS. 4, 7, 7A, 9, 11, 13, 13A, 15, 17 and 18, respectively. Rather, any of the processing blocks of FIGS. 4, 7, 7A, 9, 11, 13, 13A, 15, 17 and 18 may be re-ordered, combined or removed, performed in parallel or in serial, as necessary, to achieve the results set forth above.


The processing blocks (for example, in the processes 400, 700, 712, 900, 1100, 1300, 1312, 1500, 1700 and 1800) associated with implementing the system may be performed by one or more programmable processors executing one or more computer programs to perform the functions of the system. All or part of the system may be implemented as, special purpose logic circuitry (e.g., an FPGA (field-programmable gate array) and/or an ASIC (application-specific integrated circuit)). All or part of the system may be implemented using electronic hardware circuitry that include electronic devices such as, for example, at least one of a processor, a memory, a programmable logic device or a logic gate.


Elements of different embodiments described herein may be combined to form other embodiments not specifically set forth above. Various elements, which are described in the context of a single embodiment, may also be provided separately or in any suitable subcombination. Other embodiments not specifically described herein are also within the scope of the following claims.

Claims
  • 1. A method comprising: backing up a logical disk at a first point-in-time as a first backup file to a backup device using a data protection appliance coupled to the backup device, the logical disk being stored on a storage array coupled to the data protection appliance;generating a first metadata file at the backup device, the first metadata file including metadata indicating, with respect to regions of the logical disk at the first-point-in-time, a frequency a region is read and a frequency a region is written;backing up the logical disk at a second point-in-time to the backup device as a second backup file using the data protection appliance;generating a second metadata file at the backup device, the second metadata file including metadata indicating, with respect to regions of the logical disk at the second point-in-time, a frequency a region is read and a frequency a region is written;receiving a notification to restore the logical disk to the first point-in-time;reading the metadata from the first metadata file for the logical disk to restore to the first point in time;restoring active read areas from the first backup file to the logical disk identified in the metadata from the first metadata file; andexposing the logical disk to a host after restoring the active read areas of the logical disk;receiving a read request to read data from the logical disk;determining if a portion of the logical disk that includes the data has been restored;restoring the data if the data has not been restored in the logical disk by moving the data from the first back-up file at the backup device to the logical disk at the storage array; andreading the data from the logical disk at the storage array if the data has been restored;wherein the backup device stores metadata files for each point in time for each logical disk of the storage array.
  • 2. The method of claim 1, further comprising continuing restoring the logical disk used based on the metadata after exposing the logical disk to the host.
  • 3. The method of claim 2, wherein continuing restoring the logical disk comprises restoring active reads areas of the logical disk first and active write areas of the logical disk second.
  • 4. The method of claim 2, wherein continuing restoring the logical disk comprises restoring areas with no activity last.
  • 5. The method of claim 1, wherein restoring active read areas to the logical disk identified in the metadata comprises restoring at least the top 5% of the active read areas of the logical disk identified in the metadata.
  • 6. The method of claim 1, wherein the metadata further includes storage tiering statistics relating to access patterns.
  • 7. The method of claim 1, wherein the metadata further includes storage tiering statistics relating to active and non-active areas in the logical disk.
  • 8. An apparatus, comprising: electronic hardware circuitry configured to: back up a logical disk at a first point-in-time as a first backup file to a backup device using a data protection appliance coupled to the backup device, the logical disk being stored on a storage array coupled to the data protection appliance;generate a first metadata file at the backup device, the first metadata file including metadata indicating, with respect to regions of the logical disk at the first-point-in-time, a frequency a region is read and a frequency a region is written;back up the logical disk at a second point-in-time to the backup device as a second backup file using the data protection appliance;generate a second metadata file at the backup device, the second metadata file including metadata indicating, with respect to regions of the logical disk at the second point-in-time, a frequency a region is read and a frequency a region is written;receive a notification to restore the logical disk to the first point-in-time;read the metadata from the first metadata file for the logical disk to restore to the first point in time;restore active read areas from the first backup file to the logical disk identified in the metadata from the first metadata file; andexpose the logical disk to a host after restoring the active read areas of the logical disk;receive a read request to read data from the logical disk;determine if a portion of the logical disk that includes the data has been restored;restore the data if the data has not been restored in the logical disk by moving the data from the first back-up file at the backup device to the logical disk at the storage array; andread the data from the logical disk at the storage array if the data has been restored;wherein the backup device stores metadata files for each point in time for each logical disk of the storage array.
  • 9. The apparatus of claim 8, wherein the circuitry comprises at least one of a processor, a memory, a programmable logic device or a logic gate.
  • 10. The apparatus of claim 8, further comprising circuitry configured to continue restoring the logical disk used based on the metadata after exposing the logical disk to the host.
  • 11. The apparatus of claim 10, wherein the circuitry configured to continue restoring the logical disk comprises circuitry configured to restore active reads areas of the logical disk first and active write areas of the logical disk second.
  • 12. The apparatus of claim 10, wherein the circuitry configured to continue restoring the logical disk comprises circuitry configured to restore areas with no activity last.
  • 13. The apparatus of claim 8, wherein the circuitry configured to restore active read areas to the logical disk identified in the metadata comprises circuitry configured to restore at least the top 5% of the active read areas of the logical disk identified in the metadata.
  • 14. An article comprising: a non-transitory computer-readable medium that stores computer-executable instructions, the instructions causing a machine to: back up a logical disk at a first point-in-time as a first backup file to a backup device using a data protection appliance coupled to the backup device, the logical disk being stored on a storage array coupled to the data protection appliance;generate a first metadata file at the backup device, the first metadata file including metadata indicating, with respect to regions of the logical disk at the first-point-in-time, a frequency a region is read and a frequency a region is written;back up the logical disk at a second point-in-time to the backup device as a second backup file using the data protection appliance;generate a second metadata file at the backup device, the second metadata file including metadata indicating, with respect to regions of the logical disk at the second point-in-time, a frequency a region is read and a frequency a region is written;receive a notification to restore the logical disk to the first point-in-time;read the metadata from the first metadata file for the logical disk to restore to the first point in time;restore active read areas from the first backup file to the logical disk identified in the metadata from the first metadata file; andexpose the logical disk to a host after restoring the active read areas of the logical disk;receive a read request to read data from the logical disk;determine if a portion of the logical disk that includes the data has been restored;restore the data if the data has not been restored in the logical disk by moving the data from the first back-up file at the backup device to the logical disk at the storage array; andread the data from the logical disk at the storage array if the data has been restored;wherein the backup device stores metadata files for each point in time for each logical disk of the storage array.
  • 15. The article of claim 14, further comprising instructions causing the machine to continue restoring the logical disk used based on the metadata after exposing the logical disk to the host.
  • 16. The article of claim 15, wherein the instructions causing the machine to continue restoring the logical disk comprises instructions causing the machine to restore active reads areas of the logical disk first and active write areas of the logical disk second.
  • 17. The article of claim 15, wherein the instructions causing the machine to continue restoring the logical disk comprises instructions causing the machine to restore areas with no activity last.
  • 18. The article of claim 14, wherein the instructions causing the machine to restore active read areas to the logical disk identified in the metadata comprises instructions causing the machine to restore at least the top 5% of the active read areas of the logical disk identified in the metadata.
US Referenced Citations (353)
Number Name Date Kind
4933901 Tai et al. Jun 1990 A
5170480 Mohan et al. Dec 1992 A
5249053 Jain Sep 1993 A
5388254 Betz et al. Feb 1995 A
5499367 Bamford et al. Mar 1996 A
5526397 Lohman Jun 1996 A
5864837 Maimone Jan 1999 A
5990899 Whitten Jan 1999 A
5879459 Gadgil et al. Mar 1999 A
6042652 Hyun et al. Mar 2000 A
6065018 Beier et al. May 2000 A
6143659 Leem Nov 2000 A
6148340 Bittinger et al. Nov 2000 A
6174377 Doering et al. Jan 2001 B1
6174809 Kang et al. Jan 2001 B1
6203613 Gates et al. Mar 2001 B1
6260125 McDowell Jul 2001 B1
6270572 Kim et al. Aug 2001 B1
6272534 Guha Aug 2001 B1
6287965 Kang et al. Sep 2001 B1
6467023 DeKoning et al. Oct 2002 B1
6574657 Dickinson Jun 2003 B1
6621493 Whitten Sep 2003 B1
6804676 Bains, II Oct 2004 B1
6947981 Lubbers et al. Sep 2005 B2
7043610 Horn et al. May 2006 B2
7051126 Franklin May 2006 B1
7076620 Takeda et al. Jul 2006 B2
7111197 Kingsbury et al. Sep 2006 B2
7117327 Hirakawa et al. Oct 2006 B2
7120768 Mizuno et al. Oct 2006 B2
7130975 Suishu et al. Oct 2006 B2
7139927 Park et al. Nov 2006 B2
7146439 Ofer et al. Dec 2006 B1
7159088 Hirakawa et al. Jan 2007 B2
7167963 Hirakawa et al. Jan 2007 B2
7203741 Marco et al. Apr 2007 B2
7222136 Brown et al. May 2007 B1
7296008 Passerini et al. Nov 2007 B2
7328373 Kawamura et al. Feb 2008 B2
7353335 Kawamura Apr 2008 B2
7360113 Anderson et al. Apr 2008 B2
7426618 Vu et al. Sep 2008 B2
7516287 Ahal et al. Apr 2009 B2
7519625 Honami et al. Apr 2009 B2
7519628 Leverett Apr 2009 B1
7546485 Cochran et al. Jun 2009 B2
7577867 Lewin et al. Aug 2009 B2
7590887 Kano Sep 2009 B2
7606940 Yamagami Oct 2009 B2
7627612 Ahal et al. Dec 2009 B2
7627687 Ahal et al. Dec 2009 B2
7719443 Natanzon May 2010 B1
7757057 Sangapu et al. Jul 2010 B2
7769931 Angelone et al. Aug 2010 B1
7774565 Lewin et al. Aug 2010 B2
7797358 Ahal et al. Sep 2010 B1
7840536 Ahal et al. Nov 2010 B1
7840662 Natanzon Nov 2010 B1
7844856 Ahal et al. Nov 2010 B1
7849361 Ahal et al. Dec 2010 B2
7860836 Natanzon et al. Dec 2010 B1
7882286 Natanzon et al. Feb 2011 B1
7904681 Bappe et al. Mar 2011 B1
7908515 Schechner et al. Mar 2011 B1
7934262 Natanzon et al. Apr 2011 B1
7945640 Van Tine May 2011 B1
7958372 Natanzon Jun 2011 B1
7962567 Sandstrom et al. Jun 2011 B1
8037162 Marco et al. Oct 2011 B2
8041940 Natanzon et al. Oct 2011 B1
8060713 Natanzon Nov 2011 B1
8060714 Natanzon Nov 2011 B1
8103937 Natanzon et al. Jan 2012 B1
8108634 Natanzon et al. Jan 2012 B1
8140821 Raizen et al. Mar 2012 B1
8150936 Liu et al. Apr 2012 B2
8166314 Raizen et al. Apr 2012 B1
8205009 Hellen et al. Jun 2012 B2
8214612 Natanzon Jul 2012 B1
8250149 Marco et al. Aug 2012 B2
8271441 Natanzon et al. Sep 2012 B1
8271447 Natanzon et al. Sep 2012 B1
8332687 Natanzon et al. Dec 2012 B1
8335761 Natanzon Dec 2012 B1
8335771 Natanzon et al. Dec 2012 B1
8341115 Natanzon et al. Dec 2012 B1
8370648 Natanzon Feb 2013 B1
8380885 Natanzon Feb 2013 B1
8392680 Natanzon et al. Mar 2013 B1
8429362 Natanzon et al. Apr 2013 B1
8433869 Natanzon et al. Apr 2013 B1
8438135 Natanzon et al. May 2013 B1
8464101 Natanzon et al. Jun 2013 B1
8478955 Natanzon et al. Jul 2013 B1
8495304 Natanzon et al. Jul 2013 B1
8510279 Natanzon et al. Aug 2013 B1
8521691 Natanzon Aug 2013 B1
8521694 Natanzon Aug 2013 B1
8543609 Natanzon Sep 2013 B1
8583885 Natanzon Nov 2013 B1
8600945 Natanzon et al. Dec 2013 B1
8601085 Ives et al. Dec 2013 B1
8627012 Derbeko et al. Jan 2014 B1
8683592 Dotan et al. Mar 2014 B1
8694700 Natanzon et al. Apr 2014 B1
8706700 Natanzon et al. Apr 2014 B1
8712962 Natanzon et al. Apr 2014 B1
8719497 Don et al. May 2014 B1
8725691 Natanzon May 2014 B1
8725692 Natanzon et al. May 2014 B1
8726066 Natanzon et al. May 2014 B1
8738813 Natanzon et al. May 2014 B1
8745004 Natanzon et al. Jun 2014 B1
8751828 Raizen et al. Jun 2014 B1
8769336 Natanzon et al. Jul 2014 B1
8805786 Natanzon Aug 2014 B1
8806161 Natanzon Aug 2014 B1
8825848 Dotan et al. Sep 2014 B1
8832399 Natanzon et al. Sep 2014 B1
8850143 Natanzon Sep 2014 B1
8850144 Natanzon et al. Sep 2014 B1
8862546 Natanzon et al. Oct 2014 B1
8892835 Natanzon et al. Nov 2014 B1
8898112 Natanzon et al. Nov 2014 B1
8898409 Natanzon et al. Nov 2014 B1
8898515 Natanzon Nov 2014 B1
8898519 Natanzon et al. Nov 2014 B1
8914595 Natanzon Dec 2014 B1
8924668 Natanzon Dec 2014 B1
8930500 Marco et al. Jan 2015 B2
8930947 Derbeko et al. Jan 2015 B1
8935498 Natanzon Jan 2015 B1
8949180 Natanzon et al. Feb 2015 B1
8954673 Natanzon et al. Feb 2015 B1
8954796 Cohen et al. Feb 2015 B1
8959054 Natanzon Feb 2015 B1
8977593 Natanzon et al. Mar 2015 B1
8977826 Meiri et al. Mar 2015 B1
8996460 Frank et al. Mar 2015 B1
8996461 Natanzon et al. Mar 2015 B1
8996827 Natanzon Mar 2015 B1
9003138 Natanzon et al. Apr 2015 B1
9026696 Natanzon et al. May 2015 B1
9031913 Natanzon May 2015 B1
9032160 Natanzon et al. May 2015 B1
9037818 Natanzon et al. May 2015 B1
9063994 Natanzon et al. Jun 2015 B1
9069479 Natanzon Jun 2015 B1
9069709 Natanzon et al. Jun 2015 B1
9081754 Natanzon et al. Jul 2015 B1
9081842 Natanzon et al. Jul 2015 B1
9087008 Natanzon Jul 2015 B1
9087112 Natanzon et al. Jul 2015 B1
9104529 Derbeko et al. Aug 2015 B1
9110914 Frank et al. Aug 2015 B1
9116811 Derbeko et al. Aug 2015 B1
9128628 Natanzon et al. Sep 2015 B1
9128855 Natanzon et al. Sep 2015 B1
9134914 Derbeko et al. Sep 2015 B1
9135119 Natanzon et al. Sep 2015 B1
9135120 Natanzon Sep 2015 B1
9146878 Cohen et al. Sep 2015 B1
9152339 Cohen et al. Oct 2015 B1
9152578 Saad et al. Oct 2015 B1
9152814 Natanzon Oct 2015 B1
9158578 Derbeko et al. Oct 2015 B1
9158630 Natanzon Oct 2015 B1
9160526 Raizen et al. Oct 2015 B1
9177670 Derbeko et al. Nov 2015 B1
9189339 Cohen et al. Nov 2015 B1
9189341 Natanzon et al. Nov 2015 B1
9201736 Moore et al. Dec 2015 B1
9223659 Natanzon et al. Dec 2015 B1
9225529 Natanzon et al. Dec 2015 B1
9235481 Natanzon et al. Jan 2016 B1
9235524 Derbeko et al. Jan 2016 B1
9235632 Natanzon Jan 2016 B1
9244997 Natanzon et al. Jan 2016 B1
9256605 Natanzon Feb 2016 B1
9274718 Natanzon et al. Mar 2016 B1
9275063 Natanzon Mar 2016 B1
9286052 Solan et al. Mar 2016 B1
9305009 Bono et al. Apr 2016 B1
9323750 Natanzon et al. Apr 2016 B2
9330155 Bono et al. May 2016 B1
9336094 Wolfson et al. May 2016 B1
9336230 Natanzon May 2016 B1
9367260 Natanzon Jun 2016 B1
9378096 Erel et al. Jun 2016 B1
9378219 Bono et al. Jun 2016 B1
9378261 Bono et al. Jun 2016 B1
9383937 Frank et al. Jul 2016 B1
9389800 Natanzon et al. Jul 2016 B1
9405481 Cohen et al. Aug 2016 B1
9405684 Derbeko et al. Aug 2016 B1
9405765 Natanzon Aug 2016 B1
9411535 Shemer et al. Aug 2016 B1
9459804 Natanzon et al. Oct 2016 B1
9460028 Raizen et al. Oct 2016 B1
9471579 Natanzon Oct 2016 B1
9477407 Marshak et al. Oct 2016 B1
9501542 Natanzon Nov 2016 B1
9507732 Natanzon et al. Nov 2016 B1
9507845 Natanzon et al. Nov 2016 B1
9514138 Natanzon et al. Dec 2016 B1
9524218 Veprinsky et al. Dec 2016 B1
9529885 Natanzon et al. Dec 2016 B1
9535800 Natanzon et al. Jan 2017 B1
9535801 Natanzon et al. Jan 2017 B1
9547459 BenHanokh et al. Jan 2017 B1
9547591 Natanzon et al. Jan 2017 B1
9552405 Moore et al. Jan 2017 B1
9557921 Cohen et al. Jan 2017 B1
9557925 Natanzon Jan 2017 B1
9563517 Natanzon et al. Feb 2017 B1
9563684 Natanzon et al. Feb 2017 B1
9575851 Natanzon et al. Feb 2017 B1
9575857 Natanzon Feb 2017 B1
9575894 Natanzon et al. Feb 2017 B1
9582382 Natanzon et al. Feb 2017 B1
9588703 Natanzon et al. Mar 2017 B1
9588847 Natanzon et al. Mar 2017 B1
9594822 Natanzon et al. Mar 2017 B1
9600377 Cohen et al. Mar 2017 B1
9619543 Natanzon et al. Apr 2017 B1
9632881 Natanzon Apr 2017 B1
9665305 Natanzon et al. May 2017 B1
9710177 Natanzon Jul 2017 B1
9720618 Panidis et al. Aug 2017 B1
9722788 Natanzon et al. Aug 2017 B1
9727429 Moore et al. Aug 2017 B1
9733969 Derbeko et al. Aug 2017 B2
9737111 Lustik Aug 2017 B2
9740572 Natanzon et al. Aug 2017 B1
9740573 Natanzon Aug 2017 B1
9740880 Natanzon et al. Aug 2017 B1
9749300 Cale et al. Aug 2017 B1
9772789 Natanzon et al. Sep 2017 B1
9798472 Natanzon et al. Oct 2017 B1
9798490 Natanzon Oct 2017 B1
9804934 Natanzon et al. Oct 2017 B1
9811431 Natanzon et al. Nov 2017 B1
9823865 Natanzon et al. Nov 2017 B1
9823973 Natanzon Nov 2017 B1
9832261 Don et al. Nov 2017 B2
9846698 Panidis et al. Dec 2017 B1
9875042 Natanzon et al. Jan 2018 B1
9875162 Panidis et al. Jan 2018 B1
9880777 Bono et al. Jan 2018 B1
9881014 Bono et al. Jan 2018 B1
9910620 Veprinsky et al. Mar 2018 B1
9910621 Golan et al. Mar 2018 B1
9910735 Natanzon Mar 2018 B1
9910739 Natanzon et al. Mar 2018 B1
9917854 Natanzon et al. Mar 2018 B2
9921955 Derbeko et al. Mar 2018 B1
9933957 Cohen et al. Apr 2018 B1
9934302 Cohen et al. Apr 2018 B1
9940205 Natanzon Apr 2018 B2
9940460 Derbeko et al. Apr 2018 B1
9946649 Natanzon et al. Apr 2018 B1
9959061 Natanzon et al. May 2018 B1
9965306 Natanzon et al. May 2018 B1
9990256 Natanzon Jun 2018 B1
9996539 Natanzon Jun 2018 B1
10007626 Saad et al. Jun 2018 B1
10019194 Baruch et al. Jul 2018 B1
10025931 Natanzon et al. Jul 2018 B1
10031675 Veprinsky et al. Jul 2018 B1
10031690 Panidis et al. Jul 2018 B1
10031692 Elron et al. Jul 2018 B2
10031703 Natanzon et al. Jul 2018 B1
10037251 Bono et al. Jul 2018 B1
10042579 Natanzon Aug 2018 B1
10042751 Veprinsky et al. Aug 2018 B1
10055146 Natanzon et al. Aug 2018 B1
10055148 Natanzon et al. Aug 2018 B1
10061666 Natanzon et al. Aug 2018 B1
10067694 Natanzon et al. Sep 2018 B1
10067837 Natanzon et al. Sep 2018 B1
10078459 Natanzon et al. Sep 2018 B1
10082980 Cohen et al. Sep 2018 B1
10083093 Natanzon et al. Sep 2018 B1
10095489 Lieberman et al. Oct 2018 B1
10101943 Ayzenberg et al. Oct 2018 B1
10108356 Natanzon et al. Oct 2018 B1
10108507 Natanzon Oct 2018 B1
10108645 Bigman et al. Oct 2018 B1
10114581 Natanzon et al. Oct 2018 B1
10120787 Shemer et al. Nov 2018 B1
10120925 Natanzon et al. Nov 2018 B1
10126946 Natanzon et al. Nov 2018 B1
10133874 Natanzon et al. Nov 2018 B1
10140039 Baruch et al. Nov 2018 B1
10146436 Natanzon et al. Dec 2018 B1
10146639 Natanzon et al. Dec 2018 B1
10146675 Shemer et al. Dec 2018 B1
10146961 Baruch et al. Dec 2018 B1
10148751 Natanzon Dec 2018 B1
10152246 Lieberman et al. Dec 2018 B1
10152267 Ayzenberg et al. Dec 2018 B1
10152384 Amit et al. Dec 2018 B1
10157014 Panidis et al. Dec 2018 B1
10185583 Natanzon et al. Jan 2019 B1
10191677 Natanzon et al. Jan 2019 B1
10191687 Baruch et al. Jan 2019 B1
10191755 Natanzon et al. Jan 2019 B1
10203904 Natanzon et al. Feb 2019 B1
10210073 Baruch et al. Feb 2019 B1
10223007 Natanzon et al. Mar 2019 B1
10223023 Natanzon et al. Mar 2019 B1
10223131 Lieberman et al. Mar 2019 B1
10229006 Natanzon et al. Mar 2019 B1
10229056 Panidis et al. Mar 2019 B1
20020129168 Kanai et al. Sep 2002 A1
20030048842 Fourquin et al. Mar 2003 A1
20030061537 Cha et al. Mar 2003 A1
20030110278 Anderson Jun 2003 A1
20030145317 Chamberlain Jul 2003 A1
20030196147 Hirata et al. Oct 2003 A1
20040205092 Longo et al. Oct 2004 A1
20040250032 Ji et al. Dec 2004 A1
20040254964 Kodama et al. Dec 2004 A1
20050015663 Armangau et al. Jan 2005 A1
20050028022 Amano Feb 2005 A1
20050049924 DeBettencourt et al. Mar 2005 A1
20050172092 Lam et al. Aug 2005 A1
20050273655 Chow et al. Dec 2005 A1
20060031647 Hirakawa et al. Feb 2006 A1
20060047996 Anderson et al. Mar 2006 A1
20060064416 Sim-Tang Mar 2006 A1
20060107007 Hirakawa et al. May 2006 A1
20060117211 Matsunami et al. Jun 2006 A1
20060161810 Bao Jul 2006 A1
20060179343 Kitamura Aug 2006 A1
20060195670 Iwamura et al. Aug 2006 A1
20060212462 Hellen et al. Sep 2006 A1
20070055833 Vu et al. Mar 2007 A1
20070162513 Lewin et al. Jul 2007 A1
20070180304 Kano Aug 2007 A1
20070198602 Ngo et al. Aug 2007 A1
20070198791 Iwamura et al. Aug 2007 A1
20070220311 Lewin et al. Sep 2007 A1
20070266053 Ahal et al. Nov 2007 A1
20080082591 Ahal et al. Apr 2008 A1
20080082592 Ahal et al. Apr 2008 A1
20080082770 Ahal et al. Apr 2008 A1
20110307675 Kano Dec 2011 A1
20120272030 Jennas et al. Oct 2012 A1
20140068207 Aslot Mar 2014 A1
20150081640 Long Mar 2015 A1
20150286542 Dain Oct 2015 A1
Foreign Referenced Citations (2)
Number Date Country
1 154 356 Nov 2001 EP
WO 00 45581 Aug 2000 WO
Non-Patent Literature Citations (52)
Entry
Response to Final Office Action dated May 19, 2015 corresponding to U.S. Appl. No. 13/836,095; Response filed Aug. 3, 2015; 9 Pages.
Final Office Action dated May 19, 2015 corresponding to U.S. Appl. No. 13/836,095; 22 Pages.
Response to Office Action dated Nov. 7, 2014 corresponding to U.S. Appl. No. 13/836,095; Response filed Apr. 7, 2015; 11 Pages.
Gibson, “Five Point Plan Lies at the Heart of Compression Technology;” Apr. 29, 1991; p. 1.
Souies, “Metadata Efficiency in Versioning File Systems;” 2003; pp. 1-6.
AIX System Management Concepts: Operating Systems and Devices; May 2000; pp. 1-280.
Soules et al.; “Metadata Efficiency in a Comprehensive Versioning File System;” May 2002; CMU-CS-02-145; School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213; 33 pages.
Linux Filesystems; Sams Publishing; 2002; pp. 17-22 and 67-71.
Bunyan, “Multiplexing in a BrightStor® ARCserve® Backup Release 11;” Mar. 2004; pp. 1-4.
Marks, “Network Computing,” Feb. 2, 2006; pp. 1-8.
Hill, “Network Computing;” Jun. 8, 2006; pp, 1-9.
Microsoft Computer Dictionary; 2002; Press Fifth Edition; 2 pages.
Retrieved from http://en.wikipedia.org/wiki/DEFLATE; Deflate; Jun. 19, 2008; pp. 1-6.
Retrieved from http://en.wikipedia.org/wiki/Huffman_coding; Huffman Coding; Jun. 8, 2008; pp. 1-11.
Retrieved from http://en.wikipedia.org/wiki/LZ77; LZ77 and LZ78; Jun. 17, 2008; pp. 1-2.
Office Acton dated Nov. 7, 2014 for U.S. Appl. No. 13/836,095, filed Mar. 15, 2013 24 pages.
Saar Cohen, et al.; “Synchronization of Asymmetric Active-Active, Asynchronously-Protected Storage;” U.S. Appl. No. 13/836,095, filed Mar. 15, 2013 63 pages.
U.S. Appl. No. 11/609,560 downloaded Jan. 7, 2015 265 pages.
U.S. Appl. No. 12/057,652 downloaded Jan. 7, 2015 296 pages.
U.S. Appl. No. 11/609,561 downloaded Jan. 7, 2015 219 pages.
U.S. Appl. No. 11/356,920 downloaded Jan. 7, 2015 272 pages.
U.S. Appl. No. 10/512,687 downloaded Jan. 7, 2015 Part 1 of 2; 300 pages.
U.S. Appl. No. 10/512,687 downloaded Jan. 7, 2015 Part 2 of 2; 254 pages.
U.S. Appl. No. 11/536,233 downloaded Jan. 7, 2015 256 pages.
U.S. Appl. No. 11/536,215 downloaded Jan. 7, 2015 172 pages.
U.S. Appl. No. 11/536,160 downloaded Jan. 7, 2015 230 pages.
U.S. Appl. No. 11/964,168 downloaded Jan. 7, 2015 222 pages.
U.S. Appl. No. 13/836,095 downloaded Jan. 13, 2015 Part 1 of 4; 350 pages.
U.S. Appl. No. 13/836,095 downloaded Jan. 13, 2015 Part 2 of 4; 350 pages.
U.S. Appl. No. 13/836,095 downloaded Jan. 13, 2015 Part 3 of 4; 350 pages.
U.S. Appl. No. 13/836,095 downloaded Jan. 13, 2015 Part 4 of 4; 208 pages.
Notice of Allowance dated Aug. 20, 2015 corresponding to U.S. Appl. No. 13/836,095; 9 Pages.
U.S. Appl. No. 14/496,790, filed Sep. 25, 2014, Cohen et al.
U.S. Appl. No. 14/559,036, filed Dec. 3, 2014, Natanzon et al.
U.S. Appl. No. 14/753,389, filed Jun. 29, 2015, Nir et al.
U.S. Appl. No. 14/976,719, filed Dec. 21, 2015, Natanzon.
U.S. Appl. No. 14/978,378, filed Dec. 22, 2015, Bigman et al.
U.S. Appl. No. 15/085,148, filed Mar. 30, 2016, Baruch et al.
U.S. Appl. No. 15/274,362, filed Sep. 23, 2016, Baruch et al.
U.S. Appl. No. 15/275,768, filed Sep. 26, 2016, Natanzon et al.
U.S. Appl. No. 15/275,756, filed Sep. 26, 2016, Natanzon et al.
U.S. Appl. No. 15/379,940, filed Dec. 15, 2016, Baruch et al.
U.S. Appl. No. 15/386,754, filed Dec. 21, 2016, Shemer et al.
U.S. Appl. No. 15/380,013, filed Dec. 15, 2016, Baruch et al.
U.S. Appl. No. 15/390,996, filed Dec. 27, 2016, Natanzon et al.
U.S. Appl. No. 15/391,030, filed Dec. 27, 2016, Shemer et al.
U.S. Appl. No. 15/970,243, May 3, 2018, Schneider et al.
U.S. Appl. No. 16/052,037, filed Aug. 1, 2018, Schneider et al.
U.S. Appl. No. 16/048,763, filed Jul. 30, 2018, Schneider et al.
U.S. Appl. No. 16/050,400, filed Jul. 31, 2018, Alkalay et al.
U.S. Appl. No. 16/179,295, filed Nov. 2, 2018, Natanzon et al.
U.S. Appl. No. 16/261,174, filed Jan. 29, 2019, Natanzon et al.