Delay-constrained least-cost multicast routing problem is studied, and a multicast routing algorithm based on link optimizing is proposed to solve the problem.
研究具有时延约束的最小代价组播路由问题，提出一种基于链路优化的组播路由算法求解该问题。
A novel algorithm based on Tabu Search for Delay-Constrained Least-Cost Routing (TSBDRA) is proposed to solve delay-constrained least-cost unicast routing problem.
针对具有时延约束最小代价路径问题，提出一种基于禁忌搜索方法的时延约束的最小代价单播路由算法（TSBDRA）。
A delay and bandwidth constrained least-cost multicast routing algorithm with imprecise state information is proposed.
提出了一种在非精确网络状态信息下满足时延和带宽约束的最小代价组播路由算法。
According to the different priority and the thought of saving algorithm, the routing which has the least cost is the one we want to get.
根据节约算法的思路，求得的综合成本最低的那条线路即为我们要求的方案。
According to the different priority and the thought of saving algorithm, the routing which has the least cost is the one we want to get.
根据节约算法的思路，求得的综合成本最低的那条线路即为我们要求的方案。
应用推荐