Path provisioning for service level agreements in Differentiated Services networks

We study the path provisioning as a mechanism to deliver service level agreements in IP Differentiated Services networks. There is no known polynomial time solution for this problem, so we propose and analyze (by simulations) several heuristic algorithms for solving the problem. As our simulations demonstrate, a centralized server consistently delivers a better performance than a distributed solution. We also show that the performance of one of the proposed algorithms, the greedy algorithm with backtracking, can be very close to the optimal one, while being computationally feasible.