提出了一种基于网络编码的新的多播路由算法,该算法在搜索信源节点到各接收者路径族的过程中,考虑了不同路径族之间链路的共享,以降低带宽资源消耗,提高网络性能。基于得到的多播路由图,提出了一种最小子树图搜索算法,并利用最小子树图的性质,对相应于多播路由图的子树图进行化简。最后,在最小子树图上进行有效的网络编码,所有的网络编码问题可以简化为搜索多播网络的最小子树图问题。
This paper presents a new multicast routing algorithm based on network coding. In the process of searching the rout- ing groups from source nodes to each receiver, the algorithm considers link-sharing between different path groups to de- crease bandwidth resource consumption and improve network performances. And a scheme for search of minimal subtree graphs is presented based on the multicast routing graphs obtained. By using some properties of minimal subtree graphs, the subtree graphs corresponding to multicast routing graphs are reduced to get minimal subtree graphs. Finally, it can ef- fectively construct network coding in minimal subtree graphs, and all the network coding problems can be equivalent to search the minimal subtree graphs.