Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing

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 ges 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 addit...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking Vol. 16; no. 3; pp. 656 - 669
Main Authors: Guoliang Xue, Weiyi Zhang, Jian Tang, Thulasiraman, K.
Format: Journal Article
Language:English
Published: New York IEEE 01.06.2008
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Additives
Algorithm design and analysis
Algorithms
Approximation
Approximation algorithms
Computer networks
Computer science
Constraint optimization
Costs
Delay
Efficient approximation algorithms
Mathematical analysis
Mathematical models
multiple additive constraints
Optimization
Polynomials
Quality of service
quality-of-service (QoS) routing
Routing
Routing (telecommunications)
Studies
Time factors
ISSN:1063-6692, 1558-2566
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 ges 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(mn log log log n + mn/epsi) time (1 + epsi)(K - 1)-approximation algorithm and an O(mn log log log n + m(n/epsi) K-1 ) time (1 + epsi)-approximation algorithm, for any epsi > 0. When K is reduced to 2, both algorithms produce an (1 + epsi)-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/epsi) 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 - epsi) 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 - epsi) times the corresponding constraint, our algorithm finds a feasible path in O(m(H/epsi) K-1 ) time. This algorithm improves previous best-known algorithms with O((m + n log n)n/epsi) time for K = 2 and 0(mn(n/epsi) K-1 ) time for if ges 2.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2007.900712