概述面向流量工程的约束路由算法的研究进展。
In this paper, we try to give a survey on recent advances of constraint based routing algorithms for traffic engineering.
本文对基于MPLS的流量工程进行了深入探讨与分析，并着重研究其关键技术：约束路由算法。
This text discussion and analysis the traffic engineering based on MPLS deeply, and research the key technology: constraints routing algorithm.
提出了在组播应用中满足多个约束条件的一种组播路由算法。
The article presents a multicast routing algorithm that meets three constraint conditions in the multicast application.
论文对基于约束的路由机制进行了重点论述，为其建立了数学规划模型，并给出了常用的优化算法。
This paper puts emphasis on the discussion of constraint-based routing, its mathematical programming model is given and several common optimization algorithms are illustrated.
针对时延—带宽约束的层次路由问题，提出了楼梯法这一全新的拓扑聚集算法。
In order to deal with hierarchical routing with delay and bandwidth constraints, a new topology aggregation algorithm called stair method was proposed.
提出了一种在非精确网络状态信息下满足时延和带宽约束的最小代价组播路由算法。
A delay and bandwidth constrained least-cost multicast routing algorithm with imprecise state information is proposed.
该算法直接利用前一周期的时延信息来更新路由表，以作为当前寻找路径的依据，在满足带宽和时延波动约束条件下，使数据传送过程时延最小化。
It can refresh the router table by the previous delay information to find a suitable path with the constraints of the bandwidth and the delay-jitter.
针对WD M光网络多播动态路由分配问题，提出了一种多约束条件下的路由分配算法。
According to multicasting dynamic routing assignment problem in WDM optical network, provided a routing assignment algorithm based on multiple constraints.
针对具有时延约束最小代价路径问题，提出一种基于禁忌搜索方法的时延约束的最小代价单播路由算法（TSBDRA）。
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.
研究具有时延约束的最小代价组播路由问题，提出一种基于链路优化的组播路由算法求解该问题。
Delay-constrained least-cost multicast routing problem is studied, and a multicast routing algorithm based on link optimizing is proposed to solve the problem.
本文研究了带度约束的最小直径应用层网络多播路由问题，提出了解决该问题的启发式遗传算法。
Minimum diameter application layer multicast routing with degree constraints has been proved to be a NP-complete problem.
同时依据低压电力线的特点，采用具有中继约束条件的自动中继路由算法实现用户电量的抄收。
According to the characteristics of low voltage power line, the automatic relay routing algorithm with relay constraints is employed in user data receiving.
针对时延约束的最小代价组播路由问题，提出四种时延约束组播源路由算法。
Propose four delay-constrained multicast source routing algorithms to solve delay-constrained least-cost multicast routing problem.
摘要：算法利用网络中每个节点的状态信息，通过选择探测的方法搜索满足业务带宽和时延约束要求的路由。
Absrtact: This algorithm depends on the local state of each node in the networks, searches routes that meet bandwidth and delay requirements through the selective probe method.
首先，本文提出了基于能量约束的自适应路由算法。
First, this paper puts up with a self adaptive routing strategy based on energy limit.
针对多约束路径选择问题，提出多约束的最小跳路由算法算法（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;
应用推荐