A New Dynamic Constraint-based Routing Algorithm For Traffic Engineering

In recent years, with the declining of the cost of computer hardware, computer penetration rate rising rapidly, and the resulting growing Internet population. Based on the existing network resources, how Internet Services Provider to provide more network services, to adapt to the network of new businesses continue to appear, is a problem of ISP to be resolved. Traffic Engineering is a network optimizing technology of great value,it avoids congestion by optimizing the utilization of network resources.However, the majority of Traffic Engineering solutions either high complexity or poor scalability, it is difficult to apply to the deployment of large-scale backbone networks, urgent for a new technology for Traffic Engineering.Multi-Protocol Label Switching technology has been seen the most suitable technology for Traffic Engineering. MPLS with Traffic Engineering is defined as a process of selecting a optimal path through some assessment indicators, the goal of MPLS-TE is balanced various business in the MPLS networks. MPLS with Traffic Engineering aim at a significant improvements for network quality of service.In this paper, the author researched MPLS technology and MPLS Traffic Engineering technology, after studying constrained routing algorithm, classifying and analyzing the current constrained routing algorithms. Based on the existing minimum interference routing algorithm, proposed BMIRA that meet the high throughput, load balancing, dynamic routing algorithm constrained. Through the simulation comparison of CSPF, MIRA by NS2 simulation software, the experimental data shows that BMIRA is better than the other two algorithms in terms of the number of link request, receiving transmission delay and the throughput aspect of the business, it confirms that the proposed algorithm can achieve high throughput while achieving the business network load balancing and meet the ISP network provider traffic engineering requirements.