| 摘要 |
Data files can be sent using a data carousel and forward error correction. This involves segregating a file into groups of data blocks, wherein each group represents k data blocks. From the k data blocks of each group, n erasure-encoded blocks are calculated, where n>k. The n erasure-encoded blocks are sent in a round-robin fashion using IP multicast technology: the first erasure-encoded block for each group, then the second block of each group, and so on. Assuming a file having S data blocks, the value of k is selected by first determining the minimum number of groups G of erasure-encoded blocks that can represent the S data object blocks, wherein each group of erasure-encoded blocks represents no more than kmax data object blocks. Then, the sender determines the smallest number of data object blocks kmin that can be represented in each group while still requiring no more than G groups of erasure-encoded blocks to represent the S data object blocks. The value of k is then limited to kmin for each group of transmitted erasure-encoded blocks.
|
