Data transmission method, device, equipment, switching chip and storage medium

By setting the status of data packets in the ring network and limiting the number of data links transmitted by non-shortest paths, using an adaptive path algorithm, the deadlock problem caused by the ring structure in the on-chip network is solved, and the deadlock and path diversity are avoided. Sexual effect.

CN118413478BActive Publication Date: 2024-11-22SHANDONG YUNHAI GUOCHUANG CLOUD COMPUTING EQUIP IND INNOVATION CENT CO LTD
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202410883468.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-07-03
Publication Date
2024-11-22
Estimated Expiration
2044-07-03

AI Technical Summary

Technical Problem

The deadlock problem caused by the ring structure in the on-chip network. Once a deadlock occurs, it will cause the entire network to be paralyzed, and the existing technology is difficult to effectively avoid.

Method used

In a ring network, by setting the status for the data packet and limiting the number of data links transmitted by non-shortest paths between two routing nodes, an adaptive path algorithm is used to determine the appropriate routing nodes to avoid the occurrence of deadlocks.

Benefits of technology

It effectively avoids the occurrence of deadlocks, maintains path diversity to the greatest extent, and simplifies hardware implementation logic, and is suitable for various scenarios such as switching chips.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118413478B_ABST
    Figure CN118413478B_ABST
Patent Text Reader

Abstract

The present invention relates to the technical field of data transmission, and discloses a data transmission method, device, equipment, switching chip and storage medium, the method comprising: obtaining a target data packet; determining a target routing node for sending the target data packet externally in a ring network; if the target data packet is in a first state, and the data links corresponding to the shortest path between the current routing node and the target routing node are not idle, determining the next routing node of the current routing node in the non-shortest path between the current routing node and the target routing node; when the number of data links for currently transmitting a data packet in a second state is less than a preset threshold, updating the state of the target data packet to the second state, and sending the target data packet based on the idle data link between the current routing node and the next routing node. The present invention can determine a suitable routing node based on an adaptive path algorithm, and avoid deadlock under the number limit of data links for non-shortest path transmission.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of data transmission, and in particular to a data transmission method, device, equipment, switching chip and storage medium. Background Art

[0002] The on-chip network borrows the network structure from computer networks. The entire network is connected by multiple point-to-point lines that will not interfere with each other. It can meet the communication requirements of multiple users and can effectively overcome the various limitations brought by the bus structure in the on-chip system.

[0003] With the development of on-chip networks, some on-chip networks have a "ring" structure, which can optimize the on-chip network to a certain extent, but it also leads to the problem of deadlock. Once a deadlock occurs, it will cause the on-chip network to be completely paralyzed. Summary of the invention

[0004] In view of this, the present invention provides a data transmission method, device, equipment, switching chip and storage medium to solve the deadlock problem in on-chip networks.

[0005] In a first aspect, the present invention provides a data transmission method, which is applied to a current routing node in a ring network; the method comprises:

[0006] Get the target data packet to be sent;

[0007] Determine a target routing node in the ring network for sending the target data packet externally; the ring network includes a plurality of interconnected routing nodes, and a plurality of data links are provided between the current routing node and other routing nodes in the ring network;

[0008] When the target data packet is in the first state, if the data links corresponding to the shortest path between the current routing node and the target routing node are not idle, determine the next routing node of the current routing node in the non-shortest path between the current routing node and the target routing node;

[0009] Determine whether the number of data links currently transmitting data packets in the second state among the multiple data links between the current routing node and the next routing node is less than a preset threshold;

[0010] When the number of data links currently transmitting data packets in the second state is less than a preset threshold, the state of the target data packet is updated to the second state, and based on the idle data link between the current routing node and the next routing node, the target data packet is sent to the next routing node.

[0011] In a second aspect, the present invention provides a data transmission device, which is applied to a current routing node in a ring network; the device comprises:

[0012] An acquisition module, used to acquire a target data packet to be sent;

[0013] A target determination module, used to determine a target routing node in the ring network for sending the target data packet externally; the ring network includes a plurality of interconnected routing nodes, and a plurality of data links are provided between the current routing node and other routing nodes in the ring network;

[0014] a non-shortest processing module, configured to determine, when the target data packet is in the first state, a next routing node of the current routing node in the non-shortest path between the current routing node and the target routing node if none of the data links corresponding to the shortest path between the current routing node and the target routing node are idle;

[0015] A determination module, configured to determine whether the number of data links currently transmitting data packets in the second state among the multiple data links between the current routing node and the next routing node is less than a preset threshold;

[0016] A sending module is used to update the state of the target data packet to the second state when the number of data links currently transmitting the data packet in the second state is less than a preset threshold, and send the target data packet to the next routing node based on the idle data link between the current routing node and the next routing node.

[0017] In a third aspect, the present invention provides a computer device, comprising: a memory and a processor, the memory and the processor being communicatively connected to each other, the memory storing computer instructions, and the processor executing the data transmission method of the first aspect or any corresponding embodiment thereof by executing the computer instructions.

[0018] In a fourth aspect, the present invention provides a switching chip, comprising: a plurality of port nodes, wherein the port nodes are interconnected via a multi-stage switching network;

[0019] The multi-stage switching network includes a ring network, and at least part of the routing nodes in the ring network are configured to execute the data transmission method of the first aspect or any corresponding embodiment thereof.

[0020] In a fifth aspect, the present invention provides a network device, comprising the switching chip as described in the fourth aspect.

[0021] In a sixth aspect, the present invention provides a computer-readable storage medium having computer instructions stored thereon, the computer instructions being used to enable a computer to execute the data transmission method of the first aspect or any corresponding embodiment thereof.

[0022] The present invention sets a first state or a second state for a target data packet to be transmitted, and the number of data links transmitted by non-shortest paths between two routing nodes cannot exceed a preset threshold value, so that when the routing path transmits data, a suitable routing node can be determined based on an adaptive path algorithm, and deadlock can be avoided under the limit of the number of data links transmitted by non-shortest paths; the method can maintain path diversity to the greatest extent while avoiding deadlock; and the hardware implementation logic is simple and can be applied to various scenarios such as switching chips. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the related technologies, the drawings required for use in the specific embodiments or the related technical descriptions will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0024] Figure 1 is a schematic diagram of the structure of an improved Clos network according to an embodiment of the present invention;

[0025] Figure 2 is a schematic diagram of the principles of two routing algorithms according to an embodiment of the present invention;

[0026] Figure 3 is a schematic diagram of generating a clockwise deadlock according to an embodiment of the present invention;

[0027] Figure 4 is a schematic diagram of generating a counterclockwise deadlock according to an embodiment of the present invention;

[0028] Figure 5 is a flow chart of a data transmission method according to an embodiment of the present invention;

[0029] Figure 6 is a schematic diagram of a structure of a ring network according to an embodiment of the present invention;

[0030] Figure 7 is a schematic diagram of a clockwise deadlock generated by two data links according to an embodiment of the present invention;

[0031] Figure 8 is a flow chart of another data transmission method according to an embodiment of the present invention;

[0032] Fig. 9 is a structural block diagram of a data transmission device according to an embodiment of the present invention;

[0033] Fig.10 It is a schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0034] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0035] In response to the defects of on-chip systems in terms of latency, clock synchronization, scalability, energy consumption, and reusability, a new on-chip system structure, "on-chip network", was proposed at the end of the century. It has overcome the various limitations brought by the bus structure, fully borrowed relevant network technologies in existing computer networks, and introduced them into the on-chip system for development and utilization, and has a good development prospect.

[0036] The Clos network (proposed by Charles Clos and named after the inventor) is the most commonly used network topology in on-chip networks and is a classic multi-level interconnected network. Among them, there is only one connection between each module between each level of the Clos network, but there are multiple paths to choose from between any input and output ports, so the Clos switching network has a multi-path feature, and multiple equivalent paths can provide redundancy while also supporting service load balancing; the module scale and structure of each level of the Clos switching network are the same, with modular characteristics and good scalability. However, when the scale of the network increases, the number of routing nodes and the number of connections in the Clos switching network increase greatly, and the hardware implementation logic is complex, resulting in an excessively large area of ​​routing nodes, which further increases the difficulty of layout and wiring. Based on this, this embodiment provides an improved Clos network based on grouping, which can optimize the connection topology according to actual usage. The number of connections of the routing nodes of the optimized network is significantly reduced, which is conducive to back-end layout and wiring.

[0037] Figure 1 A schematic diagram of the architecture of a packet-based improved Clos network is shown. Figure 1 In a full-duplex mode, each link can transmit data in both directions, that is, it is full-duplex. Figure 1In the figure, the boxes represent port nodes, and there are 48 port nodes in total. These port nodes can be numbered using 6-bit binary numbers, ranging from 000000 (port node 0) to 101111 (port node 47). Figure 1 The circles in the figure are routing nodes, which are responsible for forwarding data packets. There are 12 first-level routing nodes, which are connected to 4 port nodes downward, and connected to the same second-level routing node through two links upward, and connected to another first-level routing node under the same second-level routing node through two lines; there are 6 second-level routing nodes, which are connected to two first-level routing nodes downward; there are 4 third-level routing nodes, which are connected to 6 second-level routing nodes downward.

[0038] For the improved Clos network, the shortest path algorithm can be used to implement data routing, or an adaptive path algorithm can be used, that is, a suitable path is selected according to the actual situation of the network, which increases the path diversity. Figure 2 The schematic diagram of the principles of the two routing algorithms is shown; Figure 2 As shown, when the first-level routing node 0 sends a data packet to the second-level routing node 0, the data packet can be sent directly to the second-level routing node 0 based on the shortest path algorithm; or, the first-level routing node 0 can send the data packet directly to the second-level routing node 0 based on the adaptive path algorithm; or, if the link between the first-level routing node 0 and the second-level routing node 0 is occupied, the first-level routing node 0 can send the data packet to the first-level routing node 1, and the first-level routing node 1 forwards the data packet to the second-level routing node 0.

[0039] If the shortest path algorithm is used, the algorithm is simple and will not cause deadlock, but it cannot adjust the routing path according to the busy situation of the network. If an adaptive routing algorithm is used, it increases the diversity of paths, but because the network topology contains "rings", it is easy to cause deadlock.

[0040] Still Figure 2 Taking the ring topology shown in the figure as an example, deadlock is likely to occur if an adaptive routing algorithm is used. For example, suppose there are three routing requests at the same time: Request 1: Level 1 routing node 0 to Level 1 routing node 1; Request 2: Level 2 routing node 0 to Level 1 routing node 0; Request 3: Level 1 routing node 1 to Level 2 routing node 0. The shortest paths of these three routing requests are all occupied, resulting in clockwise routing. When the three routing requests have occupied the middle routing nodes, a clockwise deadlock occurs. Figure 3 shown.

[0041] Or, for example, suppose there are three routing requests at the same time: Request 4: Level 1 routing node 0 to Level 2 routing node 0; Request 5: Level 1 routing node 1 to Level 1 routing node 0; Request 6: Level 2 routing node 0 to Level 1 routing node 1; the shortest paths of these three routing requests are all occupied, resulting in the selection of counterclockwise routing. When the three routing requests have occupied the middle routing nodes, a counterclockwise deadlock occurs. Figure 4 shown.

[0042] For general Internet networks, deadlock is usually solved by virtual paths. However, for on-chip networks, once deadlock occurs, it will cause the on-chip Internet network to be completely paralyzed, so deadlock must be avoided.

[0043] The data transmission method provided by the embodiment of the present invention can effectively avoid deadlock while realizing adaptive routing by setting the status of the data packet and limiting the number of data links for non-shortest path transmission between two routing nodes. The algorithm is simple and the hardware implementation logic is simple.

[0044] According to an embodiment of the present invention, a data transmission method embodiment is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0045] In this embodiment, a data transmission method is provided, which can be applied to a routing node of a ring network, and the routing node can be a mobile terminal, a server, etc., or the routing node can also be a routing node in a switch chip (Switch chip), that is, the switch chip uses a multi-stage switch network on-chip network architecture. Figure 5 is a flow chart of a data transmission method according to an embodiment of the present invention. Figure 5 As shown, the process includes the following steps.

[0046] Step S501, obtaining a target data packet to be sent.

[0047] In this embodiment, the method is executed by a routing node in a ring network, that is, the routing node is a node in the ring network; for example, the ring network may be a partial structure of a multi-stage switching network, for example, the ring network may be Figure 1In the Clos network shown, a ring network is formed by a first-level routing node 0, a first-level routing node 1, and a second-level routing node 0. In addition, the multi-stage switching network can realize the transmission of data packets between different port nodes, and specifically needs to transmit the data packets through the routing nodes in the multi-stage switching network, that is, the routing nodes in the multi-stage switching network can receive the data packets. For the convenience of description, the routing node is referred to as the current routing node, and the obtained data packet is referred to as the target data packet; it can be understood that the current routing node needs to send the target data packet to the destination, that is, the port node that needs to receive the target data packet.

[0048] For example, Figure 6 FIG. 1 shows a schematic diagram of the structure of a ring network in the multi-stage switching network, wherein the dotted line box represents the ring network. Figure 6 As shown, the ring network includes three routing nodes: routing node 0, routing node 1, and routing node 2, and these three routing nodes may receive the target data packet to be transmitted, that is, these three routing nodes may serve as current routing nodes and implement data transmission according to the method provided in this embodiment. In addition, each routing node can be connected to other routing nodes or port nodes outside the ring network, such as Figure 6 As shown, routing node 0 and routing node 1 are both connected to two port nodes, and routing node 2 is connected to other routing nodes.

[0049] Among them, in the ring network, multiple data links are set between the current routing node and other routing nodes, that is, when one or some data links are occupied, data transmission is still allowed between routing nodes through other idle data links. Figure 6 In the present invention, there are two data links between any two routing nodes; it can be understood that the data link is full-duplex, allowing bidirectional data transmission.

[0050] Step S502, determining a target routing node in the ring network for sending a target data packet externally.

[0051] In this embodiment, if the current routing node in the ring network receives the target data packet, it can be determined that the target data packet needs to be transmitted through the ring network and ultimately needs to be transmitted to other routing nodes or port nodes in the multi-stage switching network, that is, the target data packet needs to be sent to other routing nodes or port nodes connected to the ring network. Therefore, there is a routing node in the ring network that sends the target data packet outside the ring network, namely the target routing node. Among them, based on the destination of the target data packet (for example, the address of the port node that receives the target data packet) and the location of the current routing node, it can be determined which routing node in the ring network is the target routing node.

[0052] The current routing node and the target routing node belong to the same ring network, and the current routing node may need to send the target data packet to the outside, that is, the current routing node is the target routing node.

[0053] Optionally, after the above step S502 "determining the target routing node for sending the target data packet externally in the ring network", it can also be determined whether the current routing node is the target routing node. In the case where the target routing node is the current routing node, the target data packet can be directly sent externally, that is, the target data packet can be sent to the target port node that needs to receive the target data packet, or the target data packet can be sent to other routing nodes outside the ring network.

[0054] Specifically, if the current routing node is connected to other routing nodes, the target data packet needs to be sent to other routing nodes outside the ring network; Figure 6 As shown, if the current routing node is routing node 2, and it is also the target routing node, then the routing node 2 sends the target data packet to the external routing node. If the current routing node is connected to the port node, and it is also the target routing node, then it can be determined that the transmission process of the target data packet is about to end, and the current routing node is also connected to the target port node that needs to receive the target data packet, so at this time, the target data packet can be directly sent to the target port node, ending the transmission process of the target data packet.

[0055] In addition, when the target routing node is different from the current routing node, the target data packet needs to be transmitted within the ring network, that is, the current routing node needs to send the target data packet to the target routing node. In this embodiment, the current routing node sends the target data packet based on the state of the target data packet. For details, please refer to the following steps S503 to S505, etc.

[0056] Step S503, when the target data packet is in the first state, if the data links corresponding to the shortest path between the current routing node and the target routing node are not idle, determine the next routing node of the current routing node in the non-shortest path between the current routing node and the target routing node.

[0057] In this embodiment, a corresponding state is set for the data packet, and the state can be specifically the first state or the second state. The state of the data packet is specifically based on whether the data packet is transmitted based on a non-shortest path during the transmission of the data packet. Specifically, the first state means that the data packet is transmitted based on the shortest path during the transmission of the data packet based on the ring network; the second state means that the non-shortest path is introduced during the transmission of the data packet based on the ring network, that is, the data packet is transmitted based on the non-shortest path. It can be understood that the initial state of the data packet is the first state.

[0058] After the current routing node obtains the target data packet, it can determine the state of the target data packet. If the target data packet is in the first state, it means that in the ring network, the shortest path was used when the target data packet was previously transmitted, and then the shortest path can be continued, or a non-shortest path can be taken, and the shortest path is generally preferred.

[0059] In this embodiment, since there are multiple data links between routing nodes in the ring network, the shortest path between the current routing node and the target routing node also corresponds to multiple data links. If there is an idle data link (that is, the data link is not currently used to transmit data), the target data packet can be preferentially sent to the target routing node based on the idle data link. Specifically, when the target data packet is in the first state, if there is an idle data link corresponding to the shortest path between the current routing node and the target routing node, the target data packet is sent to the target routing node based on the idle data link corresponding to the shortest path between the current routing node and the target routing node. In general, the routing nodes in the ring network are interconnected in pairs, so the data link corresponding to the shortest path between the current routing node and the target routing node is the data link between the current routing node and the target routing node.

[0060] If the data links corresponding to the shortest path between the current routing node and the target routing node are not idle, the target data packet cannot be transmitted based on the shortest path. At this time, the non-shortest path can be adaptively determined. Since the non-shortest path cannot directly connect the current routing node and the target routing node, other routing nodes are needed, that is, in the non-shortest path, the current routing node has a next routing node.

[0061] For example, Figure 6 Taking the ring network shown as an example, if the current routing node is routing node 0, the target routing node is routing node 2, and the current state of the target data packet is the first state. If there is an idle data link in the data link directly connected between routing node 0 and routing node 2, then routing node 0 can send the target data packet directly to routing node 2; if both data links directly connected between routing node 0 and routing node 2 are not idle, the non-shortest path between the two is: routing node 0 → routing node 1 → routing node 2, that is, the transmission of the target data packet can only be achieved with the help of routing node 1, and accordingly, routing node 1 is the next routing node of the current routing node in the non-shortest path.

[0062] Optionally, the target data packet may include a state flag indicating the state in which it is located; the state flag may be a 1-bit data bit, which may specifically be a first numerical value or a second numerical value; wherein the state flag of the first numerical value corresponds to the first state, and the state flag of the second numerical value corresponds to the second state. For example, if the state flag is 0, it indicates that the target data packet is in the first state; if the state flag is 1, it indicates that the target data packet is in the second state. By setting the state flag, the current state of the target data packet can be simply and conveniently indicated.

[0063] Step S504, determining whether the number of data links currently transmitting data packets in the second state among the multiple data links between the current routing node and the next routing node is less than a preset threshold.

[0064] In this embodiment, a certain preset threshold is set for the data link between routing nodes, and the preset threshold is used to limit the number of data links between two routing nodes that simultaneously transmit data packets in the second state.

[0065] Among them, the data link between the routing nodes cannot transmit all the data packets in the second state, so the preset threshold can be determined based on the number of data links between the two routing nodes. Specifically, the preset threshold between the current routing node and the next routing node can be determined based on the number of data links between the current routing node and the next routing node, and the preset threshold does not exceed the number of data links between the current routing node and the next routing node minus one. For example, if there are two data links between the current routing node and the next routing node, the preset threshold can be 2-1=1, that is, the preset threshold is 1.

[0066] Step S505, when the number of data links currently transmitting data packets in the second state is less than a preset threshold, the state of the target data packet is updated to the second state, and based on the idle data link between the current routing node and the next routing node, the target data packet is sent to the next routing node.

[0067] In this embodiment, if the number of data links currently transmitting data packets in the second state between the current routing node and the next routing node is greater than the preset threshold, it means that there are already many data links between the current routing node and the next routing node that transmit data packets in a non-shortest path manner, and the target data packets are also transmitted in a non-shortest path manner between the current routing node and the next routing node. At this time, if the target data packet is transmitted by the data link between the current routing node and the next routing node, a deadlock problem may occur, so it is forbidden to send the target data packet to the next routing node at this time. At this time, the current routing node can wait until the number of data links currently transmitting data packets in the second state between the current routing node and the next routing node is less than the preset threshold, or there is an idle data link corresponding to the shortest path between the current routing node and the target routing node.

[0068] If the number of data links currently transmitting data packets in the second state between the current routing node and the next routing node is less than the preset threshold, it means that a data link between the two can be used to transmit the target data packet.

[0069] Specifically, before transmitting the target data packet to the next routing node, the current routing node first updates the state of the target data packet, that is, updates the state of the target data packet from the first state to the second state, and then sends the target data packet to the next routing node to ensure that when the data packet is subsequently transmitted between the current routing node and the next routing node, the number of non-shortest path transmission modes can be accurately represented.

[0070] In addition, when sending the target data packet to the next routing node, it is also necessary to base it on the idle data link between the current routing node and the next routing node; if there is no idle data link between the current routing node and the next routing node, it is also necessary to wait until an idle data link appears.

[0071] In this embodiment, by limiting the number of data links for non-shortest path transmission between routing nodes, it is possible to avoid all data links between routing nodes transmitting data packets in a non-shortest path transmission manner, thereby effectively avoiding the problem of deadlock.

[0072] For example, for Figure 3 In the clockwise deadlock shown in FIG. 1 , in this embodiment, if two data links are provided between the routing nodes, then Figure 7 As shown in the figure, if there are two non-shortest path requests between every two routing nodes (i.e., two requests 1, two requests 2, and two requests 3), and all of them have occupied the intermediate routing nodes, a deadlock occurs.

[0073] In this embodiment, since the data link that is allowed to transmit the data packet in the second state is limited among the two data links between the routing nodes, only one data link is allowed to transmit the data packet in the second state. When other data packets in the second state need to be transmitted, it is necessary to wait. Figure 7 As shown in the example, if there are two requests 1, that is, both data packets need to be sent from the first-level routing node 0 (current routing node) to the first-level routing node 1 (target routing node), if one of the data packets is sent from the first-level routing node 0 (current routing node) to the second-level routing node 0 (next routing node) in a non-shortest path manner, then one of the data links is already transmitting a data packet in the second state, so other data packets in the second state cannot be transmitted between the first-level routing node 0 (current routing node) and the second-level routing node 0 (next routing node), thereby avoiding the execution of two requests 1 at the same time, effectively avoiding the problem of deadlock. Similarly, the problem of counterclockwise deadlock can also be avoided, which will not be repeated here.

[0074] The data transmission method provided in this embodiment sets the first state or the second state for the target data packet to be transmitted, and the number of data links transmitted by non-shortest paths between two routing nodes cannot exceed a preset threshold, so that when the routing path transmits data, it can determine the appropriate routing node based on the adaptive path algorithm and avoid deadlock under the limit of the number of data links transmitted by non-shortest paths; the method can maintain the path diversity to the greatest extent while avoiding the occurrence of deadlock; and the hardware implementation logic is simple and can be applied to various scenarios such as switching chips.

[0075] In this embodiment, a data transmission method is provided, which can be applied to routing nodes of a ring network in a multi-stage switching network. Figure 8 As shown, the process includes the following steps.

[0076] Step S801, obtaining a target data packet to be sent.

[0077] For details, please see Figure 5 Step S501 of the illustrated embodiment will not be described in detail here.

[0078] Step S802, determining a target routing node in the ring network for sending a target data packet externally.

[0079] For details, please see Figure 5 Step S502 of the illustrated embodiment will not be described in detail here.

[0080] Step S803, when the target data packet is in the first state, if the data links corresponding to the shortest path between the current routing node and the target routing node are not idle, determine the next routing node of the current routing node in the non-shortest path between the current routing node and the target routing node.

[0081] For details, please see Figure 5 Step S503 of the illustrated embodiment will not be described in detail here.

[0082] Step S804, determining whether the number of data links currently transmitting data packets in the second state among the multiple data links between the current routing node and the next routing node is less than a preset threshold.

[0083] For details, please see Figure 5 Step S504 of the illustrated embodiment will not be described in detail here.

[0084] Step S805, when the number of data links currently transmitting data packets in the second state is less than a preset threshold, the state of the target data packet is updated to the second state, and based on the idle data link between the current routing node and the next routing node, the target data packet is sent to the next routing node.

[0085] For details, please see Figure 5 Step S505 of the illustrated embodiment will not be described in detail here.

[0086] Step S806, when the target data packet is in the second state, based on the idle data link corresponding to the shortest path between the current routing node and the target routing node, the target data packet is sent to the target routing node. If the data links corresponding to the shortest path between the current routing node and the target routing node are not idle, wait.

[0087] In this embodiment, if the target data packet is currently in the second state, it means that when the target data packet was previously transmitted, it has been transmitted based on a non-shortest path. To ensure the transmission effect, the current routing node needs to transmit the target data packet in the shortest path manner.

[0088] Specifically, if there is an idle data link corresponding to the shortest path between the current routing node and the target routing node, the target data packet is sent directly to the target routing node based on the idle data link; if none of the data links corresponding to the shortest path between the current routing node and the target routing node are idle, wait until the idle data link corresponding to the shortest path between the current routing node and the target routing node is released.

[0089] Optionally, when the target data packet is in the second state, the method further includes: updating the state of the target data packet to the first state, and then executing the step of sending the target data packet.

[0090] Specifically, if the target data packet is in the second state, since the target data packet is subsequently transmitted based on the shortest path, the state of the target data packet can be updated from the second state to the first state, and then the target data packet is sent to the target routing node based on step S806. At this time, since the state of the target data packet is the first state, the process of sending the target data packet to the target routing node at this time may not be limited by the situation of the data link between the current routing node and the target routing node, that is, there is no need to pay attention to the number of data links between the two that are not transmitted by the shortest path.

[0091] In this embodiment, if the target data packet is in the second state, the data packet will be subsequently transmitted via the shortest path to ensure the transmission rate; and the shortest path will not cause deadlock, and the state of the target data packet is updated to the first state so that the target data packet can be transmitted normally without being restricted by the data link state.

[0092] In some optional implementations, the multi-stage switching network to which the data transmission method is applied may specifically include multiple first-level routing nodes, multiple second-level routing nodes, and multiple third-level routing nodes; wherein the multi-stage switching network is at least three-level, that is, the multi-stage switching network may also include four-level routing nodes, etc., which is not limited in this embodiment.

[0093] Each first-level routing node is connected to at least one port node for sending and receiving data packets. Each second-level routing node is connected to a corresponding part of the first-level routing nodes to form a ring network; each second-level routing node in the ring network is connected to each third-level routing node. In a ring network, the second-level routing node in the ring network is connected to each first-level routing node in the ring network, and multiple data links are provided; the first-level routing node in the ring network is connected to at least one other first-level routing node in the ring network, and multiple data links are provided; in general, the first-level routing nodes in the ring network are connected to each other.

[0094] For example, one structure of the multi-stage switching network can be found in Figure 1 As shown. The multi-level switching network includes: 12 first-level routing nodes, 6 second-level routing nodes and 4 third-level routing nodes, each first-level routing node is connected to 4 port nodes. Each second-level routing node is interconnected with two first-level routing nodes to form a ring network; Figure 1 In the figure, the multi-stage switching network includes six ring networks in total.

[0095] In this case, both the primary routing node and the secondary routing node in the ring network can be used as the current routing node. For different routing nodes, their corresponding target routing nodes can be determined based on different methods.

[0096] Specifically, if the current routing node is a first-level routing node, the above step S802 "determining a target routing node in the ring network for sending a target data packet externally" may specifically include the following steps A1 to A5.

[0097] Step A1, when the current routing node obtains the target data packet from the source port node, it is determined whether the source port node and the target port node belong to different secondary routing nodes; the target data packet comes from the source port node and needs to be transmitted to the target port node through a multi-stage switching network.

[0098] In this embodiment, the port node that sends the target data packet to the multi-stage switching network is called the source port node S (source), and the port node to which the target data packet is ultimately sent is called the destination port node D (destination). Figure 1 As shown, if port node 10 needs to send a data packet to port node 7 through the multi-stage switching network, port node 10 is the source port node S and port node 7 is the destination port node D.

[0099] For the current routing node which is a first-level routing node, if the current routing node obtains the target data packet from the source port node S, it means that the target data packet has just been transmitted to the multi-stage switching network. At this time, the current routing node needs to determine the target routing node in the ring network based on the target port node D.

[0100] Specifically, it is determined whether the source port node S and the target port node D belong to different secondary routing nodes. Based on different situations, different methods can be used to determine the target routing node.

[0101] Optionally, the port node is provided with a certain number, namely, the port number. Specifically, in a multi-stage switching network, a first-level routing node is connected to two m port nodes, the secondary routing node is connected to 2 n A first-level routing node; and each port node has a port number set in sequence. Figure 1 As shown, each first-level routing node is connected to 4 port nodes (i.e., m=2), and the second-level routing node is connected to 2 first-level routing nodes (i.e., n=1); and each port node has a port number set in sequence, and the port numbers of the 48 port nodes are: port number 0 to port number 47.

[0102] Among them, the above-mentioned step A1 "determining whether the source port node and the target port node belong to different secondary routing nodes" may include the following steps A11 to A13.

[0103] Step A11, determine whether the high k bits of the source port number of the source port node are the same as the high k bits of the target port number of the target port node; wherein the high k bits of the port number are the remaining high bits except the low m+n bits; the target data packet comes from the source port node and needs to be transmitted to the target port node through a multi-stage switching network.

[0104] Step A12: when the high k bits of the source port number of the source port node are different from the high k bits of the target port number of the target port node, it is determined that the source port node and the target port node belong to different secondary routing nodes.

[0105] Step A13, when the high k bits of the source port number of the source port node are the same as the high k bits of the target port number of the target port node, it is determined that the source port node and the target port node belong to the same secondary routing node.

[0106] In this embodiment, the lower n bits in the port number represent the position under a certain first-level routing node, the m+1th to m+nth bits in the port number represent the position of the first-level routing node under the second-level routing node, and the higher k bits in the port number can indicate which second-level routing node it belongs to. Among them, the higher k bits of the port number are the remaining higher bits except the lower m+n bits; specifically, if the port number has a total of a bits, then k=a-(m+n).

[0107] Among them, if the high k bits of the source port number of the source port node S are the same as the high k bits of the target port number of the target port node D, it means that the source port node S and the target port node D belong to the same secondary routing node. On the contrary, if the high k bits of the two port numbers are different, the source port node S and the target port node D belong to different secondary routing nodes.

[0108] Optionally, the above step A11 "determine whether the high k bits of the source port number of the source port node are the same as the high k bits of the target port number of the target port node" includes the following steps A111 to A112.

[0109] Step A111, performing an XOR process on the source port number of the source port node and the target port number of the target port node to obtain an XOR result.

[0110] Step A112, determine whether the high k bits of the XOR result are all zero.

[0111] In this embodiment, the positional relationship between the source port node S and the target port node D can be determined by performing an XOR process on the port numbers. Specifically, the source port number of the source port node S and the target port number of the target port node D are XORed to obtain a corresponding XOR result. If the high k bits of the XOR result are all zero, it can be determined that the high k bits of the two port numbers are the same, that is, the source port node S and the target port node D belong to the same secondary routing node; on the contrary, if the high k bits of the XOR result are not all zero (at least one bit is 1), it can be determined that the source port node S and the target port node D belong to different secondary routing nodes.

[0112] Step A2: When the source port node and the target port node belong to different secondary routing nodes, a secondary routing node that belongs to the same ring network as the current routing node is used as the target routing node.

[0113] In this embodiment, if the current routing node obtains the target data packet from the source port node S, and the source port node S and the target port node D belong to different secondary routing nodes, the target data packet needs to be sent to other ring networks. At this time, it needs to be sent to a suitable third-level routing node through the second-level routing node, and the target data packet is forwarded to another ring network through the third-level routing node so that the target data packet can be sent to the target port node D.

[0114] For example, Figure 1 Taking the structure shown as an example, m=2, n=1; and, it contains 48 port nodes in total, so the port numbers of these port nodes can be represented by 6-bit binary numbers, and the port numbers range from 000000 (port node 0) to 101111 (port node 47). At this time, a=6, k=3. After the current routing node obtains the target data packet from the source port node S, it can perform XOR on the target port number in the target data packet and the source port number of the source port node S to obtain the XOR result I.

[0115] If the upper three bits of the XOR result I are not 000, it means that the source port node S and the target port node D are not in the same secondary routing node. At this time, the secondary routing node belonging to the same ring network as the current routing node is used as the target routing node.

[0116] At this time, the target data packet is in the initial state, that is, the first state. The shortest path is selected first, that is, the target data packet is directly forwarded upward to the secondary routing node, and its state remains in the first state, for example, the state flag is still "0". If both data links of the shortest path are occupied, you can choose to forward it to another connected first-level routing node, that is, the other first-level routing node is used as the next routing node in the non-shortest path. If one of the two data links of another connected first-level routing node has been occupied by a routing request in the second state, it is still waiting at the data link corresponding to the shortest path of the current routing node; if neither of the two paths of another connected first-level routing node is occupied by a routing request in the second state, and there is an idle data link, the state of the target data packet is updated to the second state, for example, the state flag is marked as "1", and the target data packet is forwarded to another connected first-level routing node on the idle data link.

[0117] For example, Figure 1 Taking the multi-stage switching network shown as an example, if the source port node S is port node 10, the binary number is 001010, and the target port node D is port node 7, the binary number is 000111, then after the first-level routing node 2 receives the routing request initiated by the source port node S, it performs XOR on the upper three bits of the source port node S and the target port node D, and the result is 001, which means that the source port node S and the target port node D are not under the same second-level routing node. In this case, the shortest path is preferred, that is, it is forwarded directly upward to the second-level routing node. If both data links of the shortest path are occupied, it can be forwarded to another connected first-level routing node. The secondary routing node is the secondary routing node 1, and the other primary routing node connected to it is the primary routing node 3. If one of the two paths from the primary routing node 2 to the primary routing node 3 has been occupied by a request with a status mark bit of "1", it will still wait at the shortest path; if neither of the two data links from the primary routing node 2 to the primary routing node 3 is occupied by a request with a status mark bit of "1", and there is an idle link, the primary routing node 2 will mark the status mark bit as "1" and forward the routing request to the primary routing node 3 on the idle link.

[0118] Step A3: when the source port node and the target port node belong to the same secondary routing node, determine whether the source port node and the target port node belong to different primary routing nodes.

[0119] In this embodiment, if the source port node S and the target port node D belong to the same secondary routing node, it is further determined whether the two belong to different primary routing nodes, that is, whether the source port node S and the target port node D belong to different primary routing nodes.

[0120] Optionally, the first-level routing node is connected with 2 m port nodes, the secondary routing node is connected to 2 n Each port node has a port number set in sequence. In addition, the above step A3 "determining whether the source port node and the target port node belong to different first-level routing nodes" includes steps A31 to A33.

[0121] Step A31, determining whether the m+1th to m+nth bits of the source port number are the same as the m+1th to m+nth bits of the target port number.

[0122] Step A32, when the m+1th to m+nth bits of the source port number are the same as the m+1th to m+nth bits of the target port number, determine that the source port node and the target port node belong to the same first-level routing node.

[0123] Step A33, when the m+1th to m+nth digits of the source port number are different from the m+1th to m+nth digits of the target port number, determine that the source port node and the target port node belong to different first-level routing nodes.

[0124] In this embodiment, similar to the above steps A11 to A13, it is possible to simply determine whether the source port node S and the target port node D belong to different first-level routing nodes based on whether some bits in the port number are the same. As described above, the m+1th to m+nth bits in the port number indicate the position of the first-level routing node under the second-level routing node; if the source port node S and the target port node D belong to the same second-level routing node, and the m+1th to m+nth bits in the port number are the same, it can be indicated that the source port node S and the target port node D belong to the same first-level routing node, otherwise they belong to different first-level routing nodes under the same second-level routing node.

[0125] Step A4: When the source port node and the target port node belong to different primary routing nodes, the primary routing node connected to the target port node is used as the target routing node.

[0126] Step A5: When the source port node and the target port node belong to the same first-level routing node, the current routing node is the target routing node.

[0127] In this embodiment, if the source port node S and the target port node D belong to different first-level routing nodes, the first-level routing node connected to the target port node in the ring network to which the current routing node belongs is used as the target routing node. If the port node and the target port node belong to the same first-level routing node, the current routing node can be determined as the target routing node. At this time, the target data packet can be directly sent to the target port node D based on the current routing node.

[0128] by Figure 1 Taking the structure shown as an example, m=2, n=1, so if the third digit of the source port number is the same as the third digit of the target port number, it means that the source port node S and the target port node D belong to the same first-level routing node; otherwise, it means that the source port node S and the target port node D belong to different first-level routing nodes.

[0129] In addition, similar to the above steps A111 to A112, it is also possible to determine whether the corresponding bits are the same by XOR processing. Specifically, the source port node S and the target port node D are XORed to obtain the XOR result I. The upper three bits of the XOR result I are 000, which means that the source port node S and the target port node D are under the same secondary routing node. Then check the third bit of the XOR result I. If the third bit of the XOR result I is 1 (the XOR result I is in the form of: 0001__), it means that the source port node S and the target port node D are on different primary routing nodes under the same secondary routing node. At this time, the shortest path is preferentially selected to be forwarded to another connected primary routing node, and the status flag is marked as "0" (first state). If both data links of the shortest path are occupied, you can choose to forward it upward to the secondary routing node, that is, the secondary routing node is used as the next routing node. If one of the two paths forwarded upward to the secondary routing node is already occupied by a request with a status flag of "1" (second state), it will continue to wait at the data link corresponding to the shortest path of the current routing node; if neither of the two data links forwarded upward to the secondary routing node is occupied by a request with a status flag of "1" and there is an idle data link, the status flag of the target data packet will be updated to "1" and the routing request will be forwarded to the secondary routing node on the idle link.

[0130] If the upper four bits of the XOR result I are 0000__, it means that the source port node S and the target port node D are two port nodes connected on the same first-level routing node. At this time, the target port node D can be forwarded downward according to the lower two bits of the target port node D and the corresponding output port, thereby forwarding the target data packet to the target port node D.

[0131] Optionally, the first-level routing node can also obtain the target data packet from other first-level routing nodes. Specifically, if the current routing node is a first-level routing node, the above step S802 "determine the target routing node in the ring network to send the target data packet to the outside" can also include the following steps A6 to A8.

[0132] Step A6, when the current routing node obtains the target data packet from different first-level routing nodes in the same ring network, it is determined whether the current routing node is connected to the target port node.

[0133] In this embodiment, if the current routing node obtains the target data packet from different first-level routing nodes in the same ring network, it is necessary to determine whether the current routing node can directly send the data packet to the target port node, that is, to determine whether the current routing node is connected to the target port node.

[0134] Step A7: When the current routing node is connected to the target port node, the current routing node is the target routing node.

[0135] Step A8: When the current routing node is not connected to the target port node, a secondary routing node belonging to the same ring network as the current routing node is used as the target routing node.

[0136] In this embodiment, if the current routing node is connected to the target port node, it means that the target data packet has been transmitted to the last routing node in the routing path, so the current routing node can directly send the target data packet to the target port node D that needs to receive the target data packet. At this time, the current routing node is also the target routing node.

[0137] If the current routing node is not connected to the target port node, the current routing node needs to transmit the target data packet sent by another first-level routing node to the second-level routing node of the same ring network to send the target data packet to the outside, that is, at this time, the second-level routing node belonging to the same ring network as the current routing node is used as the target routing node. In addition, at this time, the state of the target data packet must be the second state, so the target data packet needs to be transmitted through the idle data link between the current routing node and the target port node, that is, data transmission is performed based on the shortest path between the two.

[0138] Optionally, the above step A6 “determining whether the current routing node is connected to the target port node” may include steps A61 to 63.

[0139] Step A61, determining the status of the target data packet.

[0140] Step A62: when the target data packet is in the first state, determine whether the current routing node is connected to the target port node.

[0141] Step A63: when the target data packet is in the second state, determine that the current routing node is not connected to the target port node.

[0142] Wherein, when the target data packet is in the second state, it is necessary to first update the state of the target data packet to the first state, and then perform the step of sending the target data packet.

[0143] In this embodiment, if the target data packet is in the second state, it is necessary to send the target data packet based on the shortest path. At this time, the state of the target data packet is first updated to the first state, and then the step of sending the target data packet is performed, such as the process of sending the target data packet shown in the above step S806. In this case, it can be determined based on the state of the target data packet that the current routing node is connected to the target port node.

[0144] Specifically, the current routing node (first-level routing node) receives a target data packet sent by another first-level routing node. If the target data packet is in the first state, it means that the two are data packets sent through the shortest path, that is, the other first-level routing node determines that the current routing node is connected to the target port node, and will directly send the target data packet to the current routing node based on the shortest path, so the current routing node can also determine that it is connected to the target port node. On the contrary, if the target data packet is in the second state, it means that the two are data packets sent through a non-shortest path, and the current routing node is just a routing node in the middle. At this time, it is necessary to use the second-level routing node for data routing.

[0145] For example, Figure 1 Taking the structure shown as an example, if the source port node S is port node 1, the binary number is 000001, the target port node D is port node 7, the binary number is 000111, after the first-level routing node 1 (current routing node) receives the routing request initiated by the first-level routing node 0, the corresponding status flag is "0" (first state), then it is directly forwarded downward from the port corresponding to the lower two bits 11 of the target port node D to port node 7.

[0146] Alternatively, the source port node S is port node 1, the binary number is 000001, the target port node D is port node 10, the binary number is 001010, and after the first-level routing node 1 (current routing node) receives the routing request initiated by the first-level routing node 0, the corresponding status flag is "1" (second state). Currently, the status flag needs to be marked as "0" and forwarded to the second-level routing node 0 by the shortest path.

[0147] In addition, the first-level routing node can also optionally obtain the target data packet from the second-level routing node. Specifically, if the current routing node is a first-level routing node, the above step S802 "determine the target routing node in the ring network to send the target data packet to the outside" can also include the following step A9.

[0148] Step A9, when the current routing node obtains the target data packet from the secondary routing node of the same ring network, the primary routing node connected to the target port node is used as the target routing node.

[0149] In this embodiment, if the current routing node obtains the target data packet from the secondary routing node of the same ring network, the primary routing node connected to the target port node can be determined based on the state of the target data packet, that is, the target routing node is determined.

[0150] Specifically, the state flag of the target data packet can be checked. If the state flag is "0" (the first state), it can be determined that the current routing node is connected to the target port node, which is also the target routing node. At this time, it is forwarded downward from the corresponding output port according to the lower two bits of the target port node D. If the state flag is "1" (the second state), the previous step is not the shortest path, and the state flag needs to be marked as "0" at present, and forwarded to another first-level routing node connected to it by the shortest path.

[0151] For example, Figure 1 Taking the structure shown as an example, the source port node S is port node 10, the binary number is 001010, the target port node D is port node 7, the binary number is 000111, and after the first-level routing node 1 receives the routing request, its status flag is "0", then the first-level routing node 1 directly forwards it downward from the port corresponding to the lower two bits 11 of the target port node D to port node 7.

[0152] Alternatively, the source port node S is port node 10, the binary number is 001010, the target port node D is port node 7, the binary number is 000111, and after the first-level routing node 0 receives the routing request, its status flag is "1". Currently, the status flag needs to be marked as "0" and forwarded to another first-level routing node 1 connected to it by the shortest path.

[0153] In some optional implementations, the current routing node may also be a secondary routing node; in this case, the above step S802 "determining a target routing node in the ring network for sending a target data packet externally" may include the following steps B1 to B3.

[0154] Step B1, when the current routing node obtains the target data packet from the first-level routing node, it determines whether it is necessary to send the target data packet to the third-level routing node.

[0155] Step B2: When it is necessary to send a target data packet to a third-level routing node, the current routing node is the target routing node.

[0156] Step B3, when there is no need to send the target data packet to the third-level routing node, the first-level routing node connected to the target port node is used as the target routing node.

[0157] In this embodiment, if the current routing node (secondary routing node) obtains the target data packet from the primary routing node, it needs to determine whether the target data packet needs to be sent to other ring networks, that is, whether the target data packet needs to be sent to the third-level routing node.

[0158] Optionally, the above step B1 "determining whether it is necessary to send a target data packet to a third-level routing node" may include the following steps B11 to B13.

[0159] Step B11, determining the status of the target data packet.

[0160] Step B12: when the target data packet is in the first state, determining that the target data packet needs to be sent to the third-level routing node.

[0161] Step B13: when the target data packet is in the second state, it is determined that it is not necessary to send the target data packet to the third-level routing node.

[0162] Wherein, when the target data packet is in the second state, it is necessary to first update the state of the target data packet to the first state, and then perform the step of sending the target data packet.

[0163] In this embodiment, if the target data packet is in the second state, it is necessary to send the target data packet based on the shortest path. At this time, the state of the target data packet is first updated to the first state, and then the step of sending the target data packet is performed, such as the process of sending the target data packet shown in step S806. In this case, it can be determined whether the target data packet needs to be sent to the third-level routing node based on the state of the target data packet.

[0164] Specifically, the current routing node (secondary routing node) receives a target data packet sent by a certain level of routing node. If the target data packet is in the first state, it means that the two are data packets sent through the shortest path, that is, the first-level routing node determines that the current routing node can directly send the target data packet to the outside, that is, the current routing node needs to send the target data packet to the connected third-level routing node. At this time, the current routing node is also the target routing node. On the contrary, if the target data packet is in the second state, it means that the two are data packets sent through a non-shortest path, and the current routing node is only a certain routing node in the middle. At this time, it is necessary to use other first-level routing nodes for data routing, that is, it is not necessary to send the target data packet to the third-level routing node, and the first-level routing node connected to the target port node is used as the target routing node.

[0165] In addition, optionally, the second-level routing node may also obtain the target data packet from the third-level routing node; the above step S802 "determining the target routing node in the ring network that sends the target data packet to the outside" may include the following step B4.

[0166] Step B4, when the current routing node obtains the target data packet from the third-level routing node, the first-level routing node connected to the target port node is used as the target routing node.

[0167] In this embodiment, if the current routing node (secondary routing node) obtains the target data packet from the third-level routing node, the current routing node needs to send the target data packet downward, that is, to use a first-level routing node connected to the current routing node as the target routing node. Specifically, the target routing node needs to be connected to the target port node D.

[0168] For example, the current routing node may check the m+1th bit to the m+nth bit in the target port node D, and based on the values ​​of these bits, determine which first-level routing node to connect to as the target routing node.

[0169] For example, Figure 1 Taking the structure shown as an example, the highest bit of the three lower bits in the target port node D can be determined. If it is 0, it means that the target port node D is on the left first-level routing node connected to the second-level routing node, and it is preferentially routed to the left first-level routing node through the shortest path, that is, the left first-level routing node is the target routing node. If the ports of the shortest path connecting the left first-level routing node are all occupied, it can be transferred to the right first-level routing node (next routing node). If one of the two paths with the right first-level routing node has been occupied by a request with a status flag of "1" (second state), it is still waiting at the shortest path of the current routing node; if neither of the two paths with the right first-level routing node is occupied by a request with a status flag of "1", and there is an idle link, the status flag of the target data packet is marked as "1", and the routing request is forwarded to the right first-level routing node on the idle link.

[0170] Similarly, if the highest bit of the three lower bits in the target port node D is 1, it means that the target port node D is on the first-level routing node on the right connected to the second-level routing node, and it will be transferred to the first-level routing node on the right through the shortest path. If the ports connected to the first-level routing node on the right are all occupied, it can be transferred to the first-level routing node on the left. If one of the two paths with the first-level routing node on the left is already occupied by a request with a status flag of "1", it will still wait at the shortest path; if neither of the two paths with the first-level routing node on the left is occupied by a request with a status flag of "1", and there is an idle link, the status flag is marked as "1", and the routing request is forwarded to the first-level routing node on the left on the idle link.

[0171] For example, Figure 1Taking the structure shown as an example, the source port node S is port node 1, and the binary number is 000001. The target port node D is port node 10, and the binary number is 001010. After the secondary routing node 1 receives the routing request initiated by the third-level routing node, it checks the highest bit of the three lower bits of the target port node D. If it is 0, it means that the target port node D is on the left first-level routing node 2 connected to the secondary routing node, then it is preferentially routed to the left first-level routing node 2 through the shortest path. If the ports of the shortest path connecting the left first-level routing node 2 are all occupied, it can be transferred to the right first-level routing node 3. If one of the two paths with the right first-level routing node 3 is already occupied by a request with a status flag bit of "1", it is still waiting on the shortest path; if the two paths with the right first-level routing node 3 are not occupied by a request with a status flag bit of "1", and there is an idle link, the status flag bit is marked as "1", and the routing request is forwarded to the right first-level routing node 3 on the idle link.

[0172] Alternatively, the source port node S is port node 1, the binary number is 000001, the target port node D is port node 12, the binary number is 001100, and after receiving the routing request, the secondary routing node 1 checks the highest bit of the lower three bits of the target port node D. If it is 1, it means that the target port node D is on the first-level routing node 3 on the right connected to the secondary routing node, then it is preferentially routed to the first-level routing node 3 on the right through the shortest path. If the ports of the shortest path connecting the first-level routing node 3 on the right are all occupied, it is transferred to the first-level routing node 2 on the left. If one of the two paths with the first-level routing node 2 on the left is already occupied by a request with a status flag bit of "1", it is still waiting on the shortest path; if neither of the two paths with the first-level routing node 2 on the left is occupied by a request with a status flag bit of "1", and there is an idle link, the status flag bit is marked as "1" and the routing request is forwarded to the first-level routing node 2 on the left on the idle link.

[0173] In addition, for the third-level routing node in the multi-level switching network, after receiving the routing request from the second-level routing node below, it can determine which first- and second-level routing node the data packet needs to be sent to based on the high k bits of the target port node D, which is not described in detail here.

[0174] The data transmission method provided in this embodiment determines the appropriate routing node based on the adaptive path algorithm, and avoids deadlock under the limit of the number of data links transmitted by non-shortest paths; this method can maintain the path diversity to the greatest extent while avoiding the occurrence of deadlock. In addition, the first-level routing node or the second-level routing node can determine the target routing path based on a simple judgment, and determine the shortest path or non-shortest path transmission based on the state of the target data packet. For each routing node, the implementation logic is relatively simple and can be applied to a variety of scenarios such as switching chips.

[0175] In this embodiment, a data transmission device is also provided, which is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated. As used below, the term "module" can be a combination of software and / or hardware that implements 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.

[0176] This embodiment provides a data transmission device, which is applied to a current routing node in a ring network; Fig. 9 As shown, the device comprises:

[0177] An acquisition module 901 is used to acquire a target data packet to be sent;

[0178] The target determination module 902 is used to determine the target routing node in the ring network to send the target data packet to the outside; the ring network includes a plurality of interconnected routing nodes, and a plurality of data links are provided between the current routing node and other routing nodes in the ring network;

[0179] The non-shortest processing module 903 is used to determine the next routing node of the current routing node in the non-shortest path between the current routing node and the target routing node if none of the data links corresponding to the shortest path between the current routing node and the target routing node are idle when the target data packet is in the first state;

[0180] A determination module 904 is used to determine whether the number of data links currently transmitting data packets in the second state among the multiple data links between the current routing node and the next routing node is less than a preset threshold;

[0181] The sending module 905 is used to update the state of the target data packet to the second state when the number of data links currently transmitting the data packet in the second state is less than a preset threshold, and send the target data packet to the next routing node based on the idle data link between the current routing node and the next routing node.

[0182] In some optional implementations, the sending module 905 is further configured to:

[0183] When the target data packet is in the first state, if there is an idle data link corresponding to the shortest path between the current routing node and the target routing node, the target data packet is sent to the target routing node based on the idle data link corresponding to the shortest path between the current routing node and the target routing node.

[0184] In some optional implementations, the sending module 905 is further configured to:

[0185] When the target data packet is in the second state, sending the target data packet to the target routing node based on an idle data link corresponding to the shortest path between the current routing node and the target routing node;

[0186] If the data links corresponding to the shortest path between the current routing node and the target routing node are not idle, wait.

[0187] In some optional implementations, the sending module 905 is further used to: when the target data packet is in the second state, first update the state of the target data packet to the first state, and then execute the step of sending the target data packet.

[0188] In some optional implementations, the target data packet includes a status flag indicating a current state; a status flag of a first value corresponds to the first state, and a status flag of a second value corresponds to the second state.

[0189] In some optional implementations, after the target determination module 902 determines the target routing node in the ring network for externally sending the target data packet, the sending module 905 is further configured to:

[0190] In the case where the target routing node is the current routing node, sending the target data packet to a target port node that needs to receive the target data packet, or to other routing nodes outside the ring network;

[0191] In the case where the target routing node is different from the current routing node, the step of sending the target data packet based on the state of the target data packet is performed.

[0192] In some optional implementations, the ring network is a partial structure of a multi-stage switching network; the multi-stage switching network is at least three-stage and includes a plurality of first-stage routing nodes, a plurality of second-stage routing nodes, and a plurality of third-stage routing nodes; each of the first-stage routing nodes is connected to at least one port node for sending and receiving data packets;

[0193] Each of the secondary routing nodes is connected to a corresponding portion of the primary routing nodes to form a ring network;

[0194] In the ring network, a secondary routing node in the ring network is connected to each primary routing node in the ring network and is provided with a plurality of data links; a primary routing node in the ring network is connected to at least one other primary routing node in the ring network and is provided with a plurality of data links;

[0195] Each of the second-level routing nodes in the ring network is connected to each of the third-level routing nodes.

[0196] In some optional implementations, the current routing node is a primary routing node;

[0197] The target determination module 902 determines the target routing node in the ring network for sending the target data packet externally, including:

[0198] In the case where the current routing node obtains a target data packet from a source port node, determining whether the source port node and the target port node belong to different secondary routing nodes; the target data packet comes from the source port node and needs to be transmitted to the target port node through the multi-stage switching network;

[0199] In the case where the source port node and the target port node belong to different secondary routing nodes, a secondary routing node that belongs to the same ring network as the current routing node is used as the target routing node;

[0200] In the case where the source port node and the target port node belong to the same secondary routing node, determining whether the source port node and the target port node belong to different primary routing nodes;

[0201] In the case where the source port node and the target port node belong to different primary routing nodes, the primary routing node connected to the target port node is used as the target routing node;

[0202] In the case that the source port node and the target port node belong to the same first-level routing node, the current routing node is the target routing node.

[0203] In some optional implementations, the target determination module 902 determines the target routing node in the ring network for sending the target data packet externally, and further includes:

[0204] In the case where the current routing node obtains the target data packet from different first-level routing nodes in the same ring network, determining whether the current routing node is connected to the target port node;

[0205] In the case where the current routing node is connected to the target port node, the current routing node is the target routing node;

[0206] In the case that the current routing node is not connected to the target port node, a secondary routing node belonging to the same ring network as the current routing node is used as the target routing node.

[0207] In some optional implementations, the target determination module 902 determines whether the current routing node is connected to the target port node, including:

[0208] Determining a status of the target data packet;

[0209] When the target data packet is in the first state, determining that the current routing node is connected to the target port node;

[0210] When the target data packet is in the second state, determining that the current routing node is not connected to the target port node;

[0211] Wherein, when the target data packet is in the second state, it is necessary to first update the state of the target data packet to the first state, and then perform the step of sending the target data packet.

[0212] In some optional implementations, the target determination module 902 determines the target routing node in the ring network for sending the target data packet externally, and further includes:

[0213] In the case that the current routing node obtains the target data packet from the secondary routing node of the same ring network, the primary routing node connected to the target port node is used as the target routing node.

[0214] In some optional implementations, the first-level routing node is connected to 2 m port nodes, the secondary routing node is connected to 2 n A first-level routing node; each of the port nodes has a port number set in sequence;

[0215] The target determination module 902 determines whether the source port node and the target port node belong to different secondary routing nodes, including:

[0216] Determine whether the high k bits of the source port number of the source port node and the high k bits of the target port number of the target port node are the same; wherein the high k bits of the port number are the remaining high bits except the low m+n bits; the target data packet comes from the source port node and needs to be transmitted to the target port node through the multi-stage switching network;

[0217] In a case where the high k bits of the source port number of the source port node are different from the high k bits of the target port number of the target port node, determining that the source port node and the target port node belong to different secondary routing nodes;

[0218] When the high k bits of the source port number of the source port node are the same as the high k bits of the target port number of the target port node, it is determined that the source port node and the target port node belong to the same secondary routing node.

[0219] In some optional implementations, the target determination module 902 determines whether the high k bits of the source port number of the source port node and the high k bits of the target port number of the target port node are the same, including:

[0220] Performing an XOR process on the source port number of the source port node and the target port number of the target port node to obtain an XOR result;

[0221] It is determined whether the high k bits of the XOR result are all zero.

[0222] In some optional implementations, the first-level routing node is connected to 2 m port nodes, the secondary routing node is connected to 2 n A first-level routing node; each of the port nodes has a port number set in sequence;

[0223] The target determination module 902 determines whether the source port node and the target port node belong to different primary routing nodes, including:

[0224] Determine whether the m+1th to m+nth bits of the source port number of the source port node are the same as the m+1th to m+nth bits of the target port number of the target port node;

[0225] When the m+1th to m+nth digits of the source port number are the same as the m+1th to m+nth digits of the target port number, determining that the source port node and the target port node belong to the same first-level routing node;

[0226] When the m+1th to m+nth bits of the source port number are different from the m+1th to m+nth bits of the target port number, it is determined that the source port node and the target port node belong to different first-level routing nodes.

[0227] In some optional implementations, the current routing node is a secondary routing node;

[0228] The target determination module 902 determines the target routing node in the ring network for sending the target data packet externally, including:

[0229] In the case where the current routing node obtains the target data packet from the first-level routing node, determining whether it is necessary to send the target data packet to the third-level routing node;

[0230] In the case where the target data packet needs to be sent to a third-level routing node, the current routing node is the target routing node;

[0231] When there is no need to send the target data packet to the third-level routing node, the first-level routing node connected to the target port node is used as the target routing node; wherein the target data packet comes from the source port node and needs to be transmitted to the target port node through the multi-level switching network.

[0232] In some optional implementations, the target determination module 902 determines whether it is necessary to send the target data packet to the third-level routing node, including:

[0233] Determining a status of the target data packet;

[0234] When the target data packet is in the first state, determining that the target data packet needs to be sent to the third-level routing node;

[0235] When the target data packet is in the second state, determining that it is not necessary to send the target data packet to the third-level routing node;

[0236] Wherein, when the target data packet is in the second state, it is necessary to first update the state of the target data packet to the first state, and then perform the step of sending the target data packet.

[0237] In some optional implementations, the target determination module 902 determines the target routing node in the ring network for sending the target data packet externally, and further includes:

[0238] In the case that the current routing node obtains the target data packet from the third-level routing node, the first-level routing node connected to the target port node is used as the target routing node.

[0239] The further functional description of each of the above modules and units is the same as that of the above corresponding embodiments and will not be repeated here.

[0240] The data transmission device in this embodiment is presented in the form of a functional unit, where the unit refers to an ASIC (Application Specific Integrated Circuit) circuit, including a processor and memory that executes one or more software or fixed programs, and / or other devices that can provide the above functions.

[0241] The embodiment of the present invention also provides a switching chip, such as a PCIe Switch chip, which can be applied to general servers, AI servers, etc. The switching chip includes: a plurality of port nodes, the port nodes are interconnected through a multi-stage switching network; the multi-stage switching network includes a ring network, and at least some routing nodes in the ring network are configured to execute any of the above-mentioned data transmission methods. A network architecture of the switching chip can be found in Figure 1 As shown, no further description is given here.

[0242] The embodiment of the present invention further provides a network device, which includes the switching chip as described above. For example, the network device may be a switch, a network card, and the like.

[0243] The embodiment of the present invention also provides a computer device having the above Fig. 9 The data transmission device shown.

[0244] See also Fig.10 , Fig.10 is a schematic diagram of the structure of a computer device provided by an optional embodiment of the present invention, such as Fig.10 As shown, the computer device includes: one or more processors 10, a memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components are connected to each other using different buses for communication, and can be installed on a common mainboard or installed in other ways as needed. The processor can process instructions executed in the computer device, including instructions stored in or on the memory to display the graphical information of the GUI on an external input / output device (such as a display device coupled to the interface). In some optional embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories. Similarly, multiple computer devices can be connected, and each device provides some necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Fig.10 A processor 10 is taken as an example.

[0245] The processor 10 may be a central processing unit, a network processor or a combination thereof. The processor 10 may further include a hardware chip. The hardware chip may be a dedicated integrated circuit, a programmable logic device or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general purpose array logic or any combination thereof.

[0246] The memory 20 stores instructions executable by at least one processor 10, so that the at least one processor 10 executes the method shown in the above embodiment.

[0247] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the computer device, etc. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some optional embodiments, the memory 20 may optionally include a memory remotely arranged relative to the processor 10, and these remote memories may be connected to the computer device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0248] The memory 20 may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a flash memory, a hard disk or a solid state drive; the memory 20 may also include a combination of the above types of memory.

[0249] The computer device further comprises a communication interface 30 for the computer device to communicate with other devices or a communication network.

[0250] The embodiment of the present invention also provides a computer-readable storage medium. The method according to the embodiment of the present invention can be implemented in hardware, firmware, or can be implemented as a computer code that can be recorded in a storage medium, or can be implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and will be stored in a local storage medium through a network download, so that the method described herein can be stored in such software processing on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only storage memory, a random access memory, a flash memory, a hard disk or a solid-state hard disk, etc.; further, the storage medium can also include a combination of the above types of memories. It can be understood that a computer, a processor, a microprocessor controller, or programmable hardware includes a storage component that can store or receive software or computer code. When the software or computer code is accessed and executed by a computer, a processor, or hardware, the method shown in the above embodiment is implemented.

[0251] Although the embodiments of the present invention have been described in conjunction with the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention, and such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A data transmission method, It is characterized in that Applied to a current routing node in a ring network, the method comprises: Get the target data packet to be sent; Determine a target routing node in the ring network for sending the target data packet externally; the ring network includes a plurality of interconnected routing nodes, and a plurality of data links are provided between the current routing node and other routing nodes in the ring network; When the target data packet is in the first state, if the data links corresponding to the shortest path between the current routing node and the target routing node are not idle, determine the next routing node of the current routing node in the non-shortest path between the current routing node and the target routing node; Determine whether the number of data links currently transmitting data packets in the second state among the multiple data links between the current routing node and the next routing node is less than a preset threshold; When the number of data links currently transmitting data packets in the second state is less than a preset threshold, the state of the target data packet is updated to the second state, and based on the idle data link between the current routing node and the next routing node, the target data packet is sent to the next routing node.

2. The method according to claim 1, It is characterized in that Also includes: When the target data packet is in the first state, if there is an idle data link corresponding to the shortest path between the current routing node and the target routing node, the target data packet is sent to the target routing node based on the idle data link corresponding to the shortest path between the current routing node and the target routing node.

3. The method according to claim 1, It is characterized in that Also includes: When the target data packet is in the second state, sending the target data packet to the target routing node based on an idle data link corresponding to the shortest path between the current routing node and the target routing node; If the data links corresponding to the shortest path between the current routing node and the target routing node are not idle, wait.

4. The method according to claim 3, It is characterized in that Also includes: When the target data packet is in the second state, the state of the target data packet is first updated to the first state, and then the step of sending the target data packet is performed.

5. The method according to claim 1, It is characterized in that The target data packet includes a state flag indicating a state; a state flag of a first value corresponds to the first state, and a state flag of a second value corresponds to the second state.

6. The method according to claim 1, It is characterized in that After determining the target routing node in the ring network for sending the target data packet externally, the method further includes: In the case where the target routing node is the current routing node, sending the target data packet to a target port node that needs to receive the target data packet, or to other routing nodes outside the ring network; In the case where the target routing node is different from the current routing node, the step of sending the target data packet based on the state of the target data packet is performed.

7. The method according to any one of claims 1 to 6, It is characterized in that The ring network is a partial structure of a multi-stage switching network; the multi-stage switching network is at least three-stage and includes a plurality of first-stage routing nodes, a plurality of second-stage routing nodes and a plurality of third-stage routing nodes; each of the first-stage routing nodes is connected to at least one port node for sending and receiving data packets; Each of the secondary routing nodes is connected to a corresponding portion of the primary routing nodes to form a ring network; In the ring network, a secondary routing node in the ring network is connected to each primary routing node in the ring network and is provided with a plurality of data links; a primary routing node in the ring network is connected to at least one other primary routing node in the ring network and is provided with a plurality of data links; Each of the second-level routing nodes in the ring network is connected to each of the third-level routing nodes.

8. The method according to claim 7, It is characterized in that The current routing node is a primary routing node; The step of determining a target routing node in the ring network for sending the target data packet externally comprises: In the case where the current routing node obtains a target data packet from a source port node, determining whether the source port node and the target port node belong to different secondary routing nodes; the target data packet comes from the source port node and needs to be transmitted to the target port node through the multi-stage switching network; In the case where the source port node and the target port node belong to different secondary routing nodes, a secondary routing node that belongs to the same ring network as the current routing node is used as the target routing node; In the case where the source port node and the target port node belong to the same secondary routing node, determining whether the source port node and the target port node belong to different primary routing nodes; In the case where the source port node and the target port node belong to different primary routing nodes, the primary routing node connected to the target port node is used as the target routing node; In the case that the source port node and the target port node belong to the same first-level routing node, the current routing node is the target routing node.

9. The method according to claim 8, It is characterized in that The step of determining a target routing node in the ring network for sending the target data packet externally further comprises: In the case where the current routing node obtains the target data packet from different first-level routing nodes in the same ring network, determining whether the current routing node is connected to the target port node; In the case where the current routing node is connected to the target port node, the current routing node is the target routing node; In the case that the current routing node is not connected to the target port node, a secondary routing node belonging to the same ring network as the current routing node is used as the target routing node.

10. The method according to claim 9, It is characterized in that The determining whether the current routing node is connected to the target port node includes: Determining a status of the target data packet; When the target data packet is in the first state, determining that the current routing node is connected to the target port node; When the target data packet is in the second state, determining that the current routing node is not connected to the target port node; Wherein, when the target data packet is in the second state, it is necessary to first update the state of the target data packet to the first state, and then perform the step of sending the target data packet.

11. The method according to claim 8, It is characterized in that The step of determining a target routing node in the ring network for sending the target data packet externally further comprises: In the case that the current routing node obtains the target data packet from the secondary routing node of the same ring network, the primary routing node connected to the target port node is used as the target routing node.

12. The method according to claim 8, It is characterized in that The first-level routing node is connected to 2 m port nodes, the secondary routing node is connected to 2 n A first-level routing node; each of the port nodes has a port number set in sequence; The determining whether the source port node and the target port node belong to different secondary routing nodes includes: Determine whether the high k bits of the source port number of the source port node and the high k bits of the target port number of the target port node are the same; wherein the high k bits of the port number are the remaining high bits except the low m+n bits; the target data packet comes from the source port node and needs to be transmitted to the target port node through the multi-stage switching network; In a case where the high k bits of the source port number of the source port node are different from the high k bits of the target port number of the target port node, determining that the source port node and the target port node belong to different secondary routing nodes; When the high k bits of the source port number of the source port node are the same as the high k bits of the target port number of the target port node, it is determined that the source port node and the target port node belong to the same secondary routing node.

13. The method according to claim 12, It is characterized in that The determining whether the high k bits of the source port number of the source port node and the high k bits of the target port number of the target port node are the same includes: Performing an XOR process on the source port number of the source port node and the target port number of the target port node to obtain an XOR result; It is determined whether the high k bits of the XOR result are all zero.

14. The method according to claim 11, It is characterized in that The first-level routing node is connected to 2 m port nodes, the secondary routing node is connected to 2 n A first-level routing node; each of the port nodes has a port number set in sequence; The determining whether the source port node and the target port node belong to different primary routing nodes includes: Determine whether the m+1th to m+nth bits of the source port number of the source port node are the same as the m+1th to m+nth bits of the target port number of the target port node; When the m+1th to m+nth digits of the source port number are the same as the m+1th to m+nth digits of the target port number, determining that the source port node and the target port node belong to the same first-level routing node; When the m+1th to m+nth bits of the source port number are different from the m+1th to m+nth bits of the target port number, it is determined that the source port node and the target port node belong to different first-level routing nodes.

15. The method according to claim 7, It is characterized in that The current routing node is a secondary routing node; The step of determining a target routing node in the ring network for sending the target data packet externally comprises: In the case where the current routing node obtains the target data packet from the first-level routing node, determining whether it is necessary to send the target data packet to the third-level routing node; In the case where the target data packet needs to be sent to a third-level routing node, the current routing node is the target routing node; When there is no need to send the target data packet to the third-level routing node, the first-level routing node connected to the target port node is used as the target routing node; wherein the target data packet comes from the source port node and needs to be transmitted to the target port node through the multi-level switching network.

16. The method according to claim 15, It is characterized in that The determining whether it is necessary to send the target data packet to the third-level routing node includes: Determining a status of the target data packet; When the target data packet is in the first state, determining that the target data packet needs to be sent to the third-level routing node; When the target data packet is in the second state, determining that it is not necessary to send the target data packet to the third-level routing node; Wherein, when the target data packet is in the second state, it is necessary to first update the state of the target data packet to the first state, and then perform the step of sending the target data packet.

17. The method according to claim 15, It is characterized in that The step of determining a target routing node in the ring network for sending the target data packet externally further comprises: In the case that the current routing node obtains the target data packet from the third-level routing node, the first-level routing node connected to the target port node is used as the target routing node.

18. A data transmission device, It is characterized in that Applied to a current routing node in a ring network; the device comprises: An acquisition module, used to acquire a target data packet to be sent; A target determination module, used to determine a target routing node in the ring network for sending the target data packet externally; the ring network includes a plurality of interconnected routing nodes, and a plurality of data links are provided between the current routing node and other routing nodes in the ring network; a non-shortest processing module, configured to determine, when the target data packet is in the first state, a next routing node of the current routing node in the non-shortest path between the current routing node and the target routing node if none of the data links corresponding to the shortest path between the current routing node and the target routing node are idle; A determination module, configured to determine whether the number of data links currently transmitting data packets in the second state among the multiple data links between the current routing node and the next routing node is less than a preset threshold; A sending module is used to update the state of the target data packet to the second state when the number of data links currently transmitting the data packet in the second state is less than a preset threshold, and send the target data packet to the next routing node based on the idle data link between the current routing node and the next routing node.

19. A computer device, It is characterized in that include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the data transmission method according to any one of claims 1 to 17 by executing the computer instructions.

20. A switching chip, It is characterized in that include: A plurality of port nodes, wherein the port nodes are interconnected via a multi-stage switching network; The multi-stage switching network includes a ring network, and at least some routing nodes in the ring network are configured to execute the data transmission method according to any one of claims 1 to 17.

21. A network device, It is characterized in that Comprising the switching chip as claimed in claim 20.

22. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the data transmission method according to any one of claims 1 to 17.

Citation Information

Patent Citations

  • Network on chip system and establishment method of network on chip communication link

    CN105450555A

  • Virtual network topology construction method device

    CN105959141A

  • Link dynamic adjustment and data processing method and device, computer equipment and medium

    CN116719639A

  • Data packet forwarding method and device, storage medium and electronic equipment

    CN117097661A