Netapp, Inc.

Cohesity, Inc.

Emalayan Vairavanathan

Dheeraj Raghavender Sangamkar

Vladimir Radu Avram

Ajay Bakre

Viswanath Chandrasekara Bharathi

Song Guen Yoon

Alvin Lam

Yi Zhang

Oliver Erik Seiler

Vishnu Vardhan Chandra Kumaran

Carmen Lum

Chia-Chen Chu

Raymond Yu Shun Mak

Aditya Kalyanakrishnan

Tymoteusz Altman

Apurv Gupta

Jagavar Nehra

Vivek Venkatesan

Amandeep Gautam

Debasish Garai

Varun Ganesh

Data associated with an object to be stored is received from a source system for a destination logical storage container selected among a plurality of destination logical storage containers. A total number of the destination logical storage containers allowed to be concurrently supported by the source system is limited. The selected destination logical storage container is shared by a plurality of objects of the source system. Based at least in part on an identifier associated with the object, a child logical storage container corresponding to the object is identified. The child logical storage container is different from the selected destination logical storage container. The data associated with the object received for the selected destination logical storage container is automatically stored in the identified child logical storage container.

Performing a backup of an object based on an identifier associated with the object

A system, method, and machine-readable storage medium for analyzing a state of a data object are provided. In some embodiments, the method includes receiving, at a storage device, a metadata request for the data object from a client. The data object is composed of a plurality of segments. The method also includes selecting a subset of the plurality of segments and obtaining a segment state for each segment of the subset. Each segment state indicates whether the respective segment is accessible via a backing store. The method further includes determining a most restrictive state of the one or more segment states and sending state information to the client in response to the metadata request, the state information being derived from the most restrictive state.

Object tiering in a distributed storage system

A storage management computing device obtains an information lifecycle management (ILM) policy. A data protection scheme to be applied at a storage node computing device level is determined and a plurality of storage node computing devices are identified based on an application of the ILM policy to metadata received from one of the storage node computing devices and associated with an object ingested by the one of the storage node computing devices. The one of the storage node computing devices is instructed to generate one or more copies of the object or fragments of the object according to the data protection scheme and to distribute the object copies or one of the object fragments to one or more other of the storage node computing devices to be stored by at least the one or more other storage node computing devices on one or more disk storage devices.

Policy-based hierarchical data protection in distributed storage

Distributed storage systems frequently use a centralized metadata repository that stores metadata in an eventually consistent distributed database. However, a metadata repository cannot be relied upon for determining which erasure coded fragments are lost because of a storage node(s) failures. Instead, when recovering a failed storage node, a list of missing fragments is generated based on fragments stored in storage devices of available storage nodes. A storage node performing the recovery sends a request to one or more of the available storage nodes for a fragment list. The fragment list is generated, not based on a metadata database, but on scanning storage devices for fragments related to the failed storage node. The storage node performing the recovery merges retrieved lists to create a master list indicating fragments that should be regenerated for recovery of the failed storage node(s).

Erasure coding repair availability

Technology is disclosed for storing data in a distributed storage system using a virtual chunk service (VCS). In the VCS based storage technique, a storage node ('node') is split into multiple VCSs and each of the VCSs can be assigned a unique ID in the distributed storage. A set of VCSs from a set of nodes form a storage group, which also can be assigned a unique ID in the distributed storage. When a data object is received for storage, a storage group is identified for the data object, the data object is encoded to generate multiple fragments and each fragment is stored in a VCS of the identified storage group. The data recovery process is made more efficient by using metadata, e.g., VCS to storage node mapping, storage group to VCS mapping, VCS to objects mapping, which eliminates resource intensive read and write operations during recovery.

Layering a distributed storage system into storage groups and virtual chunk spaces for efficient data recovery

Techniques are described for reserving space on a destination node or volume for increasing the likelihood of a successful data transfer in a distributed storage environment. A reservation may be retried at one or more destinations if the reservation fails at a first destination. In some embodiments, the data-transfer process can be paused or terminated prior to data being transferred to one or more destinations if a reservation fails. Reserving space on a destination node or volume can increase the likelihood of a successful data transfer, which can increase the likelihood of efficient resources usage in a storage system.

Space reservation for distributed storage systems

To ensure that there is an elected manager among storage nodes of an erasure coding group ('ECG'), an ECG manager ('ECGM') election process is periodically performed among available storage nodes that are configured with the software to perform the services of an ECGM. When a storage node is activated, an ECGM process of the storage node begins executing and is assigned a process identifier (&#x201c;PID&#x201d;). A storage node can utilize a service query framework to identify other available storage nodes and retrieve their ECGM PIDs. The storage node then selects a PID according to a criterion and elects the storage node corresponding to the selected PID to be the acting ECGM. This process is performed periodically, so even if the acting ECGM storage node fails, a new ECGM is eventually selected from the available storage nodes.

Manager election for erasure coding groups

To efficiently recover from a multiple storage node failure, a storage node concurrently restores data fragments to the multiple failed storage nodes, as opposed to restoring each node individually. In the VCS based storage technique, storage nodes are restored as part of an ECG repair process. For each ECG being repaired, a storage node performing the restoration process reads data fragments from active nodes in the ECG and generates new data fragments to replace any lost data fragments. The node then stores one of the new data fragments across each of the failed storage nodes. By concurrently restoring data fragments to each failed storage node, the data fragments needed to repair each ECG are only read once, thereby preserving disk operations and network bandwidth.

Efficient recovery of erasure coded data

A storage management computing device obtains an information lifecycle management (ILM) policy based on a query from a storage node ingesting an object into a distributed storage system. A hierarchical data protection plan comprising protection schemes at different layers of the distributed storage system is determined. A data protection scheme to be applied at a storage node computing device level is determined and a plurality of storage node computing devices are identified based on the hierarchical data protection plan. The storage management computing device instructs the ingesting storage node to store the object into the distributed storage system according to the hierarchical data protection plan.

Growing community of inventors

Vancouver, Canada

Emalayan Vairavanathan