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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on networking Jg. 16; H. 3; S. 656 - 669
Hauptverfasser:	Guoliang Xue, Weiyi Zhang, Jian Tang, Thulasiraman, K.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.06.2008 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!