Routing for multi-constrained path problem with imprecise additive link state information

Abstract

This paper discusses the NP-complete multi-constrained path problem with imprecise state information, and a heuristic pre-computation algorithm based on flooding with imprecise additive link state information is presented. This algorithm uses limited flooding policy based on selective non-dominated path and can find paths from present node to all other nodes only running once. And the algorithm deals with imprecise additive link state information without any imprecision assumption. Selecting limited non-dominated paths kept at each node reduces space complexity and limited usage time of each link during a routing computation reduces time complexity. Several simulations indicate that the algorithm is efficient, scaleable, and can provide satisfied call acceptance probability with imprecise additive link state information.