发明名称 |
Random Linear Coding Approach To Distributed Data Storage |
摘要 |
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. |
申请公布号 |
US2015304419(A1) |
申请公布日期 |
2015.10.22 |
申请号 |
US201514788968 |
申请日期 |
2015.07.01 |
申请人 |
Massachusetts Institute of Technology |
发明人 |
Medard Muriel;Deb Supratim;Koetter Ralf |
分类号 |
H04L29/08 |
主分类号 |
H04L29/08 |
代理机构 |
|
代理人 |
|
主权项 |
1. A method of using random linear coding for performing distributed data storage in a network, the method comprising:
receiving, at a downloader in a network with r peers, a combination of m stored pieces, wherein m is the number of file pieces a file is broken into; information to recover said m file pieces from m stored pieces; and wherein a peer has no knowledge about what other peers have stored, and therefore said peers do not coordinate for storing pieces of a file. |
地址 |
Cambridge MA US |