Disaster recovery for high-bandwidth distributed archives
First Claim
1. A method, comprising:
- distributing erasure coded data to N storage systems at N sites so that the data is recoverable from N−
1 storage systems at N−
1 sites in case of failure of one of the N storage systems at one of the N sites, for N finite and greater than two;
coordinating physical movement of one or more storage devices of a replacement storage system to each of the N−
1 sites;
transferring data for rebuilding the erasure coded data, from each of the N−
1 storage systems to the one or more storage devices of the replacement storage system, at the N−
1 sites, responsive to the failure of the one of the N storage systems;
coordinating physical movement of the one or more storage devices of the replacement storage system to the one of the N sites or a further replacement site, to restore recoverability of the distributed archival storage in case of failure of one of the N storage systems; and
constructing, in the one or more storage devices of the replacement storage system, at the N−
1 sites, an index of where the erasure coded data is stored, based on the transferred data for the rebuilding the erasure coded data.
1 Assignment
0 Petitions
Accused Products
Abstract
A method for disaster recovery for distributed storage is provided. The method includes distributing erasure coded data to N storage systems at N sites so that the data is recoverable from N−1 storage systems at N−1 sites in case of failure of one of the N storage systems. The method includes coordinating movement of one or more storage devices of a replacement storage system to each of the N−1 sites and transferring data for rebuilding the erasure coded data, from each of the N−1 storage systems to the one or more storage devices of the replacement storage system, responsive to the failure of the one of the N storage systems. The method includes coordinating movement of the one or more storage devices of the replacement storage system to the one of the N sites or a further replacement site, to restore recoverability of the distributed archival storage.
-
Citations
17 Claims
-
1. A method, comprising:
-
distributing erasure coded data to N storage systems at N sites so that the data is recoverable from N−
1 storage systems at N−
1 sites in case of failure of one of the N storage systems at one of the N sites, for N finite and greater than two;coordinating physical movement of one or more storage devices of a replacement storage system to each of the N−
1 sites;transferring data for rebuilding the erasure coded data, from each of the N−
1 storage systems to the one or more storage devices of the replacement storage system, at the N−
1 sites, responsive to the failure of the one of the N storage systems;coordinating physical movement of the one or more storage devices of the replacement storage system to the one of the N sites or a further replacement site, to restore recoverability of the distributed archival storage in case of failure of one of the N storage systems; and
constructing, in the one or more storage devices of the replacement storage system, at the N−
1 sites, an index of where the erasure coded data is stored, based on the transferred data for the rebuilding the erasure coded data. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method, comprising:
-
distributing erasure coded data to N storage systems at N sites so that the data is recoverable from N−
1 storage systems at N−
1 sites in case of failure of one of the N storage systems at one of the N sites, with N finite and greater than or equal to three;coordinating physical movement of a replacement storage system to each of the N−
1 sites, in sequence, responsive to the failure of the one of the N storage systems;transferring data to rebuild the erasure coded data, from each of the N−
1 storage systems to the replacement storage system, at each of the N−
1 sites in the sequence;coordinating physical movement of the replacement storage system to the one of the N sites or a further replacement site, to restore recoverability of the distributed storage in case of failure of one of the N storage systems as comprising the N−
1 storage systems and the replacement storage system; andconstructing, in the replacement storage system or storage memory thereof, at the N−
1 sites in the sequence, an index of where the erasure coded data is stored, based on the transferred data. - View Dependent Claims (8, 9, 10, 11)
-
-
12. A method, comprising:
-
distributing erasure coded data to N storage systems at N sites so that the data is recoverable from N−
1 storage systems at N−
1 sites in case of failure of one of the N storage systems at one of the N sites, for N finite and greater than two;coordinating physical movement of distinct subsets of a plurality of storage devices, of a replacement storage system among the N−
1 sites in a sequence, responsive to the failure of the one of the N storage systems;transferring data to rebuild the erasure coded data, from each of the N−
1 storage systems to the distinct subsets of the plurality of storage devices of the replacement storage system, at the N−
1 sites in the sequence;coordinating physical movement of the plurality of storage devices of the replacement storage system to the one of the N sites or a further replacement site, to restore recoverability of the distributed storage in case of failure of one of the N storage systems henceforth comprising the N−
1 storage systems and the replacement storage system; andconstructing, in the plurality of storage devices of the replacement storage system, at the N−
1 sites, an index of where the erasure coded data is stored, based on the transferred data. - View Dependent Claims (13, 14, 15, 16, 17)
-
Specification