基于动态规划的多链路出口路径选择算法  

Multi-link Egress Path Selection Algorithm Based on Dynamic Programming

作　　者：孙素云[1] 

机构地区：[1]广东轻工职业技术学院计算机系,广州510300

出　　处：《计算机工程》2010年第9期117-119,共3页Computer Engineering

基　　金：广东省自然科学基金资助项目(05011896);广东轻工职业技术学院基金资助项目(KY200807)

摘　　要：针对多链路接入问题,选取链路成本及影响网络性能的路由跳数作为多链路出口路径选择的优化对象,通过建立多目标优化模型,将多链路出口路径选择转化为动态规划问题,提出一个基于动态规划的多链路出口路径选择优化算法。模拟结果表明,该算法能有效提高网络性能,降低网络链路成本。Aiming at the multi-link switch-in problem,the link cost and routing hop which mainly affects network performance are chose as the optimal objects of multi-link egress path selection.A multi-objective optimization model is set up.The multi-link egress path selection is transformed into dynamic programming problem.Accordingly,a multi-link egress path selection algorithm based on dynamic programming is presented.Simulation results show the algorithm can promote network performance and cut down network link cost.

关 键 词：多链路 动态规划 路径选择 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]