Polynomial time approximation algorithms for multi-constrained QoS routing

Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan Thulasiraman

Research output: Contribution to journalArticle

110 Citations (Scopus)

Abstract

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 QoS constraints. This problem is NP-hard and is commonly modeled using a graph with n vertices and m edges with K additive QoS parameters associated with each edge. For the case of K = 2, the problem has been well studied, with several provably good polynomial time-approximation algorithms reported in the literature, which enforce one constraint while approximating the other. We first focus on an optimization version of the problem where we enforce the first constraint and approximate the other K - 1 constraints. We present an O(mnlog log log n + mn/ε) time (1 + ε)(K - 1)-approximation algorithm and an O(mnlog log log n + mn/ ε)K-1) time (1 + ε)-approximation algorithm, for any ε > 0. When K is reduced to 2, both algorithms produce an (1 + ε)-approximation with a time complexity better than that of the best-known algorithm designed for this special case. We then study the decision version of the problem and present an O(m(n/ε)K-1) time algorithm which either finds a feasible solution or confirms that there does not exist a source-destination path whose first weight is bounded by the first constraint and whose every other weight is bounded by (1 - ε) times the corresponding constraint. If there exists an H-hop source-destination path whose first weight is bounded by the first constraint and whose every other weight is bounded by (1 - ε) times the corresponding constraint, our algorithm finds a feasible path in O(m(H/ε)K-1) time. This algorithm improves previous best-known algorithms with O((m+n log n)n/ε) time for K = 2 and O(mn(n/ε)K-1) time for K ≥ 2.

Original languageEnglish (US)
Pages (from-to)656-669
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume16
Issue number3
DOIs
StatePublished - Jun 2008

Fingerprint

Approximation algorithms
Quality of service
Polynomials
Computational complexity

Keywords

  • Efficient approximation algorithms
  • Multiple additive constraints
  • Quality-of-service (QoS) routing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

Polynomial time approximation algorithms for multi-constrained QoS routing. / Xue, Guoliang; Zhang, Weiyi; Tang, Jian; Thulasiraman, Krishnaiyan.

In: IEEE/ACM Transactions on Networking, Vol. 16, No. 3, 06.2008, p. 656-669.

Research output: Contribution to journalArticle

Xue, Guoliang ; Zhang, Weiyi ; Tang, Jian ; Thulasiraman, Krishnaiyan. / Polynomial time approximation algorithms for multi-constrained QoS routing. In: IEEE/ACM Transactions on Networking. 2008 ; Vol. 16, No. 3. pp. 656-669.
@article{d4b5e114105f4553ae01e54fa651519a,
title = "Polynomial time approximation algorithms for multi-constrained QoS routing",
abstract = "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 QoS constraints. This problem is NP-hard and is commonly modeled using a graph with n vertices and m edges with K additive QoS parameters associated with each edge. For the case of K = 2, the problem has been well studied, with several provably good polynomial time-approximation algorithms reported in the literature, which enforce one constraint while approximating the other. We first focus on an optimization version of the problem where we enforce the first constraint and approximate the other K - 1 constraints. We present an O(mnlog log log n + mn/ε) time (1 + ε)(K - 1)-approximation algorithm and an O(mnlog log log n + mn/ ε)K-1) time (1 + ε)-approximation algorithm, for any ε > 0. When K is reduced to 2, both algorithms produce an (1 + ε)-approximation with a time complexity better than that of the best-known algorithm designed for this special case. We then study the decision version of the problem and present an O(m(n/ε)K-1) time algorithm which either finds a feasible solution or confirms that there does not exist a source-destination path whose first weight is bounded by the first constraint and whose every other weight is bounded by (1 - ε) times the corresponding constraint. If there exists an H-hop source-destination path whose first weight is bounded by the first constraint and whose every other weight is bounded by (1 - ε) times the corresponding constraint, our algorithm finds a feasible path in O(m(H/ε)K-1) time. This algorithm improves previous best-known algorithms with O((m+n log n)n/ε) time for K = 2 and O(mn(n/ε)K-1) time for K ≥ 2.",
keywords = "Efficient approximation algorithms, Multiple additive constraints, Quality-of-service (QoS) routing",
author = "Guoliang Xue and Weiyi Zhang and Jian Tang and Krishnaiyan Thulasiraman",
year = "2008",
month = "6",
doi = "10.1109/TNET.2007.900712",
language = "English (US)",
volume = "16",
pages = "656--669",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Polynomial time approximation algorithms for multi-constrained QoS routing

AU - Xue, Guoliang

AU - Zhang, Weiyi

AU - Tang, Jian

AU - Thulasiraman, Krishnaiyan

PY - 2008/6

Y1 - 2008/6

N2 - 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 QoS constraints. This problem is NP-hard and is commonly modeled using a graph with n vertices and m edges with K additive QoS parameters associated with each edge. For the case of K = 2, the problem has been well studied, with several provably good polynomial time-approximation algorithms reported in the literature, which enforce one constraint while approximating the other. We first focus on an optimization version of the problem where we enforce the first constraint and approximate the other K - 1 constraints. We present an O(mnlog log log n + mn/ε) time (1 + ε)(K - 1)-approximation algorithm and an O(mnlog log log n + mn/ ε)K-1) time (1 + ε)-approximation algorithm, for any ε > 0. When K is reduced to 2, both algorithms produce an (1 + ε)-approximation with a time complexity better than that of the best-known algorithm designed for this special case. We then study the decision version of the problem and present an O(m(n/ε)K-1) time algorithm which either finds a feasible solution or confirms that there does not exist a source-destination path whose first weight is bounded by the first constraint and whose every other weight is bounded by (1 - ε) times the corresponding constraint. If there exists an H-hop source-destination path whose first weight is bounded by the first constraint and whose every other weight is bounded by (1 - ε) times the corresponding constraint, our algorithm finds a feasible path in O(m(H/ε)K-1) time. This algorithm improves previous best-known algorithms with O((m+n log n)n/ε) time for K = 2 and O(mn(n/ε)K-1) time for K ≥ 2.

AB - 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 QoS constraints. This problem is NP-hard and is commonly modeled using a graph with n vertices and m edges with K additive QoS parameters associated with each edge. For the case of K = 2, the problem has been well studied, with several provably good polynomial time-approximation algorithms reported in the literature, which enforce one constraint while approximating the other. We first focus on an optimization version of the problem where we enforce the first constraint and approximate the other K - 1 constraints. We present an O(mnlog log log n + mn/ε) time (1 + ε)(K - 1)-approximation algorithm and an O(mnlog log log n + mn/ ε)K-1) time (1 + ε)-approximation algorithm, for any ε > 0. When K is reduced to 2, both algorithms produce an (1 + ε)-approximation with a time complexity better than that of the best-known algorithm designed for this special case. We then study the decision version of the problem and present an O(m(n/ε)K-1) time algorithm which either finds a feasible solution or confirms that there does not exist a source-destination path whose first weight is bounded by the first constraint and whose every other weight is bounded by (1 - ε) times the corresponding constraint. If there exists an H-hop source-destination path whose first weight is bounded by the first constraint and whose every other weight is bounded by (1 - ε) times the corresponding constraint, our algorithm finds a feasible path in O(m(H/ε)K-1) time. This algorithm improves previous best-known algorithms with O((m+n log n)n/ε) time for K = 2 and O(mn(n/ε)K-1) time for K ≥ 2.

KW - Efficient approximation algorithms

KW - Multiple additive constraints

KW - Quality-of-service (QoS) routing

UR - http://www.scopus.com/inward/record.url?scp=45749119528&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=45749119528&partnerID=8YFLogxK

U2 - 10.1109/TNET.2007.900712

DO - 10.1109/TNET.2007.900712

M3 - Article

AN - SCOPUS:45749119528

VL - 16

SP - 656

EP - 669

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 3

ER -