Single-path traffic-engineering with explicit routes in a flat Differentiated Services network

In this paper, we present a scalable algorithm, capable of finding a single-path traffic-engineered solution for routing traffic in a Differentiated Services network by means of explicit paths. Additional supported features are preemption, fast restoration, with a choice of protection scheme, oversubscription and resource class affinity. The performance of the algorithm is demonstrated by means of statistical simulations on randomly generated network topologies