This dissertation concentrates on researching multicast routing algorithms with QoS constraints, proposes several simple, effective and practical QoS multicast routing heuristic algorithms to solve some classical multicast routing problems with NP difficulty.
本文主要研究基于QoS约束的组播路由算法，针对一些典型的具有NP难度的QoS组播路由问题，提出几种简单、有效、实用的QoS组播路由启发式算法。
参考来源 - 基于QoS约束的组播路由算法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
针对时延约束的最小代价组播路由问题，提出四种时延约束组播源路由算法。
Propose four delay-constrained multicast source routing algorithms to solve delay-constrained least-cost multicast routing problem.
组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。
QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete 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.
应用推荐