Sciweavers

2 search results - page 1 / 1
» Multiconstrained QoS Routing: Greedy is Good
Sort
View
GLOBECOM
2007
IEEE
14 years 5 months ago
Multiconstrained QoS Routing: Greedy is Good
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
Guoliang Xue, Weiyi Zhang
TON
2008
119views more  TON 2008»
13 years 10 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...