多媒体应用一般包含多个组播成员 ,它消耗大量的网络资源且有严格的端端延时约束 .针对这个问题 ,提出了一种延时约束费用最小的分布式动态组播路由启发算法 DDDDCLCMR( distributed dynamic delay- constrainedleast- cost multicast routing algorithm) .在 DDDDCLCMR算法中 ,组播源点很少或根本不参与路由计算 ;即使组播成员发生改变 ,组播树变化也很小 ,算法扩展性好 .实验结果表明 ,无论组播成员改变与否 ,DDDCL CMR算法都能获得满足延时约束且费用很低的组播树 . Multimedia applications generally contain multiple multicast members, which consume a large amount of network resources and have strict end-delay constraints.In view of this problem, a distributed dynamic multicast routing heuristic algorithm DDDDCLCMR In DDDDCLCMR algorithm, the multicast source is little or not involved in route calculation. Even if multicast members change, the multicast tree changes very little and the algorithm scalability is good. Experimental results show that the DDDCL CMR algorithm can obtain a multicast tree satisfying the delay constraint and low cost, regardless of whether the multicast members are changed or not.