公开(公告)号：US20150304419A1

公开(公告)日：2015-10-22

申请号：US14788968

申请日：2015-07-01

Applicant: Massachusetts Institute of Technology

Inventor： Muriel Medard ,  Supratim Deb ,  Ralf Koetter

IPC: H04L29/08

CPC classification number: H04L67/1095 ,  G06F17/30209 ,  H04L67/104

Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.

Abstract translation: 提出了一种用于向分布式数据存储提供随机线性编码方法的方法和计算机程序产品。 文件被分成多个部分。 对于每个对等体（对等体意味着具有有限存储空间的存储位置），确定对等体可以存储的编码的数量。 每个编码片段通过采用整个文件的所有片段的随机线性组合来确定。 为每个编码块存储关联码矢量。 通过收集来自对等体的代码矢量和编码块并以收集的码矢量作为矩阵来检索文件。 当矩阵的维数等于文件的数量时，使用矩阵中的代码向量的集合来恢复文件。

公开(公告)号：US20130073697A1

公开(公告)日：2013-03-21

申请号：US13678982

申请日：2012-11-16

Applicant: Massachusetts Institute of Technology

Inventor： Muriel Medard ,  Supratim Deb ,  Ralf Koetter

IPC: G06F15/16

CPC classification number: H04L67/1095 ,  G06F17/30209 ,  H04L67/104

Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.

公开(公告)号：US09680928B2

公开(公告)日：2017-06-13

申请号：US14788968

申请日：2015-07-01

Applicant: Massachusetts Institute of Technology

Inventor： Muriel Medard ,  Supratim Deb ,  Ralf Koetter

IPC: G06F15/16 ,  H04L29/08 ,  G06F17/30

CPC classification number: H04L67/1095 ,  G06F17/30209 ,  H04L67/104

Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.

公开(公告)号：US09165013B2

公开(公告)日：2015-10-20

申请号：US13678982

申请日：2012-11-16

Applicant: Massachusetts Institute of Technology

Inventor： Muriel Medard ,  Supratim Deb ,  Ralf Koetter

IPC: G06F15/16 ,  G06F17/30

CPC classification number: H04L67/1095 ,  G06F17/30209 ,  H04L67/104

Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.

Abstract translation: 提出了一种用于向分布式数据存储提供随机线性编码方法的方法和计算机程序产品。 文件被分成多个部分。 对于每个对等体（对等体意味着具有有限存储空间的存储位置），确定对等体可以存储的编码的数量。 每个编码片段通过采用整个文件的所有片段的随机线性组合来确定。 为每个编码块存储关联码矢量。 通过收集来自对等体的代码矢量和编码块并以收集的码矢量作为矩阵来检索文件。 当矩阵的维数等于文件的数量时，使用矩阵中的代码向量的集合来恢复文件。