TY - GEN
T1 - Multiconstrained QoS routing
T2 - 50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
AU - Xue, Guoliang
AU - Zhang, Weiyi
PY - 2007
Y1 - 2007
N2 - 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. This multiconstrained path problem (MCP) is known to be NP-complete. In a recent paper, Xue et al. showed that the shortest path with respect to a single auxiliary edge weight (obtained by combining the K edge weights into a single metric) is a K-approximation to MCP, in the sense that the largest ratio of path weight over its corresponding constraint is within a factor of K from minimum. In this paper, we present a simple greedy algorithm and prove that this greedy algorithm is also a K-approximation algorithm to MCP. Extensive computational results show that this greedy algorithm is superior to the previously best known K-approximation algorithm in terms of the quality of the path computed. Our algorithm is as simple as Dijkstra's shortest path algorithm, and is therefore suitable for implementation in Internet protocols.
AB - 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. This multiconstrained path problem (MCP) is known to be NP-complete. In a recent paper, Xue et al. showed that the shortest path with respect to a single auxiliary edge weight (obtained by combining the K edge weights into a single metric) is a K-approximation to MCP, in the sense that the largest ratio of path weight over its corresponding constraint is within a factor of K from minimum. In this paper, we present a simple greedy algorithm and prove that this greedy algorithm is also a K-approximation algorithm to MCP. Extensive computational results show that this greedy algorithm is superior to the previously best known K-approximation algorithm in terms of the quality of the path computed. Our algorithm is as simple as Dijkstra's shortest path algorithm, and is therefore suitable for implementation in Internet protocols.
KW - Efficient approximation algorithms
KW - Greedy algorithms
KW - Multiple additive constraints
KW - QoS routing
UR - http://www.scopus.com/inward/record.url?scp=39349095835&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=39349095835&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2007.359
DO - 10.1109/GLOCOM.2007.359
M3 - Conference contribution
AN - SCOPUS:39349095835
SN - 1424410436
SN - 9781424410439
T3 - GLOBECOM - IEEE Global Telecommunications Conference
SP - 1866
EP - 1871
BT - IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
Y2 - 26 November 2007 through 30 November 2007
ER -