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

Routing Algorithms Satisfying Explicit Node Constraint

作　　者：孙全[1] 

机构地区：[1]北京邮电大学电信工程学院计算机技术中心,北京100876

出　　处：《计算机工程与应用》2005年第16期3-5,16,共4页Computer Engineering and Applications

基　　金：北邮电信工程学院归国留学人员启动基金资助

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

关 键 词：松散指定路由 约束路径 MPLS GMPLS 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]