Dynamic ECMP (Equal-Cost Multi-Path) chip implementation method based on elephant flow

Abstract

The invention discloses a dynamic ECMP (Equal-Cost Multi-Path) chip implementation method based on an elephant flow, and the method specifically comprises the steps: detecting the elephant flow and recording the elephant flow in a chip; looking up a route table, and obtaining an ECMP route group; judging whether the ECMP group contains an enabling dynamic ECMP or not: dynamically triggering a chip and automatically selecting a link with the smallest load if the ECMP group contains the dynamic ECMP, or else, selecting one static link according to a Hash value of a message; and finally transmitting the message according to the selected link. The method triggers the chip to automatically select the link at a right moment according to the state of the elephant flow and the current load condition of an ECMP link, selects the link with the smallest load from the ECMP members at each time, and achieves an effect of link load balancing. The method provided by the invention is simple in implementation mode, facilitates the improvement of the utilization rate of network bandwidth, and reduces the impact on the network performance from the elephant flow.

Description

technical field [0001] The invention relates to the routing technology in the Ethernet, in particular to a method for implementing a dynamic ECMP chip based on elephant flow. Background technique [0002] The traditional routing method of Ethernet is to use the routing table to forward packets according to the destination IP address. However, there are many different links in the network environment to reach the same destination address. If the traditional routing technology is used, the data packet sent to the destination address can only use one of the links, and the other links are in backup state or invalid. state, and it takes a certain amount of time to switch between each other in a dynamic routing environment, while Equal-Cost Multipath Routing (ECMP) uses static hash mapping technology based on data flow to randomly split the flow into multiple available ones, etc. On the cost path, multiple links can be used simultaneously in this network environment, which not on...

AI Technical Summary

Problems solved by technology

[0005] However, this hash-map-based strategy is only effective when there are only mouse flows (data flows with a small number of bytes) and no elephant flows (data flows with a large number of bytes) in the network. If the actual load of the link is not considered, the link load will be uneven. In this way, in the ECMP group, some ECMP member links may have congestion or even packet loss, while some links have always been lightly loaded. not even ...

Images