The Research And Implementation Of Routing Algorithm Based On MPLS Traffic Engineering

Implementing traffic engineering by MPLS can conquer the problem of the network resource's unbalanced usage induced by using IP to implement traffic engineering and the problems of bad expansibility and difficult network maintenance induced by using superposition model to implement traffic engineering. So the research on MPLS traffic engineering becomes to be a hot spot. It is very important that routing algorithm is whether efficient for implementing MPLS traffic engineering.The paper does researches on routing algorithm of MPLS traffic engineering about two pivotal problems of network's performance optimization and survivability. The paper analyzes the routing algorithm based on policy and traffic character and puts forward routing algorithm based on dynamic policy and traffic character in the research of network's performance optimization. The algorithm figures out data flows'bandwith resource distributed by network through offline computing part and then figures out transferring path through online computing part, shifting the data flows by using data flows'diverting mechanism lastly when some data flows'management policy changes to have the need of changing tranferring paths. The paper puts forward the algorithm's implementing system structure in the mode of integration and distribution to support the algorithm's pratical application in network. Then the paper puts forward fault restoration algorithm based on dynamic policy and traffic character routing algorithm in the research of network's survivability. The restoration algorithm balances the usage of network resource and improves the usage rate of resource from the angle of the whole network when it computes backup paths. The restoration algorithm can support many fault restoration models.Experiments show that routing algorithm based on dynamic policy and traffic character can admit more LSP requests and higher resource's utilization probability, and shifting data flow efficientlier to reduce dropping packets than other algorithms in common when some data flows'management policy changes to have the need of changing tranferring paths. The restoration algorithm can use resource efficientlier and admit more LSP requests than other restoration algorithms when the number of backup paths built by network is equal.