Abstract: Snapshots from a first LSU (R1) on a first storage system (A1) may be replicated to a second replica LSU (R2) on a second storage system (A2), for example, concurrently to remotely replicating (e.g., synchronously) write operations for R1 to R2. A process, P, on A1 executing the replication of the snapshots from R1 to R2 may be a separate process than the one or more processes on A1 executing remote replication of write operations for R1 to R2. During a consistency window on A1, outstanding write operations for R1 at the time the consistency window opened may be logged, and a pair of snapshots, SS11 and SS12 may be activated on R1 and R2, respectively. After the consistency window has closed, the SS12 snapshot metadata and snapshot data may be updated based on the outstanding write operations.

Abstract: Snapshots may be used to implement remote replication, for example, asynchronously, between a first storage system, A1, and a second storage system, A2. A1 may take a first snapshot, SS21, of a logical storage unit, R1. After the snapshot SS21 it taken, any dependent write operations associated with SS21 may be reconciled, and differences between SS21 and the last snapshot for R1, SS11, may be determined and recorded as a difference set. One or more replication instructions for R1 that include the write operations (or data and metadata corresponding thereto) of the difference set may be sent from A1 to A2. A2 may apply the differences to R2, and then take (activate) a snapshot of R2, SS22, which is a replica of SS21. After A2 activates SS22, A2 may send an acknowledgement to A1 indicating that SS22 has been activated, and A2 may take a next snapshot of R1.

Abstract: Data may be replicated from a host storage system to a target storage system. It may be determined to replicate a first logical storage element on the source storage system to a second logical storage element on the target storage system, wherein the first logical storage element defines a first data portion having a first value. It may be determined that a third logical storage element on the target storage system defines a second data portion having the first value. The first logical storage element may be replicated to the second logical storage element by establishing a deduplication relationship between the second logical storage element and the third logical storage element on the target storage system without transmitting the first data portion from the source storage system to the target storage system.

Abstract: Data may be replicated from a host storage system to a target storage system. It may be determined to replicate a first logical storage element on the source storage system to a second logical storage element on the target storage system, wherein the first logical storage element defines a first data portion having a first value. It may be determined that a third logical storage element on the target storage system defines a second data portion having the first value. The first logical storage element may be replicated to the second logical storage element by establishing a deduplication relationship between the second logical storage element and the third logical storage element on the target storage system without transmitting the first data portion from the source storage system to the target storage system.

Abstract: Data may be replicated from a host storage system to a target storage system. It may be determined to replicate a first logical storage element on the source storage system to a second logical storage element on the target storage system, wherein the first logical storage element defines a first data portion having a first value. It may be determined that a third logical storage element on the target storage system defines a second data portion having the first value. The first logical storage element may be replicated to the second logical storage element by establishing a deduplication relationship between the second logical storage element and the third logical storage element on the target storage system without transmitting the first data portion from the source storage system to the target storage system.

Abstract: Snapshots from a first LSU (R1) on a first storage system (A1) may be replicated to a second replica LSU (R2) on a second storage system (A2), for example, concurrently to remotely replicating (e.g., synchronously) write operations for R1 to R2. A process, P, on A1 executing the replication of the snapshots from R1 to R2 may be a separate process than the one or more processes on A1 executing remote replication of write operations for R1 to R2. During a consistency window on A1, outstanding write operations for R1 at the time the consistency window opened may be logged, and a pair of snapshots, SS11 and SS12 may be activated on R1 and R2, respectively. After the consistency window has closed, the SS12 snapshot metadata and snapshot data may be updated based on the outstanding write operations.

Abstract: Snapshots may be used to implement remote replication, for example, asynchronously, between a first storage system, A1, and a second storage system, A2. A1 may take a first snapshot, SS21, of a logical storage unit, R1. After the snapshot SS21 it taken, any dependent write operations associated with SS21 may be reconciled, and differences between SS21 and the last snapshot for R1, SS11, may be determined and recorded as a difference set. One or more replication instructions for R1 that include the write operations (or data and metadata corresponding thereto) of the difference set may be sent from A1 to A2. A2 may apply the differences to R2, and then take (activate) a snapshot of R2, SS22, which is a replica of SS21. After A2 activates SS22, A2 may send an acknowledgement to A1 indicating that SS22 has been activated, and A2 may take a next snapshot of R1.

Abstract: Data may be replicated from a host storage system to a target storage system. It may be determined to replicate a first logical storage element on the source storage system to a second logical storage element on the target storage system, wherein the first logical storage element defines a first data portion having a first value. It may be determined that a third logical storage element on the target storage system defines a second data portion having the first value. The first logical storage element may be replicated to the second logical storage element by establishing a deduplication relationship between the second logical storage element and the third logical storage element on the target storage system without transmitting the first data portion from the source storage system to the target storage system.

Abstract: First information for a first event of a computer system is captured, including first event parameters. A first event key is generated, based on the first event parameters. The first information and first key are both stored as a first event in a storage structure, in which the first event key indexes the first event and the captured first information. When second information is captured for a second event, a second event key is generated based on second event parameters of the captured second event. If the second event key matches the first event key, then the first event stored in the event collection system is dynamically updated to store the second event information as part of the first event, to minimize additional storage space needed in the storage structure for the second event.

Abstract: A system, computer program product, and computer-executable method of providing a layout-independent cryptographic stamp of a distributed data set from a data storage system, the system, computer program product, and computer-executable method comprising receiving a request for a cryptographic stamp of the distributed data set, creating a hash of each slice of the distributed data set, and using each hash from each slice of the distribute data set to create the cryptographic stamp of the distributed data set.

Abstract: First information for a first event of a computer system is captured, including first event parameters. A first event key is generated, based on the first event parameters. The first information and first key are both stored as a first event in a storage structure, in which the first event key indexes the first event and the captured first information. When second information is captured for a second event, a second event key is generated based on second event parameters of the captured second event. If the second event key matches the first event key, then the first event stored in the event collection system is dynamically updated to store the second event information as part of the first event, to minimize additional storage space needed in the storage structure for the second event.

Abstract: An aspect of implementing bandwidth limits on replication sessions for a destination includes creating a list of routing modules having ownership of links going to the destination, calculating, by control modules, a proportionate share of a requested total bandwidth limit based on a number of slices owned and the number of routing modules. The proportionate share of the bandwidth limit is indicated by a budget value of a budget byte window (BBW). An aspect further includes prior to initiating a scan of the slices, identifying a BBW having a budget value equal or greater than the value, allocating the budget value to a thread, and reducing the budget value of the BBW by the predetermined value. An aspect also includes scanning the slices corresponding to the identified BBW, sending a number of bytes transmitted and corresponding number of pages to respective control modules resulting from the scanning, and updating corresponding BBW.

Abstract: An aspect of implementing bandwidth limits on replication sessions for a destination includes creating a list of routing modules having ownership of links going to the destination, calculating, by control modules, a proportionate share of a requested total bandwidth limit based on a number of slices owned and the number of routing modules. The proportionate share of the bandwidth limit is indicated by a budget value of a budget byte window (BBW). An aspect further includes prior to initiating a scan of the slices, identifying a BBW having a budget value equal or greater than the value, allocating the budget value to a thread, and reducing the budget value of the BBW by the predetermined value. An aspect also includes scanning the slices corresponding to the identified BBW, sending a number of bytes transmitted and corresponding number of pages to respective control modules resulting from the scanning, and updating corresponding BBW.

Abstract: An aspect of implementing bandwidth control for an asynchronous replication session includes calculating, by each of a group of control modules, a proportionate share of a requested total bandwidth limit based on a number of slices owned. The proportionate share of the bandwidth limit is indicated by a budget value via a budget byte window (BBW). An aspect further includes prior to initiating a scan of the slices by an initiator thread, identifying BBWs having a budget value equal to or exceeding a predetermined value, allocating the budget value for the BBWs to the thread, and reducing the budget value corresponding to the BBWs by the predetermined value. An aspect also includes initiating the initiator thread for slices corresponding to the identified BBWs, sending a number of bytes transmitted and corresponding number of pages to respective control modules resulting from the scanning, and updating corresponding BBWs.

Abstract: A storage system in one embodiment comprises a plurality of storage devices and a storage controller. The storage system is configured to operate as a source storage system in a replication process in which participation of a target storage system is simulated. In conjunction with the replication process, the source storage system is configured to monitor outbound replication messages, and responsive to a given one of the replication messages being designated for transmission over a particular communication link of a predetermined type, to generate a simulated response from the target storage system to the given replication message based at least in part on one or more simulation parameters specified for the replication process. The source storage system then processes the simulated response as if it were an actual response from the target storage system. The particular communication link of a predetermined type illustratively comprises a pseudo IP link.

Abstract: A system, computer program product, and computer-executable method for managing replication from a production site to a target site, wherein both the production site and the target site are content addressable data storage systems, the system, computer program product, and computer-executable method including processing a replication session from the production site to the target site, collecting information related to the replication session from the production site to the target site, analyzing the information to determine whether to change the processing of the replication session, upon a positive determination, modifying the processing of the replication session.

Abstract: A storage system in one embodiment comprises a plurality of storage devices and a storage controller. The storage system is configured to operate as a source storage system in a replication process in which participation of a target storage system is simulated. In conjunction with the replication process, the source storage system is configured to monitor outbound replication messages, and responsive to a given one of the replication messages being designated for transmission over a particular communication link of a predetermined type, to generate a simulated response from the target storage system to the given replication message based at least in part on one or more simulation parameters specified for the replication process. The source storage system then processes the simulated response as if it were an actual response from the target storage system. The particular communication link of a predetermined type illustratively comprises a pseudo IP link.

Abstract: A system, computer program product, and computer-executable method of optimizing replication between a first Content Addressable Storage (CAS) system and a second CAS system, the system, computer program product, and computer-executable method including analyzing the first CAS system and the second CAS system to determine an amount of differences between the first CAS system and the second CAS system, upon determining that the amount of differences are below a threshold amount, sending a set of replication information to the second CAS system, wherein the set of information includes a first address and a first hash for a portion of data stored on the first CAS system, analyzing, at the second CAS system, the set of replication information to determine whether to request that the first CAS system send data associated with the set of replication information; upon a negative determination, sending the data associated with the set of replication information.

Abstract: A system, computer program product, and computer-executable method of providing a layout-independent cryptographic stamp of a distributed data set from a data storage system, the system, computer program product, and computer-executable method comprising receiving a request for a cryptographic stamp of the distributed data set, creating a hash of each slice of the distributed data set, and using each hash from each slice of the distribute data set to create the cryptographic stamp of the distributed data set.

Abstract: Example embodiments of the present invention relate to methods, systems, and a computer program product for performing asynchronous replication of a snapshot. The method includes assigning a unique identifier to a snapshot at a source node in a data storage system. Asynchronous replication of the snapshot, including the unique identifier, then may be performed from the source node to a target node. Integrity of the replicated snapshot having the unique identifier then may be verified at the target node.