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!

Be the first to leave a comment!