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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE/ACM transactions on networking Ročník 15; číslo 1; s. 201 - 211
Hlavní autoři:	Guoliang Xue, Sen, A., Weiyi Zhang, Jian Tang, Thulasiraman, K.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.02.2007 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!