Sciweavers

107 search results - page 1 / 22
» On Balancing Delay and Cost for Routing Paths
Sort
View
ICCS
2004
Springer
13 years 10 months ago
On Balancing Delay and Cost for Routing Paths
Abstract. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The path cost of the least delay (LD) path is relatively more expe...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
ICCSA
2004
Springer
13 years 10 months ago
New Parameter for Balancing Two Independent Measures in Routing Path
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
ICOIN
2001
Springer
13 years 9 months ago
Performance Analysis of QoS Routing with Network Dependant Delay Cost
This paper investigates the problem of path calcul ation of multiple metric routing. Toda ’s Internet routing is based on a single metric path selecting algorithm. Single metric...
Hahnearl Jeon, Sung-Dae Kim, Young Joon Kim, Hyung...
INFOCOM
2009
IEEE
13 years 11 months ago
Minimizing End-to-End Delay: A Novel Routing Metric for Multi-Radio Wireless Mesh Networks
—This paper studies how to select a path with the minimum cost in terms of expected end-to-end delay (EED) in a multi-radio wireless mesh network. Different from the previous eff...
Hongkun Li, Yu Cheng, Chi Zhou, Weihua Zhuang
LION
2009
Springer
145views Optimization» more  LION 2009»
13 years 11 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall