Forwarding route updating method and device

Abstract

The embodiment of the invention provides a forwarding route updating method and device, and relates to the technical field of communication, and the method comprises the steps: determining a link fault with a first leaf node; an ARN message representing a link fault between the first spine node and the first leaf node is sent to each leaf node in the multicast group in a multicast mode, and the ARN message comprises a node ID of the first leaf node, so that the leaf node receiving the ARN message sends the link fault to the first leaf node according to the node ID in the ARN message and a node ID in an FIB table item in a local FIB; and updating the next hop node in the FIB table item forwarded to the first leaf node in the local FIB from the first spine node to other spine nodes. By applying the scheme provided by the embodiment of the invention, the forwarding route can be updated in time when the link fails.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a forwarding route updating method and device. Background Art

[0002] In the Spine-Leaf architecture, adaptive routing technology plays a very important role. Adaptive routing technology can achieve keen insight into network topology and traffic conditions by continuously monitoring the link load, latency, bandwidth changes, and other conditions of the entire network. Once any state changes that may affect data transmission efficiency are detected, adaptive routing technology can quickly re-plan routing strategies and dynamically select the optimal or alternative routes to ensure that the continuity of network services is not affected.

[0003] However, in the related art, the leaf nodes in the Spine-Leaf architecture can only perceive the status of their own directly connected links. When the link status of the opposite leaf node fails, since the leaf node is connected to the spine node that forwards the message and is not connected to the opposite leaf node, the leaf node cannot obtain the fault information in time, resulting in difficulty in updating the forwarding route in time.

[0004] See also Figure 1 , which is a connection diagram of a Spine-Leaf architecture and a server in the related technology.

[0005] from Figure 1 It can be seen that the Spine-Leaf architecture includes Spine (spine node) 1, Spine 2, Leaf (leaf node) 1, Leaf 2, Leaf 3, and Leaf 4.

[0006] Among them, Leaf 1 connects Server A and Server B, Leaf 2 connects Server C and Server D, Leaf 3 connects Server E and Server F, and Leaf 4 connects Server G and Server H.

[0007] In the Spine-Leaf architecture, the messages between servers connected to different Leaf nodes need to be forwarded through the Spine. For example, taking the data exchange between ServerA and ServerH as an example, there are two paths from Leaf1 to Leaf4, namely Leaf1→Spine1→Leaf4 and Leaf1→Spine2→Leaf4.

[0008] Assume that the preferred path is Leaf1→Spine1→Leaf4. When the link from Leaf1→Spine1 fails, Leaf1 can quickly sense the link failure from Leaf1→Spine1 because Leaf1 is directly connected to Spine1, and update the route from Leaf1→Spine1→Leaf4 to Leaf1→Spine2→Leaf4.

[0009] However, if the link from Spine1 to Leaf4 fails, Leaf1 cannot directly sense the link failure from Spine1 to Leaf4 because Leaf1 is not directly connected to Leaf4. Leaf1 can only update the route from Leaf1 to Spine1 to Leaf4 to Leaf1 to Spine2 to Leaf4 after receiving the information from Spine1 indicating the link failure from Spine1 to Leaf4. This results in Leaf1 being unable to update the forwarding route in a timely manner. Summary of the invention

[0010] The purpose of the embodiment of the present invention is to provide a forwarding route update method and device, so as to update the forwarding route in time when a link fails. The specific technical solution is as follows:

[0011] In a first aspect of an embodiment of the present invention, a forwarding route update method is first provided, which is applied to a first spine node in a multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting a spine node Spine-leaf node Leaf architecture, wherein each spine node is respectively connected to all leaf nodes, and each leaf node is respectively connected to all spine nodes, and a FIB table entry in a local forwarding information table FIB of the leaf node records a node identity ID of the corresponding end leaf node of the FIB table entry, and the method comprises:

[0012] Determine a link failure with the first leaf node;

[0013] An adaptive routing notification ARN message indicating a link failure between the first spine node and the first leaf node is sent to each leaf node in the multicast group in a multicast manner, and the ARN message includes the node ID of the first leaf node, so that the leaf node receiving the ARN message updates the next hop node in the FIB table entry in the local FIB forwarding to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

[0014] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the first leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0015] In a possible embodiment, the ARN message is transmitted based on a transport layer user datagram UDP protocol.

[0016] In a possible embodiment, for each leaf node, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the leaf node is determined in the following manner:

[0017] Receive a first update Update message sent by a second leaf node other than the leaf node; wherein the first Update message carries a node ID of the second leaf node and a route between the second leaf node and the leaf node;

[0018] updating a FIB table entry in a local FIB according to the first Update message, wherein the updated FIB table entry records the node ID carried in the first Update message;

[0019] After the FIB table entry is updated, a second Update message carrying the node ID of the second leaf node is sent to the leaf node, so that the leaf node updates the FIB table entry in the local FIB based on the second Update message, and the updated FIB table entry records the node ID carried in the second Update message.

[0020] In a second aspect of an embodiment of the present invention, a forwarding route update method is provided, which is applied to a third leaf node in a multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting a spine node Spine-leaf node Leaf architecture, wherein each spine node is respectively connected to all leaf nodes, and each leaf node is respectively connected to all spine nodes, and a FIB table entry in a local forwarding information table FIB of the leaf node records a node identity ID of the corresponding end leaf node of the FIB table entry, and the method comprises:

[0021] In the case where the first spine node determines that the link with the fourth leaf node fails, receiving an adaptive routing notification ARN message sent by the first spine node in a multicast manner indicating the link failure between the first spine node and the fourth leaf node, the ARN message including the node ID of the fourth leaf node;

[0022] According to the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, the next hop node in the FIB table entry in the local FIB forwarded to the fourth leaf node is updated from the first spine node to other spine nodes.

[0023] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the fourth leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0024] In a possible embodiment, the ARN message is transmitted based on a transport layer user datagram UDP protocol.

[0025] In a possible embodiment, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the third leaf node is determined in the following manner:

[0026] When the first spine node receives a third update Update message sent by a fifth leaf node other than the third leaf node, and updates the FIB table entry in the local FIB according to the third Update message, receive a fourth Update message sent by the first spine node and carrying the node ID of the fifth leaf node;

[0027] The third Update message carries the node ID of the fifth leaf node and the route between the fifth leaf node and the third leaf node; the FIB table entry updated by the first spine node records the node ID carried in the third Update message;

[0028] A FIB table entry in the local FIB is updated based on the fourth Update message, and the updated FIB table entry records the node ID carried in the fourth Update message.

[0029] In a third aspect of an embodiment of the present invention, a spine node is provided as the first spine node in a multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting a spine node Spine-leaf node Leaf architecture, wherein each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively, and a FIB table entry in a local forwarding information table FIB of the leaf node records a node identity ID of the corresponding end leaf node of the FIB table entry, and the spine node includes a memory, a transceiver, and a processor:

[0030] A memory for storing a computer program; a transceiver for transmitting and receiving data under the control of the processor; and a processor for reading the computer program in the memory and performing the following operations:

[0031] Determine a link failure with the first leaf node;

[0032] An adaptive routing notification ARN message indicating a link failure between the first spine node and the first leaf node is sent to each leaf node in the multicast group in a multicast manner, and the ARN message includes the node ID of the first leaf node, so that the leaf node receiving the ARN message updates the next hop node in the FIB table entry in the local FIB forwarding to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

[0033] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the first leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0034] In a possible embodiment, the ARN message is transmitted based on a transport layer user datagram UDP protocol.

[0035] In a possible embodiment, for each leaf node, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the leaf node is determined in the following manner:

[0036] Receive a first update Update message sent by a second leaf node other than the leaf node; wherein the first Update message carries a node ID of the second leaf node and a route between the second leaf node and the leaf node;

[0037] updating a FIB table entry in a local FIB according to the first Update message, wherein the updated FIB table entry records the node ID carried in the first Update message;

[0038] After the FIB table entry is updated, a second Update message carrying the node ID of the second leaf node is sent to the leaf node, so that the leaf node updates the FIB table entry in the local FIB based on the second Update message, and the updated FIB table entry records the node ID carried in the second Update message.

[0039] In a fourth aspect of an embodiment of the present invention, a leaf node is provided as a third leaf node in a multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting a spine node Spine-leaf node Leaf architecture, wherein each spine node is respectively connected to all leaf nodes, and each leaf node is respectively connected to all spine nodes, and a FIB table entry in a local forwarding information table FIB of the leaf node records a node identity number ID of the corresponding end leaf node of the FIB table entry, and the leaf node includes a memory, a transceiver, and a processor:

[0040] A memory for storing a computer program; a transceiver for transmitting and receiving data under the control of the processor; and a processor for reading the computer program in the memory and performing the following operations:

[0041] In the case where the first spine node determines that the link with the fourth leaf node fails, receiving an adaptive routing notification ARN message sent by the first spine node in a multicast manner indicating the link failure between the first spine node and the fourth leaf node, the ARN message including the node ID of the fourth leaf node;

[0042] According to the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, the next hop node in the FIB table entry in the local FIB forwarded to the fourth leaf node is updated from the first spine node to other spine nodes.

[0043] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the fourth leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0044] In a possible embodiment, the ARN message is transmitted based on a transport layer user datagram UDP protocol.

[0045] In a possible embodiment, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the third leaf node is determined in the following manner:

[0046] When the first spine node receives a third update Update message sent by a fifth leaf node other than the third leaf node, and updates the FIB table entry in the local FIB according to the third Update message, receive a fourth Update message sent by the first spine node and carrying the node ID of the fifth leaf node;

[0047] The third Update message carries the node ID of the fifth leaf node and the route between the fifth leaf node and the third leaf node; the FIB table entry updated by the first spine node records the node ID carried in the third Update message;

[0048] A FIB table entry in the local FIB is updated based on the fourth Update message, and the updated FIB table entry records the node ID carried in the fourth Update message.

[0049] In a fifth aspect of an embodiment of the present invention, a forwarding route update device is provided, which is applied to a first spine node in a multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting a spine node Spine-leaf node Leaf architecture, wherein each spine node is respectively connected to all leaf nodes, and each leaf node is respectively connected to all spine nodes, and a FIB table entry in a local forwarding information table FIB of the leaf node records a node identity ID of the corresponding end leaf node of the FIB table entry, and the device includes:

[0050] A fault determination module, used to determine a link fault with the first leaf node;

[0051] The message sending module sends an adaptive routing notification ARN message indicating a link failure between the first spine node and the first leaf node to each leaf node in the multicast group in a multicast manner. The ARN message includes the node ID of the first leaf node, so that the leaf node receiving the ARN message updates the next hop node in the FIB table entry in the local FIB forwarding to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

[0052] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the first leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0053] In a possible embodiment, the ARN message is transmitted based on a transport layer user datagram UDP protocol.

[0054] In a possible embodiment, for each leaf node, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the leaf node is determined in the following manner:

[0055] Receive a first update Update message sent by a second leaf node other than the leaf node; wherein the first Update message carries a node ID of the second leaf node and a route between the second leaf node and the leaf node;

[0056] updating a FIB table entry in a local FIB according to the first Update message, wherein the updated FIB table entry records the node ID carried in the first Update message;

[0057] After the FIB table entry is updated, a second Update message carrying the node ID of the second leaf node is sent to the leaf node, so that the leaf node updates the FIB table entry in the local FIB based on the second Update message, and the updated FIB table entry records the node ID carried in the second Update message.

[0058] In a sixth aspect of an embodiment of the present invention, a forwarding route update device is provided, which is applied to a third leaf node in a multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting a spine node Spine-leaf node Leaf architecture, wherein each spine node is respectively connected to all leaf nodes, and each leaf node is respectively connected to all spine nodes, and a FIB table entry in a local forwarding information table FIB of the leaf node records a node identity ID of the corresponding end leaf node of the FIB table entry, and the device includes:

[0059] A message receiving module is used to receive an adaptive routing notification ARN message indicating a link failure between the first spine node and the fourth leaf node, which is sent by the first spine node in a multicast manner when the first spine node determines that the link with the fourth leaf node has failed, and the ARN message includes the node ID of the fourth leaf node;

[0060] The routing update module is used to update the next hop node in the FIB table entry in the local FIB forwarding to the fourth leaf node from the first spine node to other spine nodes according to the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

[0061] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the fourth leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0062] In a possible embodiment, the ARN message is transmitted based on a transport layer user datagram UDP protocol.

[0063] In a possible embodiment, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the third leaf node is determined in the following manner:

[0064] When the first spine node receives a third update Update message sent by a fifth leaf node other than the third leaf node, and updates the FIB table entry in the local FIB according to the third Update message, receive a fourth Update message sent by the first spine node and carrying the node ID of the fifth leaf node;

[0065] The third Update message carries the node ID of the fifth leaf node and the route between the fifth leaf node and the third leaf node; the FIB table entry updated by the first spine node records the node ID carried in the third Update message;

[0066] A FIB table entry in the local FIB is updated based on the fourth Update message, and the updated FIB table entry records the node ID carried in the fourth Update message.

[0067] In another aspect of the present invention, a computer-readable storage medium is provided, wherein a computer program is stored in the computer-readable storage medium. When the computer program is executed by a processor, the method steps described in any one of the first aspect or the second aspect are implemented.

[0068] Beneficial effects of the embodiments of the present invention:

[0069] The forwarding routing update method provided by the embodiment of the present invention, since the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively. When the first spine node in the multicast group determines that the link failure between it and the first leaf node occurs, the first spine node can send an ARN message indicating the link failure between the first spine node and the first leaf node to each leaf node in the multicast group in a multicast manner, and the ARN message includes the node ID of the first leaf node.

[0070] Since the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding terminal leaf node, the leaf node that receives the ARN message can update the next hop node in the FIB table entry in the local FIB that forwards to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, thereby achieving the purpose of timely updating the forwarding route when a link fails.

[0071] Of course, it is not necessary to achieve all of the advantages described above at the same time to implement any product or method of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0072] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention. For ordinary technicians in this field, other embodiments can also be obtained based on these drawings.

[0073] Figure 1A schematic diagram of the connection between a Spine-Leaf architecture and a server in the related technology;

[0074] Figure 2 A schematic diagram of a flow chart of a first forwarding route update method provided in an embodiment of the present invention;

[0075] Figure 3 A schematic diagram of the connection between a Spine-Leaf architecture and a server provided in an embodiment of the present invention;

[0076] Figure 4 A schematic diagram of the structure of an ARN message provided by an embodiment of the present invention

[0077] Figure 5 A schematic diagram of a flow chart of a first node ID determination method provided in an embodiment of the present invention;

[0078] Figure 6 A schematic diagram of a flow chart of a second forwarding route update method provided in an embodiment of the present invention;

[0079] Figure 7 A schematic diagram of a flow chart of a second node ID determination method provided in an embodiment of the present invention;

[0080] Figure 8 A schematic diagram of the structure of a spinal node provided by an embodiment of the present invention;

[0081] Fig. 9 A schematic diagram of the structure of a leaf node provided by an embodiment of the present invention;

[0082] Fig.10 A schematic diagram of the structure of a first forwarding route update device provided by an embodiment of the present invention;

[0083] Fig.11 A schematic diagram of the structure of a second forwarding route update device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0084] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field based on the present invention belong to the scope of protection of the present invention.

[0085] The embodiment of the present invention provides a forwarding route update method, which is applied to the first spine node in a multicast group, wherein the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, wherein each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively, and the FIB table entry in the local FIB (Forwarding Information Base, forwarding information table) of the leaf node records the node ID (Identity document, identity identification number) of the corresponding end leaf node of the FIB table entry, see Figure 2 , which is a flow chart of a first forwarding route update method provided in an embodiment of the present invention, wherein the method includes S201-S202.

[0086] S201, determine that the link with the first leaf node is faulty.

[0087] The first leaf node can be any leaf node.

[0088] Spine-Leaf architecture is a modern data center network architecture design that uses a layered topology to improve network scalability, flexibility, and performance. In the Spine-Leaf architecture, all data traffic is transmitted through two levels of switches, namely spine nodes and leaf nodes.

[0089] Among them, the leaf node is also called the access layer switch, which is responsible for connecting the server and storage devices directly to the network. Each leaf node is connected to each spine node in the Spine-Leaf architecture, but the leaf nodes are not directly connected to each other.

[0090] Spine nodes are also called aggregation layer or core layer devices. They form the backbone of the Spine-Leaf architecture, connecting all leaf nodes. Spine nodes are not directly connected to each other. Spine nodes act as RR (Route Reflector) to establish BGP (Border Gateway Protocol) connections with each leaf node.

[0091] The advantage of the Spine-Leaf architecture is that any two servers can communicate through only one spine node and one leaf node, which can reduce the number of hops and lower latency. In addition, the multiple paths in the Spine-Leaf architecture can provide high bandwidth and redundant connections, increasing the fault tolerance and performance of the entire data center network.

[0092] In addition, the Spine-Leaf architecture can provide good scalability. The network capacity can be easily expanded by simply increasing the number of spine nodes and leaf nodes without redesigning the network architecture.

[0093] Since each spine node in the Spine-Leaf architecture is connected to all leaf nodes respectively, the first spine node can directly sense the link status between it and the first leaf node. For example, the first spine node establishes a BGP connection with the first leaf node, and the first spine node can directly sense the link status between it and the first leaf node through some BGP function configurations (such as linkage BFD (Bidirectional Forwarding Detection) link detection).

[0094] S202, sends an ARN message indicating a link failure between the first spine node and the first leaf node to each leaf node in the multicast group in a multicast manner, wherein the ARN message includes the node ID of the first leaf node, so that the leaf node receiving the ARN message updates the next hop node in the FIB table entry in the local FIB forwarding to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

[0095] In S202, since the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, after determining that the link between the first spine node and the first leaf node is faulty, the first spine node can send an ARN (Adaptive Routing Notification) message indicating the link failure between the first spine node and the first leaf node to each leaf node in the multicast group in a multicast manner. The ARN message includes the node ID of the first leaf node.

[0096] For example, the destination multicast group address of the ARN message is 224.0.02, and the first spine node sends an ARN message to the destination multicast group address so that each leaf node in the multicast group receives the ARN message indicating a link failure between the first spine node and the first leaf node.

[0097] It should be noted that the destination multicast group address of the ARN message is only one possible implementation example, and the embodiment of the present invention does not specifically limit the destination multicast group address of the ARN message.

[0098] The leaf node that receives the ARN message can determine the FIB table entry in the local FIB whose node ID is the same as the node ID in the ARN message based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB. The determined FIB table entry is the FIB table entry used by the leaf node to forward the message to the leaf node with the link failure. The FIB table entry forwarded via the first spine node is determined and such FIB table entry is disabled. Thus, the next hop node in the FIB table entry forwarded to the first leaf node in the local FIB is updated from the first spine node to other spine nodes.

[0099] For example, Figure 1 For example, assuming that the first spine node is Spine1 and the first leaf node is Leaf4, if Spine1 determines that the link from Spine1 to Leaf4 is faulty, it sends an ARN message indicating the link failure from Spine1 to Leaf4 to Leaf1, Leaf2, and Leaf3 in the multicast group in a multicast manner. The ARN message contains the node ID of Leaf4.

[0100] After receiving the ARN message, Leaf1, Leaf2, and Leaf3 update the next hop node in the FIB entry in the local FIB that forwards to Leaf4 from Spine1 to Spine2 based on the node ID of Leaf4 in the ARN message and the node ID in the FIB entry in the local FIB. The node ID in the FIB entry in the local FIB refers to the node ID of Leaf4.

[0101] See also Figure 3 , is a schematic diagram of the connection between a Spine-Leaf architecture and a server provided in an embodiment of the present invention.

[0102] from Figure 3 It can be seen that the Spine-Leaf architecture includes Spine1, Spine2, Leaf1, Leaf 2, Leaf 3, and Leaf 4.

[0103] Among them, Leaf 1 connects to ServerA and ServerB, Leaf 2 connects to ServerC and ServerD, Leaf 3 connects to ServerE and ServerF, and Leaf 4 connects to ServerG and ServerH.

[0104] Leaf 1, Leaf 2, and Leaf 3 update the next hop node Spine1 in the FIB entry in the local FIB that forwards to Leaf 4 to Spine 2. The × indicates a link failure from Spine 1 to Leaf 4, and the dotted line indicates the updated route.

[0105] The above embodiment is selected. Since the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively. When the first spine node in the multicast group determines that the link failure between it and the first leaf node occurs, the first spine node can send an ARN message indicating the link failure between the first spine node and the first leaf node to each leaf node in the multicast group in a multicast manner. The ARN message includes the node ID of the first leaf node.

[0106] Since the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding terminal leaf node, the leaf node that receives the ARN message can update the next hop node in the FIB table entry in the local FIB that forwards to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, thereby achieving the purpose of timely updating the forwarding route when a link fails.

[0107] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier.

[0108] Among them, the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the first leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0109] See also Figure 4 , is a structural diagram of an ARN message provided in an embodiment of the present invention.

[0110] from Figure 4 It can be seen that the ARN message includes a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier.

[0111] The first identifier may be represented by a Version field. The ARN protocol may be updated, and the version of the ARN protocol used by the ARN message may be the latest version or a version before the update. The size of the Version field may be 1 byte.

[0112] The second identifier may be represented by a Type field. The categories of ARN messages include control messages, status reports, or other specific types. The size of the Type field may be 1 byte.

[0113] The third identifier may be represented by a Length field. The size of the Length field may be 2 bytes.

[0114] The fourth identifier may be represented by a Device ID (Device Identity document) field. The size of the Device ID field may be 4 bytes.

[0115] The fifth identifier may be represented by a Status field. The Status field indicates whether the link is in a normal state or a fault state. The size of the Status field may be 2 bytes.

[0116] The sixth identifier can be represented by the Serial Number field. Each time the spine node sends an ARN message, the value of the Serial Number increases by one, and the leaf node receiving the ARN message is based on the information in the ARN message with the largest Serial Number value. The size of the Serial Number field can be 2 bytes.

[0117] By selecting the above embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier. The leaf node that receives the ARN message can update the forwarding route according to the information in the ARN message.

[0118] In a possible embodiment, the ARN message is transmitted based on the transport layer UDP (User Datagram Protocol) protocol.

[0119] When ARN messages are transmitted based on the UDP protocol, it is easy to establish a connection between the two devices sending and receiving messages, and the data packet sending speed is fast. It is suitable for scenarios with high requirements for real-time performance and low latency, such as video streaming and online games. However, the UDP protocol cannot guarantee reliable data transmission, and data may be lost or out of order.

[0120] In another possible embodiment, the ARN message is transmitted based on the transport layer TCP (Transmission Control Protocol).

[0121] When ARN messages are transmitted based on the TCP protocol, multiple handshakes are required between the two devices sending and receiving the messages to establish a connection, which can provide higher reliability, but the transmission overhead is large. Compared with the transmission of ARN messages based on the UDP protocol, the transmission efficiency of ARN messages based on the TCP protocol is lower. It is suitable for scenarios where data integrity and sequence are critical, such as web browsing, file transfer, etc.

[0122] By using the above embodiment to transmit the ARN message based on the transport layer UDP protocol, the leaf node at the opposite end can quickly receive the ARN message.

[0123] In a possible embodiment, for each leaf node, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the leaf node is determined in the following manner.

[0124] See also Figure 5 , is a flow chart of a first node ID determination method provided in an embodiment of the present invention, the method includes S501-S503.

[0125] S501, receiving a first Update message sent by a second leaf node other than the leaf node.

[0126] The first Update message carries the node ID of the second leaf node and the route between the second leaf node and the leaf node.

[0127] S502: Update a FIB entry in the local FIB according to the first Update message, wherein the updated FIB entry records the node ID carried in the first Update message.

[0128] S503, after the FIB table entry is updated, a second Update message carrying the node ID of the second leaf node is sent to the leaf node, so that the leaf node updates the FIB table entry in the local FIB based on the second Update message, and the updated FIB table entry records the node ID carried in the second Update message.

[0129] The first Update message and the second Update message may be transmitted based on the BGP protocol or the IGP (Interior Gateway Protocol) protocol. When a BGP or IGP neighbor is established between the spine node and the leaf node, the first Update message and the second Update message are sent (or received).

[0130] It should be noted that any two leaf nodes need to exchange information in this way, so that the node ID is recorded in the local FIB.

[0131] The following example uses the FIB entry in the local FIB of the leaf node Leaf2, which records the node ID of the corresponding leaf node Leaf3, and the first spine node Spine1. Figure 5 The illustrated embodiment is described in detail.

[0132] Exemplarily, Spine1 receives the first Update message sent by Leaf3, wherein the first Update message carries the node ID of Leaf3 and the route of Leaf3→Spine1→Leaf2.

[0133] After receiving the first Update message sent by Leaf3, Spine1 updates the FIB entry in the local FIB. The updated FIB entry records the node ID of Leaf3.

[0134] Afterwards, Spine1 sends a second Update message carrying the node ID of Leaf3 to Leaf2. Leaf2 updates the FIB entry in the local FIB based on the node ID of Leaf3 in the second Update message. The updated FIB entry records the node ID of Leaf3.

[0135] The above embodiment is selected, for each leaf node, after the first spine node receives the first Update message sent by the second leaf node other than the leaf node, since the first Update message carries the node ID of the second leaf node and the route between the second leaf node and the leaf node, the first spine node can update the FIB table item in the local FIB according to the node ID carried in the first Update message. After the FIB table item is updated, the first spine node sends a second Update message carrying the node ID of the second leaf node to the leaf node, and the leaf node can update the FIB table item in the local FIB based on the second Update message, thereby determining the node ID of the corresponding end leaf node corresponding to the FIB table item recorded in the FIB table item in the local FIB of the leaf node.

[0136] The embodiment of the present invention also provides a forwarding route update method, which is applied to the third leaf node in the multicast group, wherein the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, wherein each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively, and the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding end leaf node of the FIB table entry, see Figure 6 , is a flow chart of a second forwarding route update method provided in an embodiment of the present invention, the method includes S601-S602.

[0137] S601, when the first spine node determines that the link with the fourth leaf node fails, receives an ARN message sent by the first spine node in a multicast manner indicating the link failure between the first spine node and the fourth leaf node, wherein the ARN message includes the node ID of the fourth leaf node.

[0138] The fourth leaf node can be any leaf node.

[0139] For example, Figure 1 For example, assuming that the first spine node is Spine1, the fourth leaf node is Leaf4, and the third leaf node is Leaf3, if Spine1 determines that the link from Spine1 to Leaf4 is faulty, Leaf3 receives an ARN message sent by Spine1 in multicast mode indicating the link failure from Spine1 to Leaf4. The ARN message contains the node ID of Leaf4.

[0140] S602, based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, the next hop node in the FIB table entry forwarded to the fourth leaf node in the local FIB is updated from the first spine node to other spine nodes.

[0141] In S602, the third leaf node can determine the FIB table entry in the local FIB whose node ID is the same as the node ID in the ARN message. The determined FIB table entry is the FIB table entry used by the third leaf node when forwarding the message to the leaf node with the link failure. The FIB table entry forwarded via the first spine node is determined and such FIB table entry is disabled. Thus, the next hop node in the FIB table entry forwarded to the fourth leaf node in the local FIB is updated from the first spine node to other spine nodes.

[0142] For example, after Leaf3 receives the ARN message sent by Spine1 in multicast mode indicating the link failure of Spine1→Leaf4, it updates the next hop node in the FIB table entry in the local FIB forwarding to Leaf4 from Spine1 to Spine2 based on the node ID of Leaf4 in the ARN message and the node ID in the FIB table entry in the local FIB.

[0143] The above embodiment is selected. Since the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively. When the first spine node determines that the link failure between it and the fourth leaf node occurs, the third leaf node in the multicast group receives an ARN message sent by the first spine node in a multicast manner, indicating the link failure between the first spine node and the fourth leaf node, and the ARN message includes the node ID of the fourth leaf node.

[0144] Since the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding terminal leaf node, the third leaf node can update the next hop node in the FIB table entry in the local FIB to the fourth leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, thereby achieving the purpose of timely updating the forwarding route when a link fails.

[0145] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier.

[0146] Among them, the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the first leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0147] For more information about the identifiers in the ARN message, see Figure 4 The embodiments of the present invention will not be described in detail here.

[0148] By selecting the above embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier. The leaf node that receives the ARN message can update the forwarding route according to the information in the ARN message.

[0149] In a possible embodiment, the ARN message is transmitted based on the transport layer UDP (User Datagram Protocol) protocol.

[0150] By using the above embodiment to transmit the ARN message based on the transport layer UDP protocol, the leaf node at the opposite end can quickly receive the ARN message.

[0151] In a possible embodiment, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the third leaf node is determined in the following manner.

[0152] See also Figure 7 , is a flow chart of a second node ID determination method provided in an embodiment of the present invention, the method includes S701-S702.

[0153] S701, when the first spine node receives the third update Update message sent by the fifth leaf node excluding the third leaf node, and updates the FIB table entry in the local FIB according to the third Update message, receives the fourth Update message sent by the first spine node carrying the node ID of the fifth leaf node.

[0154] Among them, the third Update message carries the node ID of the fifth leaf node and the route between the fifth leaf node and the third leaf node; the FIB table entry updated by the first spine node records the node ID carried in the third Update message.

[0155] S702: Update a FIB entry in the local FIB based on the fourth Update message, and the updated FIB entry records the node ID carried in the fourth Update message.

[0156] The third Update message and the fourth Update message may be transmitted based on the BGP protocol or the IGP protocol. When a BGP or IGP neighbor is established between the spine node and the leaf node, the third Update message and the fourth Update message are sent (or received).

[0157] It should be noted that any two leaf nodes need to exchange information in this way, so that the node ID is recorded in the local FIB.

[0158] Exemplarily, assume that the third leaf node is Leaf2, the fifth leaf node is Leaf3, and the first spine node is Spine1.

[0159] Spine1 receives the third Update message sent by Leaf3, where the third Update message carries the node ID of Leaf3 and the route of Leaf3→Spine1→Leaf2.

[0160] When Spine1 updates the FIB table entry in the local FIB according to the third Update message, Leaf2 receives the fourth Update message sent by Spine1 and carrying the node ID of Leaf3, and the node ID of Leaf3 is recorded in the FIB table entry updated by Spine1.

[0161] Afterwards, Leaf2 updates the FIB entry in the local FIB based on the node ID of Leaf3 in the fourth Update message, and the updated FIB entry records the node ID of Leaf3.

[0162] By selecting the above embodiment, when the third leaf node receives the third Update message sent by the fifth leaf node other than the third leaf node at the first spine node, and updates the FIB table item in the local FIB according to the node ID of the fifth leaf node carried in the third Update message and the route between the fifth leaf node and the third leaf node, the third leaf node receives the fourth Update message sent by the first spine node and carrying the node ID of the fifth leaf node. Since the fourth Update message carries the node ID of the fifth leaf node, the third leaf node can update the FIB table item in the local FIB based on the node ID of the fifth leaf node in the fourth Update message, thereby determining the node ID of the corresponding end leaf node corresponding to the FIB table item recorded in the FIB table item in the local FIB of the third leaf node.

[0163] Corresponding to the aforementioned forwarding route update method, an embodiment of the present invention further provides a spine node, which serves as the first spine node in a multicast group. The multicast group includes spine nodes and leaf nodes that constitute a Spine-Leaf architecture, wherein each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively. The FIB table entry in the local FIB of the leaf node records the node ID of the corresponding end leaf node of the FIB table entry, see Figure 8 , is a schematic diagram of the structure of a spine node provided by an embodiment of the present invention, the spine node includes a memory 801, a transceiver 802, and a processor 803:

[0164] The memory 801 is used to store computer programs; the transceiver 802 is used to send and receive data under the control of the processor 803; the processor 803 is used to read the computer program in the memory 801 and perform the following operations:

[0165] Determine that the link with the first leaf node is faulty;

[0166] An adaptive routing notification ARN message indicating a link failure between a first spine node and the first leaf node is sent to each leaf node in the multicast group in a multicast manner. The ARN message includes the node ID of the first leaf node, so that the leaf node receiving the ARN message updates the next hop node in the FIB table entry in the local FIB forwarding to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

[0167] The above embodiment is selected. Since the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively. When the first spine node in the multicast group determines that the link failure between it and the first leaf node occurs, the first spine node can send an ARN message indicating the link failure between the first spine node and the first leaf node to each leaf node in the multicast group in a multicast manner. The ARN message includes the node ID of the first leaf node.

[0168] Since the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding terminal leaf node, the leaf node that receives the ARN message can update the next hop node in the FIB table entry in the local FIB that forwards to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, thereby achieving the purpose of timely updating the forwarding route when a link fails.

[0169] Among them, Figure 8 In the embodiment, the bus architecture may include any number of interconnected buses and bridges, specifically one or more processors represented by processor 803 and various circuits of memory represented by memory 801 are linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and are therefore not further described herein. The bus interface provides an interface. The transceiver 802 may be a plurality of components, namely, a transmitter and a receiver, providing a unit for communicating with various other devices on a transmission medium, which transmission medium may include a wireless channel, a wired channel, an optical cable, and other transmission media. The processor 803 is responsible for managing the bus architecture and general processing, and the memory 801 may store data used by the processor 803 when performing operations.

[0170] The processor 803 may be a central processing unit (CPU), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or a complex programmable logic device (CPLD). The processor may also adopt a multi-core architecture.

[0171] It should be noted here that the above-mentioned spine node provided in the embodiment of the present invention can implement all the method steps implemented in the above-mentioned method embodiment, and can achieve the same technical effect. The parts of this embodiment that are the same as the method embodiment will not be described in detail here.

[0172] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the first leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0173] By selecting the above embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier. The leaf node that receives the ARN message can update the forwarding route according to the information in the ARN message.

[0174] In a possible embodiment, the ARN message is transmitted based on the transport layer user datagram UDP protocol.

[0175] By using the above embodiment to transmit the ARN message based on the transport layer UDP protocol, the leaf node at the opposite end can quickly receive the ARN message.

[0176] In a possible embodiment, for each leaf node, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the leaf node is determined in the following manner:

[0177] Receive a first update Update message sent by a second leaf node other than the leaf node; wherein the first Update message carries a node ID of the second leaf node and a route between the second leaf node and the leaf node;

[0178] Update a FIB entry in the local FIB according to the first Update message, where the updated FIB entry records the node ID carried in the first Update message;

[0179] After the FIB table entry is updated, a second Update message carrying the node ID of the second leaf node is sent to the leaf node, so that the leaf node updates the FIB table entry in the local FIB based on the second Update message, and the updated FIB table entry records the node ID carried in the second Update message.

[0180] The above embodiment is selected, for each leaf node, after the first spine node receives the first Update message sent by the second leaf node other than the leaf node, since the first Update message carries the node ID of the second leaf node and the route between the second leaf node and the leaf node, the first spine node can update the FIB table item in the local FIB according to the node ID carried in the first Update message. After the FIB table item is updated, the first spine node sends a second Update message carrying the node ID of the second leaf node to the leaf node, and the leaf node can update the FIB table item in the local FIB based on the second Update message, thereby determining the node ID of the corresponding end leaf node corresponding to the FIB table item recorded in the FIB table item in the local FIB of the leaf node.

[0181] Corresponding to the aforementioned forwarding route update method, an embodiment of the present invention further provides a leaf node as the third leaf node in a multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting a Spine-Leaf architecture, wherein each spine node is respectively connected to all leaf nodes, and each leaf node is respectively connected to all spine nodes, and the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding end leaf node of the FIB table entry, see Fig. 9 , is a schematic diagram of a structure of a leaf node provided by an embodiment of the present invention, the leaf node includes a memory 901, a transceiver 902, and a processor 903:

[0182] The memory 901 is used to store computer programs; the transceiver 902 is used to send and receive data under the control of the processor 903; the processor 903 is used to read the computer program in the memory 901 and perform the following operations:

[0183] In the case where the first spine node determines that the link with the fourth leaf node fails, receiving an adaptive routing notification ARN message sent by the first spine node in a multicast manner indicating a link failure between the first spine node and the fourth leaf node, wherein the ARN message includes a node ID of the fourth leaf node;

[0184] According to the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, the next hop node in the FIB table entry in the local FIB forwarded to the fourth leaf node is updated from the first spine node to other spine nodes.

[0185] The above embodiment is selected. Since the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively. When the first spine node determines that the link failure between it and the fourth leaf node occurs, the third leaf node in the multicast group receives an ARN message sent by the first spine node in a multicast manner, indicating the link failure between the first spine node and the fourth leaf node, and the ARN message includes the node ID of the fourth leaf node.

[0186] Since the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding terminal leaf node, the third leaf node can update the next hop node in the FIB table entry in the local FIB to the fourth leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, thereby achieving the purpose of timely updating the forwarding route when a link fails.

[0187] Among them, Fig. 9 In the embodiment, the bus architecture may include any number of interconnected buses and bridges, specifically one or more processors represented by processor 903 and various circuits of memory represented by memory 901 are linked together. The bus architecture may also link together various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and are therefore not further described herein. The bus interface provides an interface. The transceiver 902 may be a plurality of components, namely, a transmitter and a receiver, providing a unit for communicating with various other devices on a transmission medium, which transmission medium may include a wireless channel, a wired channel, an optical cable, and other transmission media. The processor 903 is responsible for managing the bus architecture and general processing, and the memory 901 may store data used by the processor 903 when performing operations.

[0188] The processor 903 may be a central processing unit (CPU), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or a complex programmable logic device (CPLD). The processor may also adopt a multi-core architecture.

[0189] It should be noted here that the above-mentioned leaf node provided by the embodiment of the present invention can implement all the method steps implemented by the above-mentioned method embodiment, and can achieve the same technical effect. The parts of this embodiment that are the same as the method embodiment will not be described in detail here.

[0190] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the fourth leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0191] By selecting the above embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier. The leaf node that receives the ARN message can update the forwarding route according to the information in the ARN message.

[0192] In a possible embodiment, the ARN message is transmitted based on the transport layer user datagram UDP protocol.

[0193] By using the above embodiment to transmit the ARN message based on the transport layer UDP protocol, the leaf node at the opposite end can quickly receive the ARN message.

[0194] In a possible embodiment, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the third leaf node is determined in the following manner:

[0195] When the first spine node receives the third update Update message sent by the fifth leaf node except the third leaf node, and updates the FIB table item in the local FIB according to the third Update message, receive the fourth Update message sent by the first spine node and carrying the node ID of the fifth leaf node;

[0196] The third Update message carries the node ID of the fifth leaf node and the route between the fifth leaf node and the third leaf node; the FIB table entry updated by the first spine node records the node ID carried in the third Update message;

[0197] The FIB table entry in the local FIB is updated based on the fourth Update message, and the updated FIB table entry records the node ID carried in the fourth Update message.

[0198] By selecting the above embodiment, when the third leaf node receives the third Update message sent by the fifth leaf node other than the third leaf node at the first spine node, and updates the FIB table item in the local FIB according to the node ID of the fifth leaf node carried in the third Update message and the route between the fifth leaf node and the third leaf node, the third leaf node receives the fourth Update message sent by the first spine node and carrying the node ID of the fifth leaf node. Since the fourth Update message carries the node ID of the fifth leaf node, the third leaf node can update the FIB table item in the local FIB based on the node ID of the fifth leaf node in the fourth Update message, thereby determining the node ID of the corresponding end leaf node corresponding to the FIB table item recorded in the FIB table item in the local FIB of the third leaf node.

[0199] Corresponding to the aforementioned forwarding route update method, an embodiment of the present invention further provides a forwarding route update device, which is applied to the first spine node in the multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting the Spine-Leaf architecture, wherein each spine node is respectively connected to all leaf nodes, and each leaf node is respectively connected to all spine nodes, and the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding end leaf node of the FIB table entry, see Fig.10 , is a schematic diagram of the structure of a first forwarding route update device provided in an embodiment of the present application, the device comprising:

[0200] A fault determination module 1001 is used to determine a link fault with the first leaf node;

[0201] The message sending module 1002 sends an adaptive routing notification ARN message indicating a link failure between the first spine node and the first leaf node to each leaf node in the multicast group in a multicast manner. The ARN message includes the node ID of the first leaf node, so that the leaf node receiving the ARN message updates the next hop node in the FIB table entry in the local FIB forwarding to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

[0202] The above embodiment is selected. Since the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively. When the first spine node in the multicast group determines that the link failure between it and the first leaf node occurs, the first spine node can send an ARN message indicating the link failure between the first spine node and the first leaf node to each leaf node in the multicast group in a multicast manner. The ARN message includes the node ID of the first leaf node.

[0203] Since the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding terminal leaf node, the leaf node that receives the ARN message can update the next hop node in the FIB table entry in the local FIB that forwards to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, thereby achieving the purpose of timely updating the forwarding route when a link fails.

[0204] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the first leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0205] By selecting the above embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier. The leaf node that receives the ARN message can update the forwarding route according to the information in the ARN message.

[0206] In a possible embodiment, the ARN message is transmitted based on the transport layer user datagram UDP protocol.

[0207] By using the above embodiment to transmit the ARN message based on the transport layer UDP protocol, the leaf node at the opposite end can quickly receive the ARN message.

[0208] In a possible embodiment, for each leaf node, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the leaf node is determined in the following manner:

[0209] Receive a first update Update message sent by a second leaf node other than the leaf node; wherein the first Update message carries a node ID of the second leaf node and a route between the second leaf node and the leaf node;

[0210] Update a FIB entry in the local FIB according to the first Update message, where the updated FIB entry records the node ID carried in the first Update message;

[0211] After the FIB table entry is updated, a second Update message carrying the node ID of the second leaf node is sent to the leaf node, so that the leaf node updates the FIB table entry in the local FIB based on the second Update message, and the updated FIB table entry records the node ID carried in the second Update message.

[0212] The above embodiment is selected, for each leaf node, after the first spine node receives the first Update message sent by the second leaf node other than the leaf node, since the first Update message carries the node ID of the second leaf node and the route between the second leaf node and the leaf node, the first spine node can update the FIB table item in the local FIB according to the node ID carried in the first Update message. After the FIB table item is updated, the first spine node sends a second Update message carrying the node ID of the second leaf node to the leaf node, and the leaf node can update the FIB table item in the local FIB based on the second Update message, thereby determining the node ID of the corresponding end leaf node corresponding to the FIB table item recorded in the FIB table item in the local FIB of the leaf node.

[0213] Corresponding to the aforementioned forwarding route update method, an embodiment of the present invention further provides a forwarding route update device, which is applied to the third leaf node in the multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting the Spine-Leaf architecture, wherein each spine node is respectively connected to all leaf nodes, and each leaf node is respectively connected to all spine nodes, and the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding end leaf node of the FIB table entry, see Fig.11 , is a schematic diagram of the structure of a first forwarding route update device provided in an embodiment of the present application, the device comprising:

[0214] A message receiving module 1101 is used to receive an adaptive routing notification ARN message indicating a link failure between the first spine node and the fourth leaf node, which is sent by the first spine node in a multicast manner when the first spine node determines that the link with the fourth leaf node has failed, and the ARN message includes a node ID of the fourth leaf node;

[0215] The routing update module 1102 is used to update the next hop node in the FIB table entry forwarded to the fourth leaf node in the local FIB from the first spine node to other spine nodes according to the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

[0216] The above embodiment is selected. Since the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively. When the first spine node determines that the link failure between it and the fourth leaf node occurs, the third leaf node in the multicast group receives an ARN message sent by the first spine node in a multicast manner, indicating the link failure between the first spine node and the fourth leaf node, and the ARN message includes the node ID of the fourth leaf node.

[0217] Since the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding terminal leaf node, the third leaf node can update the next hop node in the FIB table entry in the local FIB to the fourth leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, thereby achieving the purpose of timely updating the forwarding route when a link fails.

[0218] In a possible embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the fourth leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

[0219] By selecting the above embodiment, the ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier. The leaf node that receives the ARN message can update the forwarding route according to the information in the ARN message.

[0220] In a possible embodiment, the ARN message is transmitted based on the transport layer user datagram UDP protocol.

[0221] By using the above embodiment to transmit the ARN message based on the transport layer UDP protocol, the leaf node at the opposite end can quickly receive the ARN message.

[0222] In a possible embodiment, the node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the third leaf node is determined in the following manner:

[0223] When the first spine node receives the third update Update message sent by the fifth leaf node except the third leaf node, and updates the FIB table item in the local FIB according to the third Update message, receive the fourth Update message sent by the first spine node and carrying the node ID of the fifth leaf node;

[0224] The third Update message carries the node ID of the fifth leaf node and the route between the fifth leaf node and the third leaf node; the FIB table entry updated by the first spine node records the node ID carried in the third Update message;

[0225] The FIB table entry in the local FIB is updated based on the fourth Update message, and the updated FIB table entry records the node ID carried in the fourth Update message.

[0226] By selecting the above embodiment, when the third leaf node receives the third Update message sent by the fifth leaf node other than the third leaf node at the first spine node, and updates the FIB table item in the local FIB according to the node ID of the fifth leaf node carried in the third Update message and the route between the fifth leaf node and the third leaf node, the third leaf node receives the fourth Update message sent by the first spine node and carrying the node ID of the fifth leaf node. Since the fourth Update message carries the node ID of the fifth leaf node, the third leaf node can update the FIB table item in the local FIB based on the node ID of the fifth leaf node in the fourth Update message, thereby determining the node ID of the corresponding end leaf node corresponding to the FIB table item recorded in the FIB table item in the local FIB of the third leaf node.

[0227] In another embodiment of the present invention, a computer-readable storage medium is provided, in which a computer program is stored. When the computer program is executed by a processor, the steps of any of the above forwarding route update methods are implemented.

[0228] The above embodiment is selected. Since the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively. When the first spine node in the multicast group determines that the link failure between it and the first leaf node occurs, the first spine node can send an ARN message indicating the link failure between the first spine node and the first leaf node to each leaf node in the multicast group in a multicast manner. The ARN message includes the node ID of the first leaf node.

[0229] Since the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding terminal leaf node, the leaf node that receives the ARN message can update the next hop node in the FIB table entry in the local FIB that forwards to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, thereby achieving the purpose of timely updating the forwarding route when a link fails.

[0230] In another embodiment of the present invention, a computer program product including instructions is provided. When the computer program product is run on a computer, the computer executes any forwarding route update method in the above embodiments.

[0231] The above embodiment is selected. Since the multicast group includes spine nodes and leaf nodes that constitute the Spine-Leaf architecture, each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively. When the first spine node in the multicast group determines that the link failure between it and the first leaf node occurs, the first spine node can send an ARN message indicating the link failure between the first spine node and the first leaf node to each leaf node in the multicast group in a multicast manner. The ARN message includes the node ID of the first leaf node.

[0232] Since the FIB table entry in the local FIB of the leaf node records the node ID of the corresponding terminal leaf node, the leaf node that receives the ARN message can update the next hop node in the FIB table entry in the local FIB that forwards to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, thereby achieving the purpose of timely updating the forwarding route when a link fails.

[0233] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented by software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present invention is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from a website site, computer, server or data center to another website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrated. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state hard disk Solid State Disk (SSD)), etc.

[0234] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

[0235] Each embodiment in this specification is described in a related manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the spine node, leaf node, device, and storage medium embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiments.

[0236] The above description is only a preferred embodiment of the present invention and is not intended to limit the protection scope of the present invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention are included in the protection scope of the present invention.

Claims

1. A forwarding route update method, characterized in that: The method is applied to the first spine node in a multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting a spine node Spine-leaf node Leaf architecture, wherein each spine node is respectively connected to all leaf nodes, and each leaf node is respectively connected to all spine nodes, and a FIB table entry in a local forwarding information table FIB of the leaf node records a node identity number ID of the corresponding end leaf node of the FIB table entry, and the method includes: Determine a link failure with the first leaf node; An adaptive routing notification ARN message indicating a link failure between the first spine node and the first leaf node is sent to each leaf node in the multicast group in a multicast manner, and the ARN message includes the node ID of the first leaf node, so that the leaf node receiving the ARN message updates the next hop node in the FIB table entry in the local FIB forwarding to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

2. The method according to claim 1, characterized in that The ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the first leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

3. The method according to claim 1 or 2, characterized in that: The ARN message is transmitted based on the transport layer user datagram UDP protocol.

4. The method according to claim 1, characterized in that: For each leaf node, the node ID of the corresponding leaf node recorded in the FIB table entry in the local FIB of the leaf node is determined in the following manner: Receive a first update Update message sent by a second leaf node other than the leaf node; wherein the first Update message carries a node ID of the second leaf node and a route between the second leaf node and the leaf node; updating a FIB table entry in a local FIB according to the first Update message, wherein the updated FIB table entry records the node ID carried in the first Update message; After the FIB table entry is updated, a second Update message carrying the node ID of the second leaf node is sent to the leaf node, so that the leaf node updates the FIB table entry in the local FIB based on the second Update message, and the updated FIB table entry records the node ID carried in the second Update message.

5. A forwarding route update method, characterized in that: The method is applied to the third leaf node in the multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting the spine node Spine-leaf node Leaf architecture, wherein each spine node is respectively connected to all leaf nodes, and each leaf node is respectively connected to all spine nodes, and the FIB table entry in the local forwarding information table FIB of the leaf node records the node identity number ID of the corresponding end leaf node of the FIB table entry, and the method includes: In the case where the first spine node determines that the link with the fourth leaf node fails, receiving an adaptive routing notification ARN message sent by the first spine node in a multicast manner indicating the link failure between the first spine node and the fourth leaf node, the ARN message including the node ID of the fourth leaf node; According to the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, the next hop node in the FIB table entry in the local FIB forwarded to the fourth leaf node is updated from the first spine node to other spine nodes.

6. The method according to claim 5, characterized in that The ARN message includes at least one of the following information: a first identifier, a second identifier, a third identifier, a fourth identifier, a fifth identifier, and a sixth identifier; wherein the first identifier indicates the version number of the ARN protocol used by the ARN message, the second identifier indicates the category of the ARN message, the third identifier indicates the length of the ARN message, the fourth identifier indicates the ID of the fourth leaf node, the fifth identifier indicates whether the link is faulty or normal, and the sixth identifier indicates the sending sequence number of the ARN message.

7. The method according to claim 5 or 6, characterized in that: The ARN message is transmitted based on the transport layer user datagram UDP protocol.

8. The method according to claim 5, characterized in that The node ID of the corresponding end leaf node recorded in the FIB table entry in the local FIB of the third leaf node is determined in the following manner: When the first spine node receives a third update Update message sent by a fifth leaf node other than the third leaf node, and updates the FIB table entry in the local FIB according to the third Update message, receive a fourth Update message sent by the first spine node and carrying the node ID of the fifth leaf node; The third Update message carries the node ID of the fifth leaf node and the route between the fifth leaf node and the third leaf node; the FIB table entry updated by the first spine node records the node ID carried in the third Update message; A FIB table entry in the local FIB is updated based on the fourth Update message, and the updated FIB table entry records the node ID carried in the fourth Update message.

9. A spinal node, characterized in that: As the first spine node in the multicast group, the multicast group includes spine nodes and leaf nodes that constitute the spine node Spine-leaf node Leaf architecture, wherein each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively, and the FIB table entry in the local forwarding information table FIB of the leaf node records the node identity number ID of the corresponding end leaf node of the FIB table entry, and the spine node includes a memory, a transceiver, and a processor: A memory for storing a computer program; a transceiver for transmitting and receiving data under the control of the processor; and a processor for reading the computer program in the memory and performing the following operations: Determine a link failure with the first leaf node; An adaptive routing notification ARN message indicating a link failure between the first spine node and the first leaf node is sent to each leaf node in the multicast group in a multicast manner, and the ARN message includes the node ID of the first leaf node, so that the leaf node receiving the ARN message updates the next hop node in the FIB table entry in the local FIB forwarding to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

10. A leaf node, characterized in that: As the third leaf node in the multicast group, the multicast group includes spine nodes and leaf nodes that constitute the spine node Spine-leaf node Leaf architecture, wherein each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively, and the FIB table entry in the local forwarding information table FIB of the leaf node records the node identity number ID of the corresponding end leaf node of the FIB table entry, and the leaf node includes a memory, a transceiver, and a processor: A memory for storing a computer program; a transceiver for transmitting and receiving data under the control of the processor; and a processor for reading the computer program in the memory and performing the following operations: In the case where the first spine node determines that the link with the fourth leaf node fails, receiving an adaptive routing notification ARN message sent by the first spine node in a multicast manner indicating the link failure between the first spine node and the fourth leaf node, the ARN message including the node ID of the fourth leaf node; According to the node ID in the ARN message and the node ID in the FIB table entry in the local FIB, the next hop node in the FIB table entry in the local FIB forwarded to the fourth leaf node is updated from the first spine node to other spine nodes.

11. A forwarding route update device, characterized in that: The device is applied to the first spine node in a multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting a spine node Spine-leaf node Leaf architecture, wherein each spine node is connected to all leaf nodes respectively, and each leaf node is connected to all spine nodes respectively, and a FIB table entry in a local forwarding information table FIB of the leaf node records a node identity number ID of the corresponding end leaf node of the FIB table entry, and the device includes: A fault determination module, used to determine a link fault with the first leaf node; The message sending module sends an adaptive routing notification ARN message indicating a link failure between the first spine node and the first leaf node to each leaf node in the multicast group in a multicast manner. The ARN message includes the node ID of the first leaf node, so that the leaf node receiving the ARN message updates the next hop node in the FIB table entry in the local FIB forwarding to the first leaf node from the first spine node to other spine nodes based on the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

12. A forwarding route update device, characterized in that: The device is applied to the third leaf node in the multicast group, wherein the multicast group includes spine nodes and leaf nodes constituting the spine node Spine-leaf node Leaf architecture, wherein each spine node is respectively connected to all leaf nodes, and each leaf node is respectively connected to all spine nodes, and the FIB table entry in the local forwarding information table FIB of the leaf node records the node identity number ID of the corresponding end leaf node of the FIB table entry, and the device includes: A message receiving module is used to receive an adaptive routing notification ARN message indicating a link failure between the first spine node and the fourth leaf node, which is sent by the first spine node in a multicast manner when the first spine node determines that the link with the fourth leaf node has failed, and the ARN message includes the node ID of the fourth leaf node; The routing update module is used to update the next hop node in the FIB table entry in the local FIB forwarding to the fourth leaf node from the first spine node to other spine nodes according to the node ID in the ARN message and the node ID in the FIB table entry in the local FIB.

13. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method steps described in any one of claims 1-4 or 5-8 are implemented.

Images