The invention discloses a tree
data center link layer load balancing routing method based on an annealing
algorithm. The method comprises the steps: setting a tree-shaped
data center mainly composed of an edge layer, a convergence layer and a core layer up to serve as a
link layer, wherein the edge layer, the convergence layer and the core layer each comprise a plurality of switches; then
monitoring data of a switch in real time by a deterministic network, and calculating load bandwidths of uplinks and load bandwidths of downlinks of all links according to a bandwidth required by transmission and a topological structure of a tree-shaped
data center; and iteratively
processing the current iteration state according to the load bandwidth, and updating the routing scheme in real time according to the switching scheme to obtain the optimal routing scheme. According to the invention, the high-efficiency, high-reliability and low-
delay routing method is realized, wherein the load of the data center is effectively balanced and the congestion condition of a switch port is reduced, so that the data flow routing
delay is reduced, the data flow
packet loss rate is reduced, and the method has the characteristics of low
time complexity, low space complexity, high performance and the like.