Study of scalability properties of two LP-based algorithms for traffic engineering in a flat differentiated services network

Two mixed-integer linear programming (MILP) formulations of a centralized, off-line traffic engineering tool are compared with respect to their scalability properties. Such an algorithm can be used to optimize the routing configuration in a DiffServ network. It is shown that a considerable reduction of the number of variables and constraints can be obtained by pairing primary and protection path candidates prior to the routing optimization. Simulations of networks with different sizes evidence this result,.