Routing with many additive QoS constraints

Guoliang Xue, Arunabha Sen, Rakesh Banka

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

14 Scopus citations

Abstract

A fundamental problem in QoS routing is to find a path between a specified source-destination node pair that satisfies a set of end-to-end quality-of-service constraints. We study this problem in a communication system where there are multiple additive quality of service parameters associated with each link. It is well-known that the multi-constrained path selection problem (MCPS) is NP-complete. In this paper, we present a fully polynomial time approximation scheme for an optimization version of the MCPS problem. This means that for any given ε > 0, we can compute, in time bounded by a polynomial of the input size of the problem and in 1/ε, a solution whose cost is at most (1 + ε) of that of the optimal solution.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages223-227
Number of pages5
Volume1
StatePublished - 2003
Event2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States
Duration: May 11 2003May 15 2003

Other

Other2003 International Conference on Communications (ICC 2003)
CountryUnited States
CityAnchorage, AK
Period5/11/035/15/03

Keywords

  • Efficient approximation algorithms
  • Multiple additive constraints
  • Quality of service routing

ASJC Scopus subject areas

  • Media Technology

Fingerprint Dive into the research topics of 'Routing with many additive QoS constraints'. Together they form a unique fingerprint.

  • Cite this

    Xue, G., Sen, A., & Banka, R. (2003). Routing with many additive QoS constraints. In IEEE International Conference on Communications (Vol. 1, pp. 223-227)