Fault tolerant distributed storage method and controller using (N,K) algorithms
AssigneeParallels Holdings, Ltd.
InventorsAlexander G. Tormasov, Vitali A. Obernikhin
Life of this patent
Estimating the term…
Loading patent…
AssigneeParallels Holdings, Ltd.
InventorsAlexander G. Tormasov, Vitali A. Obernikhin
Estimating the term…
Data sets and blocks are stored in a set of independent, functionally equivalent chunks. These chunks are placed on different elements of a distributed network to achieve pre-defined level of fault tolerance. Terms of fault tolerance are defined in terms of amount of unavailable sites in the network allowing receipt and access to the data block. Maximal and minimal number of chunks available are variable method parameters. The minimal amount of data chunks K needed to restore a data block is defined. The size of each chunk is approximately 1/K of the original block size. The maximal amounts of chunks are defined during distribution operation and depend upon a requested fault tolerance level. Redundancy in data storage is minimized and varies dynamically by changing the total amount of chunks available. Significant increase in data transfer rate is possible because all block chunks could be transferred in parallel and independently.
A method for data storage in a distributed data storage system with redundancy, the method comprising:
A method for data storage in a distributed data storage system with redundancy, the method comprising:
A method for retrieving data in a distributed data storage system comprising:
A system for managing distributed storage comprising:
A system for managing distributed storage comprising:
Dependencies are inferred from the claim text.