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.