Topological structure of interconnection network, routing method and device

Abstract

The invention provides a topological structure, a routing method and a routing device of an interconnection network, the interconnection network comprises N * P * Q node sets, and the interconnection network is divided into Q network layers; each network layer serves as a target network layer and is a node set matrix with N rows and P columns, and each target node set in the target network layer is connected with adjacent node sets on the same row and the same column; the Q network layers are arranged in sequence, and the target node set is connected with the reference node set at the same position in the adjacent network layers; each node set comprises a first network node, a second network node and a third network node which are mutually connected, the first network node is connected with an adjacent node set on the same row, the second network node is connected with an adjacent node set on the same column, and the third network node is connected with a reference node set. According to the method and the device, the problem that the network communication time delay of the interconnection network is relatively large is solved, and the effect of reducing the network communication time delay of the interconnection network is achieved.

Description

Technical Field

[0001] The embodiments of the present application relate to the computer field, and in particular, to a topology structure, a routing method and a device of an interconnected network. Background Art

[0002] The interconnection network is the key to building a high-performance large-scale parallel processing system. Its design goal is to reliably and efficiently connect a certain number of functional nodes at the lowest possible cost to form a cost-effective large-scale parallel system. The current Internet network uses a grid to construct a topology, but with the continuous expansion of network scale requirements, the topology used in the current grid network will become larger and larger, which will lead to a significant increase in network communication delay, seriously affecting the efficiency of information transmission between nodes.

[0003] In the related art, there is no effective solution to the problem of large network communication delay in interconnected networks. Summary of the invention

[0004] The embodiments of the present application provide a topology structure, a routing method and a device of an interconnected network, so as to at least solve the problem of large network communication delay of the interconnected network in the related art.

[0005] According to an embodiment of the present application, a topology structure of an interconnection network is provided, including:

[0006] The interconnection network includes N×P×Q node sets, the interconnection network is divided into Q network layers, and N, P and Q are all positive integers greater than or equal to 2;

[0007] Each network layer in the Q network layers is a node set matrix with N rows and P columns as a target network layer, and each target node set in the target network layer is connected to an adjacent node set in the same row and column;

[0008] The Q network layers are arranged in sequence, the target node set is connected to the reference node set at the same position in an adjacent network layer, and the adjacent network layer is a network layer adjacent to the target network layer among the Q network layers;

[0009] Each node set includes a first network node, a second network node and a third network node which are connected to each other. The first network node is also connected to an adjacent node set in the same row, the second network node is also connected to an adjacent node set in the same column, and the third network node is also connected to the reference node set.

[0010] As an optional implementation, in the topological structure, each node set has a set identifier;

[0011] The node identification of each network node includes a set identification field and a network identification field, wherein the set identification field is used to indicate the set identification of the node set to which each network node belongs, and the network identification field is used to indicate the node set to which each network node is connected.

[0012] As an optional implementation, in the topological structure, the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located.

[0013] As an optional implementation, in the topology structure, the network identification field of the first network node is 0, the network identification field of the second network node is 1, and the network identification field of the third network node is 2.

[0014] As an optional implementation, in the topology, N=P=Q.

[0015] According to another embodiment of the present application, a routing method of an interconnected network is provided, which is applied to the above-mentioned topology structure, and the routing method includes:

[0016] According to the row relationship between the starting routing node and the final routing node, a shortest routing path from the starting routing node to the peer routing node is generated to obtain a first routing path, wherein the row relationship is used to indicate the row distance between the starting row where the starting node set where the starting routing node is located in the starting network layer and the final row where the final node set where the final routing node is located in the final network layer, and the peer node set where the peer routing node is located is located in the final row in the starting network layer;

[0017] Generate a shortest routing path from the same-column routing node to the same-column routing node according to the column relationship between the same-column routing node and the final routing node, and obtain a second routing path, wherein the column relationship is used to indicate the column distance between the current column where the same-column node set is located in the starting network layer and the final column where the final node set is located in the final network layer, and the same-column node set where the same-column routing node is located is located in the final row and the final column in the starting network layer;

[0018] According to the layer relationship between the routing nodes in the same column and the final routing node, a shortest routing path from the routing nodes in the same column to the final routing node is generated to obtain a third routing path, wherein the layer relationship is used to indicate the layer distance between the starting network layer and the final network layer, and the target routing path includes: the first routing path, the second routing path and the third routing path;

[0019] Routing from the starting routing node to the final routing node according to the target routing path.

[0020] As an optional implementation manner, generating the shortest routing path from the starting routing node to the same routing node according to the row relationship between the starting routing node and the final routing node to obtain the first routing path includes:

[0021] Obtaining a starting node identifier of the starting routing node and a final node identifier of the final routing node;

[0022] Detecting the row relationship between the starting routing node and the final routing node according to the starting node identifier and the final node identifier;

[0023] According to the row relationship, a shortest routing path from the starting routing node to the same routing node is generated to obtain the first routing path.

[0024] As an optional implementation, each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier, and a layer identifier, wherein the row identifier is used to identify the row in the node set matrix where each node set is located, the column identifier is used to identify the column in the node set matrix where each node set is located, and the layer identifier is used to identify the network layer in which each node set is located;

[0025] The detecting the row relationship between the starting routing node and the final routing node according to the starting node identifier and the final node identifier comprises:

[0026] Detecting whether a starting row identifier in the starting node identifier and a final row identifier in the final node identifier are equal;

[0027] When the start row identifier and the final row identifier are not equal, determining that the row relationship is a different row relationship;

[0028] When the start row identifier and the end row identifier are equal, determining that the row relationship is a same row relationship;

[0029] The step of generating the shortest routing path from the starting routing node to the peer routing node according to the row relationship to obtain the first routing path includes:

[0030] In the case where the row relationship is a different row relationship, generating a shortest routing path from the starting routing node to the peer routing node according to the network identification field of the starting routing node to obtain the first routing path;

[0031] When the row relationship is a row relationship, it is determined that the first routing path is empty.

[0032] As an optional implementation manner, generating the shortest routing path from the routing node in the same row to the routing node in the same column according to the column relationship between the routing node in the same row and the final routing node to obtain the second routing path includes:

[0033] Obtaining the peer node identifiers of the peer routing nodes and the final node identifier of the final routing node;

[0034] Detecting the column relationship between the peer routing node and the final routing node according to the peer node identifier and the final node identifier;

[0035] According to the column relationship, a shortest routing path from the routing node in the same row to the routing node in the same column is generated to obtain the second routing path.

[0036] As an optional implementation, each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier, and a layer identifier, wherein the row identifier is used to identify the row in the node set matrix where each node set is located, the column identifier is used to identify the column in the node set matrix where each node set is located, and the layer identifier is used to identify the network layer in which each node set is located;

[0037] The detecting the column relationship between the peer routing node and the final routing node according to the peer node identifier and the final node identifier comprises:

[0038] Detecting whether a row column identifier in the row node identifier and a final column identifier in the final node identifier are equal;

[0039] When the same row column identifier and the final column identifier are not equal, determining that the column relationship is a different column relationship;

[0040] When the same row column identifier and the final column identifier are equal, determining that the column relationship is a same-column relationship;

[0041] The step of generating the shortest routing path from the routing node in the same row to the routing node in the same row according to the column relationship to obtain the second routing path includes:

[0042] In the case where the column relationship is a different column relationship, generating a shortest routing path from the routing node in the same column to the routing node in the same column according to the network identification field of the routing node in the same column, to obtain the second routing path;

[0043] When the column relationship is a same-column relationship, it is determined that the second routing path is empty.

[0044] As an optional implementation manner, generating the shortest routing path from the routing nodes in the same column to the final routing node according to the layer relationship between the routing nodes in the same column and the final routing node to obtain the third routing path includes:

[0045] Obtaining node identifiers of the routing nodes in the same column and a final node identifier of the final routing node;

[0046] Detecting the layer relationship between the routing nodes in the same column and the final routing node according to the node identifiers in the same column and the final node identifier;

[0047] According to the layer relationship, a shortest routing path from the routing nodes in the same column to the final routing node is generated to obtain the third routing path.

[0048] As an optional implementation, each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier, and a layer identifier, wherein the row identifier is used to identify the row in the node set matrix where each node set is located, the column identifier is used to identify the column in the node set matrix where each node set is located, and the layer identifier is used to identify the network layer in which each node set is located;

[0049] The detecting the layer relationship between the routing nodes in the same column and the final routing node according to the node identifiers in the same column and the final node identifier comprises:

[0050] Detecting whether the same-column layer identifier in the same-column node identifier and the final layer identifier in the final node identifier are equal;

[0051] When the same-column layer identifier and the final layer identifier are not equal, determining that the layer relationship is a different layer relationship;

[0052] When the same-column layer identifier and the final layer identifier are equal, determining that the layer relationship is a same-layer relationship;

[0053] The step of generating the shortest routing path from the routing nodes in the same column to the final routing node according to the layer relationship to obtain the third routing path includes:

[0054] In the case where the layer relationship is a different layer relationship, generating the shortest routing path from the routing nodes in the same column to the final routing node according to the network identification field of the routing nodes in the same column to obtain the third routing path;

[0055] In the case where the layer relationship is a same-layer relationship, it is determined that the third routing path is empty.

[0056] According to another embodiment of the present application, a method for constructing an interconnection network is also provided, which is applied to the above-mentioned topology structure, and the construction method includes:

[0057] Constructing N×P×Q node sets, wherein each node set includes a first network node, a second network node, and a third network node that are connected to each other, and N, P, and Q are all positive integers greater than or equal to 2;

[0058] Constructing an N×P×Q three-dimensional network, wherein the three-dimensional network includes N×P×Q initial nodes, the three-dimensional network is divided into Q network layers, each network layer is an initial node matrix of N rows and P columns as a target network layer, and each initial node in the target network layer is connected to an adjacent node in the same row and column;

[0059] The N×P×Q node sets are used to replace the N×P×Q initial nodes in the three-dimensional network, and connections are established between the node sets to obtain an interconnected network, wherein the first network nodes in each node set are connected to adjacent node sets in the same row, the second network nodes in each node set are connected to adjacent node sets in the same column, and the third network nodes in each node set are connected to the reference node set.

[0060] As an optional implementation, after replacing the N×P×Q initial nodes in the three-dimensional network with the N×P×Q node sets and establishing connections between the node sets to obtain an interconnected network, the method further includes:

[0061] Encode a set identifier for each node set, wherein the set identifier of each node set includes a row identifier, a column identifier, and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located;

[0062] A node identifier is encoded for each network node, wherein the node identifier includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected.

[0063] As an optional implementation manner, encoding a node identifier for each network node includes:

[0064] The network identification field of the first network node in each node set is encoded as 0, the network identification field of the second network node in each node set is encoded as 1, and the network identification field of the third network node in each node set is encoded as 2.

[0065] According to another embodiment of the present application, a routing device of an interconnected network is provided, which is applied to the above-mentioned topology structure, and the routing device includes:

[0066] A first generating module is configured to generate a shortest routing path from a starting routing node to a peer routing node according to a row relationship between the starting routing node and the final routing node, to obtain a first routing path, wherein the row relationship is used to indicate a row distance between a starting row where a starting node set where the starting routing node is located in a starting network layer and a final row where a final node set where the final routing node is located in a final network layer, and the peer node set where the peer routing node is located is located in the final row in the starting network layer;

[0067] A second generating module is configured to generate a shortest routing path from the same-column routing node to the same-column routing node according to a column relationship between the same-column routing node and the final routing node, to obtain a second routing path, wherein the column relationship is used to indicate a column distance between a current column where the same-column node set is located in the starting network layer and a final column where the final node set is located in the final network layer, and the same-column node set where the same-column routing node is located is located in the final row and the final column in the starting network layer;

[0068] a third generating module, configured to generate a shortest routing path from the routing nodes in the same column to the final routing node according to the layer relationship between the routing nodes in the same column and the final routing node, to obtain a third routing path, wherein the layer relationship is used to indicate the layer distance between the starting network layer and the final network layer, and the target routing path includes: the first routing path, the second routing path and the third routing path;

[0069] A routing module is used to route from the starting routing node to the final routing node according to the target routing path.

[0070] According to another embodiment of the present application, a device for constructing an interconnection network is provided, which is applied to the above-mentioned topological structure, and the device for constructing the interconnection network includes:

[0071] A first construction module is used to construct N×P×Q node sets, wherein each node set includes a first network node, a second network node and a third network node that are connected to each other, and N, P and Q are all positive integers greater than or equal to 2;

[0072] A second construction module is used to construct an N×P×Q three-dimensional network, wherein the three-dimensional network includes N×P×Q initial nodes, the three-dimensional network is divided into Q network layers, each network layer is an initial node matrix with N rows and P columns as a target network layer, and each initial node in the target network layer is connected to an adjacent node in the same row and column;

[0073] A replacement module is used to replace the N×P×Q initial nodes in the three-dimensional network with the N×P×Q node sets, and establish connections between the node sets to obtain an interconnected network, wherein the first network nodes in each node set are connected to the adjacent node sets in the same row, the second network nodes in each node set are connected to the adjacent node sets in the same column, and the third network nodes in each node set are connected to the reference node set.

[0074] According to another embodiment of the present application, a computer-readable storage medium is provided, in which a computer program is stored, wherein the computer program is configured to execute the steps of any of the above method embodiments when run.

[0075] According to another embodiment of the present application, an electronic device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.

[0076] According to another embodiment of the present application, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the steps in any of the above method embodiments are implemented.

[0077] Through this application, the interconnected network is divided into network layers, and the nodes in the network layer are constructed in the form of a node set matrix with N rows and P columns. Each node set includes a first network node, a second network node, and a third network node that are connected to each other. The three network nodes are respectively connected to adjacent node sets in three different dimensions. Under the same network scale, the network diameter of the topological structure is much smaller than the topological structure in the form of a grid. Therefore, the technical problem of large network communication delay of the interconnected network can be solved, and the technical effect of reducing the network communication delay of the interconnected network can be achieved. BRIEF DESCRIPTION OF THE DRAWINGS

[0078] Figure 1 is a structural block diagram of a topological structure of an interconnected network according to an embodiment of the present application;

[0079] Figure 2 is a schematic diagram of network node identification in a topological structure of an interconnected network according to an embodiment of the present application;

[0080] Figure 3 A process of a routing method for an interconnected network according to an embodiment of the present application Figure 1 ;

[0081] Figure 4 A process of a routing method for an interconnected network according to an embodiment of the present application Figure 2 ;

[0082] Figure 5 is a flow chart of a method for constructing an interconnection network according to an embodiment of the present application;

[0083] Figure 6 is a schematic diagram of a construction process of an interconnection network according to an embodiment of the present application;

[0084] Figure 7 is a schematic diagram of an encoding method of an interconnected network according to an embodiment of the present application;

[0085] Figure 8 is a structural block diagram of a routing device of an interconnected network according to an embodiment of the present application;

[0086] Fig. 9 It is a structural block diagram of a device for constructing an interconnected network according to an embodiment of the present application. DETAILED DESCRIPTION

[0087] The embodiments of the present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0088] It should be noted that the terms "first", "second", etc. in the specification and claims of this application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0089] In this embodiment, a topological structure of an interconnection network is provided. Figure 1 is a structural block diagram of a topological structure of an interconnected network according to an embodiment of the present application, such as Figure 1 As shown, the interconnected network includes N×P×Q node sets, and the interconnected network is divided into Q network layers, where N, P and Q are all positive integers greater than or equal to 2; each network layer in the Q network layers is a node set matrix with N rows and P columns as a target network layer, and each target node set in the target network layer is connected to an adjacent node set in the same row and column; the Q network layers are arranged in sequence, and the target node set is connected to a reference node set at the same position in an adjacent network layer, and the adjacent network layer is a network layer in the Q network layers that is adjacent to the target network layer; each node set includes a first network node, a second network node and a third network node that are connected to each other, the first network node is also connected to an adjacent node set in the same row, the second network node is also connected to an adjacent node set in the same column, and the third network node is also connected to a reference node set.

[0090] Through the above topological structure, the interconnected network is divided into network layers, and the nodes in the network layer are constructed in the form of a node set matrix with N rows and P columns. Each node set includes a first network node, a second network node and a third network node that are connected to each other. The three network nodes are respectively connected to adjacent node sets in three different dimensions. Under the same network scale, the network diameter of this topological structure is much smaller than the topological structure in the form of a grid. Therefore, the technical problem of large network communication delay of the interconnected network can be solved, and the technical effect of reducing the network communication delay of the interconnected network can be achieved.

[0091] Optionally, in this embodiment, each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected.

[0092] Optionally, in this embodiment, the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located.

[0093] Optionally, in this embodiment, the network identification field of the first network node is 0, the network identification field of the second network node is 1, and the network identification field of the third network node is 2.

[0094] Optionally, in this embodiment, N = P = Q. In this case, the interconnection network includes a node set of N × N × N. The interconnection network has 3 × N × N × N routing nodes, the out-degree and in-degree of each routing node is 4, the maximum out-degree and in-degree of the routing node is 4, and the network diameter is N + N + (N-1).

[0095] Take a 3×3×3 node set as an example, Figure 2 is a schematic diagram of network node identification in a topological structure of an interconnected network according to an embodiment of the present application, such as Figure 2 As shown, each node set and network node has a corresponding identifier, and the network node identifier is , and network nodes are connected.

[0096] Optionally, in this embodiment, the topological structure of the interconnected network may be, but is not limited to, a combination of an interconnected network of three nodes and a three-dimensional mesh network. The topological structure of the interconnected network is compared with the two-dimensional and three-dimensional mesh networks, as shown in Table 1. It can be seen that for the three networks with network nodes of the same scale, the topological structure of the interconnected network has a small network diameter, which reduces the communication delay of the network, and the out-degree and in-degree of the network nodes are small, which is more conducive to layout and wiring.

[0097] Table 1 Comparison of the topological structures of the above interconnected networks with two-dimensional and three-dimensional mesh networks

[0098]

[0099] In this embodiment, a routing method of an interconnected network is also provided, which is applied to the above topology structure. Figure 3 A process of a routing method for an interconnected network according to an embodiment of the present application Figure 1 ,like Figure 3 As shown, the process includes the following steps:

[0100] Step S302, generating the shortest routing path from the starting routing node to the peer routing node according to the row relationship between the starting routing node and the final routing node, and obtaining a first routing path, wherein the row relationship is used to indicate the row distance between the starting row where the starting node set where the starting routing node is located in the starting network layer and the final row where the final node set where the final routing node is located in the final network layer, and the peer node set where the peer routing node is located is located in the final row in the starting network layer;

[0101] Step S304, generating the shortest routing path from the routing node in the same column to the routing node in the same column according to the column relationship between the routing node in the same column and the final routing node, to obtain a second routing path, wherein the column relationship is used to indicate the column distance between the current column where the set of nodes in the same column is located in the starting network layer and the final column where the set of final nodes is located in the final network layer, and the set of nodes in the same column where the routing node in the same column is located is located in the final row and the final column in the starting network layer;

[0102] Step S306, generating a shortest routing path from the routing nodes in the same column to the final routing node according to the layer relationship between the routing nodes in the same column and the final routing node, and obtaining a third routing path, wherein the layer relationship is used to indicate the layer distance between the starting network layer and the final network layer, and the target routing path includes: a first routing path, a second routing path and a third routing path;

[0103] Step S308: routing from the starting routing node to the final routing node according to the target routing path.

[0104] Through the above steps, the interconnected network is divided into network layers, and the nodes in the network layer are constructed in the form of a node set matrix with N rows and P columns. Each node set includes a first network node, a second network node and a third network node that are connected to each other. The three network nodes are respectively connected to adjacent node sets in three different dimensions. Under the same network scale, the network diameter of this topological structure is much smaller than the topological structure in the form of a grid, and a routing planning method in the interconnected network is provided. Therefore, the technical problem of large network communication delay of the interconnected network can be solved, and the technical effect of reducing the network communication delay of the interconnected network can be achieved.

[0105] Optionally, in this embodiment, the routing method may be but is not limited to being deployed on each network node.

[0106] In an optional example, in the above step S302, the shortest routing path from the starting routing node to the same routing node can be generated according to the row relationship between the starting routing node and the final routing node in the following manner, to obtain the first routing path: obtaining the starting node identifier of the starting routing node and the final node identifier of the final routing node; detecting the row relationship between the starting routing node and the final routing node according to the starting node identifier and the final node identifier; generating the shortest routing path from the starting routing node to the same routing node according to the row relationship, to obtain the first routing path.

[0107] Optionally, in this embodiment, the row relationship between routing nodes may be, but is not limited to, indicating whether the routing nodes are in the same row, or the row distance between the rows where the routing nodes are located, and the like.

[0108] Optionally, in this embodiment, the routing method between routing nodes may include but is not limited to first routing from the row dimension until the starting routing node and the final routing node are in the same row regardless of whether they are in the same column or layer.

[0109] Optionally, in this embodiment, under the above-mentioned encoding method of the network nodes, it can be understood that routing is first performed in the x dimension.

[0110] Optionally, in this embodiment, each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located; the start routing node and the end routing node can be detected according to the start node identifier and the end node identifier in the following manner, but is not limited to: According to the row relationship between the nodes: detect whether the starting row identifier in the starting node identifier and the final row identifier in the final node identifier are equal; when the starting row identifier and the final row identifier are not equal, determine that the row relationship is a different row relationship; when the starting row identifier and the final row identifier are equal, determine that the row relationship is a peer relationship; it can be but not limited to the following methods to generate the shortest routing path from the starting routing node to the peer routing node according to the row relationship to obtain the first routing path: when the row relationship is a different row relationship, generate the shortest routing path from the starting routing node to the peer routing node according to the network identifier field of the starting routing node to obtain the first routing path; when the row relationship is a peer relationship, determine that the first routing path is empty.

[0111] In an optional example, the shortest routing path from the peer routing node to the routing node in the same column can be generated according to the column relationship between the peer routing node and the final routing node in the following manner, to obtain the second routing path: obtaining the peer node identifier of the peer routing node and the final node identifier of the final routing node; detecting the column relationship between the peer routing node and the final routing node according to the peer node identifier and the final node identifier; generating the shortest routing path from the peer routing node to the routing node in the same column according to the column relationship, to obtain the second routing path.

[0112] Optionally, in this embodiment, the column relationship between routing nodes may be, but is not limited to, indicating whether the routing nodes are in the same column, or the column distance between the columns where the routing nodes are located, and the like.

[0113] Optionally, in this embodiment, the routing method between routing nodes may include, but is not limited to, first routing from the row dimension until the starting routing node and the final routing node are in the same row regardless of whether they are in the same column or layer, and then routing is performed in the column dimension until the starting routing node and the final routing node are in the same row and column regardless of whether they are in the same layer.

[0114] Optionally, in this embodiment, in the above-mentioned encoding mode of the network nodes, it can be understood that routing is first performed in the x dimension, and then routing is performed in the y dimension.

[0115] Optionally, in this embodiment, each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row in which each node set is located in the node set matrix, the column identifier is used to identify the column in which each node set is located in the node set matrix, and the layer identifier is used to identify the network layer in which each node set is located; the column relationship between the same routing node and the final routing node can be detected according to the same node identifier and the final node identifier in the following manner, but is not limited to: detecting whether the same column identifier in the same node identifier and the final column identifier in the final node identifier are equal; when the same column identifier and the final column identifier are not equal, determining that the column relationship is a different column relationship; when the same column identifier and the final column identifier are equal, determining that the column relationship is a same column relationship;

[0116] The shortest routing path from the same-column routing node to the same-column routing node may be generated according to the column relationship, but is not limited to, in the following manner to obtain the second routing path: when the column relationship is a different column relationship, the shortest routing path from the same-column routing node to the same-column routing node is generated according to the network identification field of the same-column routing node to obtain the second routing path; when the column relationship is a same-column relationship, the second routing path is determined to be empty.

[0117] In an optional example, the shortest routing path from the routing nodes in the same column to the final routing node can be generated according to the layer relationship between the routing nodes in the same column and the final routing node, to obtain the third routing path, but is not limited to the following method: obtaining the node identifiers of the routing nodes in the same column and the final node identifier of the final routing node; detecting the layer relationship between the routing nodes in the same column and the final routing node according to the node identifiers in the same column and the final node identifier; and generating the shortest routing path from the routing nodes in the same column to the final routing node according to the layer relationship, to obtain the third routing path.

[0118] Optionally, in this embodiment, the layer relationship between routing nodes may include, but is not limited to, indicating whether the routing nodes are in the same layer, or the layer distance between the layers where the routing nodes are located, and the like.

[0119] Optionally, in this embodiment, the routing method between routing nodes may include, but is not limited to, first routing from the row dimension until the starting routing node and the final routing node are in the same row regardless of whether they are in the same column or layer. Then routing is performed in the column dimension until the starting routing node and the final routing node are in the same row and column regardless of whether they are in the same layer. Finally, routing is performed in the layer dimension to the final routing node.

[0120] Optionally, in this embodiment, in the above-mentioned encoding mode of the network nodes, it can be understood that routing is first performed in the x dimension, then in the y dimension, and finally in the z dimension.

[0121] Optionally, in this embodiment, each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row in the node set matrix where each node set is located, the column identifier is used to identify the column in the node set matrix where each node set is located, and the layer identifier is used to identify the network layer where each node set is located; the layer relationship between the routing node in the same column and the final routing node can be detected according to the node identifier in the same column and the final node identifier in the following manner, but is not limited to: detecting whether the layer identifier in the same column in the node identifier in the same column and the final layer identifier in the final node identifier are equal; when the layer identifier in the same column and the final layer identifier are not equal, determining that the layer relationship is a different layer relationship; when the layer identifier in the same column and the final layer identifier are equal, determining that the layer relationship is a same layer relationship;

[0122] The shortest routing path from the routing nodes in the same column to the final routing node can be generated according to the layer relationship, but is not limited to, in the following manner to obtain the third routing path: when the layer relationship is a different layer relationship, the shortest routing path from the routing nodes in the same column to the final routing node is generated according to the network identification field of the routing nodes in the same column to obtain the third routing path; when the layer relationship is a same-layer relationship, the third routing path is determined to be empty.

[0123] In an optional embodiment, a routing method applied to the topology of the above interconnected network is provided, assuming that the source routing node is the above starting routing node , the target routing node is the final routing node mentioned above , the routing method may include but is not limited to the following steps:

[0124] Step 1: Judgement and Are they equal: If , go to step 2, if , proceed to the third step.

[0125] Step 2: , routing is required in the X direction: Is it 0? If yes, , then route within the node set to the node numbered 0, and then route in the X direction: If , then route in the positive direction of X until ;if , then route in the negative direction of X until If , then route directly in the X direction and then go to the third step.

[0126] Step 3: Now , there is no need to route in the X direction. Update the routing node where the data packet is located at this time to the source routing node. and Are they equal: If , go to step 4, if , proceed to step 5.

[0127] Step 4: , routing is required in the Y direction: Is it 1? , then route within the node set to the node numbered 1, and then route in the Y direction: If , then route in the positive direction of Y until ;if , then route in the negative Y direction until .if , then directly route in the Y direction and go to step 5.

[0128] Step 5: Now , there is no need to route in the X and Y directions. Update the routing node where the data packet is located at this time to the source routing node. and Are they equal: If , go to step 6, if , proceed to step 7.

[0129] Step 6: , routing is required in the Z direction: Is it 2? If , then route within the node set to the node numbered 2, and then route in the Z direction: If , then route in the positive direction of Z until ;if , then route in the negative direction of Z until .if , then route directly in the Y direction and go to step 7.

[0130] Step 7: At this time , there is no need to route in the X, Y and Z directions. Update the routing node where the data packet is located at this time to the source routing node. Is it equal to ,if , the routing ends; if , then routing is performed within the node set, from Routing to , the routing ends.

[0131] For example: Assume that the source routing node , target routing node , the routing process is as follows:

[0132] Step 1: Judgement and Are they equal? , proceed to the second step.

[0133] Step 2: , routing is required in the X direction: Is it 0? , then routing is performed inside the triangle to the node numbered 0. The routing process is: Then route in the X direction: , then route in the negative direction of X until . Routing process: , proceed to the third step.

[0134] Step 3: Now , there is no need to route in the X direction. Update the routing node where the data packet is located at this time to the source routing node, that is, at this time . judge and Are they equal? , proceed to step 4.

[0135] Step 4: , routing is required in the Y direction: Is it 1? , then routing is performed inside the triangle to the node numbered 1. The routing process is: Then route in the Y direction: , then route in the positive direction of Y until , routing process: , proceed to step 5.

[0136] Step 5: Now , there is no need to route in the X and Y directions. Update the routing node where the data packet is located at this time to the source routing node, that is, at this time . judge and Are they equal? , proceed to step 6.

[0137] Step 6: , routing is required in the Z direction: Is it 2? , then routing is performed inside the triangle to the node numbered 2. The routing process is: Then route in the Z direction: , then route in the positive direction of Z until , routing process: , proceed to step 7.

[0138] Step 7: At this time , there is no need to route in the X, Y and Z directions. Update the routing node where the data packet is located at this time to the source routing node, that is, at this time . judge Is it equal to ,if , then routing is performed inside the triangle, from Routing to , routing process: , the routing ends.

[0139] For an N×N two-dimensional mesh network, its network diameter is 2×(N-1). For an N×N×N three-dimensional mesh network, its network diameter is 3×(N-1). It can be seen that as the number of routing nodes increases, whether it is a two-dimensional mesh or a three-dimensional mesh, the network diameter will become larger and larger, resulting in an increase in network communication delay, thus limiting the application of the network, resulting in the application of both two-dimensional mesh and three-dimensional mesh in small-scale network environments. The topological structure of the above three-node network structure combined with the three-dimensional mesh network has the advantages of small network diameter, simple structure, simple and easy to implement routing algorithm, and good scalability. And as the scale of routing nodes increases, the advantage of small network diameter becomes more obvious. And the maximum value of the out-degree and in-degree of the routing node is 4, which is less than 6 of the three-dimensional mesh, which is conducive to the back-end layout and routing.

[0140] In this embodiment, a routing method of an interconnection network is also provided, which is applied to the topological structure of the above-mentioned interconnection network. Figure 4 A process of a routing method for an interconnected network according to an embodiment of the present application Figure 2 ,like Figure 4 As shown, the process includes the following steps:

[0141] Step S402, obtaining a starting routing node and a final routing node;

[0142] Step S404, generating a shortest routing path from the starting routing node to the intermediate routing node on an intermediate dimension of the adjacent node set connected to the starting routing node relative to the starting node set where the starting routing node is located, to obtain an intermediate routing path, wherein the intermediate node set where the intermediate routing node is located and the final node set where the final routing node is located belong to the same intermediate dimension, and the dimensions of the node set include: row dimension, column dimension and layer dimension;

[0143] Step S406, generating a shortest routing path from an intermediate routing node to a reference routing node according to a type relationship between a node type of the final routing node in the final node set and a node type of the starting routing node in the starting node set, and obtaining a reference routing path, wherein the reference routing node and the final routing node belong to at least the same intermediate dimension and reference dimension;

[0144] Step S408, generating the shortest routing path from the reference routing node to the final routing node to obtain the final routing path, wherein the target routing path includes: an intermediate routing path, a reference routing path and a final routing path;

[0145] Step S410: routing from the starting routing node to the final routing node according to the target routing path.

[0146] Through the above steps, the interconnected network is divided into network layers, and the nodes in the network layer are constructed in the form of a node set matrix with N rows and P columns. Each node set includes a first network node, a second network node and a third network node that are connected to each other. The three network nodes are respectively connected to adjacent node sets in three different dimensions. Under the same network scale, the network diameter of this topological structure is much smaller than the topological structure in the form of a grid, and a routing planning method in the interconnected network is provided. The order of routing between dimensions is planned according to the actual situation of the routing starting point and the routing end point, so as to avoid detours. Therefore, the technical problem that the routing method of the interconnected network causes a large transmission delay in the network can be solved, and the technical effect of reducing the transmission delay in the network caused by the routing method of the interconnected network can be achieved.

[0147] Optionally, in this embodiment, the routing method may be but is not limited to being deployed on each network node.

[0148] In an optional example, in the above step S404, the shortest routing path from the starting routing node to the intermediate routing node can be generated on the intermediate dimension of the set of adjacent nodes connected to the starting routing node relative to the set of starting nodes where the starting routing node is located, to obtain the intermediate routing path, but is not limited to the following method: determine the intermediate dimension of the set of adjacent nodes connected to the starting routing node relative to the set of starting nodes where the starting routing node is located; generate the shortest routing path from the starting routing node to the intermediate routing node on the intermediate dimension to obtain the intermediate routing path.

[0149] Optionally, in this embodiment, the dimensions of the node set include three dimensions: row dimension, column dimension and layer dimension. During the routing process, the routing order of each dimension is determined based on the situation and relative relationship between the starting routing node and the final routing node, so as to find a routing path with less delay.

[0150] Optionally, in this embodiment, the intermediate dimension of the set of adjacent nodes connected to the starting routing node relative to the starting node set where the starting routing node is located can be determined, but is not limited to, in the following manner: when the starting routing node is the first network node in the starting node set where the starting routing node is located, the intermediate dimension is determined to be the row dimension; when the starting routing node is the second network node in the starting node set where the starting routing node is located, the intermediate dimension is determined to be the column dimension; when the starting routing node is the third network node in the starting node set where the starting routing node is located, the intermediate dimension is determined to be the layer dimension.

[0151] Optionally, in this embodiment, the corresponding starting routing dimension is determined according to the connection function of the starting routing node in the starting node set to which it belongs, for example: if the connection function of the starting routing node in the starting node set to which it belongs is used to connect the adjacent node set on the same row, then the starting routing dimension (i.e., the middle dimension) is the row dimension. If the connection function of the starting routing node in the starting node set to which it belongs is used to connect the adjacent node set on the same column, then the starting routing dimension (i.e., the middle dimension) is the column dimension. If the connection function of the starting routing node in the starting node set to which it belongs is used to connect the adjacent node set on the same layer, then the starting routing dimension (i.e., the middle dimension) is the layer dimension.

[0152] Optionally, in this embodiment, the shortest routing path from the starting routing node to the intermediate routing node may be generated on the intermediate dimension, but is not limited to, in the following manner to obtain the intermediate routing path: when the dimension of the starting routing node in the intermediate dimension in the starting node set is the same as the dimension of the final routing node in the intermediate dimension in the final node set, determining that the intermediate routing path is empty; when the dimension of the starting routing node in the intermediate dimension in the starting node set is different from the dimension of the final routing node in the final node set, and the intermediate dimension is a row dimension, generating the shortest routing path from the starting routing node to the intermediate routing node to obtain the intermediate routing path, wherein the intermediate routing node is the first network node in the intermediate node set where the number of rows is the same as the number of rows of the final node set where the final routing node is located; when the starting routing node is in the When the dimension of the starting node set on the intermediate dimension is different from the dimension of the final routing node on the intermediate dimension in the final node set, and the intermediate dimension is a column dimension, a shortest routing path from the starting routing node to the intermediate routing node is generated to obtain an intermediate routing path, wherein the intermediate routing node is a second network node in the intermediate node set whose number of columns is the same as the number of columns of the final node set where the final routing node is located; when the dimension of the starting routing node in the intermediate dimension is different from the dimension of the final routing node in the final node set, and the intermediate dimension is a layer dimension, a shortest routing path from the starting routing node to the intermediate routing node is generated to obtain an intermediate routing path, wherein the intermediate routing node is a third network node in the intermediate node set whose number of layers is the same as the number of layers of the final node set where the final routing node is located.

[0153] Optionally, in this embodiment, the shortest routing path from the intermediate routing node to the reference routing node can be generated according to the type relationship between the node type of the final routing node in the final node set and the node type of the starting routing node in the starting node set to obtain the reference routing path in the following manner, but not limited to: detecting the type relationship between the node type of the final routing node in the final node set and the node type of the starting routing node in the starting node set; when the type relationship is that the node type of the final routing node in the final node set is the same as the node type of the starting routing node in the starting node set, randomly selecting a reference dimension from the dimensions of the node set except the intermediate dimension; generating the shortest routing path from the intermediate routing node to the reference routing node on the reference dimension to obtain the reference routing path; when the type relationship is that the node type of the final routing node in the final node set is different from the node type of the starting routing node in the starting node set, determining the dimension corresponding to the node type of the final routing node in the final node set as the reference dimension; generating the shortest routing path from the intermediate routing node to the reference routing node on the reference dimension to obtain the reference routing path.

[0154] Optionally, in this embodiment, each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row in the node set matrix where each node set is located, the column identifier is used to identify the column in the node set matrix where each node set is located, and the layer identifier is used to identify the network layer where each node set is located; the final routing node in the final node set can be detected in the following manner but is not limited to: The type relationship between the node type and the node type of the starting routing node in the starting node set: detect whether the network identification field of the final routing node is equal to the network identification field of the starting routing node; when the network identification field of the final routing node is equal to the network identification field of the starting routing node, determine the type relationship as the node type of the final routing node in the final node set is the same as the node type of the starting routing node in the starting node set; when the network identification field of the final routing node is not equal to the network identification field of the starting routing node, determine the type relationship as the node type of the final routing node in the final node set is different from the node type of the starting routing node in the starting node set.

[0155] Optionally, in this embodiment, the reference dimension can be randomly selected from the dimensions of the node set other than the middle dimension in the following manner but not limited to: when the middle dimension is the row dimension, the reference dimension is randomly selected from the column dimension and the layer dimension; when the middle dimension is the column dimension, the reference dimension is randomly selected from the row dimension and the layer dimension; when the middle dimension is the layer dimension, the reference dimension is randomly selected from the row dimension and the column dimension.

[0156] Optionally, in this embodiment, the dimension corresponding to the node type of the final routing node in the final node set can be determined as the reference dimension in the following manner but is not limited to: when the node type of the final routing node in the final node set is a first network node, the reference dimension is determined to be a row dimension; when the node type of the final routing node in the final node set is a second network node, the reference dimension is determined to be a column dimension; when the node type of the final routing node in the final node set is a third network node, the reference dimension is determined to be a layer dimension.

[0157] Optionally, in this embodiment, the shortest routing path from the reference routing node to the final routing node can be generated in the following manner but is not limited to: the dimension of the node set other than the intermediate dimension and the reference dimension is determined as the final dimension; the shortest routing path from the reference routing node to the final routing node is generated on the final dimension to obtain the final routing path.

[0158] Optionally, in this embodiment, the dimensions of the node set other than the intermediate dimension and the reference dimension can be determined as the final dimension in the following manner but is not limited to: when the intermediate dimension is the column dimension and the reference dimension is the layer dimension, or when the intermediate dimension is the layer dimension and the reference dimension is the column dimension, the final dimension is determined to be the row dimension; when the intermediate dimension is the row dimension and the reference dimension is the layer dimension, or when the intermediate dimension is the layer dimension and the reference dimension is the row dimension, the final dimension is determined to be the column dimension; when the intermediate dimension is the row dimension and the reference dimension is the column dimension, or when the intermediate dimension is the column dimension and the reference dimension is the row dimension, the final dimension is determined to be the layer dimension.

[0159] Optionally, in this embodiment, the shortest routing path from the reference routing node to the final routing node can be generated in the final dimension in the following manner, but is not limited to: generating a first segment path from the reference routing node to the final node set where the final routing node is located in the final dimension; generating a second segment path to the final routing node within the final node set, wherein the final routing path includes the first segment path and the second segment path.

[0160] The network diameter of the network topology of the network structure of three network nodes of N×N×N×3 network nodes and the combination of three-dimensional Mesh is N+N+N, that is, the maximum value of the shortest distance between any two routing nodes in the network is N+N+N. If the routing method of first X dimension, then Y dimension and finally Z dimension is used, the maximum value of the routing path between any two routing nodes in the network is N+N+(N+1). That is, the routing path between any two routing nodes in the network is greater than the shortest distance between the two routing nodes, that is, if the routing method of first X dimension, then Y dimension and finally Z dimension is used, there is a detour in the routing path between the routing nodes, resulting in an increase in the transmission delay of the data in the network, and the advantages of the above network structure are not brought into play. Therefore, the above-mentioned routing method that follows the shortest distance routing is proposed. The use of this routing method can make the maximum value of the routing path between any two routing nodes in the network N+N+N, which is equal to the network diameter. Thereby avoiding the detour phenomenon and reducing the network transmission delay.

[0161] In an optional implementation, it is assumed that the source routing node , target routing node , the node where the data packet is currently located during the routing process To ensure that all routing requests can be routed according to the shortest distance, the routing rules are as follows:

[0162] Rule 1: When routing along any of the X, Y, or Z dimensions, all routing along that dimension must be completed. Assuming that routing along the Y direction is selected, routing to The routing node.

[0163] Rule 2: View middle The value of Then it will be routed in the X direction first until it is routed to The routing node; Then it will be routed in the Y direction first until it is routed to The routing node; Then it will be routed in the Z direction first until it is routed to The routing node.

[0164] Rule 3: View middle The value of:

[0165] if :exist In the case of , the YZ direction routing is completed first, and then the X direction routing is completed last; that is, in the YZ direction and , and then start routing along the X direction. In the case of , routing along the XZ direction is preferred, and routing along the Y direction is the last; that is, in the XZ direction and , and then route along the Y direction. In the case of , the routing is first along the XY direction, and finally along the Z direction; that is, in the XY direction and , and then route along the Z direction.

[0166] if , under the premise of following Rule 2, the routes in the other two directions can be arranged at will.

[0167] The routing process proposed according to the above rules is as follows:

[0168] Step 1: Order , view the The value of , then proceed to the second step; , then proceed to the third step; , then go to step 4.

[0169] Step 2: At this time , then routing along the X direction is preferred: if at this time , then there is no need to route in the X direction, and go directly to step 5; if , you need to route in the X direction: if , then route in the positive direction of X until ;if , then route in the negative direction of X until , proceed to step 5.

[0170] Step 3: Now , then routing along the Y direction is preferred: if at this time , then there is no need to route in the Y direction, and go directly to step 6; if , you need to route in the Y direction: if , then route in the positive direction of Y until ;if , then route in the negative Y direction until , proceed to step 6.

[0171] Step 4: Now , then routing along the Z direction is preferred: if at this time , then there is no need to route in the Z direction, and go directly to step 7; if , you need to route in the Z direction: if , then route in the positive direction of Z until ;if , then route in the negative direction of Z until , proceed to step 7.

[0172] Step 5: Now , routing in the X direction is no longer necessary. View middle The value of and judge and Are they equal?

[0173] if Routing is done inside the triangle and the routing ends. :

[0174] like , then judge and Are they equal? and Are they equal? , then select routing method 1; if , then select routing method 2; if You can choose between routing method 1 and routing method 2:

[0175] Routing method 1: , then go to step 4.

[0176] Routing method 2: , and then proceed to step 3.

[0177] like , the Z direction routing needs to be completed first. , then select routing method 1; if , then select routing method 2.

[0178] like , the Y direction routing needs to be completed first. , then select routing method 1; if , then select routing method 2.

[0179] Step 6: Now , routing in the Y direction is no longer necessary. View middle The value of and judge and Are they equal: If Routing is done inside the triangle and routing ends.

[0180] if :like , then judge and Are they equal? and Are they equal? , then select routing method three; if , then select routing method 4; if You can choose between routing method 3 and routing method 4:

[0181] Routing method three: , then go to step 4.

[0182] Routing method four: , and then proceed to the second step.

[0183] like , then the Z direction routing needs to be completed first. If , then select routing method three; if , then select routing method 4.

[0184] like , then the X direction routing needs to be completed first. If , then select routing method three; if , then select routing method 4.

[0185] Step 7: At this time , routing in the Z direction is no longer necessary. View middle The value of and judge and Are they equal: If Routing is done inside the triangle and routing ends.

[0186] if :like , then judge and Are they equal? and Are they equal? , then select routing method 5; if , then select routing method six; if You can choose between routing method 3 and routing method 4:

[0187] Routing method five: , and then proceed to step 3.

[0188] Routing method six: , and then proceed to the second step.

[0189] like , then the Y direction routing needs to be completed first. , then select routing method 5; if , then select routing method six.

[0190] , then the X direction routing needs to be completed first. If , then select routing method 5; if , then select routing method six.

[0191] For example: Assume that the source routing node , target routing node , the routing is as follows:

[0192] Step 1: Order , Viewing The value of , then proceed to the second step.

[0193] Step 2: At this time , then routing along the X direction is preferred: , you need to route in the X direction: if , then route in the positive direction of X until The routing process is ,at this time , then go to step 5.

[0194] Step 5: Now , routing in the X direction is no longer required. : , then judge and Are they equal? and Are they equal? , then select routing method 2.

[0195] Routing method 2: , , and then proceed to step 3.

[0196] Step 3: Now ,at this time , you need to route in the Y direction: , then route in the positive direction of Y until : , , then go to step 6.

[0197] Step 6: Now , routing in the Y direction is no longer necessary. View middle Value: Judgment and Are they equal: If , routing is performed inside the triangle, routing process: , the routing ends.

[0198] For another example: Assume that the source routing node , target routing node , the routing process is as follows:

[0199] Step 1: Order , Viewing The value of , then go to step 4.

[0200] Step 4: Now , then routing along the Z direction is preferred: , you need to route in the Z direction: , then route in the positive direction of Z until , routing method: , Go to step 7.

[0201] Step 7: At this time , routing in the Z direction is no longer necessary. View middle The value of and judge and Are they equal? :

[0202] , , you need to complete the routing in the X direction first, and select routing method six.

[0203] Routing method six: , and then proceed to the second step.

[0204] Step 2: At this time , routing along the X direction is preferred: at this time , you need to route in the X direction: if , route in the negative X direction until , routing method: . , proceed to step 5.

[0205] Step 5: Now , routing in the X direction is no longer necessary. View middle The value of and judge and Are they equal? :

[0206] like , then the routing in the Z direction needs to be completed first. , then select routing method 2.

[0207] Routing method 2: , and then proceed to step 3.

[0208] Step 3: Now , then routing along the Y direction is preferred: , you need to route in the Y direction: if , then route in the positive direction of Y until , routing method , proceed to step 6.

[0209] Step 6: Now , routing in the Y direction is no longer necessary. View middle The value of and judge and Are they equal? and , the routing ends.

[0210] In this embodiment, a method for constructing an interconnection network is also provided, which is applied to construct the above-mentioned topological structure. Figure 5 is a flow chart of a method for constructing an interconnection network according to an embodiment of the present application, such as Figure 5 As shown, the process includes the following steps:

[0211] Step S502, constructing N×P×Q node sets, wherein each node set includes a first network node, a second network node and a third network node that are connected to each other, and N, P and Q are all positive integers greater than or equal to 2;

[0212] Step S504, constructing an N×P×Q three-dimensional network, wherein the three-dimensional network includes N×P×Q initial nodes, the three-dimensional network is divided into Q network layers, each network layer is an initial node matrix of N rows and P columns as a target network layer, and each initial node in the target network layer is connected to an adjacent node in the same row and column;

[0213] Step S506, using N×P×Q node sets to replace the N×P×Q initial nodes in the three-dimensional network, and establishing connections between the node sets to obtain an interconnected network, wherein the first network node in each node set is connected to the adjacent node set in the same row, the second network node in each node set is connected to the adjacent node set in the same column, and the third network node in each node set is connected to the reference node set.

[0214] Through the above steps, the constructed interconnected network is divided into network layers, and the nodes in the network layer are constructed in the form of a node set matrix with N rows and P columns. Each node set includes a first network node, a second network node and a third network node that are connected to each other. The three network nodes are respectively connected to adjacent node sets in three different dimensions. Under the same network scale, the network diameter of the topological structure is much smaller than the topological structure in the form of a grid. Therefore, the technical problem of large network communication delay of the interconnected network can be solved, and the technical effect of reducing the network communication delay of the interconnected network can be achieved.

[0215] In an optional example, after the above-mentioned step S506, encoding can be performed for each network node in the following manner, but is not limited to: encoding a set identifier for each node set, wherein the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located; encoding a node identifier for each network node, wherein the node identifier includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set where each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected.

[0216] In an optional example, the node identification for each network node can be encoded in the following manner but is not limited to: the network identification field of the first network node in each node set is encoded as 0, the network identification field of the second network node in each node set is encoded as 1, and the network identification field of the third network node in each node set is encoded as 2.

[0217] Figure 6 is a schematic diagram of a construction process of an interconnection network according to an embodiment of the present application, such as Figure 6 As shown in the figure, taking a 4×4×4 three-dimensional Mesh network as an example, the construction process of the interconnection network is as follows:

[0218] Step 1: Construct 4×4×4 topological structures of three network nodes connected according to the connection mode of the three network nodes.

[0219] Step 2: Construct a 4×4×4 three-dimensional Mesh network according to the structure of the mesh network.

[0220] Step 2: Replace all nodes of the 4×4×4 three-dimensional Mesh network topology with a 4×4×4 topology connected by three network nodes.

[0221] The encoding method of each network node in the interconnected network constructed above is as follows:

[0222] Step 1: Encode each triangle according to the encoding method of the 3D Mesh network. Establish a 3D rectangular coordinate system, and represent each node set with 3D space coordinates. Figure 7 is a schematic diagram of an encoding method of an interconnected network according to an embodiment of the present application, such as Figure 7 As shown, the encoding of the network structure of each node set in a 2×2×2 three-dimensional Mesh network is given.

[0223] Step 2: Encode each routing node. Number each routing node as ,in The value of ; Indicates the three-dimensional spatial coordinates of the node set to which the routing node belongs; Indicates that the node is located at In, and with and The nodes are connected; Indicates that the node is located at In, and with and The nodes are connected; Indicates that the node is located at In, and with and Nodes are connected.

[0224] Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), and includes a number of instructions for a terminal device (which can be a mobile phone, computer, server, or network device, etc.) to execute the methods described in each embodiment of the present application.

[0225] In this embodiment, a routing device for an interconnected network and a construction device for an interconnected network are also provided. The above devices are applied to the topological structure of the above-mentioned interconnected network. The above devices are used to implement the above-mentioned embodiments and preferred implementation modes. The descriptions that have been made will not be repeated. As used below, the term "module" can implement a combination of software and / or hardware for a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0226] Figure 8is a structural block diagram of a routing device of an interconnected network according to an embodiment of the present application, such as Figure 8 As shown, the routing device includes:

[0227] A first generating module 802 is used to generate the shortest routing path from the starting routing node to the peer routing node according to the row relationship between the starting routing node and the final routing node, so as to obtain a first routing path, wherein the row relationship is used to indicate the row distance between the starting row where the starting node set where the starting routing node is located in the starting network layer and the final row where the final node set where the final routing node is located in the final network layer, and the peer node set where the peer routing node is located is located in the final row in the starting network layer;

[0228] A second generating module 804 is configured to generate a shortest routing path from the same-column routing node to the same-column routing node according to a column relationship between the same-column routing node and the final routing node, to obtain a second routing path, wherein the column relationship is used to indicate a column distance between a current column where the same-column node set is located in the starting network layer and a final column where the final node set is located in the final network layer, and the same-column node set where the same-column routing node is located is located in the final row and the final column in the starting network layer;

[0229] A third generating module 806 is used to generate a shortest routing path from the routing nodes in the same column to the final routing node according to the layer relationship between the routing nodes in the same column and the final routing node, to obtain a third routing path, wherein the layer relationship is used to indicate the layer distance between the starting network layer and the final network layer, and the target routing path includes: the first routing path, the second routing path and the third routing path;

[0230] The routing module 808 is used to route from the starting routing node to the final routing node according to the target routing path.

[0231] Through the above steps, the interconnected network is divided into network layers, and the nodes in the network layer are constructed in the form of a node set matrix with N rows and P columns. Each node set includes a first network node, a second network node, and a third network node that are connected to each other. The three network nodes are respectively connected to adjacent node sets in three different dimensions. Under the same network scale, the network diameter of this topological structure is much smaller than the topological structure in the form of a grid, and a routing planning method in the interconnected network is provided. Therefore, the technical problem of large network communication delay of the interconnected network can be solved, and the technical effect of reducing the network communication delay of the interconnected network can be achieved.

[0232] As an optional implementation manner, the routing device is further used to: obtain a starting node identifier of the starting routing node and a final node identifier of the final routing node;

[0233] Detecting the row relationship between the starting routing node and the final routing node according to the starting node identifier and the final node identifier;

[0234] According to the row relationship, a shortest routing path from the starting routing node to the same routing node is generated to obtain the first routing path.

[0235] As an optional implementation, each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located; the routing device is further used to:

[0236] Detecting whether a starting row identifier in the starting node identifier and a final row identifier in the final node identifier are equal;

[0237] When the start row identifier and the final row identifier are not equal, determining that the row relationship is a different row relationship;

[0238] When the start row identifier and the end row identifier are equal, it is determined that the row relationship is a same row relationship.

[0239] Optionally, the routing device is further used for:

[0240] In the case where the row relationship is a different row relationship, generating a shortest routing path from the starting routing node to the peer routing node according to the network identification field of the starting routing node to obtain the first routing path;

[0241] When the row relationship is a row relationship, it is determined that the first routing path is empty.

[0242] As an optional implementation manner, the routing device is further used for:

[0243] Obtaining the peer node identifiers of the peer routing nodes and the final node identifier of the final routing node;

[0244] Detecting the column relationship between the peer routing node and the final routing node according to the peer node identifier and the final node identifier;

[0245] According to the column relationship, a shortest routing path from the routing node in the same row to the routing node in the same column is generated to obtain the second routing path.

[0246] As an optional implementation, each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located; the routing device is further used to:

[0247] Detecting whether a row column identifier in the row node identifier and a final column identifier in the final node identifier are equal;

[0248] When the same row column identifier and the final column identifier are not equal, determining that the column relationship is a different column relationship;

[0249] When the same row column identifier and the final column identifier are equal, it is determined that the column relationship is a same column relationship.

[0250] Optionally, the routing device is further used for:

[0251] In the case where the column relationship is a different column relationship, generating a shortest routing path from the routing node in the same column to the routing node in the same column according to the network identification field of the routing node in the same column, to obtain the second routing path;

[0252] When the column relationship is a same-column relationship, it is determined that the second routing path is empty.

[0253] As an optional implementation manner, the routing device is further used for:

[0254] Obtaining node identifiers of the routing nodes in the same column and a final node identifier of the final routing node;

[0255] Detecting the layer relationship between the routing nodes in the same column and the final routing node according to the node identifiers in the same column and the final node identifier;

[0256] According to the layer relationship, a shortest routing path from the routing nodes in the same column to the final routing node is generated to obtain the third routing path.

[0257] As an optional implementation, each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located; the routing device is further used to:

[0258] Detecting whether the same-column layer identifier in the same-column node identifier and the final layer identifier in the final node identifier are equal;

[0259] When the same-column layer identifier and the final layer identifier are not equal, determining that the layer relationship is a different layer relationship;

[0260] When the same-column layer identifier and the final layer identifier are equal, it is determined that the layer relationship is a same-layer relationship.

[0261] Optionally, the routing device is further used for:

[0262] In the case where the layer relationship is a different layer relationship, generating the shortest routing path from the routing nodes in the same column to the final routing node according to the network identification field of the routing nodes in the same column to obtain the third routing path;

[0263] In the case where the layer relationship is a same-layer relationship, it is determined that the third routing path is empty.

[0264] Fig. 9 is a structural block diagram of a device for constructing an interconnected network according to an embodiment of the present application, such as Fig. 9 As shown, the construction device includes:

[0265] A first construction module 902 is used to construct N×P×Q node sets, where each node set includes a first network node, a second network node and a third network node that are connected to each other, and N, P and Q are all positive integers greater than or equal to 2;

[0266] A second construction module 904 is used to construct an N×P×Q three-dimensional network, wherein the three-dimensional network includes N×P×Q initial nodes, the three-dimensional network is divided into Q network layers, each network layer is an initial node matrix with N rows and P columns as a target network layer, and each initial node in the target network layer is connected to an adjacent node in the same row and column;

[0267] The replacement module 906 is used to replace the N×P×Q initial nodes in the three-dimensional network with the N×P×Q node sets, and establish connections between the node sets to obtain an interconnected network, wherein the first network nodes in each node set are connected to the adjacent node sets in the same row, the second network nodes in each node set are connected to the adjacent node sets in the same column, and the third network nodes in each node set are connected to the reference node set.

[0268] Through the above steps, the constructed interconnected network is divided into network layers, and the nodes in the network layer are constructed in the form of a node set matrix with N rows and P columns. Each node set includes a first network node, a second network node and a third network node that are connected to each other. The three network nodes are respectively connected to adjacent node sets in three different dimensions. Under the same network scale, the network diameter of the topological structure is much smaller than the topological structure in the form of a grid. Therefore, the technical problem of large network communication delay of the interconnected network can be solved, and the technical effect of reducing the network communication delay of the interconnected network can be achieved.

[0269] As an optional implementation manner, after replacing the N×P×Q initial nodes in the three-dimensional network with the N×P×Q node sets and establishing connections between the node sets to obtain an interconnected network, the construction device is further used to:

[0270] Encode a set identifier for each node set, wherein the set identifier of each node set includes a row identifier, a column identifier, and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located;

[0271] A node identifier is encoded for each network node, wherein the node identifier includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected.

[0272] As an optional implementation, the construction device is also used to: encode the network identification field of the first network node in each node set as 0, encode the network identification field of the second network node in each node set as 1, and encode the network identification field of the third network node in each node set as 2.

[0273] It should be noted that the above modules can be implemented by software or hardware. For the latter, it can be implemented in the following ways, but not limited to: the above modules are all located in the same processor; or the above modules are located in different processors in any combination.

[0274] An embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored, wherein the computer program is configured to execute the steps of any of the above method embodiments when running.

[0275] In an exemplary embodiment, the computer-readable storage medium may include, but is not limited to, various media that can store computer programs, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk.

[0276] An embodiment of the present application further provides an electronic device, including a memory and a processor, wherein a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.

[0277] In an exemplary embodiment, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.

[0278] An embodiment of the present application further provides a computer program product, which includes a computer program. When the computer program is executed by a processor, the steps in any one of the above method embodiments are implemented.

[0279] An embodiment of the present application further provides another computer program product, including a non-volatile computer-readable storage medium, wherein the non-volatile computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps in any of the above method embodiments are implemented.

[0280] An embodiment of the present application also provides a computer program, which includes computer instructions, which are stored in a computer-readable storage medium; a processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device performs the steps in any one of the above method embodiments.

[0281] For specific examples in this embodiment, reference may be made to the examples described in the above embodiments and exemplary implementation modes, and this embodiment will not be described in detail herein.

[0282] Obviously, those skilled in the art should understand that the above modules or steps of the present application can be implemented by a general computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, they can be implemented by a program code executable by a computing device, so that they can be stored in a storage device and executed by the computing device, and in some cases, the steps shown or described can be executed in a different order from that herein, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. Thus, the present application is not limited to any specific combination of hardware and software.

[0283] The above description is only the preferred embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the principles of the present application shall be included in the protection scope of the present application.

Claims

1. A topological structure of an interconnected network, characterized in that: include: The interconnection network includes N×P×Q node sets, the interconnection network is divided into Q network layers, and N, P and Q are all positive integers greater than or equal to 2; Each network layer in the Q network layers is a node set matrix with N rows and P columns as a target network layer, and each target node set in the target network layer is connected to an adjacent node set in the same row and column; The Q network layers are arranged in sequence, the target node set is connected to the reference node set at the same position in an adjacent network layer, and the adjacent network layer is a network layer adjacent to the target network layer among the Q network layers; Each node set includes a first network node, a second network node and a third network node which are connected to each other. The first network node is also connected to an adjacent node set in the same row, the second network node is also connected to an adjacent node set in the same column, and the third network node is also connected to the reference node set.

2. The topological structure according to claim 1, characterized in that: Each node set has a set identifier; The node identification of each network node includes a set identification field and a network identification field, wherein the set identification field is used to indicate the set identification of the node set to which each network node belongs, and the network identification field is used to indicate the node set to which each network node is connected.

3. The topological structure according to claim 2, characterized in that: The set identifier of each node set includes a row identifier, a column identifier and a layer identifier. The row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located.

4. The topological structure according to claim 2, characterized in that: The network identification field of the first network node is 0, the network identification field of the second network node is 1, and the network identification field of the third network node is 2.

5. The topological structure according to claim 1, characterized in that: N=P=Q.

6. A routing method for an interconnected network, characterized in that: Applied to the topology structure described in any one of claims 1 to 5, the routing method comprises: According to the row relationship between the starting routing node and the final routing node, a shortest routing path from the starting routing node to the peer routing node is generated to obtain a first routing path, wherein the row relationship is used to indicate the row distance between the starting row where the starting node set where the starting routing node is located in the starting network layer and the final row where the final node set where the final routing node is located in the final network layer, and the peer node set where the peer routing node is located is located in the final row in the starting network layer; Generate a shortest routing path from the same-column routing node to the same-column routing node according to the column relationship between the same-column routing node and the final routing node, and obtain a second routing path, wherein the column relationship is used to indicate the column distance between the current column where the same-column node set is located in the starting network layer and the final column where the final node set is located in the final network layer, and the same-column node set where the same-column routing node is located is located in the final row and the final column in the starting network layer; According to the layer relationship between the routing nodes in the same column and the final routing node, a shortest routing path from the routing nodes in the same column to the final routing node is generated to obtain a third routing path, wherein the layer relationship is used to indicate the layer distance between the starting network layer and the final network layer, and the target routing path includes: the first routing path, the second routing path and the third routing path; Routing from the starting routing node to the final routing node according to the target routing path.

7. The method according to claim 6, characterized in that The step of generating the shortest routing path from the starting routing node to the same routing node according to the row relationship between the starting routing node and the final routing node to obtain the first routing path includes: Obtaining a starting node identifier of the starting routing node and a final node identifier of the final routing node; Detecting the row relationship between the starting routing node and the final routing node according to the starting node identifier and the final node identifier; According to the row relationship, a shortest routing path from the starting routing node to the same routing node is generated to obtain the first routing path.

8. The method according to claim 7, characterized in that Each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located; The detecting the row relationship between the starting routing node and the final routing node according to the starting node identifier and the final node identifier comprises: Detecting whether a starting row identifier in the starting node identifier and a final row identifier in the final node identifier are equal; When the start row identifier and the final row identifier are not equal, determining that the row relationship is a different row relationship; When the start row identifier and the end row identifier are equal, determining that the row relationship is a same row relationship; The step of generating the shortest routing path from the starting routing node to the peer routing node according to the row relationship to obtain the first routing path includes: In the case where the row relationship is a different row relationship, generating a shortest routing path from the starting routing node to the peer routing node according to the network identification field of the starting routing node to obtain the first routing path; When the row relationship is a row relationship, it is determined that the first routing path is empty.

9. The method according to claim 6, characterized in that The step of generating the shortest routing path from the routing node in the same row to the routing node in the same row according to the column relationship between the routing node in the same row and the final routing node to obtain the second routing path comprises: Obtaining the peer node identifiers of the peer routing nodes and the final node identifier of the final routing node; Detecting the column relationship between the peer routing node and the final routing node according to the peer node identifier and the final node identifier; According to the column relationship, a shortest routing path from the routing node in the same row to the routing node in the same column is generated to obtain the second routing path.

10. The method according to claim 9, characterized in that Each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located; The detecting the column relationship between the peer routing node and the final routing node according to the peer node identifier and the final node identifier comprises: Detecting whether a row column identifier in the row node identifier and a final column identifier in the final node identifier are equal; When the same row column identifier and the final column identifier are not equal, determining that the column relationship is a different column relationship; When the same row column identifier and the final column identifier are equal, determining that the column relationship is a same-column relationship; The step of generating the shortest routing path from the routing node in the same row to the routing node in the same row according to the column relationship to obtain the second routing path includes: In the case where the column relationship is a different column relationship, generating a shortest routing path from the routing node in the same column to the routing node in the same column according to the network identification field of the routing node in the same column, to obtain the second routing path; When the column relationship is a same-column relationship, it is determined that the second routing path is empty.

11. The method according to claim 6, characterized in that The step of generating the shortest routing path from the routing nodes in the same column to the final routing node according to the layer relationship between the routing nodes in the same column and the final routing node to obtain the third routing path includes: Obtaining node identifiers of the routing nodes in the same column and a final node identifier of the final routing node; Detecting the layer relationship between the routing nodes in the same column and the final routing node according to the node identifiers in the same column and the final node identifier; According to the layer relationship, a shortest routing path from the routing nodes in the same column to the final routing node is generated to obtain the third routing path.

12. The method according to claim 11, characterized in that Each node set has a set identifier; the node identifier of each network node includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected; the set identifier of each node set includes a row identifier, a column identifier and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located; The detecting the layer relationship between the routing nodes in the same column and the final routing node according to the node identifiers in the same column and the final node identifier comprises: Detecting whether the same-column layer identifier in the same-column node identifier and the final layer identifier in the final node identifier are equal; When the same-column layer identifier and the final layer identifier are not equal, determining that the layer relationship is a different layer relationship; When the same-column layer identifier and the final layer identifier are equal, determining that the layer relationship is a same-layer relationship; The step of generating the shortest routing path from the routing nodes in the same column to the final routing node according to the layer relationship to obtain the third routing path includes: In the case where the layer relationship is a different layer relationship, generating the shortest routing path from the routing nodes in the same column to the final routing node according to the network identification field of the routing nodes in the same column to obtain the third routing path; In the case where the layer relationship is a same-layer relationship, it is determined that the third routing path is empty.

13. A method for constructing an interconnection network, characterized in that: Applied to the topological structure described in any one of claims 1 to 5, the construction method comprises: Constructing N×P×Q node sets, wherein each node set includes a first network node, a second network node, and a third network node that are connected to each other, and N, P, and Q are all positive integers greater than or equal to 2; Constructing an N×P×Q three-dimensional network, wherein the three-dimensional network includes N×P×Q initial nodes, the three-dimensional network is divided into Q network layers, each network layer is an initial node matrix of N rows and P columns as a target network layer, and each initial node in the target network layer is connected to an adjacent node in the same row and column; The N×P×Q node sets are used to replace the N×P×Q initial nodes in the three-dimensional network, and connections are established between the node sets to obtain an interconnected network, wherein the first network nodes in each node set are connected to adjacent node sets in the same row, the second network nodes in each node set are connected to adjacent node sets in the same column, and the third network nodes in each node set are connected to the reference node set.

14. The method according to claim 13, characterized in that After replacing the N×P×Q initial nodes in the three-dimensional network with the N×P×Q node sets and establishing connections between the node sets to obtain an interconnected network, the method further includes: Encode a set identifier for each node set, wherein the set identifier of each node set includes a row identifier, a column identifier, and a layer identifier, the row identifier is used to identify the row where each node set is located in the node set matrix, the column identifier is used to identify the column where each node set is located in the node set matrix, and the layer identifier is used to identify the network layer where each node set is located; A node identifier is encoded for each network node, wherein the node identifier includes a set identifier field and a network identifier field, wherein the set identifier field is used to indicate the set identifier of the node set to which each network node is located, and the network identifier field is used to indicate the node set to which each network node is connected.

15. The method according to claim 14, characterized in that The step of encoding a node identifier for each network node includes: The network identification field of the first network node in each node set is encoded as 0, the network identification field of the second network node in each node set is encoded as 1, and the network identification field of the third network node in each node set is encoded as 2.

16. A routing device for interconnecting networks, characterized in that: Applied to the topological structure described in any one of claims 1 to 5, the routing device comprises: A first generating module is configured to generate a shortest routing path from a starting routing node to a peer routing node according to a row relationship between the starting routing node and the final routing node, to obtain a first routing path, wherein the row relationship is used to indicate a row distance between a starting row where a starting node set where the starting routing node is located in a starting network layer and a final row where a final node set where the final routing node is located in a final network layer, and the peer node set where the peer routing node is located is located in the final row in the starting network layer; A second generating module is configured to generate a shortest routing path from the same-column routing node to the same-column routing node according to a column relationship between the same-column routing node and the final routing node, to obtain a second routing path, wherein the column relationship is used to indicate a column distance between a current column where the same-column node set is located in the starting network layer and a final column where the final node set is located in the final network layer, and the same-column node set where the same-column routing node is located is located in the final row and the final column in the starting network layer; a third generating module, configured to generate a shortest routing path from the routing nodes in the same column to the final routing node according to the layer relationship between the routing nodes in the same column and the final routing node, to obtain a third routing path, wherein the layer relationship is used to indicate the layer distance between the starting network layer and the final network layer, and the target routing path includes: the first routing path, the second routing path and the third routing path; A routing module is used to route from the starting routing node to the final routing node according to the target routing path.

17. A device for constructing an interconnected network, characterized in that: Applied to the topological structure described in any one of claims 1 to 5, the construction device comprises: A first construction module is used to construct N×P×Q node sets, wherein each node set includes a first network node, a second network node and a third network node that are connected to each other, and N, P and Q are all positive integers greater than or equal to 2; A second construction module is used to construct an N×P×Q three-dimensional network, wherein the three-dimensional network includes N×P×Q initial nodes, the three-dimensional network is divided into Q network layers, each network layer is an initial node matrix with N rows and P columns as a target network layer, and each initial node in the target network layer is connected to an adjacent node in the same row and column; A replacement module is used to replace the N×P×Q initial nodes in the three-dimensional network with the N×P×Q node sets, and establish connections between the node sets to obtain an interconnected network, wherein the first network nodes in each node set are connected to the adjacent node sets in the same row, the second network nodes in each node set are connected to the adjacent node sets in the same column, and the third network nodes in each node set are connected to the reference node set.

18. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, wherein when the computer program is executed by a processor, the steps of the method described in any one of claims 6 to 12 are implemented, or the steps of the method described in any one of claims 13 to 15 are implemented.

19. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the processor implements the steps of the method described in any one of claims 6 to 12, or implements the steps of the method described in any one of claims 13 to 15.

20. A computer program product comprising a computer program, characterized in that When the computer program is executed by a processor, the computer program implements the steps of the method described in any one of claims 6 to 12, or implements the steps of the method described in any one of claims 13 to 15.

Images