A New Dynamic Routing Algorithm Based on Minimum Interference in MPLS Networks

The LSP routing algorithm in MPLS becomes the core and hot topic of traffic engineering. This paper presents a new routing scheme that uses the current bandwidth availability and the traffic flow distribution to achieve traffic engineering in IP networks. It reduces the interference among competing flows by balancing the number and quantity of flows carried by a link to achieve efficient routing of MPLS bandwidth guaranteed LSPs. Simulation result shows the algorithm is better than other algorithms in reject ratio of the traffic requests, especially in computing time cost.