New delay-bounded constraint multicast routing algorithm
一种具有时延约束的组播路由算法研究

For real-time multicast business such as multimedia applications, multicast routing algorithms must optimize both cost and delay. In response to this problem, proposed a heuristic algorithm DCMA, which joined destination nodes to the multicast tree dynamically. This algorithm was based on DDMC algorithm and improved by using new indicator function and link choice function. Considering the optimization of delay and cost, the algorithm efficiently guarantees the performance of multicast tree, with advantage of low time complexity and easy operation in real system.