Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding

To reduce computational complexity and delay in randomized network coded content distribution, and for some other practical reasons, coding is not performed simultaneously over all content blocks, but over much smaller, possibly overlapping subsets of these blocks, known as generations. A penalty of this strategy is throughput reduction. To analyze the throughput loss, we model coding over generations with random generation scheduling as a coupon collector’s brotherhood problem. This model enables us to derive the expected number of coded packets needed for successful decoding of the entire content as well as the probability of decoding failure (the latter only when generations do not overlap) and further, to quantify the tradeoff between computational complexity and throughput. Interestingly, with a moderate increase in the generation size, throughput quickly approaches link capacity. Overlaps between generations can further improve throughput substantially for relatively small generation sizes.

💡 Research Summary

This paper investigates the practical trade‑off between computational complexity, delay, and throughput in randomized linear network coding (RLNC) when the source data is divided into smaller, possibly overlapping subsets called generations. Coding over the entire file at once incurs cubic‑order encoding/decoding costs and large latency, which motivates the use of generation‑based coding. The authors model the random scheduling of generations as a “coupon collector’s brotherhood” problem, where each generation corresponds to a distinct coupon type and each transmitted coded packet contributes a new linear combination that may or may not be linearly independent for that generation.

Using this probabilistic framework, the authors derive closed‑form expressions for the expected number of coded packets required to decode the whole content, (E