Adjusting Traffic over Multi-paths Based on Feasible Distance of Path
基于路径可行距离的流量调整算法

For eliminating the problem of poor load balancing which is resulted from implementing current adjusting traffic algorithms over multi-paths,IAH(Improved Adjustment Heuristic) was proposed. IAH utilizes the information of whole network and nodes which show the state of loads on the links. Based on the change of feasible distance of paths in routing information and the principle that the capability of short path is better than one long path, IAH adj usts traffic over multi-paths, transfers traffic from links with heavy load to light ones and make their traffic respectively match with their feasible distance. Simulation results show that the time of losing packets in implementing IAH is later than AH and the losing packet rate of IAH is better than AH in most time. Namely, the load balancing performance of IAH exceeds one of AH.