| 摘要 |
An arrangement for storing data has a plurality of N storage devices S1 . . . SN, wherein at least one of the storage devices has a storage capacity that not equal to a storage capacity of others of the storage devices. A storage device SMAX has a largest capacity of the plurality of storage devices S1 . . . SN. A fountain encoder encodes the data into F fountain codewords, wherein <maths id="MATH-US-00001" num="00001"> <math overflow="scroll"> <mrow> <mi>F</mi> <mo>=</mo> <mrow> <munderover> <mo>∑</mo> <mrow> <mi>K</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <mo></mo> <msub> <mi>F</mi> <mi>K</mi> </msub> </mrow> </mrow> </math> </maths> with K being a counting integer; and the fountain encoder distributes the fountain codewords among the N storage devices S1 . . . SN in approximate proportion to the storage capacity CK of each of the N storage devices S1 . . . SN subject to the constraint that enough fountain codewords are stored in each of the N storage devices, to assure that all of the data in all of the N storage devices can be recovered if any one of the N storage devices SP is lost using the fountain codewords stored in the remaining storage devices S1 . . . SN excluding SP. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.
|
