Sciweavers

COMCOM
2006
75views more  COMCOM 2006»
13 years 11 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
ICC
2009
IEEE
136views Communications» more  ICC 2009»
14 years 6 months ago
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-complet...
Ronghui Hou, King-Shan Lui, Ka-Cheong Leung, Fred ...