Delay-constrained and low-cost multicast routing algorithm based on key node
基于关键节点时延约束低代价组播路由算法

This paper proposed a delay-contrained and low-cost multicast routing algorithm based on key node according to the construction of delay-constrained and low-cost multicast tree. This algorithm not only improved the existing path selection function which was appropriate for dynamic delay optimization, but also in conception and frequency of key node. Because key node could reduce the time complexity of choosing low-cost path in the first time to choose destination nodes. And then it used the improved path selection function to choose nodes add into the muticast tree one by one. By this way, the multicast tree which met the requirements could be constructed. The simulation results show that this algorithm can not only construct a multicast tree correctly but also need less time than those of many other multicast algorithms.