作者: S.K. Biswas , S. Ganguly , R. Izmailov
关键词:
摘要: 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 solving problem. As our simulations demonstrate, centralized server consistently delivers better performance than distributed solution. also show that of one proposed algorithms, greedy algorithm with backtracking, can be very close optimal one, while being computationally feasible.