收集世代的编码优惠券
Collecting Coded Coupons over Generations
摘要：
为了减少随机化网络编码内容分发中的计算复杂性和延迟（以及出于一些其他实际原因），编码不是在所有内容块上同时执行，而是在被称为代的小得多的子集上同时执行。代价是吞吐量降低。我们将几代人的编码建模为优惠券收集者的兄弟情谊问题。该模型使我们能够从理论上计算成功解码整个内容所需的编码分组的预期数量，以及解码失败的概率上的界限，并且进一步量化计算复杂性和吞吐量之间的权衡。有趣的是，随着代大小的适度增加，吞吐量很快接近链路容量。作为一个额外的贡献，我们得到了新的结果，广义收藏家的兄弟问题，也可以用于进一步研究的许多其他方面的编码世代。
英文摘要：
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 subsets known as generations. A penalty is throughput reduction. We model coding over generations as the coupon collector's brotherhood problem. This model enables us to theoretically compute the expected number of coded packets needed for successful decoding of the entire content, as well as a bound on the probability of decoding failure, 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. As an additional contribution, we derive new results for the generalized collector's brotherhood problem which can also be used for further study of many other aspects of coding over generations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
