arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1101.3979cs.MMcs.ITcs.NImath.IT
收藏

流覆盖中用于最小回放延迟的网络编码节点的选择

Selection of network coding nodes for minimal playback delay in streaming overlays

Nicolae Cleju, Nikolaos Thomos, Pascal Frossard

摘要:

网络编码允许在媒体流应用中部署本地适应网络可用性的分布式分组递送算法。然而,如果它没有被有效地实现,它也可能增加延迟和计算复杂性。我们在这里解决的有效放置的节点,实现随机网络编码的覆盖网络,使有效吞吐量保持较高,而解码的延迟在流媒体应用中保持较小。我们首先估计每个客户端的解码延迟,这取决于网络中的创新率。该估计允许识别必须执行编码以减少解码延迟的节点。然后,我们提出了两个迭代算法选择的节点,应该执行网络编码。第一种算法依赖于完整网络统计信息的知识。第二种算法只使用每个节点的本地网络统计数据。仿真结果表明,只需选择少量的网络编码节点,就可以获得较大的性能增益。此外,第二种算法的性能非常接近于中心估计策略,这表明网络编码节点可以以分布式方式有效地选择。我们的计划显示了巨大的收益,在现实的覆盖网络中实现的吞吐量,延迟和视频质量相比,采用传统的流媒体策略以及随机网络节点选择算法的方法。

英文摘要:

Network coding permits to deploy distributed packet delivery algorithms that locally adapt to the network availability in media streaming applications. However, it may also increase delay and computational complexity if it is not implemented efficiently. We address here the effective placement of nodes that implement randomized network coding in overlay networks, so that the goodput is kept high while the delay for decoding stays small in streaming applications. We first estimate the decoding delay at each client, which depends on the innovative rate in the network. This estimation permits to identify the nodes that have to perform coding for a reduced decoding delay. We then propose two iterative algorithms for selecting the nodes that should perform network coding. The first algorithm relies on the knowledge of the full network statistics. The second algorithm uses only local network statistics at each node. Simulation results show that large performance gains can be achieved with the selection of only a few network coding nodes. Moreover, the second algorithm performs very closely to the central estimation strategy, which demonstrates that the network coding nodes can be selected efficiently in a distributed manner. Our scheme shows large gains in terms of achieved throughput, delay and video quality in realistic overlay networks when compared to methods that employ traditional streaming strategies as well as random network nodes selection algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑