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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE/ACM transactions on networking Ročník 16; číslo 3; s. 656 - 669
Hlavní autoři:	Guoliang Xue, Weiyi Zhang, Jian Tang, Thulasiraman, K.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.06.2008 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
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!