Abstract: An illustrative method includes receiving a request to create a storage volume; identifying, based on the request and on a configuration file propagated among a plurality of storage nodes in a cluster, status indicators of the storage nodes; identifying, based on the request, a size of the storage volume; identifying, based on the request, a replication factor representing a number of storage nodes that are to be replicated within a cluster for the storage volume; identifying, based on one or more characteristics associated with the storage volume, a traffic priority for the storage volume, the traffic priority representing a hierarchy that determines and prioritizes which traffic is allocated to available hardware and network resources in a particular order; creating, based on the status indicators, the size, the replication factor, and the traffic priority, the storage volume on one or more of the plurality of storage nodes.

Abstract: An example method for optimizing data deletion in a storage system comprises: detecting a command to delete data from a storage volume using a file system, the data stored on one or more blocks within a storage device associated with the storage volume; monitoring a load metric associated with the storage volume, the load metric indicative of a dynamically changing operational load of the storage volume; and initiating, based on the detecting the command and on the monitored load metric, a discard request for the storage device, the discard request commanding the storage device to indicate that the one or more blocks are free for use by the file system to store additional data.

Abstract: An example method for provisioning volumes in a distributed storage system comprises: receiving a volume provision request to allocate data storage space for a storage volume on a storage node cluster comprising a plurality of storage nodes; determining, in response to the volume provision request, locations of replicas of other storage volumes on the plurality of storage nodes; determining, based on the locations of the replicas of the other storage volumes, a placement of replicas of the storage volume on a set of storage nodes of the plurality of storage nodes that minimizes a number of failed storage volumes in an event of a failure of the set of storage nodes; and provisioning, based on the determining the placement, the storage volume on the set of storage nodes.

Abstract: An example method of distributed service throttling in a container system comprises: determining, by a service among a plurality of services executing within a container system, a cluster resource threshold associated with a resource of the container system; determining, by the service, a quantity of services in the plurality of services; determining, by the service, a service resource threshold based on the cluster resource threshold and the quantity of services; and performing, by the service, one or more operations associated with the resource in accordance with the service resource threshold.

Abstract: An example method includes tracking, by a storage management system, input/output (I/O) operations to a storage pool from a first application and a second application; determining, by the storage management system, that the storage pool has reached a threshold storage usage; and throttling, by the storage management system in response to the determining that the storage pool has reached the threshold storage usage, the first application and the second application differently based on the tracked I/O operations from the first application and the second application.

Abstract: A virtual storage volume may be implemented as one or more chunks stored on a set of storage nodes. The virtual storage volume may be dynamically adjusted by adjusting the one or more chunks that make up the virtual storage volume, without taking the virtual storage volume offline. Such dynamic volume adjustment may allow for increasing volume size without moving data unnecessarily. In addition or alternatively, such dynamic volume adjustment may free up storage space in a node with minimum movement of data.

Abstract: An example method includes transferring, for each of a plurality of snapshots of a source virtual storage volume mounted at a first compute node, at least a portion of a plurality of data blocks for each of the snapshots to a target virtual storage volume at a second compute node; and after the data blocks are transferred, resynchronizing the target virtual storage volume with the source virtual storage volume.

Abstract: An illustrative method includes receiving a request to create a storage volume; identifying, based on the request and on a configuration file propagated among a plurality of storage nodes in a cluster, status indicators of the storage nodes; identifying, based on the request, a size of the storage volume; identifying, based on the request, a replication factor representing a number of storage nodes that are to be replicated within a cluster for the storage volume; identifying, based on one or more characteristics associated with the storage volume, a traffic priority for the storage volume, the traffic priority representing a hierarchy that determines and prioritizes which traffic is allocated to available hardware and network resources in a particular order; creating, based on the status indicators, the size, the replication factor, and the traffic priority, the storage volume on one or more of the plurality of storage nodes.

Abstract: A virtual storage volume that includes storage space on potentially many different physical disks may be implemented as one or more chunks. This allows for dynamic volume storage adjustment. Dynamic volume storage adjustment allows for increasing volume size without moving data unnecessarily. In addition, dynamic volume storage adjustment also allows freeing up storage space in a node with minimum movement of data.

Abstract: Distributed storage systems are implemented with rule based rebalancing mechanisms. Methods includes steps for creating a set of rules for rebalancing data storage space in a storage node cluster, as well as steps for performing a rebalance operation across the storage node cluster using the set of rules. The distributed storage systems include one or more labels for storage pools and storage volumes.

Abstract: A container storage system that provides storage services to a container system provides data resiliency using storage pools based on: detecting an interruption to storage services associated with a first storage pool that includes a first plurality of storage resources on which a first set of replicas of a dataset is distributed; selecting, in response to the interruption, a second storage pool that includes a second plurality of storage resources; and generating, based on one or more replicas within the first set of replicas, a second set of replicas of the dataset distributed among the second plurality of storage resources in the second storage pool.

Abstract: A controller for a storage system manages distribution of snapshots for one or more replicas of a dataset. In certain embodiments, the controller may perform steps including: determining, within a container system, a set of storage resources, where a volume is replicated on each storage resource of the set of storage resources, and wherein the set of storage resources comprises a first number of storage resources associated with a replication factor for the volume; determining, based on a replication policy and in response to an indication to generate a snapshot of the volume, a subset of storage resources, where the subset of storage resources comprises a second number of storage resources that is less than the replication factor; and generating, in accordance with the replication policy, a snapshot of the volume on each storage resource of the subset of storage resources.

Abstract: An example method includes identifying, based on a request to write data to a volume provided by storage nodes in a storage node cluster, a cluster hierarchy associated with the storage node cluster, the cluster hierarchy identifying storage characteristics of the storage nodes, wherein the cluster hierarchy is based on data characterizing performance and storage capabilities of the storage nodes; based on the request, selecting a storage node for storing the data in the volume, the selecting being based, at least in part, on the storage characteristics identified by the cluster hierarchy and on one or more data distribution parameters associated with the storage volume; and transmitting the data to the storage node.

Abstract: Systems, devices, and methods are disclosed herein for containerized scalable storage applications. Methods may include instantiating an application instance based on a plurality of application instance parameters, the application instance being configured to utilize a plurality of storage volumes implemented in a storage cluster. Methods may also include enumerating a plurality of unattached storage volumes included in the cluster associated with the application instance, the plurality of unattached storage volumes having a plurality of underlying physical storage devices, and the plurality of unattached storage volumes being identified based on a plurality of application instance parameters. The methods may further include attaching at least some of the plurality of unattached storage volumes to the application instance, wherein the attaching enables the application instance to access data stored in the attached storage volumes.

Abstract: An example method includes identifying, based on a request to write data to a volume provided by storage nodes in a storage node cluster, a cluster hierarchy associated with the storage node cluster, the cluster hierarchy identifying storage characteristics of the storage nodes, wherein the cluster hierarchy is based on data characterizing performance and storage capabilities of the storage nodes; based on the request, selecting a storage node for storing the data in the volume, the selecting being based, at least in part, on the storage characteristics identified by the cluster hierarchy and on one or more data distribution parameters associated with the storage volume; and transmitting the data to the storage node.

Abstract: A single application may rely on data storage provided by a plurality of virtual data storage volumes mounted on one or more compute nodes. A crash-consistent snapshot of the state of the application may be generated. Each of the virtual data storage volumes may be quiesced prior to the capture of a plurality of volume-level snapshots, after which each volume is unquiesced. The crash-consistent snapshot may be used to restore the application to the state at the time the snapshot was captured.

Abstract: Clustered containerized applications are implemented with scalable provisioning. Methods include receiving a data storage request to store one or more data values in a storage volume implemented across a storage node cluster, the storage node cluster including a plurality of storage nodes including one or more storage devices having storage space allocated for storing data associated with the storage volume. Methods may further include identifying a cluster hierarchy associated with the storage node cluster, the cluster hierarchy identifying storage characteristics of the plurality of storage nodes, the cluster hierarchy also identifying physical location information for the plurality of storage nodes, the physical location information indicating node-to-node proximity on a network graph.

Abstract: A single application may rely on data storage provided by a plurality of virtual data storage volumes mounted on one or more compute nodes. A crash-consistent snapshot of the state of the application may be generated. Each of the virtual data storage volumes may be quiesced prior to the capture of a plurality of volume-level snapshots, after which each volume is unquiesced. The crash-consistent snapshot may be used to restore the application to the state at the time the snapshot was captured.

Abstract: An example method includes transferring, for each of a plurality of snapshots of a source virtual storage volume mounted at a first compute node, at least a portion of a plurality of data blocks for each of the snapshots to a target virtual storage volume at a second compute node; and after the data blocks are transferred, resynchronizing the target virtual storage volume with the source virtual storage volume.

Abstract: Distributed storage systems are implemented with application aware provisioning. Methods include receiving a volume provision request to allocate data storage space for a storage volume implemented across a storage node cluster. Methods also include selecting a storage pool among a set of candidate storage pools for provisioning the storage volume. Selecting the storage pool includes using application aware provisioning rules.