Multi-path constraint-based routing algorithms for MPLS traffic engineering

This paper proposes two multi-path constraint-based routing algorithms for Internet traffic engineering using MPLS. In a normal constraint-based shortest path first (CSPF) routing algorithm, there is a high probability that it cannot find a feasible path through networks for a large bandwidth constraint, which is one of the most important constraints for traffic engineering. The proposed algorithms can divide the bandwidth constraint into two or more seconds and find a constrained path for each subconstraint. Extensive simulations show that they enhance the success probability of path setup and the utilization of network resources.