Finding the Most Balanced Delay Constrained Path

Sometimes the backbone network of Internet experiences congestion because traffic is not distributed rationally. This fact may lead network resources utilized inefficiently. The main idea for load balancing is to alter the route for some traffic. But current approaches with this idea often get such a long route that decrease the quality of service. This paper presents a new flow routing adjustment algorithm which can substantially balance the traffic of network with delay constrained to some extent. With simulation method, it is proved that, compared with current methods, the new algorithm can improve the throughput of network greatly and at the same time provide quality of service guarantee. Moreover, the theoretical analysis shows that the computational complexity of the new algorithm is O(N²log N), which is better than that of most current methods.