Minimizing the impact of stale link state information on QoS routing

In this paper, we show that routing without considering the staleness of link state information introduced by update policies may generate significant percentage of false routing. Hence, we introduce and investigate the issue of minimizing the impact of stale link state information on the performance of QoS routing without stochastic link state knowledge. Under the assumption that trigger-based link state policies are adopted for updating link state information, we theoretically decouple the problem of finding the most probable feasible path (without link state stochastic knowledge) to the problems of finding the Multiple Additively Constrained Path (MACP) and finding the Least Cost Multiple Additively Constrained Path (LCMACP), respectively, and propose a framework for minimizing the impact of stale link state information on the performance of QoS routing. We show by theoretical analysis and extensive simulations that our proposed framework is effective in minimizing the undesirable effect of the staleness of link state information.