FATE: a polynomial time framework for flow allocation in MPLS-TE networks

In this paper, we present a novel polynomial time framework for the off-line flow allocation problem in MPLS-traffic engineering (MPLS-TE) networks. This framework, named FATE (flow allocation for traffic engineering), encom-passes different objectives that illustrate the operator needs for traffic engineering and provides advanced control over the quality of the solution. Typically, we consider minimizing congestion, bandwidth consumption and operational costs. FATE is based on linear programming and presents an efficient solution for the problem both in terms of computational complexity and approximation guarantees. Simulation results show that we can get an efficient trade-off between congestion and bandwidth consumption while having a reduced number of label switched paths (LSPs) for various known topologies