Unicast and multicast QoS routing with multiple constraints

Dan Wang, Funda Ergun, Zhan Xu

Research output: Journal article publicationConference articleAcademic researchpeer-review

3 Citations (Scopus)


We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for the unicast case. We then explore the use of optimization techniques in devising heuristics for QoS routing both in the unicast and multicast settings using algorithmic techniques as well as techniques from optimization theory. We present test results showing that our techniques perform very well in the unicast case. For multicast with multiple constraints, we present the first results that we know of where one can quickly obtain near-optimal, feasible trees.

Original languageEnglish
Pages (from-to)481-494
Number of pages14
JournalLecture Notes in Computer Science
Publication statusPublished - 9 Sept 2005
Externally publishedYes
EventThird International Workshop on Quality of Service in Multiservice IP Networks, QoS-IP 2005 - Catania, Italy
Duration: 2 Feb 20054 Feb 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Unicast and multicast QoS routing with multiple constraints'. Together they form a unique fingerprint.

Cite this