Automated data recovery from remote data object replicas

US10169159B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10169159-B2
Application numberUS-201514964050-A
CountryUS
Kind codeB2
Filing dateDec 9, 2015
Priority dateOct 21, 2013
Publication dateJan 1, 2019
Grant dateJan 1, 2019

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information for the one or more replicas to determine which of the one or more replicas is available for restoration of the object data; calculating a restoration-priority for the first data object based on the health information for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on the calculated restoration-priority.

First claim

Opening claim text (preview).

What is claimed is: 1. A method for recovering data objects in a distributed data storage system, the method comprising: storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network, wherein a first data center of the one or more data centers includes one or more clusters and each cluster of the one or more clusters includes a respective plurality of compute nodes and the each cluster further includes a respective database that stores metadata specifying list of candidate clusters from which the one or more replicas can be recovered; recording health information metadata that is within the database about said one or more replicas, wherein the health information comprises data about availability of a replica to participate in a restoration process; in response to determining that the first data object is to be recovered, calculating a query-priority for the first data object; querying, based on the calculated query-priority, the health information metadata that is within the database for the one or more replicas to determine which of the one or more replicas is available for restoration of the first data object; calculating a restoration-priority for the first data object based on the health information metadata that is within the database for the one or more replicas; and restoring the first data object from the one or more of the available replicas, based on querying the list of candidate clusters and further based on the calculated restoration-priority, wherein the query-priority is calculated based on a priority function P(D)=Func(R(D),C(D),n), where: D represents a data object with multiple replicas in multiple clusters; R(D) i , i=1 . . . n, where “i” and “n” are natural numbers, with a remote replica indexed i of D out of n remote replicas; C(D) represents cost of losing N replicas of D; P(D) represents priority given by the system for the query operation of D; and Func( ) represents some function. 2. The method of claim 1 , wherein the restoration-priority is calculated based on a second function with parameters that represent at least one of: number of replicas available for restoring the first data object in the distributed data storage system, projected costs associated with losing M replicas of the first data object in the distributed data storage system, or risk of loss associated with delaying recovery of the first data object over a second data object, wherein the risk of loss is calculated based on the number of replicas or the costs of loss associated with the first and second data objects. 3. The method of claim 1 , wherein the one or more data centers are located remotely from the location in which the first data object is being recovered. 4. The method of claim 1 , wherein the health information comprises availability and location data about the one or more replicas. 5. The method of claim 1 , wherein querying the health information of a plurality of data objects from a location is optimized by aggregating queries for at least a subset of the plurality of the data objects in a single query. 6. The method of claim 5 , wherein data objects in the subset of the plurality of the data objects in the single query are associated with the same query-priority. 7. The method of claim 1 , wherein the restoration of a plurality of data objects is optimized by restoring at least a subset of the plurality of the data objects from a location where a maximum collective number of the plurality of data objects have replicas, using a single restoration request. 8. The method of claim 7 , wherein data objects in the subset of the plurality of the data objects restored using a single restoration request are associated with the same restoration-priority. 9. The method of claim 1 , wherein the restoration-priority is calculated based on a second priority function P(D)=Func(N(D),C(D),n), where: D represents a data object with multiple replicas in multiple clusters; R(D) i , i=1 . . . n, where “i” and “n” are natural numbers, with a remote replica indexed i of D out of n remote replicas; H(D) i represents health of R(D) i at the time a recovery query is run, wherein ad-hoc information provided by a remote cluster may indicate that a replica is “Available” or “Unavailable”, for example; N(D) represents number of remote replicas for which H(D) i is available; C(D) represents cost of losing N replicas of D; P(D) represents priority given by the system for the restoration operation of D; and Func( ) represents some function. 10. The method of claim 1 , wherein the health information for the one or more replicas is recorded by a first cluster in a database accessible by a recovery module of the first cluster. 11. The method of claim 1 , wherein a first priority queue is used in the one or more clusters to record and prioritize one or more tasks for restoring one or more data objects such that: a first task associated with priority set to be the first data object query-priority is inserted into the first priority queue to query the health information for the one or more replicas of the first data object from one or more locations, in response to determining that the first data object is to be recovered, and a second task with priority set to be the first data object restoration-priority is inserted into the first priority queue to restore the first data object from the one or more available replicas in the one or more locations, in response to determining the restoration-priority for the first data object; wherein the one or more tasks are extracted from the first priority queue and executed, such that a task with higher priority is executed before a task with lower priority. 12. The method of claim 11 , wherein given a first plurality of data objects with health information that is to be queried from the same location or have the same query-priority, optimizing the querying such that a first task for querying health information for a subset of one or more of the first plurality of data objects is inserted as a single task in the first priority queue. 13. The method of claim 11 , wherein given a second plurality of data objects that are to be restored from the same location or have the same restoration-priority, optimizing the restoring such that a second task for restoring a subset of one or more of the second plurality of data objects is inserted as a single task in the first priority queue.

Assignees

Inventors

Classifications

  • for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS] · CPC title

  • Migration mechanisms · CPC title

  • Active fault masking without idle spares · CPC title

  • Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS] · CPC title

  • Management of state, configuration or failover · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10169159B2 cover?
Machines, systems and methods for recovering data objects in a distributed data storage system, the method comprising storing one or more replicas of a first data object on one or more clusters in one or more data centers connected over a data communications network; recording health information about said one or more replicas, wherein the health information comprises data about availability of…
Who is the assignee on this patent?
IBM
What technology area does this patent fall under?
Primary CPC classification H04L67/1097. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Jan 01 2019 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 2 related publications on this page (citations in our corpus or others sharing the same primary CPC).