Two additive-constrained path selection in the presence of inaccurate state information
Yanxing Zheng
Korkmaz, T.
Wanhua Dou
Sch. of Comput. Sci., Nat. Univ. of Defense Technol., Changsha, China
This paper appears in: Next Generation Internet Networks, 2005 Publication Date: 18-20 April 2005
On page(s):
16
- 23
ISSN:
ISBN: 0-7803-8900-X
Digital Object Identifier: 10.1109/NGI.2005.1431642
Current Version Published: 2005-05-23
Abstract
In this paper, we study quality-of-service (QoS) routing, particularly two additive-constrained path problem, in the presence of inaccurate state information. We formulate this problem as most-probable two-additive-constrained path (MP-TACP) problem. To solve it, we follow a probabilistic approach and propose an algorithm called MP-TACPA. In general, MP-TACPA uses pre- and on-demand computation along with both linear and nonlinear search techniques. In contrast to previous algorithms using similar techniques, MP-TACPA takes into account the inaccuracies along with new bounds and heuristics including look ahead, dominance probability that contribute the low average computation cost. Extensive simulations show that MP-TACPA algorithm behaves very well in the presence of inaccurate state information under two additive constraints.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You are not
logged in.
Guests
may access Abstract records free of charge.
Cart
