An effective algorithm for delay constrained least cost unicast routing

This paper discusses the NP-complete delay constrained least cost path problem, and a distributed heuristic algorithm based on mobile agent, which is called the mobile agent routing algorithm based on residual evaluation is presented. And several algorithm instances with different path selecting strategies are examined through computerized simulations. The results indicate that the presented solution is scaleable. An appropriate path selecting strategy can improve network performance. And the algorithm can provide satisfying call acceptance performance.