Routing in MPLS networks with probabilistic failures

We present a routing scheme for MPLS networks with probabilistic failures. Our routing scheme simultaneously maximizes the expected satisfied demand and minimizes the maximum link utilization of the network. Our approach is novel in that it is the first to jointly address the traffic engineering and the routing through reliable paths problems. In addition to the optimal routing algorithm, we present a lower complexity heuristic algorithm based on Linear Programming and Yen´s algorithm. Finally, numerical results are presented to demonstrate the effectiveness of both our optimal and heuristic algorithms.