Abstract:

This paper presents a key-node based trigger rearranged dynamic multicast routing algorithm named CRKDMR. It would preferentially choose the path including key nodes on certain conditions, by which a new multicast node be connected to the existing multicast tree. This could be beneficial to implementing more link share and reducing multicast tree cost. Furthermore, trigger function of CRKDMR is more comprehensive and rational than that of existing trigger rearranged dynamic multicast routing algorithms. Simulation results show that performance of CRKDMR is better than that of other algorithms. Cost competitiveness and average tree change of CRKDMR are smaller, in the meantime, CRKDMR can achieve a better balance between performance of multicast tree and change of tree.

摘要： 本文提出了一种基于关键节点的触发重组动态组播路由算法（CRKDMR）。它在一定条件下优先选择包含关键节点的路径将新的组播节点连接到已有组播树，以此实现更多链路共享，降低组播树费用。相对于现有的触发重组算法，它提出了更为全面和合理的触发函数。随机网络模型的仿真结果表明，CRKDMR算法的性能好，效差和对树的改变都比较小，同时可以在代价性能和对树的改变间进行很好的权衡。