Improved Delay-constrained Multicast Routing Algorithm
Qin Zong-weib · Jisuanji gongcheng · 2012
Aiming at the problem of DCMPH algorithm can not choose the connection path reasonably,an improved meeting delay-constrained multicast routing algorithm is proposed in this paper.In the algorithm,if the destination nodes can not use the least-cost path to join the multicast tree,it calculates the least-delay path to all the nodes in the multicast tree,and then selects the least-cost path which meets the delay constraint to add to the multicast tree.Experimental results show that the cost of the new algorithm in constructing multicast routing tree is superior to DCMPH algorithm.