The results show that the proposed algorithm can effectively find a more an optimal solution for multicast routing problem.
结果表明，所提出的算法可以有效找到多组播路由问题的优化解。
QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem.
组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。
Propose four delay-constrained multicast source routing algorithms to solve delay-constrained least-cost multicast routing problem.
针对时延约束的最小代价组播路由问题，提出四种时延约束组播源路由算法。
In this paper, the performance of as is improved and the improved as is combined with the heuristic algorithm to solve the multicast routing problem.
提出一种改进的蚁群算法，并将其与启发式方法相结合以解决多点路由问题。
Delay-constrained least-cost multicast routing problem is studied, and a multicast routing algorithm based on link optimizing is proposed to solve the problem.
研究具有时延约束的最小代价组播路由问题，提出一种基于链路优化的组播路由算法求解该问题。
The core of multicast mechanism is routing problem, and designing & selecting appropriate multicast routing algorithm is very important to efficiently implement multicast routing.
组播技术的核心是选路问题，设计或选取合适的组播路由算法对组播选路的有效实施非常重要。
This paper studies the problem of multicast routing with end-to-end delay constraint in packet-switched computer networks.
该文探讨了包交换计算机网络中，具有端到端时延限制的多播路由问题。
Many-to-many multicast routing is an important problem in multicast research fields.
多点到多点组播路由是组播研究领域内的一个重要问题。
This paper researches the problem of minimization of delay variation under the multicast end-to-end delay bounded and presents an efficient multicast routing algorithm.
研究多播端到端时延受限条件下的最优时延抖动问题，提出一种有效的多播路由算法。
The degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol (DBTP) was proposed.
研究有度和延时约束的覆盖多播路由问题，提出了一个新的覆盖多播路由协议-延时受限的树协议（DBTP）。
This paper investigate the problem of multicast routing in mesh WDM networks with sparse light splitter configuration.
研究了WDM网络中在稀疏分光器配置约束下的多播选路问题。
Minimum diameter application layer multicast routing with degree constraints has been proved to be a NP-complete problem.
本文研究了带度约束的最小直径应用层网络多播路由问题，提出了解决该问题的启发式遗传算法。
Minimum diameter application layer multicast routing with degree constraints has been proved to be a NP-complete problem.
本文研究了带度约束的最小直径应用层网络多播路由问题，提出了解决该问题的启发式遗传算法。
应用推荐