Delay-based adaptive load balancing in MPLS networks

In this paper, we propose a new adaptive load balancing mechanism for MPLS networks in that core LSRs are not required to perform traffic engineering. Based on measurements, we obtain the average one-way delay between a pair of label switched routers (LSR), and dynamically distribute traffic load among multiple label switched paths (LSP) according to this average. Simulation results indicate that our approach improves end-to-end throughput and decreases packet loss probability. Our work demonstrates that our algorithm is robust and simple to use.