Abstract: A technique includes causing an agent device to setup a replication partnership between a first storage node and a second storage. Causing the agent device to setup the replication partnership includes configuring a proxy server that is associated with the second storage node to establish a secure communication channel for the replication partnership over a public network. Configuring the proxy server includes storing in the proxy server credentials for authenticating the first storage node to use the secure communication channel; and establishing port translations to be used in the secure communication channel in communicating replication data between the first storage node and the second storage node. Causing the agent device to setup the replication partnership may also include communicating replication partnership information to the second node.

Abstract: A technique includes causing an agent device to setup a replication partnership between a first storage node and a second storage. Causing the agent device to setup the replication partnership includes configuring a proxy server that is associated with the second storage node to establish a secure communication channel for the replication partnership over a public network. Configuring the proxy server includes storing in the proxy server credentials for authenticating the first storage node to use the secure communication channel; and establishing port translations to be used in the secure communication channel in communicating replication data between the first storage node and the second storage node. Causing the agent device to setup the replication partnership may also include communicating replication partnership information to the second node.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: According to examples, an apparatus may include a processor and a non-transitory machine-readable storage medium comprising instructions executable by the processor to assign a first object identifier and a data identifier to a first volume, the first object identifier being assigned exclusively to the first volume. The instructions may also be executable by the processor to identify an identifier of a second volume, determined whether the identifier of the second volume matches the data identifier, and based on a determination that the identifier of the second volume matches the data identifier of the first volume, configure a replication relationship between the first volume and the second volume.

Abstract: In some examples, with respect to pool partner based replication, a first pool may be generated for a first storage array and may include a first volume of data stored in a storage space of the first storage array. A second pool may be generated for a second storage array and may include a second volume to receive data replicated from the first volume. Based on the generation of the second pool, first and second pool partners respectively representing end points for communication with the first and second pools may be generated. A volume collection may be generated and may include identifications of the first pool partner and the second pool partner, and a first volume identification of the first volume. Based on the volume collection, replication of the first volume may be performed from the first pool to the second volume of the second pool.

Abstract: According to examples, an apparatus may include a processor and a non-transitory machine-readable storage medium comprising instructions executable by the processor to assign a first object identifier and a data identifier to a first volume, the first object identifier being assigned exclusively to the first volume. The instructions may also be executable by the processor to identify an identifier of a second volume, determined whether the identifier of the second volume matches the data identifier, and based on a determination that the identifier of the second volume matches the data identifier of the first volume, configure a replication relationship between the first volume and the second volume.

Abstract: In some examples, with respect to pool partner based replication, a first pool may be generated for a first storage array and may include a first volume of data stored in a storage space of the first storage array. A second pool may be generated for a second storage array and may include a second volume to receive data replicated from the first volume. Based on the generation of the second pool, first and second pool partners respectively representing end points for communication with the first and second pools may be generated. A volume collection may be generated and may include identifications of the first pool partner and the second pool partner, and a first volume identification of the first volume. Based on the volume collection, replication of the first volume may be performed from the first pool to the second volume of the second pool.

Abstract: A technique includes causing an agent device to setup a replication partnership between a first storage node and a second storage. Causing the agent device to setup the replication partnership includes configuring a proxy server that is associated with the second storage node to establish a secure communication channel for the replication partnership over a public network. Configuring the proxy server includes storing in the proxy server credentials for authenticating the first storage node to use the secure communication channel; and establishing port translations to be used in the secure communication channel in communicating replication data between the first storage node and the second storage node. Causing the agent device to setup the replication partnership may also include communicating replication partnership information to the second node.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: Techniques and mechanisms provide a storage optimization manager. Data may be optimized and maintained on various nodes in a cluster. Particular nodes may be overburdened while other nodes remain relatively unused. Techniques are provided to efficiently optimize data onto nodes to enhance operational efficiency. Data access requests for optimized data are monitored and managed to allow for intelligent maintenance of optimized data.

Abstract: A computer-implemented method for reclaiming storage space from deleted volumes on thin-provisioned disks may include: 1) identifying a deleted volume, 2) identifying storage space on a thin-provisioned disk that was allocated to the deleted volume, 3) saving information that identifies the storage space, 4) identifying a policy that specifies reclaiming the storage space asynchronously with respect to the deleted volume, and then 5) reclaiming the storage space asynchronously with respect to deletion of the volume in accordance with the policy. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Systems and methods for information storage replication are presented. In one embodiment a storage flow control method includes receiving a memory operation indication; performing a pre-reserve allocation process before proceeding with the memory operation, wherein the pre-reserve allocation process includes converting available unallocated memory space to allocated memory space if there is sufficient available unallocated memory space to perform the memory operation; executing the memory operation if the pre-reserve allocation process returns an indication there is sufficient memory space allocated to perform the memory operation; and aborting the memory operation if the pre-reserve allocation process returns an indication there is sufficient memory space allocated to perform the memory operation. In one embodiment, the memory operation is a write operation. The memory operation can be a write operation.

Abstract: A computer-implemented method for reclaiming storage space on striped volumes may include: 1) identifying a volume striped across a set of storage devices, 2) identifying a reclamation request to reclaim storage space allocated to the striped volume and then, for at least one device in the set of storage devices, 3) identifying stripes of storage on the device that are covered by the reclamation request, 4) creating a consolidated reclamation request for the device that identifies each stripe of storage on the device that is covered by the reclamation request, and then 5) issuing the consolidated reclamation request to the device. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Techniques and mechanisms are provided for migrating data blocks around a cluster during node addition and node deletion. Migration requires no downtime, as a newly added node is immediately operational while the data blocks are being moved. Blockmap files and deduplication dictionaries need not be updated.

Abstract: Techniques and mechanisms provide a storage optimization manager. Data may be optimized and maintained on various nodes in a cluster. Particular nodes may be overburdened while other nodes remain relatively unused. Techniques are provided to efficiently optimize data onto nodes to enhance operational efficiency. Data access requests for optimized data are monitored and managed to allow for intelligent maintenance of optimized data.

Abstract: Various embodiments of a system and method for enabling multiple computers to mount a file system are described herein. The file system may be mounted on one computer, and a snapshot copy of the file system may be created and mounted on a second computer. Data for a particular file in the file system may be stored at particular storage locations on a storage device. In response to a read request to access data for the particular file through the file system, the data stored at the particular storage locations may be read and returned. Similarly, in response to a read request to access data for the particular file through the snapshot copy of the file system, the data stored at the particular storage locations may be read and returned.

Abstract: Systems and methods for information storage replication are presented. In one embodiment a storage flow control method includes receiving a memory operation indication; performing a pre-reserve allocation process before proceeding with the memory operation, wherein the pre-reserve allocation process includes converting available unallocated memory space to allocated memory space if there is sufficient available unallocated memory space to perform the memory operation; executing the memory operation if the pre-reserve allocation process returns an indication there is sufficient memory space allocated to perform the memory operation; and aborting the memory operation if the pre-reserve allocation process returns an indication there is sufficient memory space allocated to perform the memory operation. In one embodiment, the memory operation is a write operation. The memory operation can be a write operation.