Routing computation method of fat-tree topology, node equipment and communication system

Abstract

The embodiment of the invention discloses a routing computation method of fat-tree topology, node equipment and a communication system. The method comprises the following steps: a main node receives the identifier and interconnection interface information of a first node which are sent by a first node,; the first node can be other nodes except the main node in the fat tree; the main node and the first node belong to the same fat tree, and the order of the main node in the fat tree is 0; according to the received identifier and interconnection interface information of the first node, the route of the fat tree topology is calculated; and a calculation result is sent to the first node. Through the identifier and interconnection interface information of the first node which are sent by the first node according to the identifier and interconnection interface information of the main node, the main node knows the topology of the fat tree; and then, a rough is calculated according to the topology and the calculated route is sent to the first node; therefore, lots of maual configuration can be reduced configuration errors are decreased and configuration speed is improved.

Description

technical field [0001] The present invention relates to the field of communication technology, in particular to a fat tree topology route calculation method and device. Background technique [0002] In data centers and large-scale cluster router / switch systems, due to the increasing density of data centralized processing and the increasing number of server storage, the bandwidth of the network root node provided by Internet services has become a communication bottleneck. The fat-tree (fat-tree) topology has good characteristics, the closer to the root node, the greater the bandwidth of the link, so it is a network topology often used in data centers and cluster systems. The fat tree generally uses the rank (Rank) value to distinguish the level of the nodes in the network (that is, the level in the fat tree), for example, the Rank of the root node is 0, and the rank of the node directly connected to the root node is 1. The fat tree topology not only provides non-blocking tra...

AI Technical Summary

Problems solved by technology

[0004] The topology collection process of the fat tree usually adopts a static configuration method, which needs to be configured on each node of the fat tree. These configurations are currently performed manually and the configuration information of each node is different. When the network scale is large and the nodes are distributed in different places , manual configuration is slow and error-prone

Images