Research On Routing Algorithm For MPLS-TE

MPLS is a multi-protocol label switching system applied to the fast data packet switching and routing, it provides a target network traffic, routing, forwarding and switching capabilities. It offers a unique way: the IP address mapping to a simple label with a fixed length, which applied to different packet forwarding and packet switching technology. MPLS-TE refers to the traffic engineering application on the network in MPLS. The main goal of MPLS-TE is to find the optimal data transmission path between two network nodes, and this choice of the optimal transmission path may be based on some constraints measurement. The current MPLS-TE-based routing algorithm: CSPF algorithm is mainly based on Dijkstra algorithm, it is used to configure the appropriate management of the mainstream of distance considering the bandwidth as a constraint measurement, or with the delay as a constraint measurement, or as with the bandwidth and latency constraints measurement, and or be multi-constrained measurement routing algorithm.In this article, we will focus on two kinds of constraint measurement-based routing algorithm, these two algorithms are based on bandwidth constrained measurement routing algorithm and the multiple constraints measurement routing algorithm. These two MPLS-TE routing algorithms are based on the Dijkstra algorithm, and the analysis and research will focus in this article.Firstly, starting from the link weight calculation rule, this paper select the link weight of this value as an emphasis of research focus in a single constraint measurement MPLS-TE network. From the improvement of link weight (taking the case of available bandwidth into account) values manner, this paper provides an improved single constraint measurement routing algorithms. In a multiple constraints measurement MPLS-TE network, the focus point will be integrated as a measure of value. Thinking of different link parameters in the severe case of deviation, this paper provides an improved multiple constraints measurement routing algorithm. The new single constraint measurement routing algorithm and new multiple constraints measurement routing algorithm for MPLS-TE in particular: (1) bandwidth constraint measurement-based routing algorithm: improved Dijkstra algorithm for simple MPLS-TE network of small. Through the algorithm simulation can be seen in a small network, this algorithm can solve the problem of fish-shaped route. So it can enhance the utilization of the link. Because its parameters are simple, easy to configure, so this algorithm for small MPLS-TE network has good usability. (2) Multiple constraints measurement-based routing algorithm: multi-dimensional approximation algorithm. This algorithm is a constraint to each of multidimensional space as a coordinate. By improving the algorithm to improve link utilization, this algorithm also improve time complexity. Finally, the algorithm simulated in the simulation software OPNET and analysis the simulation comparison of simulation data. The simulation results of the analysis show that although the approximation algorithm for multi-dimensional space time complexity of has been increased, but it could prevent the route congestion and improve the link connection rate has better performance.