有向有环组播网络的网络编码构造

摘要

Aiming at the cyclic network, this paper proposed a construction method of network coding. It used depth—first search to find all the rings, and calculated the length of them. Removed one of the directed edges from each ring successively, obtained the throughput of various conditions, found out the maximum throughput, and marked the edges which were removed at this time, these edges do not participate the linear network coding construction. Thus, the directed cyclic network had been transformed into a directed acyclic network to construct the linear network coding. Simulation and test results show that the proposed approach is feasible.%针对有环的组播网络,文章提出了一种网络编码的构造方法.采用深度优先遍历找出组播网络中的环,并求得各环的长度,依次再去掉各环中的一条有向边,求得不同去边情况下的网络组播容量,并找出最大的网络组播容量,标记此时的去边情况,在网络编码构造时,这些边不参与线性网络编码.这样,有向有环网络被转化成了有向无环网络进行线性网络编码构造.仿真测试结果表明,提出的方法是可行的.