针对WD M光网络多播动态路由分配问题，提出了一种多约束条件下的路由分配算法。
According to multicasting dynamic routing assignment problem in WDM optical network, provided a routing assignment algorithm based on multiple constraints.
本文研究了带度约束的最小直径应用层网络多播路由问题，提出了解决该问题的启发式遗传算法。
Minimum diameter application layer multicast routing with degree constraints has been proved to be a NP-complete problem.
针对多约束路径选择问题，提出多约束的最小跳路由算法算法（MHMCA），解决多约束路径问题。
Minimum hop Multi-Constrained path algorithm (MHMCA) is proposed to solve multi-constraint path selection problem.
为此，采用度约束来表示每个节点的多播能力，提出了一种有度约束的分布式多播路由算法。
Thus, the multicast capability of each node is represented in this paper by a degree-constraint.
实验结果及分析表明：算法在非完全组播网络上实现了较优的多约束多点对多点组播路由；
Experimental results and analyses indicated that: this algorithm carry out better multi-constraint Many-to-many multicast routing on Partial-multicast Network;
实验结果及分析表明：算法在非完全组播网络上实现了较优的多约束多点对多点组播路由；
Experimental results and analyses indicated that: this algorithm carry out better multi-constraint Many-to-many multicast routing on Partial-multicast Network;
应用推荐