The failure probability at sink node of random linear network coding
The failure probability at sink node of random linear network coding
复制标题
DOI：
10.1109/icitis.2010.5689776
复制
发表时间：
2010-10
期刊：
影响因子：
--
通讯作者：
Xuan Guang;Fang-Wei Fu
中科院分区：
文献类型：
--
作者：
Xuan Guang;Fang-Wei Fu
在实际应用中，由于许多通信网络规模庞大，结构复杂，甚至是动态的，即使知道网络的拓扑结构，也不可能根据网络拓扑预先设计网络代码。因此，随机线性网络编码被提出作为可接受的编码技术。本文进一步研究了随机线性网络编码的性能，通过分析不同网络拓扑知识下sink节点的失效概率，得到了失效概率的紧的和渐近紧的上界。特别是，最差的情况下指出这些界限。此外，如果利用更多的关于网络拓扑的信息，则获得更好的上界。这些界限改进了已知的界限。最后，我们还讨论了这一故障概率的下界，并表明它也是渐近紧的。
In practice, since many communication networks are huge in scale or complicated in structure even dynamic, the predesigned network codes based on the network topology is impossible even if the topological structure is known. Therefore, random linear network coding was proposed as an acceptable coding technique. In this paper, we further study the performance of random linear network coding by analyzing the failure probabilities at sink node for different knowledge of network topology and get some tight and asymptotically tight upper bounds of the failure probabilities. In particular, the worst cases are indicated for these bounds. Furthermore, if the more information about the network topology is utilized, the better upper bounds are obtained. These bounds improve on the known ones. Finally, we also discuss the lower bound of this failure probability and show that it is also asymptotically tight.