Benefits of Network Coding for Unicast Application in Disruption-Tolerant Networks
Benefits of Network Coding for Unicast Application in Disruption-Tolerant Networks
复制标题
DOI：
10.1109/tnet.2012.2224369
复制
发表时间：
2013-10
期刊：
影响因子：
--
通讯作者：
X. Zhang;G. Neglia;J. Kurose;D. Towsley;Haixiang Wang
中科院分区：
文献类型：
--
作者：
X. Zhang;G. Neglia;J. Kurose;D. Towsley;Haixiang Wang
在本文中，我们研究的好处，应用一种形式的网络编码称为随机线性编码（RLC）的单播应用中断容忍网络（DTNs）。在RLC下，节点在它们彼此遇到时存储和转发分组的随机线性组合。对于一组数据包的情况下，从同一个源和目的地为同一目的地，我们证明了一个下界的概率，RLC方案达到最小的时间来提供一组数据包。尽管RLC显着减少了组传递延迟，但在平均数据包传递延迟和网络传输方面，它的表现更差。当采用复制控制时，RLC方案在不增加传输次数的情况下减少组传递延迟。一般来说，RLC实现的好处是更显着的严格的资源（带宽和缓冲区）的约束下，有限的信令，高度动态的网络，当应用于同一个流中的数据包。对于更实际的设置与多个连续流在网络中，我们展示了部署RLC计划的重要性，仔细调整复制控制，以实现减少平均延迟，这是观察到高达20%时，缓冲区空间受到限制。
In this paper, we investigate the benefits of applying a form of network coding known as random linear coding (RLC) to unicast applications in disruption-tolerant networks (DTNs). Under RLC, nodes store and forward random linear combinations of packets as they encounter each other. For the case of a single group of packets originating from the same source and destined for the same destination, we prove a lower bound on the probability that the RLC scheme achieves the minimum time to deliver the group of packets. Although RLC significantly reduces group delivery delays, it fares worse in terms of average packet delivery delay and network transmissions. When replication control is employed, RLC schemes reduce group delivery delays without increasing the number of transmissions. In general, the benefits achieved by RLC are more significant under stringent resource (bandwidth and buffer) constraints, limited signaling, highly dynamic networks, and when applied to packets in the same flow. For more practical settings with multiple continuous flows in the network, we show the importance of deploying RLC schemes with a carefully tuned replication control in order to achieve reduction in average delay, which is observed to be as large as 20% when buffer space is constrained.