Approximation Algorithm for QoS Routing with Multiple Additive Constraints

—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.1

• Type: Conference
• Year: 2009
• Where: ICC
• Authors: Ronghui Hou, King-Shan Lui, Ka-Cheong Leung, Fred Baker
• Keywords: Approximation Algorithm, Communications, ICC 2009, Multi-dimensional Relaxation Algorithm, Multiple Additive Constraints