Abstract:

This paper presents a new dynamic online routing algorithm for the Multi-Protocol Label Switching （MFLS） traffic engineering. The prior famous MPLS  routing algorithms such as MIRA try to minimize the interference between different source-destination pairs by circumventing the critical links. But it  may choose a very long path, and the identification of critical links is not very accurate in some circumstances. The main contribution of this paper is   a new heuristic routing approach which maximizes the sum of the maximum flow value of all the other S-D pairs. Simulation results show that ourproposed  algorithm performs better than the existing famous algorithms in the literature.

Key words: traffic engineefing, constraint based routing, MPLS, interference minimizing