Abstract: Techniques are provided for load balancing for IP failover. A backend address of a first node is identified as a routing destination to which a request is to be routed by a load balancer based upon a load balancer rule mapping a frontend address, specified by the request as a request destination, to the backend address of the first node. The request is routed to a primary network interface of the first node using the backend address. The first node has a loopback interface with an address matching the frontend address for routing the request to a destination data structure based upon the request maintaining the frontend address as the request destination. Health probes are used by the load balancer for detecting a failure of the first node in order to failover to routing requests to a second backend address of a second node.

Abstract: Methods, non-transitory machine readable media, and computing devices that provide improved dictionary-based compression are disclosed. With this technology, a first portion of an input data stream is compressed using a first dictionary. A second dictionary is trained when the first dictionary is determined to be stale. The dictionary can be determined to be stale based on a size of the input data stream compressed using the first dictionary or a compression ratio decreasing by a threshold, for example. The first dictionary can be stored with metadata associated with the compressed first portion of the input data stream. Accordingly, this technology improves compression ratios, eliminates the need for reference counting, and facilitates improved reclamation of orphan dictionaries, among other advantages.

Abstract: One or more techniques and/or systems are provided for profiling a dataset. For example, a snapshot of a volume may be evaluated to identify a set of data characteristics, such as file and directory size information. A baseline dataset profile of a dataset of data within the volume may be constructed based upon the set of data characteristics. Histograms and graphs of directory counts and file counts may be constructed based upon the baseline dataset profile. An incremental dataset profile may be constructed for the dataset based upon an evaluation of the snapshot and a subsequent snapshot of the volume. Histograms and graphs of directories and files that are modified, created, and/or deleted may be constructed based upon the incremental dataset profile. Performance predictions, analytics, field diagnostics of performance issues, and/or scheduling of service execution may be implemented for a storage network hosting the volume based upon dataset profiles.

Abstract: Techniques are provided for transitioning a first storage object and a second storage object from an asynchronous replication state to a synchronous replication state. Metadata operations are logged into a metadata log. Dirty data, modified by data operations executed upon the first storage object, are tracked using a dirty region log. Metadata operations are replicated from the metadata log to the second storage object during a metadata drain phase. During the metadata drain phase, incoming operations are logged into the metadata log when the metadata log has a non-zero size, otherwise, the metadata operations are replicated to the second storage object. After the metadata drain phase, a data drain phase is performed using the dirty region log.

Abstract: Monitoring health of associated, but separated storage clusters can be done at both a node scope and a cluster scope. Monitoring the storage clusters at the cluster scope includes monitoring the network elements that support the storage clusters and connect the storage clusters. Initially, a fabric monitor in each cluster discovers cluster topology. This cluster topology is communicated and maintained throughout the managing storage elements of the storage clusters. After the storage cluster topologies have been discovered, the fabric monitors of each cluster can periodically determine status of network elements of the storage clusters. This allows the storage clusters to maintain awareness of interconnect status, and react to changes in status. In addition, each managing storage element monitors its own health. This information is aggregated to determine when to trigger corrective actions, alerts, and/or storage features in accordance with rules defined at the managing storage elements.

Abstract: Techniques are provided for deduplicating encrypted data. For example, a device has data to store in an encrypted state within a remote data store. A key is used to encrypt the data to create encrypted data. The data is hashed to create hashed data and the encrypted data is hashed to create hashed encrypted data. A probabilistic data structure of the data is generated. The key is encrypted based upon the data to create an encrypted key. The encrypted data is transmitted to the remote data store, along with metadata comprising the hashed data, the hashed encrypted data, the probabilistic data structure, and the encrypted key. The metadata may be used to implement deduplication for subsequent requests, to store data within the remote data store, with respect to the encrypted data.

Abstract: Computing technology for managing support requests are provided. The technology includes a processor executable application programming interface (API) that receives a support case indicating a problem associated with a device. The API utilizes a training model to predict a problem category for the support case. The training model predicts the problem category based on a feature extracted from information included in the support case. The training model further identifies a plurality of proximate support cases based on a distance between the support case and the proximate support cases within a virtual space assigned to the predicted problem category; determines relevance of each proximate support case to the support case; and outputs a resolution code for the support case based on the determined relevance of each proximate support case.

Abstract: A request is received to retrieve at least a portion of a file from a compressed data archived image stored in a backup storage device. The compressed data archived image comprises a backup of a file system having a number of directories and a number of files. The compressed data archived image comprises a file that includes a compression of the number of files. An address of the at least the portion of the file within the compressed data archived image is determined. The at least the portion of the file is retrieved at the address in the compressed data archived image, without decompressing the compressed data archived image.

Abstract: Techniques are provided for freeing and utilizing unused inodes. For example, an operation, targeting a first storage object of a first node having a replication relationship with a second storage object of a second node, is intercepted. A replication operation is created as a replication of the operation. The operation is implemented upon the first storage object and the replication operation is implemented upon the second storage object. A determination is made that the replication operation uses an inode no longer used by storage objects of the second node. The inode targeted by the replication operation is freed and utilized based upon the inode being a leaf inode. If the inode is a stream directory inode, then data streams of the stream directory inode are moved under a new private inode and the stream directory inode is released.

Abstract: One or more techniques and/or systems are provided for detecting stale data and/or changed data. For example, a bitmap file may be maintained and mapped to an inofile describing various states of files of a file system. The bitmap file may be populated with bitmap records indicating whether files were accessed, modified, or have other states. The bitmap file may efficiently convey information used to determine whether files have not been accessed recently (e.g., stale data) or were recently modified (e.g., changed data) compared to the inofile because the bitmap file may comprise a fraction of the size of the inofile (e.g., a byte of information may be used to represent various states of one or more files). In this way, instead of evaluating a relatively larger inofile, the bitmap file may be evaluated to efficiently identify stale data for deletion or destaging and/or changed data for backup.

Abstract: Techniques for load balancing and fault tolerant service are described. An apparatus may comprise load balancing and fault tolerant component operative to execute a load balancing and fault tolerant service in a distributed data system. The load balancing and fault tolerant service distributes a load of a task to a first node in a cluster of nodes using a routing table. The load balancing and fault tolerant service stores information to indicate the first node from the cluster of nodes is assigned to perform the task. The load balancing and fault tolerant service detects a failure condition for the first node. The load balancing and fault tolerant service moves the task to a second node from the cluster of nodes to perform the task for the first node upon occurrence of the failure condition.

Abstract: An augmented reality (AR) diagnostic tool embodied as a software application on a portable device employs AR infrastructure to enable a user to locate a failed/malfunctioning node of a cluster and, with minimal interaction, diagnose causes and provide recommendations to repair the node. The portable device may be a computer embodied as visualization technology and configured to execute the software application. Once installed, the AR diagnostic (ARD) tool is ready for use by the user, e.g., a customer service technician, to locate and repair one or more failed cluster nodes. In response to a failure/malfunction, the cluster node sends diagnostic and configuration information (i.e., failure/malfunction information) of the failed node to an analytics service. The failure information informs the technician of the cluster failure. The technician may then activate the ARD tool and AR infrastructure to locate and repair the failed node.

Abstract: Various embodiments are directed to techniques for dynamically adjusting a maximum rate of throughput for accessing data stored within a volume of storage space of a storage cluster system based on the amount of that data that is stored within that volume. An apparatus includes an access component to monitor an amount of client data stored within a volume defined within a storage device coupled to a first node, and to perform a data access command received from a client device via a network to alter the client data stored within the volume; and a policy component to limit a rate of throughput at which at least the client data within the volume is exchanged as part of performance of the data access command to a maximum rate of throughput, and to calculate the maximum rate of throughput based on the stored amount.

Abstract: Techniques are provided for synchronous replication based cutover. An asynchronous replication process is executed to perform asynchronous incremental transfers of data of a storage object from a first computing environment to a replicated storage object at a second computing environment until a cutover criteria is met. A synchronous replication process is executed to synchronously replicate operations, targeting the storage object, to the replicated storage object based upon the cutover criteria being met. A cutover is performed to direct operations from targeting the storage object to targeting the replicated storage object based upon the synchronous replication process reaching a steady state of synchronous replication for sub-objects of the storage object, where operations are committed to both the storage object and the replicated storage object.

Abstract: A distributed storage system replicates data for a primary logical storage object on a primary node of the storage system to a secondary logical storage object on a secondary node on the distributed storage system. Failures in writing data to the primary logical storage object or failures in the replication of the data to the secondary logical storage object can cause data that should be synchronized to become divergent. In cases where the data may be divergent, reconciliation operations can be performed to resynchronize the data.

Abstract: Technology is disclosed for bridging clouds of computing devices for compute and data storage. The technology can receive a virtual routing table (VRT), wherein the VRT indicates an association with a virtual local area network (VLAN) and defines neighbors for each route wherein at least one neighbor is defined for each of the two different cloud service providers, wherein the route definition creates a private transitive network between the neighbors; receive from a first node a first message destined for a second node; determine that the first message employs the route specified by the VRT; forward the first message to the second node; receive from a third node a second message destined for the second node; determine that the second message does not employ the route specified by the VRT; and fail to forward the second message to the second node.

Abstract: Techniques are provided for asynchronous semi-inline deduplication. A multi-tiered storage arrangement comprises a first storage tier, a second storage tier, etc. An in-memory change log of data recently written to the first storage tier is evaluate to identify a fingerprint of a data block recently written to the first storage tier. A donor data store, comprising fingerprints of data blocks already stored within the first storage tier, is queried using the fingerprint. If the fingerprint is found, then deduplication is performed for the data block to create deduplicated data based upon a potential donor data block within the first storage tier. The deduplicated data is moved from the first storage tier to the second storage tier, such as in response to a determination that the deduplicated data has not been recently accessed. The deduplication is performed before cold data is moved from first storage tier to second storage tier.

Abstract: A method, a computing device, and a non-transitory machine-readable medium for performing a multipath selection based on a determined quality of service for the paths. An example method includes a host computing device periodically polling a storage system for path information including an indication of a recommended storage controller. The host computing device periodically determines a quality of service information corresponding to a plurality of paths between the host computing device and a storage volume of the storage system, where at least one of the plurality of paths including the recommended storage controller. The host computing device identifies a fault corresponding to a path of the plurality of paths that routes I/O from the host computing device to the storage volume. The host computing device re-routes the I/O from the path to a different path of the plurality of paths, where the different path is selected for the re-routing based on the quality of service information and the path information.

Abstract: One or more techniques and/or devices are provided for dynamic resource allocation based upon network flow control. For example, a first counter, corresponding to a count of communication availability signals provided by a network interface to a storage process, may be maintained. A second counter, corresponding to a count of communication unavailability signals provided by the network interface to the storage process, may be maintained. Responsive to the first counter exceeding a resource allocation threshold, additional resources may be dynamically allocated to the storage process during operation of the storage process. Responsive to the second counter exceeding a resource deallocation threshold, resources may be dynamically deallocated from the storage process during operation of the storage process.

Abstract: Techniques are provided for implementing a file system format for persistent memory. A node, with persistent memory, receives an operation associated with a file identifier and file system instance information. A list of file system info objects are evaluated to identify a file system info object matching the file system instance information. An inofile, identified by the file system info object as being associated with inodes of files within an instance of the file system targeted by the operation, is traversed to identify an inode matching the file identifier. If the inode has an indicator that the file is tiered into the persistent memory, then the inode it utilized to facilitate execution of the operation upon the persistent memory. Otherwise, the operation is routed to a storage file system tier for execution by a storage file system upon storage associated with the node.