×

Distributed storage system data management and security

  • US 10,608,784 B2
  • Filed: 03/15/2017
  • Issued: 03/31/2020
  • Est. Priority Date: 03/15/2016
  • Status: Active Grant
First Claim
Patent Images

1. A method for erasure coding, comprising:

  • executing, by one or more processors configured to execute code stored in non-transitory processor readable media, encoding of data partitioned into K information chunks with an error correcting code C to produce N codeword chunks, wherein N is a composite natural number, K is a natural number lower than N and the error correcting code C is based on component codes;

    h outer codes, wherein the i-th code generates bin chunks as a function of ki information chunks, where n is a natural number being a divisor of N, parameters h, bi and ki are natural numbers such that the code C has the highest possible minimum distance, and index i takes h different values; and

    h inner codes, wherein the codes are nested and each code generates N/n chunks as a function of chunks produced by the outer codes;

    distributing, by the one or more processors, the N codeword chunks over a set of storage nodes, wherein mapping of the N codeword chunks to the storage nodes is optimized to balance network load and to reduce predicted retrieval latency by computing;

    i) availability coefficients for the storage nodes using statistical data, wherein each availability coefficient characterizes predicted average download speed for a respective storage node; and

    ii) relevance coefficients for the codeword chunks;

    reconstructing, by the one or more processors, the information chunks from the codeword chunks requested from the storage nodes;

    repairing, by the one or more processors, failed storage nodes by reconstructing erased codeword chunks as a function of available codeword chunks belonging to the same set of the N codeword chunks; and

    updating, by one or more processors, one or several information chunks, wherein the number of corresponding codeword chunks to be updated is minimized.

View all claims
  • 8 Assignments
Timeline View
Assignment View
    ×
    ×