Random linear coding approach to distributed data storage
US8375102B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 6, 2011 |
| Grant date | Feb 12, 2013 |
| Priority date | — |
| Expiry date | Oct 6, 2031 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L67/104
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.