Network traffic forwarding method, related device, storage medium and computer program product

Abstract

The embodiment of the invention provides a network traffic forwarding method, related equipment, a storage medium and a computer program product, the method is applied to a first node, and the method comprises the following steps: the first node receives a first message sent by a second node; wherein the first message at least comprises identification information of a first destination node corresponding to the fault link and first weight information of a first forwarding node corresponding to the fault link; updating the first forwarding table based on the identification information and the first weight information to obtain a second forwarding table; wherein the second forwarding table at least comprises second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information; and forwarding processing of the network flow is carried out through the second forwarding table, so that a lossless network can be provided when a network fault occurs, the network bandwidth is utilized to the maximum extent, and the forwarding efficiency of the message is further improved.

Description

Technical Field

[0001] The present application relates to the field of network traffic forwarding, and in particular to a network traffic forwarding method, related equipment, storage medium and computer program product. Background Art

[0002] At present, the industry uses a packet-by-packet or container-by-container approach to load balance the network between computing devices, thereby improving bandwidth utilization, reducing network congestion, avoiding packet loss and reducing communication latency; dual-link interconnection between GSP (network edge processing node) and GSF (network core switching node), when the starting node GSP sends a message to the destination node GSP, the message can be forwarded and processed by each GSF, for example, the message can be evenly sprayed and forwarded through the links of GSF1 and GSF2, and GSF1 and GSF2 each bear 50% of the traffic. When a network link fails, if GSF1 senses a link failure, assuming that there is a single link failure between GSF1 and the destination node GSP, since GSF1 and the destination node GSP can still communicate with each other, other GSPs are not notified, and the proportion of GSF1 in the traffic sent by other GSPs to the destination node GSP is still 50%.

[0003] However, due to the failure of a single link between GSF1 and the destination node GSP, the bandwidth is reduced, so congestion may occur in the GSF1 downlink, thereby increasing communication delay and packet loss, and further reducing the forwarding efficiency of the message. Summary of the invention

[0004] The implementation legislation of this application provides a network traffic forwarding method, related equipment, storage medium and computer program product, which can maximize the use of network bandwidth and improve the forwarding efficiency of messages when a network failure occurs.

[0005] The technical solution of the embodiment of the present application is implemented as follows:

[0006] In a first aspect, an embodiment of the present application provides a network traffic forwarding method, the method being applied to a first node, the method comprising:

[0007] Receive a first message sent by the second node; wherein the first message includes at least identification information of a first destination node corresponding to the faulty link and first weight information of a first forwarding node corresponding to the faulty link;

[0008] Based on the identification information and the first weight information, the first forwarding table is updated to obtain a second forwarding table; wherein the second forwarding table at least includes second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information;

[0009] The network traffic is forwarded through the second forwarding table.

[0010] In a second aspect, an embodiment of the present application provides a network traffic forwarding method, the method being applied to a second node, the method comprising:

[0011] When a link between the sensing node and the first destination node fails, a first message is generated; wherein the first message includes at least identification information of the first destination node corresponding to the failed link and first weight information of the first forwarding node corresponding to the failed link;

[0012] The first message is sent to one or more first nodes, so that each of the first nodes performs forwarding processing of network traffic based on the first message; wherein the first nodes include any node except the first destination node.

[0013] In a third aspect, an embodiment of the present application provides a first node, the first node comprising: a receiving unit, an updating unit and a forwarding unit; wherein,

[0014] The receiving unit is configured to receive a first message sent by a second node; wherein the first message includes at least identification information of a first destination node corresponding to the faulty link and first weight information of a first forwarding node corresponding to the faulty link;

[0015] The updating unit is configured to update the first forwarding table based on the identification information and the first weight information to obtain a second forwarding table; wherein the second forwarding table at least includes second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information;

[0016] The forwarding unit is used to perform forwarding processing of network traffic through the second forwarding table.

[0017] In a fourth aspect, an embodiment of the present application provides a first node, the first node comprising: a first processor and a first memory; wherein:

[0018] The first memory is used to store a computer program that can be run on the processor;

[0019] The first processor is used to execute the network traffic forwarding method as described above when running the computer program.

[0020] In a fifth aspect, an embodiment of the present application provides a second node, the second node comprising: a generating unit and a sending unit; wherein:

[0021] The generating unit is configured to generate a first message when sensing that a link between the first destination node and the first destination node fails; wherein the first message includes at least identification information of the first destination node corresponding to the failed link and first weight information of the first forwarding node corresponding to the failed link;

[0022] The sending unit is used to send the first message to one or more first nodes, so that each of the first nodes performs forwarding processing of network traffic based on the first message; wherein the first nodes include any node except the first destination node.

[0023] In a sixth aspect, an embodiment of the present application provides a second node, the second node comprising: a second processor and a second memory; wherein:

[0024] The second memory is used to store a computer program that can be run on the processor;

[0025] The second processor is used to execute the network traffic forwarding method as described above when running the computer program.

[0026] In a seventh aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program code is stored. When the computer program code is executed by a computer, the network traffic forwarding method as described above is implemented.

[0027] In an eighth aspect, an embodiment of the present application provides a computer program product, including a computer program, which, when executed by a processor, implements the network traffic forwarding method as described above.

[0028] The embodiments of the present application provide a network traffic forwarding method, related equipment, storage medium and computer program product, wherein a first node receives a first message sent by a second node; wherein the first message includes at least identification information of a first destination node corresponding to a faulty link and first weight information of a first forwarding node corresponding to the faulty link; the first forwarding table is updated based on the identification information and the first weight information to obtain a second forwarding table; wherein the second forwarding table includes at least second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information; network traffic is forwarded through the second forwarding table; the second node generates a first message when sensing that a link between the second node and the first destination node has a fault; the first message is sent to one or more first nodes; wherein the first node includes any node except the first destination node. It can be seen that when the second node senses that the link between it and the first destination node has a fault, it can generate a first message and send the first message to one or more first nodes. The first message includes the identification information of the first destination node corresponding to the faulty link and the first weight information of the first forwarding node corresponding to the faulty link, so that the first node can update the first forwarding table based on the identification information and the first weight information of the first destination node to obtain the second forwarding table, and the second forwarding table contains new weight information of the first forwarding node, that is, the second weight information obtained based on the first weight information, and then the network traffic can be forwarded through the second forwarding table. That is, the embodiment of the present application proposes an implementation mechanism for adjusting the corresponding forwarding node load weight when a link fails, and the first weight information of the forwarding node in the first forwarding table can be updated based on the weight information corresponding to the faulty link in the first message, and the network traffic can be forwarded based on the updated second forwarding table, so that a lossless network can be provided in the event of a network failure, and the network bandwidth can be maximized, thereby improving the forwarding efficiency of the message. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] Figure 1 Schematic diagram of traffic forwarding in related technologies Figure 1 ;

[0030] Figure 2 Schematic diagram of traffic forwarding in related technologies Figure 2 ;

[0031] Figure 3 Schematic diagram of the network traffic forwarding method proposed in the embodiment of the present application Figure 1 ;

[0032] Figure 4 Schematic diagram of the network traffic forwarding method proposed in the embodiment of the present application Figure 2 ;

[0033] Figure 5A schematic diagram of network traffic forwarding proposed in an embodiment of the present application;

[0034] Figure 6 Schematic diagram of the network traffic forwarding method proposed in the embodiment of the present application Figure 3 ;

[0035] Figure 7 Schematic diagram of the network traffic forwarding method proposed in the embodiment of the present application Figure 4 ;

[0036] Figure 8 Schematic diagram of the composition structure of the first node proposed in the embodiment of the present application Figure 1 ;

[0037] Fig. 9 Schematic diagram of the composition structure of the first node proposed in the embodiment of the present application Figure 2 ;

[0038] Fig.10 The structure diagram of the second node proposed in the embodiment of the present application is shown in FIG. Figure 1 ;

[0039] Fig.11 The structure diagram of the second node proposed in the embodiment of the present application is shown in FIG. Figure 2 . DETAILED DESCRIPTION

[0040] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. It is understood that the specific embodiments described herein are only used to explain the related applications, rather than to limit the applications. It should also be noted that, for ease of description, only the parts related to the related applications are shown in the drawings.

[0041] In the scenario of large-scale artificial intelligence (AI) model training, the AI ​​large-scale model training process usually includes multiple parallel computing modes such as data parallelism, pipeline parallelism, and tensor parallelism. Different parallel modes require collective communication operations between multiple computing devices. The traffic characteristics of the intelligent computing center are that the number of flows is relatively small, mainly periodic bursts of large flows, there are synchronization effects between flows, and the training performance is sensitive to packet loss and latency. The industry load balances the network between computing devices on a packet-by-packet or container-by-container basis to provide bandwidth utilization, reduce network congestion, avoid packet loss, and reduce communication latency. Figure 1 Schematic diagram of traffic forwarding in related technologies Figure 1 ,like Figure 1As shown, GSP and GSF are dual-link interconnected, H0 (server) communicates with H4 (server), and the links from GSP to GSF1 and GSF2 are evenly sprayed and forwarded. GSF1 and GSF2 each bear 50% of the traffic. When a network link fails, such as a single link failure between GSF1 and GSP3, GSF1 senses the failure, locally isolates the faulty link, and completes load balancing convergence. Figure 2 Schematic diagram of traffic forwarding in related technologies Figure 2 ,like Figure 2 As shown in the figure, since GSF1 and GSP3 can still communicate with each other, other GSPs are not notified, and the proportion of GSF1 in the traffic sent from other GSPs to GSP3 is still 50%. However, due to the link failure between GSF1 and GSP3, the bandwidth is reduced, and congestion may occur in the GSF1 downlink, thereby increasing communication delay and packet loss, and thus reducing the forwarding efficiency of the message.

[0042] In order to solve the current problem of reduced message forwarding efficiency when a network link fails, an embodiment of the present application provides a network traffic forwarding method, related equipment, storage medium and computer program product, wherein a first node receives a first message sent by a second node; wherein the first message includes at least identification information of a first destination node corresponding to the failed link and first weight information of a first forwarding node corresponding to the failed link; the first forwarding table is updated based on the identification information and the first weight information to obtain a second forwarding table; wherein the second forwarding table includes at least second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information; network traffic is forwarded through the second forwarding table; the second node generates a first message when sensing that a link between the second node and the first destination node has failed; the first message is sent to one or more first nodes; wherein the first node includes any node except the first destination node. It can be seen that when the second node senses that the link between it and the first destination node has a fault, it can generate a first message and send the first message to one or more first nodes. The first message includes the identification information of the first destination node corresponding to the faulty link and the first weight information of the first forwarding node corresponding to the faulty link, so that the first node can update the first forwarding table based on the identification information and the first weight information of the first destination node to obtain the second forwarding table, and the second forwarding table contains new weight information of the first forwarding node, that is, the second weight information obtained based on the first weight information, and then the network traffic can be forwarded through the second forwarding table. That is, the embodiment of the present application proposes an implementation mechanism for adjusting the corresponding forwarding node load weight when a link fails, and the first weight information of the forwarding node in the first forwarding table can be updated based on the weight information corresponding to the faulty link in the first message, and the network traffic can be forwarded based on the updated second forwarding table, so that a lossless network can be provided in the event of a network failure, and the network bandwidth can be maximized, thereby improving the forwarding efficiency of the message.

[0043] The technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application.

[0044] Embodiment 1

[0045] The embodiment of the present application provides a network traffic forwarding method, which is applied to a first node. Figure 3 Schematic diagram of the network traffic forwarding method proposed in the embodiment of the present application Figure 1 ,like Figure 3 As shown, the network traffic forwarding method may include the following steps:

[0046] Step 101: Receive a first message sent by a second node; wherein the first message includes at least identification information of a first destination node corresponding to a faulty link and first weight information of a first forwarding node corresponding to the faulty link.

[0047] In an embodiment of the present application, a first node receives a first message sent by a second node; wherein the first message includes at least identification information of a first destination node corresponding to a faulty link and first weight information of a first forwarding node corresponding to the faulty link.

[0048] It should be noted that, in the embodiments of the present application, the first node may include any node except the first destination node, the first node may be a GSP device, the GSP device may include a switch device, and the present application does not specifically limit the type of the first node.

[0049] It should be noted that, in the embodiment of the present application, the second node may be any GSF device, and the GSF device may include a switch device; for example, the second node may be a GSF device that senses a fault, such as Figure 1 As shown, assuming that the GSF1 device senses that the link with GSP3 fails, the second node can be the GSF1 device, and this application does not specifically limit the type of the second node.

[0050] It should be noted that, in an embodiment of the present application, the first message may include identification information of the first destination node corresponding to the faulty link, first weight information of the first forwarding node corresponding to the faulty link, and may also include other information. The present application does not specifically limit the amount and type of information included in the first message.

[0051] Exemplarily, in an embodiment of the present application, assuming that GSF1 senses that the link with GSP3 has a fault, the identification information of the first destination node corresponding to the faulty link may be the identification information of GSP3, and the first weight information of the first forwarding node corresponding to the faulty link may be the first weight information of GSF1.

[0052] It should be noted that, in the embodiments of the present application, the first forwarding node includes at least a second node, and the present application does not specifically limit the number of nodes included in the first forwarding node.

[0053] It should be noted that, in the embodiments of the present application, Figure 4 Schematic diagram of the network traffic forwarding method proposed in the embodiment of the present application Figure 2 ,like Figure 4 As shown, before receiving the first message sent by the second node, that is, before step 101, the following steps may also be included:

[0054] Step 104, determine a first forwarding link with a third node; wherein the first forwarding link includes a second forwarding node between the first node and the third node, the first node includes a starting node, the third node includes at least a first destination node, and the second forwarding node includes the first forwarding node.

[0055] It should be noted that, in the embodiment of the present application, the first node may determine the first forwarding link between the first node and the third node.

[0056] It should be noted that, in the embodiments of the present application, the first node may include a starting node. For example, the starting node may be a GSP1 device or other GSP devices. The present application does not specifically limit the type of the first node.

[0057] It should be noted that, in the embodiment of the present application, the third node includes at least the first destination node, and may also include other destination nodes, for example, as described above. Figure 1 As shown, assuming that the starting node is a GSP1 device, the first destination node is a GSP3 device, and the third node may also include a GSP2 device and a GSP4 device. This application does not specifically limit the number of nodes included in the third node.

[0058] Exemplarily, in an embodiment of the present application, the first node may determine a first forwarding link between the first node and the third node, the first forwarding link including a second forwarding node between the first node and the third node, for example, as described above. Figure 1 As shown, assuming that the first node is a GSP1 device, and the third node includes a GSP2 device, a GSP3 device, and a GSP4 device, then the GSP1 device can respectively determine the first forwarding link between the GSP2 device, the GSP3 device, and the GSP4 device, and the first forwarding link includes the second forwarding nodes (i.e., GSF1, GSF2) between the GSP1 device and the third node.

[0059] Step 105: Generate a first forwarding table based on the first forwarding link and the first initial weight information; wherein the first initial weight information is at least used for the second forwarding node to perform traffic load balancing.

[0060] It should be noted that, in an embodiment of the present application, when the first node generates the first forwarding table based on the first forwarding link and the first initial weight information, the first initial weight information of the corresponding forwarding node can be determined based on the first bandwidth information between the first node and the second forwarding node and the second bandwidth information between the second forwarding node and the third node; and then the first forwarding table can be generated based on the first forwarding link and the first initial weight information.

[0061] Exemplarily, in an embodiment of the present application, assuming that the bandwidth of each second forwarding node connected to the first node is two 400G links, and the bandwidth of each third node connected to the second forwarding node is a 400G link, and 100G is used as the base unit, the initial weight corresponding to each GSF is 8, and then the first forwarding table can be generated based on the first forwarding link and the first initial weight information. The present application does not specifically limit the bandwidth size of the link.

[0062] Exemplarily, in an embodiment of the present application, Table 1 is the first forwarding table. As shown in Table 1 below, GSP2 and GSP3 can represent the third node. Assuming that the first node is GSP1, that is, GSP1 can reach GSP2 through the GSF1 forwarding node or the GSF2 forwarding node, and the initial weights corresponding to GSF1 or GSF2 are both 8; wherein id represents identification information, and Port represents the port number.

[0063] Table 1

[0064]

[0065] It should be noted that in an embodiment of the present application, if the first node does not receive the identification information of the first destination node corresponding to the faulty link and the first weight information of the first forwarding node corresponding to the faulty link sent by the second node, the network traffic can be forwarded based on the first forwarding table.

[0066] It should be noted that in an embodiment of the present application, if the first node receives the identification information of the first destination node corresponding to the faulty link and the first weight information of the first forwarding node corresponding to the faulty link sent by the second node, the first forwarding table can be updated based on the identification information and the first weight information to obtain the second forwarding table.

[0067] Step 102: Update the first forwarding table based on the identification information and the first weight information to obtain a second forwarding table; wherein the second forwarding table at least includes second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information.

[0068] In an embodiment of the present application, after receiving the first message sent by the second node, the first node may update the first forwarding table based on the identification information and the first weight information to obtain the second forwarding table.

[0069] It should be noted that, in the embodiment of the present application, when the first node updates the first forwarding table based on the identification information and the first weight information to obtain the second forwarding table, the first destination node corresponding to the failed link can be determined based on the identification information, and the target weight of the first forwarding node corresponding to the first destination node can be determined based on the first weight information; and then the first forwarding table can be updated based on the target weights of the first destination node and the first forwarding node to obtain the second forwarding table.

[0070] Exemplarily, in an embodiment of the present application, the first node can determine which GSP the first destination node corresponding to the faulty link is based on the identification information, and can also determine the target weight of the first forwarding node corresponding to the first destination node based on the first weight information. Assuming that the first destination node corresponding to the faulty link is GSP3 determined based on the identification information, the target weight of GSF1 (i.e., the first forwarding node) corresponding to GSP3 can be determined based on the first weight information. For example, if the weight value in the first weight information is 4, then the target weight of GSF1 corresponding to GSP3 is 4.

[0071] Further, in an embodiment of the present application, when the first node updates the first forwarding table based on the target weights of the first destination node and the first forwarding node to obtain the second forwarding table, the second initial weight information of the first forwarding node corresponding to the first destination node can be queried in the first forwarding table; wherein the first initial weight information includes the second initial weight information; then the second initial weight information can be updated based on the target weight of the first forwarding node to obtain the second weight information; and then the second forwarding table can be generated based on the first forwarding link and the second weight information.

[0072] Exemplarily, in an embodiment of the present application, the first node may query the second initial weight information of the first forwarding node corresponding to the first destination node in the first forwarding table. Assuming that the first destination node is GSP3 and the first forwarding node corresponding to the first destination node is GSF1, the second initial weight information of GSF1 corresponding to GSP3 may be queried in Table 1 above, and the weight value in the second initial weight information is 8. Then, the second initial weight information may be updated based on the target weight of the first forwarding node to obtain the second weight information. Assuming that the target weight of the first forwarding node is 4, the weight value 8 in the second initial weight information may be updated to 4 to obtain the second weight information, and then the second forwarding table may be generated based on the first forwarding link and the second weight information.

[0073] Exemplarily, in an embodiment of the present application, Table 2 is a second forwarding table, as shown in the following table. Assuming that the first destination node is GSP3, the weight value of the forwarding node GSF1 corresponding to GSP3 is updated from the initial weight value 8 to 4, thereby obtaining the second weight information, and then the first node can generate a second forwarding table based on the first forwarding link and the second weight information.

[0074] Table 2

[0075]

[0076]

[0077] That is to say, in an embodiment of the present application, if a GSF senses that a link has a fault, a first message can be constructed; wherein the first message can carry the ID of the GSP device corresponding to the faulty link (i.e., the identification information of the first destination node), and the link weight after the fault (i.e., the first weight information), and the first message is sent to any first node other than the first destination node, so that after receiving the first message, the first node can update the initial weight information of the first forwarding node corresponding to the first destination node in the first forwarding table based on the first weight information, and obtain an updated second forwarding table, so that traffic forwarding processing can be performed based on the updated second forwarding table subsequently, that is, the embodiment of the present application can dynamically adjust the load weight of the network link when a link failure occurs, thereby providing a lossless network in the event of a network failure, ensuring the maximum utilization of the network bandwidth, and achieving the best forwarding performance.

[0078] Step 103: forwarding the network traffic through the second forwarding table.

[0079] In an embodiment of the present application, after the first node updates the first forwarding table based on the identification information and the first weight information and obtains the second forwarding table, the network traffic may be forwarded through the second forwarding table.

[0080] It should be noted that in the embodiment of the application, when the first node forwards network traffic through the second forwarding table, it can forward traffic based on the first forwarding link and the second weight information when sending traffic to the first destination node.

[0081] For example, in the embodiments of the application, Figure 5 A schematic diagram of network traffic forwarding proposed in the embodiment of the present application, such as Figure 5As shown, the first node can forward the network traffic through the second forwarding table. Assuming that the first destination node is GSP3 and the first node is GSP1, when the first node forwards the network traffic to the first destination node through the second forwarding table, the weight values ​​corresponding to the forwarding nodes in the second forwarding table can be used to set the traffic proportion sent to the forwarding node GSF1 to 33.3%, and the traffic proportion sent to GSF2 to 66.7%. That is, when the first node sends a message to the first destination node, load sharing can be performed according to the weights of each GSF in the second forwarding table, so that load balancing convergence can be achieved quickly.

[0082] To summarize, if a GSF senses that a link has a fault, a first message can be constructed; wherein the first message can carry the ID of the GSP device corresponding to the faulty link (i.e., the identification information of the first destination node), and the link weight after the fault (i.e., the first weight information), and the first message is sent to any first node other than the first destination node, so that after receiving the first message, the first node can update the initial weight information of the first forwarding node corresponding to the first destination node in the first forwarding table based on the first weight information, and obtain an updated second forwarding table, so that the traffic can be forwarded based on the updated second forwarding table subsequently, that is, the embodiment of the present application can dynamically adjust the load weight of the network link when a link failure occurs, thereby providing a lossless network in the event of a network failure, ensuring the maximum utilization of the network bandwidth, and achieving the best forwarding performance.

[0083] An embodiment of the present application provides a network traffic forwarding method, which is applied to a first node, and the first node receives a first message sent by a second node; wherein the first message includes at least identification information of a first destination node corresponding to a faulty link and first weight information of a first forwarding node corresponding to the faulty link; based on the identification information and the first weight information, a first forwarding table is updated to obtain a second forwarding table; wherein the second forwarding table includes at least second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information; and network traffic is forwarded through the second forwarding table. It can be seen that after receiving the first message sent by the second node, the first node can update the first forwarding table based on the identification information of the first destination node and the first weight information to obtain the second forwarding table, and the second forwarding table contains the new weight information of the first forwarding node, that is, the second weight information obtained based on the first weight information, and then the network traffic can be forwarded through the second forwarding table. That is, the embodiment of the present application proposes an implementation mechanism for adjusting the corresponding forwarding node load weight when a link fails, and the first weight information of the forwarding node in the first forwarding table can be updated based on the weight information corresponding to the faulty link in the first message, and the network traffic can be forwarded based on the updated second forwarding table, so as to provide a lossless network in the event of a network failure and maximize the use of network bandwidth, thereby improving the forwarding efficiency of the message.

[0084] Embodiment 2

[0085] Based on the above embodiment, another embodiment of the present application provides a network traffic forwarding method, which is applied to a second node. Figure 6 Schematic diagram of the network traffic forwarding method proposed in the embodiment of the present application Figure 3 ,like Figure 6 As shown, the network traffic forwarding method may include the following steps:

[0086] Step 201: When a link between the sensing node and a first destination node fails, a first message is generated; wherein the first message includes at least identification information of the first destination node corresponding to the failed link and first weight information of the first forwarding node corresponding to the failed link.

[0087] In an embodiment of the present application, the second node may generate a first message when sensing that a link between the second node and the first destination node fails.

[0088] It should be noted that, in the embodiment of the present application, the second node may be any GSF device, and the GSF device may include a switch device; for example, the second node may be a GSF device that senses a fault, such as Figure 1As shown, assuming that the GSF1 device senses that the link with GSP3 fails, the second node can be the GSF1 device, and this application does not specifically limit the type of the second node.

[0089] It should be noted that, in an embodiment of the present application, assuming that the second node is GSF1, and GSF1 senses that the link with GSP3 has a fault, a first message can be generated, and the first message includes at least the identification information of the first destination node GSP3 corresponding to the faulty link and the first weight information of the first forwarding node GSF1 corresponding to the faulty link.

[0090] It should be noted that, in the embodiment of the present application, it is assumed that the second node is GSF1, and the first weight information includes the weight value corresponding to GSF1 after the link failure occurs. The present application does not specifically limit the size of the first weight information.

[0091] Step 202: Send the first message to one or more first nodes, so that each first node performs forwarding processing of network traffic based on the first message; wherein the first node includes any node except the first destination node.

[0092] In an embodiment of the present application, when the second node senses that the link between it and the first destination node has a fault, after generating a first message, the first message can be sent to one or more first nodes so that each first node forwards network traffic based on the first message.

[0093] To summarize, assuming that the second node is GSF1, and GSF1 senses that the link with GSP3 has a fault, it can generate a first message, which includes at least the identification information of the first destination node GSP3 corresponding to the faulty link and the first weight information of the first forwarding node GSF1 corresponding to the faulty link. Then, the second node can send the first message to one or more first nodes, so that each first node forwards network traffic based on the first message to achieve optimal forwarding performance.

[0094] The embodiment of the present application provides a network traffic forwarding method, which is applied to a second node, and when the second node senses that a link between the second node and the first destination node fails, the second node generates a first message; wherein the first message at least includes the identification information of the first destination node corresponding to the failed link and the first weight information of the first forwarding node corresponding to the failed link; the first message is sent to one or more first nodes, so that each first node performs forwarding processing of network traffic based on the first message; wherein the first node includes any node except the first destination node. It can be seen that after sensing the link failure, the second node can generate a first message carrying the identification information of the destination node corresponding to the failed link and the weight information of the forwarding node corresponding to the failed link, and then send the message to the first node, so that the first node can perform forwarding processing of network traffic based on the identification information of the destination node corresponding to the failed link and the weight information of the forwarding node corresponding to the failed link, thereby improving the forwarding efficiency of the message.

[0095] Embodiment 3

[0096] Based on the above embodiment, another embodiment of the present application provides a network traffic forwarding method, which is applied to a first node and a second node. Figure 7 Schematic diagram of the network traffic forwarding method proposed in the embodiment of the present application Figure 4 ,like Figure 7 As shown, the network traffic forwarding method may include the following steps:

[0097] Step 301: When the second node senses that a link between it and a first destination node fails, the second node generates a first message, wherein the first message includes at least identification information of the first destination node corresponding to the failed link and first weight information of the first forwarding node corresponding to the failed link.

[0098] It should be noted that, in the embodiments of the present application, the second node may be any GSF device, and the GSF device may include a switch device. The present application does not specifically limit the type of the second node.

[0099] Step 302: The second node sends the first message to one or more first nodes; wherein the first node includes any node except the first destination node.

[0100] It should be noted that, in the embodiments of the present application, the first node may include any node except the first destination node, the first node may be a GSP device, the GSP device may include a switch device, and the present application does not specifically limit the type of the first node.

[0101] Step 303: The first node updates the first forwarding table based on the identification information and the first weight information to obtain a second forwarding table; wherein the second forwarding table at least includes second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information.

[0102] It should be noted that, in the embodiments of the present application, Figure 4 As shown, before receiving the first message sent by the second node, the first node can determine the first forwarding link between the first node and the third node; wherein the first forwarding link includes the second forwarding node between the first node and the third node respectively, the first node includes the starting node, the third node includes at least the first destination node, and the second forwarding node includes the first forwarding node, and then the first forwarding table can be generated based on the first forwarding link and the first initial weight information; wherein the first initial weight information is at least used for traffic load balancing at the second forwarding node.

[0103] It should be noted that, in the embodiments of the present application, the first node includes a starting node. For example, the starting node may be a GSP1 device or other GSP devices. The present application does not specifically limit the type of the first node.

[0104] It should be noted that, in the embodiment of the present application, the third node includes at least the first destination node, and may also include other destination nodes, for example, as described above. Figure 1 As shown, assuming that the starting node is a GSP1 device, the first destination node is a GSP3 device, and the third node may also include a GSP2 device and a GSP4 device. This application does not specifically limit the number of nodes included in the third node.

[0105] Exemplarily, in an embodiment of the present application, the first node may determine a first forwarding link between the first node and the third node, the first forwarding link including a second forwarding node between the first node and the third node, for example, as described above. Figure 1 As shown, assuming that the first node is a GSP1 device, and the third node includes a GSP2 device, a GSP3 device, and a GSP4 device, then the GSP1 device can respectively determine the first forwarding link between the GSP2 device, the GSP3 device, and the GSP4 device, and the first forwarding link includes the second forwarding nodes (i.e., GSF1, GSF2) between the GSP1 device and the third node.

[0106] It should be noted that, in an embodiment of the present application, when the first node generates the first forwarding table based on the first forwarding link and the first initial weight information, the first initial weight information of the corresponding forwarding node can be determined based on the first bandwidth information between the first node and the second forwarding node and the second bandwidth information between the second forwarding node and the third node; and then the first forwarding table can be generated based on the first forwarding link and the first initial weight information.

[0107] Exemplarily, in an embodiment of the present application, assuming that the bandwidth of each second forwarding node connected to the first node is two 400G links, and the bandwidth of each third node connected to the second forwarding node is a 400G link, and 100G is used as the base unit, the initial weight corresponding to each GSF is 8, and then the first forwarding table can be generated based on the first forwarding link and the first initial weight information. The present application does not specifically limit the bandwidth size of the link.

[0108] Exemplarily, in an embodiment of the present application, as shown in Table 1 above, GSP2 and GSP3 can represent the third node. Assuming that the first node is GSP1, that is, GSP1 can reach GSP2 through the GSF1 forwarding node or the GSF2 forwarding node, and the initial weights corresponding to GSF1 or GSF2 are both 8.

[0109] It should be noted that in an embodiment of the present application, if the first node does not receive the identification information of the first destination node corresponding to the faulty link and the first weight information of the first forwarding node corresponding to the faulty link sent by the second node, the network traffic can be forwarded based on the first forwarding table.

[0110] It should be noted that in an embodiment of the present application, if the first node receives the identification information of the first destination node corresponding to the faulty link and the first weight information of the first forwarding node corresponding to the faulty link sent by the second node, the first forwarding table can be updated based on the identification information and the first weight information to obtain the second forwarding table.

[0111] It should be noted that, in the embodiment of the present application, when the first node updates the first forwarding table based on the identification information and the first weight information to obtain the second forwarding table, the first destination node corresponding to the failed link can be determined based on the identification information, and the target weight of the first forwarding node corresponding to the first destination node can be determined based on the first weight information; and then the first forwarding table can be updated based on the target weights of the first destination node and the first forwarding node to obtain the second forwarding table.

[0112] Exemplarily, in an embodiment of the present application, the first node can determine which GSP the first destination node corresponding to the faulty link is based on the identification information, and can also determine the target weight of the first forwarding node corresponding to the first destination node based on the first weight information. Assuming that the first destination node corresponding to the faulty link is GSP3 determined based on the identification information, the target weight of GSF1 (i.e., the first forwarding node) corresponding to GSP3 can be determined based on the first weight information. For example, if the weight value in the first weight information is 4, then the target weight of GSF1 corresponding to GSP3 is 4.

[0113] Further, in an embodiment of the present application, when the first node updates the first forwarding table based on the target weights of the first destination node and the first forwarding node to obtain the second forwarding table, the second initial weight information of the first forwarding node corresponding to the first destination node can be queried in the first forwarding table; wherein the first initial weight information includes the second initial weight information; then the second initial weight information can be updated based on the target weight of the first forwarding node to obtain the second weight information; and then the second forwarding table can be generated based on the first forwarding link and the second weight information.

[0114] Exemplarily, in an embodiment of the present application, the first node may query the second initial weight information of the first forwarding node corresponding to the first destination node in the first forwarding table. Assuming that the first destination node is GSP3 and the first forwarding node corresponding to the first destination node is GSF1, the second initial weight information of GSF1 corresponding to GSP3 may be queried in Table 1 above, and the weight value in the second initial weight information is 8. Then, the second initial weight information may be updated based on the target weight of the first forwarding node to obtain the second weight information. Assuming that the target weight of the first forwarding node is 4, the weight value 8 in the second initial weight information may be updated to 4 to obtain the second weight information, and then the second forwarding table may be generated based on the first forwarding link and the second weight information.

[0115] Exemplarily, in an embodiment of the present application, as shown in Table 2 above, assuming that the first destination node is GSP3, the weight value of the forwarding node GSF1 corresponding to GSP3 is updated from the initial weight value 8 to 4, thereby obtaining the second weight information, and then the first node can generate a second forwarding table based on the first forwarding link and the second weight information.

[0116] That is to say, in an embodiment of the present application, if a GSF senses that a link has a fault, a first message can be constructed; wherein the first message can carry the ID of the GSP device corresponding to the faulty link (i.e., the identification information of the first destination node), and the link weight after the fault (i.e., the first weight information), and the first message is sent to any first node other than the first destination node, so that after receiving the first message, the first node can update the initial weight information of the first forwarding node corresponding to the first destination node in the first forwarding table based on the first weight information, and obtain an updated second forwarding table, so that traffic forwarding processing can be performed based on the updated second forwarding table subsequently, that is, the embodiment of the present application can dynamically adjust the load weight of the network link when a link failure occurs, thereby providing a lossless network in the event of a network failure, ensuring the maximum utilization of the network bandwidth, and achieving the best forwarding performance.

[0117] Step 304: The first node performs forwarding processing of the network traffic through the second forwarding table.

[0118] For example, in the embodiments of the application, Figure 5 As shown, the first node can forward the network traffic through the second forwarding table. Assuming that the first destination node is GSP3 and the first node is GSP1, when the first node forwards the network traffic to the first destination node through the second forwarding table, the weight value corresponding to each forwarding node in the second forwarding table can be used to set the traffic proportion sent to the forwarding node GSF1 to 33.3%, and the traffic proportion sent to GSF2 to 66.7%. That is, when the first node sends a message to the first destination node, load sharing can be performed according to the weights of each GSF in the second forwarding table, so that load balancing convergence can be achieved quickly.

[0119] To summarize, if a GSF senses that a link has a fault, a first message can be constructed; wherein the first message can carry the ID of the GSP device corresponding to the faulty link (i.e., the identification information of the first destination node), and the link weight after the fault (i.e., the first weight information), and the first message is sent to any first node other than the first destination node, so that after receiving the first message, the first node can update the initial weight information of the first forwarding node corresponding to the first destination node in the first forwarding table based on the first weight information, and obtain an updated second forwarding table, so that the traffic can be forwarded based on the updated second forwarding table subsequently, that is, the embodiment of the present application can dynamically adjust the load weight of the network link when a link failure occurs, thereby providing a lossless network in the event of a network failure, ensuring the maximum utilization of the network bandwidth, and achieving the best forwarding performance.

[0120] An embodiment of the present application provides a network traffic forwarding method, which is applied to a first node and a second node, the first node receives a first message sent by the second node; wherein the first message includes at least identification information of a first destination node corresponding to a faulty link and first weight information of a first forwarding node corresponding to the faulty link; the first forwarding table is updated based on the identification information and the first weight information to obtain a second forwarding table; wherein the second forwarding table includes at least second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information; network traffic is forwarded through the second forwarding table; the second node generates a first message when sensing that a link between the second node and the first destination node has a fault; the first message is sent to one or more first nodes; wherein the first node includes any node except the first destination node. It can be seen that when the second node senses that the link between it and the first destination node has a fault, it can generate a first message and send the first message to one or more first nodes. The first message includes the identification information of the first destination node corresponding to the faulty link and the first weight information of the first forwarding node corresponding to the faulty link, so that the first node can update the first forwarding table based on the identification information and the first weight information of the first destination node to obtain the second forwarding table, and the second forwarding table contains new weight information of the first forwarding node, that is, the second weight information obtained based on the first weight information, and then the network traffic can be forwarded through the second forwarding table. That is, the embodiment of the present application proposes an implementation mechanism for adjusting the corresponding forwarding node load weight when a link fails, and the first weight information of the forwarding node in the first forwarding table can be updated based on the weight information corresponding to the faulty link in the first message, and the network traffic can be forwarded based on the updated second forwarding table, so that a lossless network can be provided in the event of a network failure, and the network bandwidth can be maximized, thereby improving the forwarding efficiency of the message.

[0121] Embodiment 4

[0122] Based on the above embodiments, another embodiment of the present application provides a network traffic forwarding method, which can be implemented by the following contents: the source GSP forwarding table (i.e., the first forwarding table) sets the forwarding group according to the GSF, the links to the same GSF are grouped together, and a weight (i.e., the first initial weight information) is set for each GSF (i.e., the second forwarding node). The weight (i.e., the first initial weight information) is set to a smaller value according to the bandwidth between the source GSP (i.e., the first node)-GSF (i.e., the second forwarding node) and the GSF (i.e., the second forwarding node)-destination GSP (i.e., the third node). After the GSF (i.e., the second node) senses the fault, the data plane constructs a fault notification message (i.e., the first message) and notifies other GSPs (i.e., the first node). After receiving the fault notification message, other GSPs (i.e., the first node) refresh the corresponding GSF weight in the forwarding table (i.e., the second forwarding table) with the destination as the faulty GSP in the data plane forwarding table, thereby performing fast load balancing convergence; for example, in the above fault scenario, as shown in Table 2 above, other GSPs perform load balancing convergence after receiving the fault notification, and the weight of GSF1 in the forwarding table with the destination as GSP3 is adjusted to 4, and the weight of GSF2 remains 8, so that the traffic sent to GSF1 accounts for 33.3%, and the traffic sent to GSF2 accounts for 66.7%, thereby providing a lossless network in the event of a network failure and maximizing the use of network bandwidth, thereby improving the forwarding efficiency of messages.

[0123] It should be noted that, in an embodiment of the present application, there are multiple next-hop devices GSF (i.e., the second forwarding node) from the source GSP (i.e., the first node) to the destination GSP. The source GSP forwarding table sets the forwarding group according to the GSF, and the links to the same GSF are grouped together. The weight of each GSF is set, and the weight is configured with a smaller value according to the bandwidth between the source GSP and the GSF and between the GSF and the destination GSP, as shown in Table 3 below.

[0124] Table 3

[0125]

[0126] It should be noted that in an embodiment of the present application, when the GSP (i.e., the first node) forwards traffic, it performs load balancing among multiple GSFs according to weight, and at the same time performs load balancing on the interconnected links between the GSP and a single GSF; for example, as shown in Table 1 above, all GSPs are connected to each GSF with two 400G links interconnected, with 100G as the base unit, so the weight of each GSF can be set to 8.

[0127] Furthermore, in an embodiment of the present application, a GSF (i.e., the second node) senses a GSF-destination GSP link failure, and a GSF data plane can construct a fault notification message (i.e., the first message), wherein the fault message carries the GSP device ID corresponding to the faulty link (i.e., the identification information of the first destination node), and the post-fault link weight (i.e., the first weight information of the first forwarding node corresponding to the faulty link). For example, after a link fails, the notification link weight is 4.

[0128] It should be noted that, in the embodiment of the present application, the second node may be any GSF device, and the GSF device may include a switch device; for example, the second node may be a GSF device that senses a fault, such as Figure 1 As shown, assuming that the GSF1 device senses that the link with GSP3 fails, the second node can be the GSF1 device, and this application does not specifically limit the type of the second node.

[0129] Exemplarily, in an embodiment of the present application, assuming that the second node is GSF1, and GSF1 senses that the link with GSP3 has a fault, a first message can be generated, and the first message includes at least the identification information of the first destination node GSP3 corresponding to the faulty link and the first weight information of the first forwarding node GSF1 corresponding to the faulty link.

[0130] It should be noted that in an embodiment of the present application, a GSF (i.e., the second node) can send a fault notification message (i.e., the first message) to other GSP devices (i.e., the first node) through the data plane. After receiving the fault notification message, the other GSP devices (i.e., the first node) refresh the weight of a certain GSF in the next-hop forwarding table whose destination is the GSP device ID corresponding to the faulty link.

[0131] It should be noted that in an embodiment of the present application, if the first node receives the identification information of the first destination node corresponding to the faulty link and the first weight information of the first forwarding node corresponding to the faulty link sent by the second node, the first forwarding table can be updated based on the identification information and the first weight information to obtain the second forwarding table.

[0132] It should be noted that, in the embodiment of the present application, when the first node updates the first forwarding table based on the identification information and the first weight information to obtain the second forwarding table, the first destination node corresponding to the failed link can be determined based on the identification information, and the target weight of the first forwarding node corresponding to the first destination node can be determined based on the first weight information; and then the first forwarding table can be updated based on the target weights of the first destination node and the first forwarding node to obtain the second forwarding table.

[0133] Exemplarily, in an embodiment of the present application, the first node can determine which GSP the first destination node corresponding to the faulty link is based on the identification information, and can also determine the target weight of the first forwarding node corresponding to the first destination node based on the first weight information. Assuming that the first destination node corresponding to the faulty link is GSP3 determined based on the identification information, the target weight of GSF1 (i.e., the first forwarding node) corresponding to GSP3 can be determined based on the first weight information. For example, if the weight value in the first weight information is 4, then the target weight of GSF1 corresponding to GSP3 is 4.

[0134] Further, in an embodiment of the present application, when the first node updates the first forwarding table based on the target weights of the first destination node and the first forwarding node to obtain the second forwarding table, the second initial weight information of the first forwarding node corresponding to the first destination node can be queried in the first forwarding table; wherein the first initial weight information includes the second initial weight information; then the second initial weight information can be updated based on the target weight of the first forwarding node to obtain the second weight information; and then the second forwarding table can be generated based on the first forwarding link and the second weight information.

[0135] Exemplarily, in an embodiment of the present application, the first node may query the second initial weight information of the first forwarding node corresponding to the first destination node in the first forwarding table. Assuming that the first destination node is GSP3 and the first forwarding node corresponding to the first destination node is GSF1, the second initial weight information of GSF1 corresponding to GSP3 may be queried in Table 1 above, and the weight value in the second initial weight information is 8. Then, the second initial weight information may be updated based on the target weight of the first forwarding node to obtain the second weight information. Assuming that the target weight of the first forwarding node is 4, the weight value 8 in the second initial weight information may be updated to 4 to obtain the second weight information, and then the second forwarding table may be generated based on the first forwarding link and the second weight information.

[0136] Exemplarily, in an embodiment of the present application, as shown in Table 2 above, assuming that the first destination node is GSP3, the weight value of the forwarding node GSF1 corresponding to GSP3 is updated from the initial weight value 8 to 4, thereby obtaining the second weight information, and then the first node can generate a second forwarding table based on the first forwarding link and the second weight information.

[0137] That is to say, in an embodiment of the present application, if a GSF senses that a link has a fault, a first message can be constructed; wherein the first message can carry the ID of the GSP device corresponding to the faulty link (i.e., the identification information of the first destination node), and the link weight after the fault (i.e., the first weight information), and the first message is sent to any first node other than the first destination node, so that after receiving the first message, the first node can update the initial weight information of the first forwarding node corresponding to the first destination node in the first forwarding table based on the first weight information, and obtain an updated second forwarding table, so that traffic forwarding processing can be performed based on the updated second forwarding table subsequently, that is, the embodiment of the present application can dynamically adjust the load weight of the network link when a link failure occurs, thereby providing a lossless network in the event of a network failure, ensuring the maximum utilization of the network bandwidth, and achieving the best forwarding performance.

[0138] Furthermore, in an embodiment of the present application, when other GSPs (ie, the first node) send messages to the destination GSP, load sharing can be performed according to the weight of each GSF, and then load sharing can be performed on all links of the GSF, thereby achieving rapid load balancing convergence.

[0139] For example, in the embodiments of the application, Figure 5 As shown, the first node can forward the network traffic through the second forwarding table. Assuming that the first destination node is GSP3 and the first node is GSP1, when the first node forwards the network traffic to the first destination node through the second forwarding table, the weight value corresponding to each forwarding node in the second forwarding table can be used to set the traffic proportion sent to the forwarding node GSF1 to 33.3%, and the traffic proportion sent to GSF2 to 66.7%. That is, when the first node sends a message to the first destination node, load sharing can be performed according to the weights of each GSF in the second forwarding table, so that load balancing convergence can be achieved quickly.

[0140] To summarize, if a GSF senses that a link has a fault, a first message can be constructed; wherein the first message can carry the ID of the GSP device corresponding to the faulty link (i.e., the identification information of the first destination node), and the link weight after the fault (i.e., the first weight information), and the first message is sent to any first node other than the first destination node, so that after receiving the first message, the first node can update the initial weight information of the first forwarding node corresponding to the first destination node in the first forwarding table based on the first weight information, and obtain an updated second forwarding table, so that the traffic can be forwarded based on the updated second forwarding table subsequently, that is, the embodiment of the present application can dynamically adjust the load weight of the network link when a link failure occurs, thereby providing a lossless network in the event of a network failure, ensuring the maximum utilization of the network bandwidth, and achieving the best forwarding performance.

[0141] An embodiment of the present application provides a network traffic forwarding method, which is applied to a first node and a second node, the first node receives a first message sent by the second node; wherein the first message includes at least identification information of a first destination node corresponding to a faulty link and first weight information of a first forwarding node corresponding to the faulty link; the first forwarding table is updated based on the identification information and the first weight information to obtain a second forwarding table; wherein the second forwarding table includes at least second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information; network traffic is forwarded through the second forwarding table; the second node generates a first message when sensing that a link between the second node and the first destination node has a fault; the first message is sent to one or more first nodes; wherein the first node includes any node except the first destination node. It can be seen that when the second node senses that the link between it and the first destination node has a fault, it can generate a first message and send the first message to one or more first nodes. The first message includes the identification information of the first destination node corresponding to the faulty link and the first weight information of the first forwarding node corresponding to the faulty link, so that the first node can update the first forwarding table based on the identification information and the first weight information of the first destination node to obtain the second forwarding table, and the second forwarding table contains new weight information of the first forwarding node, that is, the second weight information obtained based on the first weight information, and then the network traffic can be forwarded through the second forwarding table. That is, the embodiment of the present application proposes an implementation mechanism for adjusting the corresponding forwarding node load weight when a link fails, and the first weight information of the forwarding node in the first forwarding table can be updated based on the weight information corresponding to the faulty link in the first message, and the network traffic can be forwarded based on the updated second forwarding table, so that a lossless network can be provided in the event of a network failure, and the network bandwidth can be maximized, thereby improving the forwarding efficiency of the message.

[0142] Embodiment 5

[0143] Based on the above embodiment, the embodiment of the present application provides a first node, Figure 8 The structure diagram of the first node Figure 1 ,like Figure 8 As shown, the first node 10 includes: a receiving unit 11, an updating unit 12 and a forwarding unit 13; wherein,

[0144] The receiving unit 11 is used to receive a first message sent by a second node; wherein the first message includes at least identification information of a first destination node corresponding to the faulty link and first weight information of a first forwarding node corresponding to the faulty link;

[0145] The updating unit 12 is used to update the first forwarding table based on the identification information and the first weight information to obtain a second forwarding table; wherein the second forwarding table at least includes the second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information;

[0146] The forwarding unit 13 is used to perform forwarding processing of network traffic through the second forwarding table.

[0147] In the embodiments of the present application, further, Fig. 9 The structure diagram of the first node Figure 2 ,like Fig. 9 As shown, the first node 10 proposed in the embodiment of the present application may also include a first processor 14, a first memory 15 storing executable instructions of the first processor 14, and further, the first node 10 may also include a first communication interface 16, and a first bus 17 for connecting the first processor 14, the first memory 15 and the first communication interface 16.

[0148] In the embodiment of the present application, the first processor 14 may be at least one of an Application Specific Integrated Circuit (ASIC), a Digital Signal Processor (DSP), a Digital Signal Processing Device (DSPD), a Programmable Logic Device (PLD), a Field Programmable Gate Array (FPGA), a Central Processing Unit (CPU), a controller, a microcontroller, and a microprocessor. It can be understood that for different devices, the electronic device used to implement the above-mentioned processor function may also be other, and the embodiment of the present application is not specifically limited. The first node 10 may also include a first memory 15, which may be connected to the first processor 14, wherein the first memory 15 is used to store executable program code, the program code includes computer operation instructions, and the first memory 15 may include a high-speed RAM memory, and may also include a non-volatile memory, for example, at least two disk memories.

[0149] In the embodiment of the present application, the first bus 17 is used to connect the first communication interface 16, the first processor 14 and the first memory 15, and the mutual communication between these devices.

[0150] In the embodiment of the present application, the first memory 15 is used to store instructions and data.

[0151] Further, in an embodiment of the present application, the above-mentioned first processor 14 is used to receive a first message sent by a second node; wherein, the first message at least includes identification information of the first destination node corresponding to the faulty link and first weight information of the first forwarding node corresponding to the faulty link; based on the identification information and the first weight information, the first forwarding table is updated to obtain a second forwarding table; wherein, the second forwarding table at least includes second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information; and network traffic is forwarded through the second forwarding table.

[0152] In practical applications, the first memory 15 may be a volatile memory, such as a random access memory (RAM); or a non-volatile memory, such as a read-only memory (ROM), a flash memory, a hard disk (HDD) or a solid-state drive (SSD); or a combination of the above types of memories, and provide instructions and data to the first processor 14.

[0153] An embodiment of the present application provides a first node, which receives a first message sent by a second node; wherein the first message includes at least identification information of a first destination node corresponding to a faulty link and first weight information of a first forwarding node corresponding to the faulty link; based on the identification information and the first weight information, a first forwarding table is updated to obtain a second forwarding table; wherein the second forwarding table includes at least second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information; and network traffic is forwarded through the second forwarding table. It can be seen that after receiving the first message sent by the second node, the first node can update the first forwarding table based on the identification information of the first destination node and the first weight information to obtain the second forwarding table, and the second forwarding table contains the new weight information of the first forwarding node, that is, the second weight information obtained based on the first weight information, and then the network traffic can be forwarded through the second forwarding table. That is, the embodiment of the present application proposes an implementation mechanism for adjusting the corresponding forwarding node load weight when a link fails, and the first weight information of the forwarding node in the first forwarding table can be updated based on the weight information corresponding to the faulty link in the first message, and the network traffic can be forwarded based on the updated second forwarding table, so as to provide a lossless network in the event of a network failure and maximize the use of network bandwidth, thereby improving the forwarding efficiency of the message.

[0154] An embodiment of the present application provides a computer-readable storage medium having a program stored thereon, which implements the network traffic forwarding method as described above when executed by a processor.

[0155] Specifically, a program instruction corresponding to a network traffic forwarding method in this embodiment can be stored on a storage medium such as a CD, a hard disk, or a USB flash drive. When the program instruction corresponding to a network traffic forwarding method in the storage medium is read or executed by an electronic device, the following steps are included:

[0156] Receive a first message sent by the second node; wherein the first message includes at least identification information of a first destination node corresponding to the faulty link and first weight information of a first forwarding node corresponding to the faulty link;

[0157] Based on the identification information and the first weight information, the first forwarding table is updated to obtain a second forwarding table; wherein the second forwarding table at least includes second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information;

[0158] The network traffic is forwarded through the second forwarding table.

[0159] The embodiment of the present application further provides a computer program product, including a computer program, and the computer program can be executed by the first processor 14 of the first node 10 to complete the steps of any of the aforementioned methods.

[0160] In the embodiments of the present application, further, Fig.10 The structure diagram of the second node Figure 1 ,like Fig.10 As shown, the second node 20 includes: a generating unit 21 and a sending unit 22; wherein,

[0161] The generating unit 21 is configured to generate a first message when a link between the first destination node and the generating unit 21 is sensed to have a fault; wherein the first message includes at least identification information of the first destination node corresponding to the faulty link and first weight information of the first forwarding node corresponding to the faulty link;

[0162] The sending unit 22 is used to send the first message to one or more first nodes, so that each of the first nodes performs forwarding processing of network traffic based on the first message; wherein the first nodes include any node except the first destination node.

[0163] In the embodiments of the present application, further, Fig.11 The structure diagram of the second node Figure 2 ,like Fig.11 As shown, the second node 20 proposed in the embodiment of the present application may also include a second processor 23, a second memory 24 storing executable instructions of the second processor 23, and further, the second node 20 may also include a second communication interface 25, and a second bus 26 for connecting the second processor 23, the second memory 24 and the second communication interface 25.

[0164] In the embodiment of the present application, the second processor 23 may be at least one of an Application Specific Integrated Circuit (ASIC), a Digital Signal Processor (DSP), a Digital Signal Processing Device (DSPD), a Programmable Logic Device (PLD), a Field Programmable Gate Array (FPGA), a Central Processing Unit (CPU), a controller, a microcontroller, and a microprocessor. It can be understood that for different devices, the electronic device used to implement the above-mentioned processor function may also be other, and the embodiment of the present application is not specifically limited. The second node 20 may also include a second memory 24, which may be connected to the second processor 23, wherein the second memory 24 is used to store executable program code, the program code includes computer operation instructions, and the second memory 24 may include a high-speed RAM memory, and may also include a non-volatile memory, for example, at least two disk memories.

[0165] In the embodiment of the present application, the second bus 26 is used to connect the second communication interface 25, the second processor 23 and the second memory 24, and the mutual communication between these devices.

[0166] In the embodiment of the present application, the second memory 24 is used to store instructions and data.

[0167] Furthermore, in an embodiment of the present application, the above-mentioned second processor 23 is used to generate a first message when sensing that a link between the second processor and the first destination node has a fault; wherein the first message includes at least identification information of the first destination node corresponding to the faulty link and first weight information of the first forwarding node corresponding to the faulty link; the first message is sent to one or more first nodes so that each of the first nodes forwards network traffic based on the first message; wherein the first node includes any node other than the first destination node.

[0168] In practical applications, the second memory 24 may be a volatile memory, such as a random access memory (RAM); or a non-volatile memory, such as a read-only memory (ROM), a flash memory, a hard disk (HDD) or a solid-state drive (SSD); or a combination of the above types of memories, and provide instructions and data to the second processor 23.

[0169] The embodiment of the present application provides a second node, which generates a first message when sensing a link failure between the second node and the first destination node; wherein the first message at least includes the identification information of the first destination node corresponding to the failed link and the first weight information of the first forwarding node corresponding to the failed link; the first message is sent to one or more first nodes, so that each first node performs forwarding processing of network traffic based on the first message; wherein the first node includes any node except the first destination node. It can be seen that after sensing the link failure, the second node can generate a first message carrying the identification information of the destination node corresponding to the failed link and the weight information of the forwarding node corresponding to the failed link, and then send the message to the first node, so that the first node can perform forwarding processing of network traffic based on the identification information of the destination node corresponding to the failed link and the weight information of the forwarding node corresponding to the failed link, thereby improving the forwarding efficiency of the message.

[0170] An embodiment of the present application provides a computer-readable storage medium having a program stored thereon, which implements the network traffic forwarding method as described above when executed by a processor.

[0171] Specifically, a program instruction corresponding to a network traffic forwarding method in this embodiment can be stored on a storage medium such as a CD, a hard disk, or a USB flash drive. When the program instruction corresponding to a network traffic forwarding method in the storage medium is read or executed by an electronic device, the following steps are included:

[0172] When a link between the sensing node and the first destination node fails, a first message is generated; wherein the first message includes at least identification information of the first destination node corresponding to the failed link and first weight information of the first forwarding node corresponding to the failed link;

[0173] The first message is sent to one or more first nodes, so that each of the first nodes performs forwarding processing of network traffic based on the first message; wherein the first nodes include any node except the first destination node.

[0174] The embodiment of the present application further provides a computer program product, including a computer program, and the computer program can be executed by the second processor 23 of the second node 20 to complete the steps of any of the aforementioned methods.

[0175] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of hardware embodiments, software embodiments, or embodiments in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) that contain computer-usable program code.

[0176] The present application is described with reference to implementation flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the process in the flowchart. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0177] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device, which is implemented in the implementation flow diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0178] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operation steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for executing the steps in the flowchart. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0179] The above description is only a preferred embodiment of the present application and is not intended to limit the protection scope of the present application.

Claims

1. A network traffic forwarding method, characterized in that: The method is applied to a first node, and the method comprises: Receive a first message sent by the second node; wherein the first message includes at least identification information of a first destination node corresponding to the faulty link and first weight information of a first forwarding node corresponding to the faulty link; Based on the identification information and the first weight information, the first forwarding table is updated to obtain a second forwarding table; wherein the second forwarding table at least includes second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information; The network traffic is forwarded through the second forwarding table.

2. The method according to claim 1, characterized in that: Before receiving the first message sent by the second node, the method further includes: Determine a first forwarding link with a third node; wherein the first forwarding link includes a second forwarding node between the first node and the third node respectively, the first node includes a starting node, the third node includes at least the first destination node, and the second forwarding node includes the first forwarding node; The first forwarding table is generated based on the first forwarding link and the first initial weight information; wherein the first initial weight information is at least used for the second forwarding node to perform traffic load balancing.

3. The method according to claim 2, characterized in that The generating the first forwarding table based on the first forwarding link and the first initial weight information includes: Determine first initial weight information of the corresponding forwarding node based on first bandwidth information between the first node and the second forwarding node and second bandwidth information between the second forwarding node and the third node; The first forwarding table is generated based on the first forwarding link and the first initial weight information.

4. The method according to claim 1, characterized in that: The updating of the first forwarding table based on the identification information and the first weight information to obtain the second forwarding table includes: Determine the first destination node corresponding to the faulty link based on the identification information, and determine the target weight of the first forwarding node corresponding to the first destination node based on the first weight information; The first forwarding table is updated based on the target weights of the first destination node and the first forwarding node to obtain the second forwarding table.

5. The method according to claim 4, characterized in that The updating the first forwarding table based on the target weights of the first destination node and the first forwarding node to obtain the second forwarding table includes: Querying the first forwarding table for second initial weight information of the first forwarding node corresponding to the first destination node; wherein the first initial weight information includes the second initial weight information; Updating the second initial weight information based on the target weight of the first forwarding node to obtain the second weight information; The second forwarding table is generated based on the first forwarding link and the second weight information.

6. The method according to claim 5, characterized in that The forwarding process of the network traffic by the second forwarding table includes: When sending traffic to the first destination node, forwarding processing of the traffic is performed based on the first forwarding link and the second weight information.

7. A network traffic forwarding method, characterized in that: The method is applied to the second node, and the method includes: When a link between the sensing node and the first destination node fails, a first message is generated; wherein the first message includes at least identification information of the first destination node corresponding to the failed link and first weight information of the first forwarding node corresponding to the failed link; The first message is sent to one or more first nodes, so that each of the first nodes performs forwarding processing of network traffic based on the first message; wherein the first nodes include any node except the first destination node.

8. A first node, characterized in that: The first node includes: a receiving unit, an updating unit and a forwarding unit; wherein, The receiving unit is configured to receive a first message sent by a second node; wherein the first message includes at least identification information of a first destination node corresponding to the faulty link and first weight information of a first forwarding node corresponding to the faulty link; The updating unit is configured to update the first forwarding table based on the identification information and the first weight information to obtain a second forwarding table; wherein the second forwarding table at least includes second weight information of the first forwarding node, and the second weight information is obtained based on the first weight information; The forwarding unit is used to perform forwarding processing of network traffic through the second forwarding table.

9. A first node, characterized in that: The first node includes: a first processor and a first memory; wherein, The first memory is used to store a computer program that can be run on the processor; The first processor is configured to execute the method according to any one of claims 1 to 6 when running the computer program.

10. A second node, characterized in that: The second node includes: a generating unit and a sending unit; wherein, The generating unit is configured to generate a first message when sensing that a link between the first destination node and the first destination node fails; wherein the first message includes at least identification information of the first destination node corresponding to the failed link and first weight information of the first forwarding node corresponding to the failed link; The sending unit is used to send the first message to one or more first nodes, so that each of the first nodes performs forwarding processing of network traffic based on the first message; wherein the first nodes include any node except the first destination node.

11. A second node, characterized in that: The second node includes: a second processor and a second memory; wherein, The second memory is used to store a computer program that can be run on the processor; The second processor is configured to execute the method as claimed in claim 7 when running the computer program.

12. A computer-readable storage medium, characterized in that: The storage medium stores computer program codes, and when the computer program codes are executed by a computer, the method according to any one of claims 1 to 6 or 7 is executed.

13. A computer program product, comprising a computer program, characterized in that The computer program implements the method according to any one of claims 1 to 6 or 7 when executed by a processor.

Images