Finding a Path Subject to Many Additive QoS Constraints

A fundamental problem in quality-of-service (QoS) routing is to find a path between a source-destination node pair that satisfies two or more end-to-end QoS constraints. We model this problem using a graph with n vertices and m edges with K additive QoS parameters associated with each edge, for any...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on networking Jg. 15; H. 1; S. 201 - 211
Hauptverfasser:	Guoliang Xue, Sen, A., Weiyi Zhang, Jian Tang, Thulasiraman, K.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.02.2007 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Additives Algorithms Approximation Approximation algorithms Bandwidth Complexity Computer network reliability Computer networks Computer science Constraint optimization Costs Delay effects Efficient approximation algorithms Graphs multiple additive constraints Operations research Optimization Polynomials QoS routing Quality of service Routing (telecommunications) Routing protocols Studies
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!