Routing for multi-constrained path problem with imprecise state information

Abstract

This paper discusses the NP-complete multi-constrained path problem with imprecise state information, and a distributed heuristic framework without any imprecision assumption is presented. This framework needs no link state exchanging message, and employs mobile agents to search feasible paths in parallel. Two key strategies are used: to select a suitable next node, and to choose the appropriate one from all feasible paths. Simulation results indicate that the presented solution is scaleable and efficient. An appropriate path selecting strategy with traffic engineering can improve network performance. And the framework can tolerate high degree of information imprecision