Approximation Algorithm for QoS Routing with Multiple Additive Constraints
Ronghui Hou, Ki Lui, K.-C. Leung, Fred Baker · 2009
In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complete and many approximation algorithms have been developed. We propose a new approximation algorithm called multi-dimensional relaxation algorithm. We formally prove that our algorithm produces smaller approximation error than the existing algorithms. We further verify the performance by extensive simulations.