代间循环流式传输
Round-Robin Streaming with Generations
摘要：
我们考虑三种类型的应用层编码流有损链路：随机线性编码，系统随机线性编码，和结构化编码。正在流式传输的文件被划分为子块（代）。通过组合属于相同代的数据形成代码符号，并以循环方式传输。我们比较的方案的基础上交付的数据包计数，净吞吐量，和能源消耗的一代大小的范围。我们确定这些性能指标分析和实验配置。我们发现我们的分析预测与实验结果相符。我们表明，在应用层的编码带来了显着的净数据吞吐量的增加，从而减少由于减少通信时间的能源消耗。另一方面，在计算资源受限的设备上，繁重的编码操作会导致较高层的丢包，并对净吞吐量产生负面影响。我们发现，从我们的实验结果，低速率MDS码是最好的小世代大小，而系统随机线性编码具有最好的净吞吐量和最低的能量消耗较大的世代大小，由于其低解码复杂度。
英文摘要：
We consider three types of application layer coding for streaming over lossy links: random linear coding, systematic random linear coding, and structured coding. The file being streamed is divided into sub-blocks (generations). Code symbols are formed by combining data belonging to the same generation, and transmitted in a round-robin fashion. We compare the schemes based on delivery packet count, net throughput, and energy consumption for a range of generation sizes. We determine these performance measures both analytically and in an experimental configuration. We find our analytical predictions to match the experimental results. We show that coding at the application layer brings about a significant increase in net data throughput, and thereby reduction in energy consumption due to reduced communication time. On the other hand, on devices with constrained computing resources, heavy coding operations cause packet drops in higher layers and negatively affect the net throughput. We find from our experimental results that low-rate MDS codes are best for small generation sizes, whereas systematic random linear coding has the best net throughput and lowest energy consumption for larger generation sizes due to its low decoding complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
