MPLS网络中面向流量工程的路由算法  

A Routing Algorithm for Traffic Engineering in MPLS Networks

作　　者：何涛[1] 王锁萍[2] 张明[1] 

机构地区：[1]南京邮电大学软件学院,江苏南京210003 [2]南京邮电大学自动化学院,江苏南京210003

出　　处：《南京邮电大学学报（自然科学版）》2010年第5期68-72,共5页Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition

摘　　要：针对MPLS流量工程,提出了一种新的路由选择算法:最小竞争路由算法,目的是为了提高网络资源的利用率,使之能够接受尽可能多的路由请求。在选择路径时,算法同时考虑到了最大流零流边对最大流的影响以及MPLS网络中各出口-入口对之间带宽资源的竞争。仿真结果表明,与参与测试的算法相比,最小竞争路由算法能够接受更多的路由请求。A new routing algorithm,minimum competition routing algorithm,is proposed for MPLS traffic engineering.The algorithm targets to improve the utilization of network resources,and enable network to accept the route request as much as possible.The algorithm not only takes the impact of maximum-flow-zero-edge into account but also considers competition for bandwidth among all ingress-egress pairs in a MPLS network.Simulation results have shown that the minimum competition routing algorithm can accept more route requests than other three algorithms.

关 键 词：流量工程 MPLS 路由选择 最小干涉 

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