Sciweavers

1574 search results - page 21 / 315
» Efficient QoS Routing
Sort
View
TON
2008
119views more  TON 2008»
15 years 5 months ago
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 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
QOSIP
2005
Springer
15 years 11 months ago
Unicast and Multicast QoS Routing with Multiple Constraints
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
Dan Wang, Funda Ergün, Zhan Xu
JNCA
2008
123views more  JNCA 2008»
15 years 5 months ago
Edge-limited scalable QoS flow set-up
Although the Differentiated Services architecture supports scalable packet forwarding based on aggregate flows, the detailed procedure of Quality of Service (QoS) flow set-up with...
James Lembke, Byung Kyu Choi
APNOMS
2006
Springer
15 years 9 months ago
Network-Adaptive QoS Routing Using Local Information
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP p...
Jeongsoo Han
ICC
2009
IEEE
136views Communications» more  ICC 2009»
16 years 14 days ago
Approximation Algorithm for QoS Routing with Multiple Additive Constraints
—In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complet...
Ronghui Hou, King-Shan Lui, Ka-Cheong Leung, Fred ...