论文标题

通过重新传输的滑动网络编码的可靠性和延迟分析

Reliability and Latency Analysis of Sliding Network Coding With Re-Transmission

论文作者

Wu, Fangzhou, Tan, Zhiyuan, Zhu, Huiying, Dong, Pengpeng

论文摘要

未来的网络有望通过无线链接支持各种超级可靠的低延迟通信。为了避免数据包的丢失并保持低延迟,滑动网络编码(SNC)是一种新兴技术,它通过生成冗余数据包,这些数据包是当前块和一些先前块的原始数据包的线性组合。但是,如何利用SNC重新传输的优势仍然是一个开放的问题,因为可以以往返时间(RTT)引起的较大潜伏期来实现更高的可靠性。为了解决这个问题,在本文中,我们考虑了调整传输阶段的想法以及通过重新传输的SNC的冗余数据包的数量。具体来说,如果RTT很大,则大多数冗余数据包是在第一个传输中发送的,否则将使用重新传输。我们首先在不重新传输的情况下得出了SNC块误差概率的简洁而紧密的下限。然后,基于界限,提出了有关块误差概率,平均代码长度和平均数据包延迟的理论表达式。结果表明,带有重新传输的拟议SNC提高了块错误概率,并保持低延迟。

Future networks are expected to support various ultra-reliable low-latency communications via wireless links. To avoid the loss of packets and keep the low latency, sliding network coding (SNC) is an emerging technology by generating redundant packets that are the linear combination of the original data packets from the current block and some previous blocks. However, how to take the advantage of re-transmission for SNC is still an open problem since higher reliability could be achieved at the expense of large latency caused by round-trip time (RTT). To deal with this issue, in this paper, we consider the idea of adjusting the transmission phase and the number of the redundant packets for SNC with re-transmission. Specifically, If RTT is large, most of the redundant packets are sent at the first transmission, otherwise, re-transmission will be used. We first derive a concise and tight lower bound of the block error probability of SNC without re-transmission. Then, based on the bound, the theoretical expressions of the proposed re-transmission schemes are derived regarding the block error probability, the average code length, and the average packet latency. Results show that the proposed SNC with re-transmission improves block error probability and keeps the low latency.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源