满足指定节点约束的路由算法

在MPLS或GMPLS网络中,路由算法常常需考虑节点约束条件(即用户可能指定一条端到端路径所必须经过的一些中途节点)。对链路代价值为整数的有向无回路网络,文章提出了一种伪多项式时间算法,用于计算满足指定节点约束的最小代价路径。对一般有向网络,文中给出了一种计算时间及空间上限可调的启发式算法。仿真实验结果表明,所给的启发式算法在网络规模变大时明显优于已知的算法。

Routing Algorithms Satisfying Explicit Node Constraint

In MPLS or GMPLS networks,the routing algorithm often needs to consider the explicite node constraint(i.e.users may specify some intermediate nodes that an end-to-end path has to traverse).This paper proposes a pseudo-polynomial time algorithm for computing least-cost paths satisfying the explicit node constraint in directed acyclic networks with integer link costs.For general directed networks,a heuristic algorithm with user-controllable upper bound for the computation time and space is given.Simulation results show that the proposed heuristic clearly performs better than the known algorithm.