Bandwidth Constrained Routing Algorithm for MPLS Traffic Engineering

Much of the researches in network resource management have been devoted to providing bandwidth guarantees and preventing network congestion. However, most of them rely on load balancing to avoid network bottlenecks, tailoring on the other hand longer and costly paths. They ignore that longer paths can badly affect on both quality of routing, and usage efficiency of their network infrastructure. This paper presents a new bandwidth constrained routing algorithm (BCRA) for MPLS traffic engineering. The approach is an improvement of the well-known bandwidth constrained routing algorithms since it compromises between network load balancing, reducing path length, and minimizing path cost. Our proposed TE (traffic engineering) algorithm has been integrated in a toolbox for traffic engineering methods to evaluate its performance against some existing ones. Simulation results show that it outperforms the most recent algorithms under a wide range of workload, topology and system parameters. Simulations also show that our proposed algorithm gives good results in reducing rejected requests.