Two additive-constrained path selection in the presence of inaccurate state information

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.