Multiconstrained QoS routing: Greedy is good

Guoliang Xue, Weiyi Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationIEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
Number of pages6
StatePublished - 2007
Event50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007 - Washington, DC, United States
Duration: Nov 26 2007Nov 30 2007

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference


Other50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
Country/TerritoryUnited States
CityWashington, DC


  • Efficient approximation algorithms
  • Greedy algorithms
  • Multiple additive constraints
  • QoS routing

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'Multiconstrained QoS routing: Greedy is good'. Together they form a unique fingerprint.

Cite this