Fixed content distributed data storage using permutation ring encoding
First Claim
1. A method to protect a data file against loss of data, wherein the data file comprises a set of N data blocks A1, . . . , An that are stored in N respective nodes, comprising:
- generating a k×
n matrix of code blocks;
storing K code blocks in K respective nodes, distinct from the N respective nodes, wherein each code block has an ith code block computed as;
Ci=f(gi1(A1), . . . gin(An)), where each g is a permutation operator that comprises a superposition of cyclic permutations.
3 Assignments
0 Petitions
Accused Products
Abstract
A file protection scheme for fixed content in a distributed data archive uses computations that leverage permutation operators of a cyclic code. In an illustrative embodiment, an N+K coding technique is described for use to protect data that is being distributed in a redundant array of independent nodes (RAIN). The data itself may be of any type, and it may also include system metadata. According to the invention, the data to be distributed is encoded by a dispersal operation that uses a group of permutation ring operators. In a preferred embodiment, the dispersal operation is carried out using a matrix of the form [IN
1462 Citations
20 Claims
-
1. A method to protect a data file against loss of data, wherein the data file comprises a set of N data blocks A1, . . . , An that are stored in N respective nodes, comprising:
-
generating a k×
n matrix of code blocks;storing K code blocks in K respective nodes, distinct from the N respective nodes, wherein each code block has an ith code block computed as;
Ci=f(gi1(A1), . . . gin(An)), where each g is a permutation operator that comprises a superposition of cyclic permutations. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A method of storing data comprising a set of N data blocks A1, . . . , An, comprising the unordered steps of:
-
generating a k×
n matrix of code blocks;storing the N data blocks in N respective nodes; and storing K code blocks in K respective nodes, distinct from the N respective nodes, wherein each code block has an ith code block computed as;
Ci=f(gi1(A1), . . . gin(An)), where each g is a permutation operator that comprises a superposition of cyclic permutations. - View Dependent Claims (9, 10)
-
-
11. In a redundant array of independent nodes, wherein a data file comprising a set of N data blocks A1, . . . , An are stored in N respective nodes of the array, a method of protecting the data file against loss of data, comprising:
storing K code blocks in K respective nodes of the array, distinct from the N respective nodes, wherein each code block has an ith code block computed as;
Ci=f(gi1(A1), . . . gin(An)), where each g is a permutation operator that comprises a superposition of cyclic permutations.- View Dependent Claims (12, 13, 14, 15)
-
16. A process for protecting against loss and for enhancing accessibility in storage or memory, or protecting against loss and enhancing speed of transmission on communication paths, of information that is represented in storage or memory, or represented as data signals on communication paths, the information comprising N data blocks A1, . . . , An, comprising:
-
dispersing the information by transmitting the N data blocks in the form of said data signals carried on multiple first communication paths, or by storing the N data blocks in N storage or memory locations; dispersing protection information by transmitting K code blocks in the form of data signals carried on multiple second communication paths distinct from the multiple first communications paths, or by storing the K code blocks in K storage or memory locations distinct from the N storage or memory locations, wherein each code block has an ith code block computed as;
Ci=f(gi1(A1), . . . gin(An)), where each g is a permutation operator that comprises a superposition of cyclic permutations. - View Dependent Claims (17, 18, 19, 20)
-
Specification