An algorithm based on mobile agent for delay constrained least cost unicast routing
Xin Jin, Liu Xian-de, Xiao Shi-yuan · Wuhan University Journal of Natural Sciences · 2005
The delay constrained least cost path problem with imprecise delay information is discussed, and a distributed heuristic algorithm without any assumption of imprecise state information is presented. The algorithm employs mobile agents to search feasible paths in parallel and requires limited network state information kept at each node. The simulations indicate that the presented solution provides better call acceptance probability and better fairness between short paths and long paths. And the algorithm can tolerate high degree of delay imprecision.