The Dynamic Equal-Cost-Multi-Paths Routing Algorithm Based on the Average Link Utilization
Xuezhen Xu, Wei Li · 2014
In order to improve load balancing and reduce network congestion, the traffic flows will distribute among the equal-cost-multi-paths (ECMPs) on the forwarding node. As the existing algorithms cannot deal with the traffic load real-time, a dynamic equal-cost-multi-paths(ECMPs) routing algorithm based on the average link utilization (ALU) has been proposed. It collects the value of link utilization and calculates the proportion of reallocation to adapt to the load change of network. Using the average link utilization as the adjustment standard can not only get the better load balancing performance, but with the fewer iterations, ensure the stability of the network. In particular, it considers with the case of overlapping links, which can further reduce the whole network congestion. The ALU provides no packets arrived out-of-order and the lowest average end-to-end packet delay. The simulation results show that the algorithm greatly increases the network throughput.