Method and apparatus for updating link state and determining sub-area

Abstract

The application provides a method and device for updating link state and determining sub-area, and belongs to the technical field of network communication. The method is applied to an autonomous system (AS), the AS includes at least one sub-area, the at least one sub-area includes a first sub-area, the first sub-area includes a first node, and the method includes: the first node acquires a first update message, the first update message is used for indicating a link state of a first link, and the first link is a link outside the first sub-area; if the link state indicated by the first update message does not exist in the first node, the first node updates the link state indicated by the first update message; and the first node sends the first update message to nodes in the first sub-area except the first node by a routing forwarding transmission mode. By using the application, the flooding efficiency of the network can be improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of network communication, and particularly relates to a method and device for updating link state and determining sub-area. BACKGROUND

[0002] An autonomous system (AS) is a network collection managed under the same network operation organization and using unified routing strategy. An interior gateway protocol (IGP) is usually run in the AS to realize interconnection and intercommunication of nodes in the AS.

[0003] With the growth of network scale, the nodes in a single AS are more and more, and the interfaces of each node in the AS must participate in the link state flooding process, resulting in a relatively long flooding time of the link state. Moreover, each time a node receives a link state, the node does not directly forward the link state through a data plane, but first processes the link state through a control plane, and then forwards the link state through an interface other than the interface receiving the link state. Since the control plane processing time is in milliseconds, the flooding efficiency of the network is relatively low. SUMMARY

[0004] The present application provides a method and device for updating link state and determining sub-area, to solve the problem of low flooding efficiency of the network.

[0005] In a first aspect, the present application provides a method for updating link state, which is applied to an AS, the AS including at least one sub-area, the at least one sub-area including a first sub-area, the first sub-area including a first node, the method including: obtaining, by the first node, a first update message, the first update message being used to indicate a link state of a first link, the first link being a link outside the first sub-area; if the link state indicated by the first update message does not exist in the first node, updating, by the first node, the link state indicated by the first update message; and transmitting, by the first node, the first update message to nodes other than the first node in the first sub-area through a routing forwarding transmission mode.

[0006] The link outside the first sub-area refers to a link in which at least one of two directly connected nodes is not located in the first sub-area. The routing forwarding transmission mode refers to that when the first update message passes through a transit node, the first update message is only forwarded through a data plane, without being sent to a control plane for processing.

[0007] The scheme shown in the present application, the first node acquires the first update information, and can determine whether the link state indicated by the first update message exists in the first node. If it is determined that the link state indicated by the first update message does not exist in the first node, the first node can update the link state indicated by the first update message. The first node can determine the nodes in the first sub-region except the first node. Then the first node can send the first update message to the nodes in the first sub-region except the first node through the routing forwarding transmission mode. In this way, since in the first sub-region, the update message is forwarded by the data plane of the transit node when passing through the transit node, and does not need to be processed by the control plane of the transit node, the processing of the control plane of the transit node can be saved, and the flooding efficiency of the network can be improved.

[0008] In a possible implementation, the first node is a node that first acquires the first update message among all nodes in the first sub-region. In this way, the first node can diffuse the first update message in the first sub-region through the routing forwarding transmission mode.

[0009] In a possible implementation, the first node sends the first update message to the nodes in the first sub-region except the first node through the routing forwarding transmission mode, including: the first node determines routing information, the routing information is used to send a packet to a second node in the first sub-region, and the first node and the second node are non-adjacent nodes; and the first node sends the first update message to the second node according to the routing information.

[0010] The scheme shown in the present application, the first node can use the stored topology information in the first sub-region to determine a routing message, the routing message being used to send a packet to a second node in the first sub-region. The routing message can include a destination address of the second node and an out-interface of the first node on which the first update message is sent. The first node can use the determined routing message to send the first update message to the second node. In this way, since the hop-by-hop delivery flooding mode is not used, the first update message does not need to pass through the control plane on each forwarding node, so the flooding time of the network can be saved.

[0011] In a possible implementation, the first node sends the first update message to the nodes in the first sub-region except the first node through the routing forwarding transmission mode, including: the first node sends the first update message to the nodes in the first sub-region except the first node through a transmission control protocol (TCP).

[0012] The scheme shown in the present application can be TCP, the first node can determine the nodes in the first sub-area except the first node. The first node sends the first update message to any node in the first sub-area except the first node (which can be referred to as a target node), and the first node can encapsulate the first update message into a TCP packet with the address of the target node as the destination address, and then the first node sends the TCP packet to the next hop node. If the next hop node is not the target node, the next hop node forwards the TCP packet in the data plane to the next hop node until the TCP packet is transmitted to the target node. The data plane of the target node confirms that the destination address of the TCP packet is the address of itself, and can parse the TCP packet and send the first update message to the control plane of the target node for processing. In this way, since the hop-by-hop delivery flooding mode is not used, the first update message does not need to pass through the control plane at each forwarding node, so the flooding time of the network can be saved.

[0013] In a possible implementation, the first node obtaining the first update message comprises: the first node detecting a first link failure, generating the first update message, the first update message being used to indicate that a link state of the first link is a failure state, the first link being a link of the first node connecting a neighbor node outside the first sub-area; or the first node receiving the first update message sent by the neighbor node outside the first sub-area.

[0014] The scheme shown in the present application, the first link failure includes the first link disconnection, the first link congestion, etc. Each node is connected with its neighbor node through an interface. The first node periodically sends a greeting message (such as a hello message) on the link connected by the local interface, to periodically send the greeting message to the neighbor node. After receiving the greeting message sent by the first node, the neighbor node sends an acknowledgement message to the first node. The first node receives the acknowledgement message sent by the neighbor node within a certain time length, and can confirm that the link with the neighbor node is normal. If the first node does not receive the acknowledgement message sent by a certain neighbor node for a continuous preset number of periods, it can be determined that the link between the first node and the neighbor node is faulty. The first node can generate the first update message, at this time, the first update message is used to indicate that the link state of the first link is a failure state, and the first link is a link of the first node connecting a neighbor node outside the first sub-area. Or, the first node receives the first update message sent by the neighbor node outside the first sub-area through the hop-by-hop delivery mode. In this way, the update message of the link outside the first sub-area can be obtained.

[0015] In a possible implementation, the method further comprises: the first node sending the first update message to the neighbor node outside the first sub-area through the hop-by-hop delivery flooding mode. In this way, the first update message can be flooded to the outside of the first sub-area.

[0016] In a possible implementation, the method further includes: the first node sending, to a neighbor node in the first sub-region, a first update message through the hop-by-hop delivery flooding manner. In this way, if the flooding of the link state outside the sub-region fails, the hop-by-hop delivery flooding manner can be used to flood the link state inside the sub-region, so as to ensure the flooding of the link state inside the sub-region as much as possible, and improve the reliability of the flooding of the link state.

[0017] In a possible implementation, the method further includes: the first node receiving a second update message sent by a third node in the first sub-region, the second update message being used to indicate a link state of a second link; and the first node updating the link state indicated by the second update message, if the link state indicated by the second update message does not exist in the first node.

[0018] In the scheme shown in the present application, the third node is any node in the first sub-region except the first node. The third node can send a second update message to the first node. The second update message can be an update message generated by the third node when detecting a failure of a second link with a neighbor node outside the first sub-region; or the second update message is an update message of the second link outside the first sub-region sent by a neighbor node outside the first sub-region and received by the third node; or the second update message is an update message of the second link sent by a neighbor node in the first sub-region and received by the third node; or the second update message is an update message generated by the third node when detecting a failure of the second link with a neighbor node in the first sub-region, and so on. The first node receives the second update message sent by the third node. If a destination address in the second update message is the destination address of the first node, the data plane of the first node provides the second update message to the control plane of the first node. The control plane of the first node determines whether the link state indicated by the second update message does not exist in the first node. If it is determined that the link state indicated by the second update message does not exist in the first node, the first node can update the link state indicated by the second update message. In this way, the first node can also update the link state based on the update message received from the node in the first sub-region.

[0019] In a possible implementation, the first node receiving the second update message sent by the third node in the first sub-region includes: the first node receiving the second update message through TCP. The method further includes: the first node sending the second update message to a neighbor node outside the first sub-region through the hop-by-hop delivery flooding manner.

[0020] In the scheme shown in the application, the second link is a link outside the first sub-region, the third node sends the second update message to the first node through TCP, and the data plane of the first node receives the second update message through TCP. The data plane of the first node determines that the destination address is the address of itself, and provides the second update message to the control plane of the first node. The control plane of the first node judges that the link state indicated by the second update message does not exist in the first node, and the first node can update the link state indicated by the second update message. Then the first node sends the second update message to the neighbor node outside the first sub-region through the hop-by-hop flooding manner. In this way, the second update message can be flooded to the sub-region outside.

[0021] In a possible implementation, the second link is a link in the first sub-region, and the first node receives the second update message sent by the third node in the first sub-region, including: the first node receives the second update message through the hop-by-hop flooding manner; the method further includes: the first node sends the second update message to the neighbor node except the third node through the hop-by-hop flooding manner.

[0022] In the scheme shown in the application, the second link is a link in the first sub-region, the third node sends the second update message to the first node through the hop-by-hop flooding manner, and the data plane of the first node receives the second update message through the hop-by-hop flooding manner. The data plane of the first node determines that the destination address is the address of itself, and provides the second update message to the control plane of the first node. The control plane of the first node judges that the link state indicated by the second update message does not exist in the first node, and the first node can update the link state indicated by the second update message. Then the first node sends the second update message to the neighbor node except the third node through the hop-by-hop flooding manner. That is, the first node can send the second update message through the interface other than the interface connected with the third node. In this way, the flooding of the second update message can be realized.

[0023] In a possible implementation, before the first node sends the first update message to the node except the first node in the first sub-region through the route forwarding transmission manner, the method further includes: the first node determines that the first link does not belong to the first sub-region.

[0024] In the scheme shown in the application, the first node stores all link information of the sub-region to which the first node belongs, and the link information can be indicated by the interfaces of two nodes directly connected by the link of the node. The first node can determine whether the first link belongs to the stored link information, and if not, the first node determines that the first link does not belong to the first sub-region. In this way, whether the first link belongs to the first sub-region can be accurately determined.

[0025] In a second aspect, the present application provides a method for updating a link state, the method is applied to an AS, the AS comprises at least one sub-area, the at least one sub-area comprises a first sub-area, the first sub-area comprises a first node, the method comprises: detecting, by the first node, a first link failure, generating an AS update message and a sub-area update message, the AS update message is used to indicate the link state of the first link to nodes in the AS, the sub-area update message is used to indicate the link state of the first link to nodes in the first sub-area, the first link is a link connecting the first node and a neighbor node in the first sub-area; and sending, by the first node, the AS update message and the sub-area update message.

[0026] According to the scheme provided in the present application, the first node can determine the link failure with a neighbor node in the first sub-area by periodically sending a hello message to the neighbor node, and when the first node does not receive a feedback message from the neighbor node for a continuous preset number of periods, the first node can determine the link failure with the neighbor node. The first node can generate an AS update message and a sub-area update message. The AS update message is used to indicate the link state of the first link to nodes in the AS, so that the nodes in the AS can obtain the link state of the first link, which is a failure state. The sub-area update message is used to indicate the link state of the first link to nodes in the first sub-area, so that the nodes in the first sub-area can obtain the link state of the first link. After the first node obtains the link state of the first link, the first node can update the link state of the first link to the failure state through the control plane of the first link. The first node can send the AS update message and the sub-area update message through the hop-by-hop delivery flooding manner. In this way, the nodes in the AS can obtain the link state of the first link.

[0027] In a possible implementation, the first node sending the AS update message and the sub-area update message comprises: the first node sending the sub-area update message to neighbor nodes in the first sub-area except for the neighbor node connected by the first link through the hop-by-hop delivery flooding manner; and the first node sending the AS update message to neighbor nodes of the first node except for the neighbor node connected by the first link through the hop-by-hop delivery flooding manner.

[0028] According to the scheme provided in the present application, the first node can determine the neighbor nodes in the first sub-area except for the neighbor node connected by the first link. Then the first node sends the sub-area update message to the neighbor nodes through the interfaces connected with the neighbor nodes. The first node can determine the neighbor nodes except for the neighbor node connected by the first link, and then the first node sends the AS update message to the neighbor nodes through the interfaces connected with the neighbor nodes. In this way, the link state of the first link can be spread to the entire AS.

[0029] In a third aspect, a method for updating link state is provided. The method is applied to an AS, and the AS includes at least one sub-area, and the at least one sub-area includes a first sub-area, and the first sub-area includes a first node and a target node. The method includes: receiving, by the target node in a routing and forwarding transmission mode, a first update message sent by the first node, and the first update message is used to indicate a link state of a first link outside the first sub-area; and updating, by the target node, the link state indicated by the first update message, if the link state indicated by the first update message does not exist in the target node.

[0030] According to the scheme provided in the present application, the data plane of the target node receives the first update message sent by the first node in a routing and forwarding transmission mode. The target node can determine whether the destination address of the first update message is the address of the target node. If the destination address is the address of the target node, the data plane of the target node can send the first update message to the control plane of the target node for processing. After the control plane of the target node obtains the first update message, the control plane can determine whether the link state indicated by the first update message does not exist in the target node. If the control plane determines that the link state indicated by the first update message does not exist in the target node, the target node can update the link state indicated by the first update message. In this way, since the update message is forwarded by the data plane of the transit node when passing through the transit node in the first sub-area, and does not need to be processed by the control plane of the transit node, the processing of the control plane of the transit node can be saved, and the flooding efficiency of the network can be improved.

[0031] In a possible implementation, the method further includes: receiving, by the target node in a hop-by-hop delivery flooding mode, the first update message sent by the first node; and updating, by the target node, the link state indicated by the first update message, if the link state indicated by the first update message does not exist in the target node.

[0032] The scheme shown in the present application is that the target node receives the first update message sent by the first node through the hop-by-hop delivery flooding manner. The data plane of the target node can send the first update message to the control plane of the target node for processing. After the control plane of the target node obtains the first update message, it can determine whether the link state indicated by the first update message does not exist in the target node. If the control plane determines that the link state indicated by the first update message does not exist in the target node, the target node can update the link state indicated by the first update message, and the target node sends the first update message to the neighbor nodes of the target node through the hop-by-hop delivery flooding manner, except for the neighbor nodes to which the first update message is sent. In this way, since the first node floods the first update message through the route forwarding transmission manner, it will also send the first update message through the hop-by-hop delivery flooding manner, so the target node can also receive the first update message sent by the first node through the hop-by-hop delivery flooding manner. Therefore, even if the route forwarding transmission manner fails, the first update message can be flooded through the hop-by-hop delivery flooding manner.

[0033] In a possible implementation, the method further includes that the target node sends the first update message to the neighbor nodes outside the first sub-region through the hop-by-hop delivery flooding manner.

[0034] The scheme shown in the present application is that the target node sends the first update message to the neighbor nodes outside the first sub-region through the hop-by-hop delivery flooding manner. In this way, the first update message can be flooded to the outside of the sub-region.

[0035] In a fourth aspect, the present application provides a method for determining a sub-region, which is applied to a node in an AS, and includes: obtaining a network topology of the AS, a number of sub-regions in the AS, and a radius of the sub-region, the radius of the sub-region being a number of nodes between a boundary node of the sub-region and a center node of the sub-region; determining the center node of each sub-region in the AS according to the number of sub-regions in the AS and the network topology; and determining the nodes in each sub-region in the AS according to distances between other nodes in the AS except the center nodes of the sub-regions and the center nodes of the sub-regions, and the radius of the sub-region.

[0036] In the solution shown in the present application, the first node in the sub-area is taken as an example to illustrate that the first node can acquire the number of configured sub-areas and the radius of the sub-area. The first node can acquire the network topology of the AS based on the diffusion of the link state of the nodes in the AS based on the hop-by-hop transmission mode, or the first node acquires the network topology of the AS configured. The first node can determine the diameter of the network topology using the network topology of the AS, where the diameter refers to the connection line of the two nodes farthest apart in the AS in the network topology. The first node then divides the diameter into a certain number of parts, where the certain number is equal to the number of sub-areas plus 1. The first node selects the division point of the adjacent two parts in the divided diameter, and determines the division point as the center node of each sub-area in the AS. Then the first node determines the nodes in each sub-area in the AS using the distance between the nodes other than the center nodes of each sub-area in the AS and the center nodes of each sub-area in the AS, and the radius of the sub-area. In this way, the sub-areas can be automatically divided.

[0037] In a fifth aspect, the present application provides a device for updating a link state, which comprises one or more modules to implement the method of the first aspect and possible implementation manners thereof.

[0038] In a sixth aspect, the present application provides a device for updating a link state, which comprises one or more modules to implement the method of the second aspect and possible implementation manners thereof.

[0039] In a seventh aspect, the present application provides a device for updating a link state, which comprises one or more modules to implement the method of the third aspect and possible implementation manners thereof.

[0040] In an eighth aspect, the present application provides a device for determining a sub-area, which comprises one or more modules to implement the method of the fourth aspect and possible implementation manners thereof.

[0041] In a ninth aspect, the present application provides a computing device, which comprises a processor and a memory, where the memory stores computer instructions, and the processor executes the computer instructions to implement the method of the first aspect and possible implementation manners thereof.

[0042] In a tenth aspect, the present application provides a computing device, which comprises a processor and a memory, where the memory stores computer instructions, and the processor executes the computer instructions to implement the method of the second aspect and possible implementation manners thereof.

[0043] In an eleventh aspect, the present application provides a computing device, which comprises a processor and a memory, where the memory stores computer instructions, and the processor executes the computer instructions to implement the method of the third aspect and possible implementation manners thereof.

[0044] In a twelfth aspect, the present application provides a computing device, comprising a processor and a memory, wherein: the memory stores computer instructions, and the processor executes the computer instructions to implement the method of the fourth aspect and possible implementation manners thereof.

[0045] In a thirteenth aspect, the present application provides a computer readable storage medium storing computer instructions, when the computer instructions in the computer readable storage medium are executed by a computing device, causing the computing device to execute the method of the first aspect and possible implementation manners thereof, or causing the computing device to implement the functions of the apparatus of the fifth aspect and possible implementation manners thereof.

[0046] In a fourteenth aspect, the present application provides a computer readable storage medium storing computer instructions, when the computer instructions in the computer readable storage medium are executed by a computing device, causing the computing device to execute the method of the second aspect and possible implementation manners thereof, or causing the computing device to implement the functions of the apparatus of the sixth aspect and possible implementation manners thereof.

[0047] In a fifteenth aspect, the present application provides a computer readable storage medium storing computer instructions, when the computer instructions in the computer readable storage medium are executed by a computing device, causing the computing device to execute the method of the third aspect and possible implementation manners thereof, or causing the computing device to implement the functions of the apparatus of the seventh aspect and possible implementation manners thereof.

[0048] In a sixteenth aspect, the present application provides a computer readable storage medium storing computer instructions, when the computer instructions in the computer readable storage medium are executed by a computing device, causing the computing device to execute the method of the fourth aspect and possible implementation manners thereof, or causing the computing device to implement the functions of the apparatus of the eighth aspect and possible implementation manners thereof.

[0049] In a seventeenth aspect, the present application provides a computer program product containing instructions, when the computer program product is run on a computing device, causing the computing device to execute the method of the first aspect and possible implementation manners thereof, or causing the computing device to implement the functions of the apparatus of the fifth aspect and possible implementation manners thereof.

[0050] In an eighteenth aspect, the present application provides a computer program product containing instructions, when the computer program product is run on a computing device, causing the computing device to execute the method of the second aspect and possible implementation manners thereof, or causing the computing device to implement the functions of the apparatus of the sixth aspect and possible implementation manners thereof.

[0051] In a nineteenth aspect, the present application provides a computer program product containing instructions which, when executed on a computing device, cause the computing device to perform the method of the third aspect above and possible implementation forms thereof, or cause the computing device to implement the functions of the apparatus of the seventh aspect above and possible implementation forms thereof.

[0052] In a twentieth aspect, the present application provides a computer program product containing instructions which, when executed on a computing device, cause the computing device to perform the method of the fourth aspect above and possible implementation forms thereof, or cause the computing device to implement the functions of the apparatus of the eighth aspect above and possible implementation forms thereof.

[0053] In a twenty-first aspect, the present application provides a system for updating link state, comprising: a first node and a target node, the first node being the apparatus of the fourth aspect above, and the target node being the apparatus of the seventh aspect above. BRIEF DESCRIPTION OF DRAWINGS

[0054] Figure 1 is a schematic diagram of an autonomous system according to an example embodiment of the present application;

[0055] Figure 2 is a schematic diagram of a node according to an example embodiment of the present application;

[0056] Figure 3 is a schematic diagram of a node according to an example embodiment of the present application;

[0057] Figure 4 is a schematic diagram of a node according to an example embodiment of the present application;

[0058] Figure 5 is a schematic diagram of a node according to an example embodiment of the present application;

[0059] Figure 6 is a schematic diagram of link state flooding in a sub-area according to an example embodiment of the present application;

[0060] Figure 7 is a schematic diagram of a method for updating link state according to an example embodiment of the present application;

[0061] Figure 8 is an example diagram of a link outside the first sub-area according to an example embodiment of the present application;

[0062] Figure 9 is an example diagram of a link outside the first sub-area according to an example embodiment of the present application;

[0063] Figure 10 is a schematic diagram of route flooding in an AS according to an example embodiment of the present application;

[0064] Figure 11 is a flowchart of a method for updating link states according to an example embodiment of the present application;

[0065] Figure 12 is an example diagram of a method for updating link states outside a sub-area according to an example embodiment of the present application;

[0066] Figure 13 is a flowchart of a method for updating link states according to an example embodiment of the present application;

[0067] Figure 14 is a flowchart of a method for updating link states inside a sub-area according to an example embodiment of the present application;

[0068] Figure 15 is an example diagram of a method for updating link states inside a sub-area according to an example embodiment of the present application;

[0069] Figure 16 is a flowchart of a method for updating link states according to an example embodiment of the present application;

[0070] Figure 17 is a flowchart of a method for determining a sub-area according to an example embodiment of the present application;

[0071] Figure 18 is an example diagram of a method for determining a sub-area according to an example embodiment of the present application;

[0072] Figure 19 is a structural diagram of an apparatus for updating link states according to an example embodiment of the present application;

[0073] Figure 20 is a structural diagram of an apparatus for updating link states according to an example embodiment of the present application;

[0074] Figure 21 is a structural diagram of an apparatus for updating link states according to an example embodiment of the present application;

[0075] Figure 22 is a structural diagram of an apparatus for updating link states according to an example embodiment of the present application;

[0076] Figure 23 is a structural diagram of an apparatus for determining a sub-area according to an example embodiment of the present application. DETAILED DESCRIPTION

[0077] For the purpose, technical solutions and advantages of the present application to be clearer, the embodiments of the present application will be described in further detail below with reference to the drawings.

[0078] In order to facilitate the understanding of the embodiments of the present application, the concepts of the terms involved will be introduced first as follows:

[0079] 1. AS is a network set using a unified routing strategy under the management of a same network operation organization.

[0080] 2. The hop-by-hop delivery flooding mode, the process is: each node in the network transmits its latest link state to its neighbor node, the neighbor node receives the link state through the data plane, the control plane of the neighbor node determines whether the received link state has been stored. If the received link state has been stored, it is discarded, if the received link state has not been stored, the link state is updated, and the link state is sent to its neighbor node through the data plane from other interfaces except the receiving interface. In this way, all nodes in the network form a unified link state. For example, as shown in Figure 1 , the network includes four nodes, namely node A, node B, node C and node D, and each node stores the link state as shown in Table 1, in which 24 represents a 24-bit prefix mask.

[0081] Table 1

[0082]

[0083] 3. Link state, in Open Shortest Path First (OSPF), it is called Link State Address (LSA), in Intermediate System-to-Intermediate System (IS-IS), it is called Link State PDU (LSP). The link state of each node includes the number of the node, the links connected by each interface in the node and the information of the neighbor nodes.

[0084] In the AS, the hop-by-hop delivery flooding mode is used for flooding, and in the flooding process, a hop-by-hop delivery flooding process runs in each node. When the hop-by-hop delivery flooding process receives a link state each time, it is not directly forwarded through the data plane, but first processed through the control plane, and then forwarded through the interface other than the interface receiving the link state. Since the control plane processing time is in milliseconds, it will lead to a relatively low flooding efficiency of the network. Therefore, a method for updating the link state is needed to make the flooding efficiency of the network relatively high.

[0085] The method for updating a link state provided in the embodiments of the present application can be applied to flooding of a link state in an AS. The method for updating a link state can be executed by a device for updating a link state (hereinafter can be referred to as an updating device). The updating device can be a hardware device, such as a node (such as a first node, a second node, etc. mentioned hereinafter) implemented by hardware, which can be a router, etc., or a software device (such as a set of software programs running on a hardware device).

[0086] When the updating device is a hardware device, as shown in Figure 2 a structural diagram of a node is provided. The node includes a master board 201 and an interface board 202. The master board 201 belongs to a control plane of the node, and the interface board 202 belongs to a data plane of the node. The master board 201 includes a processor 2011 and a memory 2012. The interface board 202 includes a processor 2021, a memory 2022 and an interface card 2023. A communication connection is established between the master board 201 and the interface board 202.

[0087] The processor 2011 can be a central processing unit (CPU), an application specific integrated circuit (ASIC) or the like. The processor 2011 can include one or more chips. The memory 2012 can be a read only memory (ROM), a static storage device, a dynamic storage device or a random access memory (RAM). The memory 2012 can store computer instructions. When the computer instructions stored in the memory 2012 are executed by the processor 2011, the processor 2011 executes the method for updating a link state.

[0088] The processor 2021 can be a CPU, an application specific integrated circuit (ASIC) or the like. The processor 2021 can include one or more chips. The memory 2022 can be a ROM, a static storage device, a dynamic storage device or a RAM. The memory 2022 can store computer instructions. When the computer instructions stored in the memory 2022 are executed by the processor 2021, the processor 2021 executes the method for updating a link state. The interface card 2023 can implement receiving and sending processing of a packet.

[0089] When the updating device is a hardware device, as shown in Figure 3 another structural diagram of a node is provided. The node includes a memory 301, a processor 302, a transceiver 303 and a bus 304. The memory 301, the processor 302 and the transceiver 303 are communicatively connected to each other through the bus 304.

[0090] The memory 301 can be a ROM, static storage device, dynamic storage device, or RAM. The memory 301 can store computer instructions, which, when executed by the processor 302, enable the processor 302 and transceiver 303 to perform a method for updating the link state. The memory 301 can also store data; for example, a portion of the memory 301 may be used to store data required for the method of updating the link state, as well as intermediate or result data during program execution.

[0091] Processor 302 may be a general-purpose CPU, an application ASIC, a graphics processing unit (GPU), or any combination thereof. Processor 302 may include one or more chips.

[0092] Transceiver 303 uses transceiver modules, such as, but not limited to, transceivers, to enable communication between the node and other devices or communication networks. For example, transceiver 303 can be used to obtain data needed to update link status.

[0093] Bus 304 may include a path for transmitting information between various components of a node (e.g., memory 301, processor 302, transceiver 303).

[0094] The method for updating link states is applied in an AS (Application System). An AS comprises at least one sub-area, which can also be called a Flooding Sub-Topology (FST). Each sub-area includes a first sub-area, which is any one of the at least one sub-areas. Each sub-area includes multiple nodes, which can be routers. The first sub-area includes a first node.

[0095] Figure 4 This is a schematic diagram of the logical structure of a node provided in an exemplary embodiment of this application. Regarding the embodiments of this application, as shown... Figure 4 As shown, the first node adds a flooding mode selection module 401 and a route forwarding flooding module 402 (the route forwarding flooding module 402 includes a route forwarding flooding process). Specifically, the first node also includes a route calculation module 403, a route management module 404, an interface card 405, a hop-by-hop flooding module 406 (the hop-by-hop flooding module 406 includes a hop-by-hop forwarding flooding process), and a sub-area acquisition module 407. Figure 4The protocol of the route forwarding flooding process and the hop-by-hop flooding process can use OSPF or IS-IS. The flooding mode selection module 401, the route forwarding flooding module 402, the hop-by-hop flooding module 406, the route calculation module 403, and the sub-area acquisition module 407 are arranged in the aforementioned memory 2012. The route management module 404 is arranged in the aforementioned memory 2022. The interface card 405 is the aforementioned interface card 2023. After the interface card 405 receives the link state update message, if the destination address is the address of the first node, the interface card 405 sends the link state update message to the flooding mode selection module 401. Or if the interface card 405 does not receive the feedback message of the neighbor node for a preset number of periods, the interface card 405 informs the flooding mode selection module 401. The flooding mode selection module 401 determines whether to use the hop-by-hop flooding or the route forwarding flooding, and when it is determined to use the hop-by-hop flooding, the link state update message is flooded through the hop-by-hop flooding module 406, and when it is determined to use the route forwarding flooding, the link state update message is flooded through the route forwarding flooding mode. The detailed process is described below. The sub-area acquisition module 407 is used to acquire the sub-area in the AS. Correspondingly Figure 4 That is, the route forwarding flooding module 402 and the hop-by-hop flooding module 406 are arranged on each node in each sub-area, and only the hop-by-hop flooding module 406 can be arranged on the node outside the sub-area, or the route forwarding flooding module 402 and the hop-by-hop flooding module 406 can be arranged on the node outside the sub-area, and the node outside the sub-area only enables the hop-by-hop flooding module 406, as shown in Figure 5 .

[0096] In addition, the first node is further provided with a link state database for storing the link state in the AS, and the route calculation module 403 is used to calculate the routing information through the link state in the link state database and send the routing information to the route management module 404. Subsequently, when the first node receives a data packet, if the data packet is not sent to the first node, the data packet is forwarded through the interface card 405.

[0097] Firstly, the flooding rule of the link state in the sub-area is introduced. In each sub-area, each node uses the route forwarding flooding module 402 to transmit the link state outside the sub-area through the route forwarding transmission mode. For example, as shown in Figure 6 , the AS includes two sub-areas, and each sub-area includes four nodes. When the node in the upper left corner of the sub-area acquires the link state outside the sub-area, the node floods the link state inside the sub-area through the route forwarding transmission mode. Figure 6 In the figure, the dotted line with an arrow indicates that the flooding is performed through the route forwarding transmission mode, and the solid line with an arrow indicates that the flooding is performed through the hop-by-hop flooding mode.

[0098] The following will be described in combination with Figure 7 The method for updating the link state of the first node is described, and the flow is for the link state update outside the first sub-area. As shown in Figure 7 , the processing flow of the method is as follows:

[0099] Step 701, the first node acquires the first update message, the first update message is used to indicate the link state of the first link, and the first link is a link outside the first sub-area.

[0100] Among them, the link outside the first sub-area refers to the link between the two nodes directly connected, at least one of which is not located in the first sub-area. Specifically, the link outside the first sub-area can include two cases, the first case is as shown in Figure 8 , the first sub-area includes the B node, the A node is located outside the first sub-area, and the A node is directly connected with the B node, the link between the A node and the B node is link 1, since the A node is located outside the first sub-area, so the link 1 is the link outside the first sub-area; the second case is as shown in Figure 9 , the first sub-area includes the B node, the A node and the C node are located outside the first sub-area, and the A node is directly connected with the C node, the link between the A node and the C node is link 2, since the A node and the C node are located outside the first sub-area, so the link 2 is the link outside the first sub-area. The first link is the link outside the first sub-area. The first update message includes the related information of the link to be updated, for example, the first link is in a fault state, etc.

[0101] In this embodiment, the first node acquires the first update message in multiple ways, for example, two feasible ways are given as follows:

[0102] The first node detects the first link failure, generates the first update message, the first update message is used to indicate that the link state of the first link is in a fault state, and the first link is the link connected with the neighbor node outside the first sub-area.

[0103] Among them, the first link failure includes the disconnection of the first link, the congestion of the first link, etc.

[0104] In this embodiment, each node is connected to its neighboring nodes via an interface. The first node periodically sends greeting messages (such as hello messages) on the link connected to its local interface, thus periodically sending greeting messages to its neighboring nodes. After receiving the greeting message from the first node, the neighboring node sends an acknowledgment message to the first node. If the first node receives an acknowledgment message from a neighboring node within a certain time period, it can confirm that the link with the neighboring node is normal. If the first node does not receive an acknowledgment message from a neighboring node for a preset number of consecutive periods, it can determine that the link between the first node and that neighboring node is faulty. The first node can generate a first update message, which indicates that the link status of the first link is faulty. The first link is the link connecting the first node to neighboring nodes outside the first sub-region. For example, ... Figure 8 As shown, the first node is node B, and node A is the neighbor node outside the first sub-region connected to the first node.

[0105] Method 2: The first node receives the first update message sent by a neighboring node outside the first sub-region.

[0106] In this embodiment, the first node receives the first update message sent by its neighboring node outside the first sub-region via a hop-by-hop transmission method. For example, as Figure 9 As shown, the first link is the link between node A and node C, and the first node is node B. When node A detects a failure in the first link, node A sends the first update message of the first link to node B.

[0107] Optionally, the first node can be a predefined node among all nodes in the first sub-region. For example, the first node is the node in the first sub-region that first receives the first update message.

[0108] Step 702: If the link state indicated by the first update message does not exist in the first node, then the first node updates the link state indicated by the first update message.

[0109] In this embodiment, after receiving the first update message, the first node can determine whether the link state indicated by the first update message does not exist in the first node. If it is determined that the link state indicated by the first update message does not exist in the first node, the first node can update the link state indicated by the first update message. Specifically, the cases where the link state indicated by the first update message does not exist in the first node can be as follows:

[0110] 1. A first link exists in the first node, but the link state of the first link is different from the link state indicated by the first update message. In this case, the first node can replace the currently stored link state of the first link with the link state indicated by the first update message.

[0111] 2. The first link does not exist in the first node. In this case, the first node stores the link state indicated by the first update message.

[0112] In step 703, the first node sends the first update message to the nodes in the first sub-region except the first node by a route forwarding transmission mode.

[0113] The route forwarding transmission mode means that when the first update message passes through the transit nodes, it only passes through the data plane forwarding and does not need to be sent to the control plane for processing. For example, the first node sends the first update message from the first node to the D node, passing through the M node and the N node. After receiving the first update message, the M node and the N node perform forwarding through the data plane of the M node and the N node, without the need to send to the control plane of the M node and the N node for processing.

[0114] In this embodiment, the first node can determine the nodes in the first sub-region except the first node. Then the first node can send the first update message to the nodes in the first sub-region except the first node by the route forwarding transmission mode.

[0115] Optionally, before step 703, it can be judged whether the first link belongs to the first sub-region. In the case that the first link does not belong to the first sub-region, the processing of step 703 is performed. Specifically, before step 703, the first node determines that the first link does not belong to the first sub-region.

[0116] In this embodiment, the first node stores all link information of the sub-region to which the first node belongs. The link information can be indicated by the interfaces of the two nodes directly connected by the link. The first node can determine whether the first link belongs to the stored link information. If the first link does not belong to the stored link information, the first node determines that the first link does not belong to the first sub-region. In this way, it can be accurately judged whether the first link belongs to the first sub-region. In addition, if the first link belongs to the stored link information, the first node determines that the first link belongs to the first sub-region.

[0117] Optionally, the processing of step 703 can be as follows:

[0118] The first node determines routing information, wherein the routing information is used to send a packet to a second node in the first sub-region, and the first node and the second node are non-adjacent nodes; and the first node sends the first update message to the second node according to the routing information.

[0119] The second node is a node in the first sub-region, and the second node is not adjacent to the first node.

[0120] In the embodiment, the first node can determine a routing message for sending a packet to the second node in the first sub-region using the stored topology information in the first sub-region. The routing message can include a destination address of the second node and an out interface on the first node from which the first update message is sent. The first node can send the first update message to the second node using the determined routing message. Specifically, the routing and forwarding flooding module 402 of the first node determines that the first update message is to be sent to the second node, the interface card 405 of the first node obtains routing information of the second node, and the first update message is sent out using the routing information of the second node. In this way, since the flooding by hop-by-hop delivery is not used, the first update message does not need to pass through the control plane of each forwarding node, and thus the flooding time of the network can be saved.

[0121] It should be noted that the second node herein is a node that is not adjacent to the first node, and of course, the same sending manner as that for the second node can also be used for sending to a node adjacent to the first node in the first sub-region.

[0122] Optionally, the routing and forwarding transmission manner can be TCP, and the first node can determine a node in the first sub-region other than the first node. The first node is to send the first update message to any node (which can be referred to as a target node) in the first sub-region other than the first node, and the first node can encapsulate the first update message into a TCP packet with a destination address of the target node, and then the first node sends the TCP packet to a next hop node. If the next hop node is not the target node, the next hop node forwards the TCP packet in the data plane to a node at a next hop until the TCP packet is transmitted to the target node. The data plane of the target node confirms that the destination address of the TCP packet is the address of the target node, parses the TCP packet, and sends the first update message to the control plane of the target node for processing.

[0123] In this way, in the flow shown in Figure 7 , the first node can send the first update message to a node in the first sub-region other than the first node by using the routing and forwarding transmission manner. Since in the first sub-region, the update message is forwarded by the data plane of a transit node when passing through the transit node, and does not need to be processed by the control plane of the transit node, the processing of the control plane of the transit node can be saved, and the flooding efficiency of the network can be improved. For example, as shown in Figure 10 , the link state flooding in the AS is equivalent to flooding in each sub-region (such as sub-region 1, sub-region 2, and sub-region 3) by using the routing and forwarding transmission manner, and the flooding speed is accelerated.

[0124] In a possible implementation, the first node can also send the first update message to the node outside the first sub-region, and flood the first update message outside the first sub-region. The corresponding processing can be as follows:

[0125] The first node sends the first update message to the neighbor node outside the first sub-region by the hop-by-hop delivery flooding manner.

[0126] In this embodiment, after the first node obtains the first update message, the first node can send the first update message to the neighbor node outside the first sub-region through the interface connected to the neighbor node outside the first sub-region, that is, the first node sends the first update message to the neighbor node outside the first sub-region by the hop-by-hop delivery flooding manner. Specifically, the first node sends the first update message to the neighbor node outside the first sub-region by using the hop-by-hop flooding module 406. In this way, the first update message can be flooded outside the first sub-region.

[0127] In a possible implementation, the first node can also send the first update message to the node inside the first sub-region by the hop-by-hop delivery flooding manner. The corresponding processing can be as follows:

[0128] The first node sends the first update message to the neighbor node inside the first sub-region by the hop-by-hop delivery flooding manner.

[0129] In this embodiment, after the first node obtains the first update message, the first node can send the first update message to the neighbor node inside the first sub-region through the interface connected to the neighbor node inside the first sub-region, that is, the first node sends the first update message to the neighbor node inside the first sub-region by the hop-by-hop delivery flooding manner. Specifically, the first node can also send the first update message to the neighbor node inside the first sub-region by using the hop-by-hop flooding module 406. In this way, since the first update message transmitted by the route forwarding transmission manner is relatively fast, after the neighbor node inside the first sub-region receives the first update message, the neighbor node inside the first sub-region can determine that the link state indicated by the first update message already exists, and will not be spread in a large range in the first sub-region.

[0130] From the above description, it can be known that in the first node, if the link state belongs to outside the sub-area, the route forwarding flooding module 402 performs flooding in the sub-area, the hop-by-hop flooding module 406 performs flooding outside the sub-area, and the accelerated flooding can be implemented in the sub-area. Of course, the nodes in the sub-area still use the hop-by-hop flooding module 406 to perform flooding in the sub-area. In this way, when the link state outside the sub-area is flooded by using the route forwarding transmission mode, if the transmission fails, since the nodes in the sub-area still use the hop-by-hop flooding module 406 to perform flooding in the sub-area, the link state in the sub-area can be flooded as much as possible, and the reliability of the link state flooding is improved. In addition, even if the nodes in the sub-area still use the hop-by-hop flooding module 406 to perform flooding in the sub-area, since the nodes that have been updated based on the route forwarding transmission mode will not continue to use the hop-by-hop flooding module 406 to perform flooding, a large-scale spread will not be caused.

[0131] In addition, as shown in Figure 11 In the embodiment of the application, a processing flow of a node in the first sub-area receiving the first update message sent by the first node is also provided:

[0132] In step 1101, the target node receives the first update message sent by the first node through the route forwarding transmission mode, and the first update message is used to indicate the link state of the first link outside the first sub-area.

[0133] The target node can be the second node mentioned above, or a neighbor node of the first node in the first sub-area, that is, the target node is any node in the first sub-area except the first node.

[0134] In the embodiment, the data plane of the target node receives the first update message sent by the first node through the route forwarding transmission mode. The target node can determine whether the destination address of the first update message is the address of the target node. If the destination address is the address of the target node, the data plane of the target node can send the first update message to the control plane of the target node for processing.

[0135] In step 1102, if the link state indicated by the first update message does not exist in the target node, the target node updates the link state indicated by the first update message.

[0136] In the embodiment, after the control plane of the target node obtains the first update message, it can determine whether the link state indicated by the first update message does not exist in the target node. If the control plane determines that the link state indicated by the first update message does not exist in the target node, the target node can update the link state indicated by the first update message. If the control plane determines that the link state indicated by the first update message exists in the target node, the target node does not perform processing. Here, the processing of the target node to update the link state indicated by the first update message is the same as the processing of the first node to update the link state indicated by the first update message, which will not be described herein again.

[0137] In a possible implementation, since the hop-by-hop flooding module 406 of the first node also sends the first update message outwards through the hop-by-hop delivery flooding mode, the target node can also receive the first update message sent by the first node through the hop-by-hop delivery flooding mode. The processing can be as follows:

[0138] The target node receives the first update message sent by the first node through the hop-by-hop delivery flooding mode. If the link state indicated by the first update message does not exist in the target node, the target node updates the link state indicated by the first update message.

[0139] In the embodiment, the target node receives the first update message sent by the first node through the hop-by-hop delivery flooding mode. Here, if the target node is a neighbor node of the first node in the first sub-region, the target node directly receives the first update message sent by the first node. If the target node is not a neighbor node of the first node in the first sub-region, the target node does not directly receive the first update message sent by the first node.

[0140] The data plane of the target node can send the first update message to the control plane of the target node for processing. After the control plane of the target node obtains the first update message, it can determine whether the link state indicated by the first update message does not exist in the target node. If the control plane determines that the link state indicated by the first update message does not exist in the target node, the target node can update the link state indicated by the first update message, and the hop-by-hop flooding module 406 in the target node sends the first update message to the neighbor nodes of the target node through the hop-by-hop delivery flooding mode, except for the neighbor node to which the first update message is sent. If the control plane determines that the link state indicated by the first update message exists in the target node, the target node does not perform subsequent processing.

[0141] In a possible implementation, after receiving the first update message sent by the first node, the target node no longer sends the first update message outwards through the route forwarding transmission mode. However, the hop-by-hop flooding module 406 of the target node sends the first update message to the neighbor nodes outside the first sub-region through the hop-by-hop transmission flooding mode.

[0142] In this embodiment, in order to send the first update message to the outside of the first sub-region, the hop-by-hop flooding module 406 of the target node sends the first update message to the neighbor nodes outside the first sub-region through the hop-by-hop transmission flooding mode. Specifically, the target node can send the first update message to the neighbor nodes outside the first sub-region through the interface connected to the neighbor nodes outside the first sub-region.

[0143] For better understanding Figure 7 and Figure 11 of the flow shown in the figure, the embodiment of the present application further provides an example as shown in the figure: Figure 12

[0144] Figure 12 The AS in the example includes two sub-regions, i.e., sub-region 1 and sub-region 2. The sub-region 1 is shown in the left dashed box in the figure, and the sub-region 2 is shown in the right dashed box in the figure. The sub-region 1 includes nodes 1, 2 and 3, etc. The sub-region 2 includes nodes 4 and 5, etc. The AS further includes some nodes not belonging to the sub-regions, such as nodes 6, 7, 8 and 9. Figure 12 In the example, only some nodes are described, and all the nodes are not described. Figure 12 Figure 12 It is assumed that the node 7 detects the link failure between the node 7 and the node 6, and the node 7 generates the first update message of the link. The node 7 wants to flood the first update message to the node 9. The node 7 does not belong to the sub-region, and the node 7 enables the hop-by-hop flooding module 406 to use the hop-by-hop transmission flooding mode to flood the first update message to the other neighbor nodes except the node 6. The node 1 is a neighbor node of the node 7, and the node 1 receives the first update message through the hop-by-hop transmission flooding mode.

[0145] It is assumed that the node 7 detects the link failure between the node 7 and the node 6, and the node 7 generates the first update message of the link. The node 7 wants to flood the first update message to the node 9. The node 7 does not belong to the sub-region, and the node 7 enables the hop-by-hop flooding module 406 to use the hop-by-hop transmission flooding mode to flood the first update message to the other neighbor nodes except the node 6. The node 1 is a neighbor node of the node 7, and the node 1 receives the first update message through the hop-by-hop transmission flooding mode.

[0146] ​​Node 1 determines that the link state indicated in the first update message does not exist at node 1, and node 1 updates the link state indicated in the first update message. Node 1 can enable the route forwarding flooding module 402 to send the first update message to all nodes in sub-area 1 except node 1 via the route forwarding transmission mode. In this way, the nodes in sub-area 1 can receive the first update message via the route forwarding transmission mode, and then node 2 also receives the first update message. Node 2 determines that the link state indicated in the first update message does not exist at node 2, and node 2 updates the link state indicated in the first update message. Node 2 does not send the first update message via the route forwarding transmission mode. The hop-by-hop flooding module 406 of node 2 transmits the first update message to the neighbor nodes of node 2 via the hop-by-hop transmission flooding mode, and the neighbor node 4 also receives the first update message and performs similar processing as node 1 to send the first update message to node 5. Node 5 performs similar processing as node 2 to transmit the first update message to node 8. The hop-by-hop flooding module 406 of node 8 transmits the first update message to node 9 via the hop-by-hop transmission flooding mode, so that the first update message reaches node 9. In addition, node 1 also enables the hop-by-hop flooding module 406 to send the first update message to the neighbor nodes of node 1 except the neighbor node from which the first update message is sent via the hop-by-hop transmission flooding mode, so as to flood the first update message in sub-area 1 and outside sub-area 1. Similarly, node 4 also enables the hop-by-hop flooding module 406 to flood the first update message in sub-area 2 via the hop-by-hop transmission flooding mode. In Figure 12 In the figure, the solid arrowed line indicates the optimal process of transmitting the first update message to node 9, and the dashed arrowed line indicates the optimal process of transmitting the first update message to other nodes.

[0147] It should be noted that although the solid arrowed line is directly connected from node 4 to node 5, it only indicates that the destination address of the first update message sent by node 4 to node 5 is the address of node 5, and the first update message reaches node 5 through the nodes between node 4 and node 5, but the control plane of the nodes between node 4 and node 5 does not process the first update message. Similarly, the dashed arrowed line is directly connected from node 1 to node 3, which also indicates that the destination address of the first update message sent by node 1 to node 3 is the address of node 3, and the first update message reaches node 3 through the nodes between node 1 and node 2, i.e., node 2, but the control plane of the nodes between node 1 and node 2, i.e., node 2, does not process the first update message. That is, the nodes that forward the first update message in the sub-area do not need to process the first update message in the control plane. In this way, flooding acceleration can be achieved in the sub-area. Compared with the hop-by-hop transmission flooding mode, the flooding link state is reduced from the original 9 hops to 6 hops.

[0148] It should be further noted that, in Figure 12 a physical link is established between adjacent nodes, Figure 12 is not shown.

[0149] In a possible implementation, as shown in Figure 13 The embodiment of the present application also provides a processing flow of a first node receiving a second update message sent by a third node in a first sub-area:

[0150] Step 1301, the first node receives a second update message sent by a third node in the first sub-area, wherein the second update message is used to indicate a link state of a second link.

[0151] The third node is any node in the first sub-area except the first node.

[0152] In the embodiment, the third node can send the second update message to the first node. The second update message can be an update message generated by the third node when the third node detects a second link fault between the third node and a neighbor node outside the first sub-area; or the second update message is an update message of the second link outside the first sub-area sent by a neighbor node outside the first sub-area and received by the third node; or the second update message is an update message of the second link sent by a neighbor node inside the first sub-area and received by the third node; or the second update message is an update message generated by the third node when the third node detects a second link fault with a neighbor node inside the first sub-area, and so on. The first node receives the second update message sent by the third node. If a destination address in the second update message is the destination address of the first node, the data plane of the first node provides the second update message to the control plane of the first node.

[0153] Step 1302, if the link state indicated by the second update message does not exist in the first node, the first node updates the link state indicated by the second update message.

[0154] In the embodiment, the control plane of the first node judges whether the link state indicated by the second update message exists in the first node. If it is judged that the link state indicated by the second update message does not exist in the first node, the first node can update the link state indicated by the second update message.

[0155] In a possible implementation, the second link is a link outside the first sub-area, the third node sends the second update message to the first node through TCP, and the data plane of the first node receives the second update message through TCP. The data plane of the first node determines that the destination address is the address of the first node, and provides the second update message to the control plane of the first node. The control plane of the first node determines that the link state indicated by the second update message does not exist in the first node, and the first node can update the link state indicated by the second update message. Then the hop-by-hop flooding module 406 of the first node sends the second update message to the neighbor node outside the first sub-area through the hop-by-hop delivery flooding mode. Of course, the hop-by-hop flooding module 406 of the first node also sends the second update message to the neighbor node inside the first sub-area through the hop-by-hop delivery flooding mode.

[0156] In a possible implementation, the second link is a link inside the first sub-area, and the hop-by-hop flooding module 406 of the third node sends the second update message to the first node through the hop-by-hop delivery flooding mode. The data plane of the first node receives the second update message through the hop-by-hop delivery flooding mode. The data plane of the first node determines that the destination address is the address of the first node, and provides the second update message to the control plane of the first node. The control plane of the first node determines that the link state indicated by the second update message does not exist in the first node, and the first node can update the link state indicated by the second update message. Then the hop-by-hop flooding module 406 of the first node sends the second update message to the neighbor node except the third node through the hop-by-hop delivery flooding mode. That is, the first node can send the second update message through the interface other than the interface connected with the third node. In this way, the flooding of the second update message can be implemented.

[0157] In the embodiments of the present application, a processing manner of the link fault inside the first sub-area is also provided. Specifically, as shown in Figure 14

[0158] In step 1401, the first node detects the first link fault, generates an AS update message and a sub-area update message, the AS update message is used to indicate the link state of the first link to the nodes of the AS, and the sub-area update message is used to indicate the link state of the first link to the nodes inside the first sub-area. The first link is a link connecting the first node and the neighbor node inside the first sub-area.

[0159] ​In this embodiment, the first node can determine the first link failure with a neighbor node in the first sub-area by periodically sending a hello message to the neighbor node and determining the link failure with the neighbor node when the first node does not receive a feedback message from the neighbor node for a preset number of continuous periods. The first node can determine the first link failure with a neighbor node in the first sub-area in this way. The first node can generate an AS update message and a sub-area update message. The AS update message is used for the first node to indicate the link state of the first link to the nodes in the AS, so that the nodes in the AS can obtain the link state of the first link, which is a failure state. The sub-area update message is used for the first node to indicate the first link state to the nodes in the first sub-area, so that the nodes in the first sub-area can obtain the link state of the first link.

[0160] After the first node obtains the link state of the first link, the first node can update the link state of the first link to the failure state through the control plane of the first link.

[0161] In step 1402, the first node sends the AS update message and the sub-area update message.

[0162] In this embodiment, after the first node generates the AS update message and the sub-area update message, the first node can send the AS update message through the hop-by-hop flooding module 406 and send the sub-area update message through the route forwarding flooding module 402. In this way, the nodes in the AS can obtain the link state of the first link.

[0163] In a possible implementation, the processing in step 1402 can be as follows:

[0164] The first node sends the sub-area update message to the neighbor nodes in the first sub-area through the hop-by-hop delivery flooding manner, and the first node sends the AS update message through the hop-by-hop delivery flooding manner.

[0165] In this embodiment, the first node can determine the neighbor nodes in the first sub-area except for the neighbor node connected by the first link. Then the first node sends the sub-area update message to these neighbor nodes through the interfaces connected to these neighbor nodes by using the route forwarding flooding module 402. This is also the hop-by-hop delivery flooding manner.

[0166] The first node can determine the neighbor nodes except for the neighbor node connected by the first link. Then the hop-by-hop flooding module 406 of the first node sends the AS update message to these neighbor nodes through the interfaces connected to these neighbor nodes. In this way, the link state of the first link can be spread to the entire AS.

[0167] Thus, when the link state of a link in a sub-area is updated, since the updating of the link state occurs in the sub-area, the route forwarding transmission mode needs to be based on the route convergence in the sub-area to establish an effective transmission, so the updating of the link state occurs in the sub-area. Although the route forwarding transmission mode is not accelerated, this is limited to the sub-area to which the updating of the link state belongs, and does not affect the acceleration of the route forwarding transmission mode in other sub-areas.

[0168] For better understanding Figure 14 The flowchart shown, the embodiment of the present application also provides Figure 15 The example shown:

[0169] Figure 15 The AS includes two sub-areas, i.e., sub-area 1 and sub-area 2. The sub-area 1 is shown in the left dashed box in FIG. 1, and the sub-area 2 is shown in the right dashed box in FIG. 1. The sub-area 1 includes nodes 1, 2, 3, and a, etc. The sub-area 2 includes nodes 4 and 5, etc. The AS also includes some nodes that do not belong to the sub-areas, such as nodes 6, 7, 8, and 9. Figure 15 In the example, only some nodes are described, and all nodes are not described. Figure 15 Figure 15 Suppose that the node 1 detects a link failure between the node 1 and the node a. The hop-by-hop flooding module 406 of the node a generates an AS update message of the link, and the route forwarding flooding module 402 of the node a generates a sub-area update message of the link.

[0170] The node 1 uses the route forwarding flooding module 402 to send the sub-area update message to the neighbor nodes in the sub-area 1 except the node a by the hop-by-hop delivery flooding mode. The node 1 uses the hop-by-hop flooding module 406 to send the AS update message to the neighbor nodes of the node 1 except the node a by the hop-by-hop delivery flooding mode.

[0171] The node 1 uses the route forwarding flooding module 402 to send the sub-area update message to the neighbor nodes in the sub-area 1 except the node a by the hop-by-hop delivery flooding mode. The node 1 uses the hop-by-hop flooding module 406 to send the AS update message to the neighbor nodes of the node 1 except the node a by the hop-by-hop delivery flooding mode.

[0172] ​Node 4 receives the AS update message from node 2, and sends the AS update message to node 4 using the hop-by-hop flooding module 406 through the hop-by-hop flooding mode. Since the link between node 1 and node a is a link outside the sub-area 2 for the sub-area 2, node 4 uses the route forwarding flooding module 402 to transmit the AS update message in the sub-area 2. Node 5 in the sub-area 2 receives the AS update message through the route forwarding mode. Node 5 uses the hop-by-hop flooding module 406 to send the AS update message to node 8 through the hop-by-hop flooding mode. Node 8 uses the hop-by-hop flooding module 406 to send the AS update message to node 9 through the hop-by-hop flooding mode. In this way, node 9 receives the AS update message. At each node receiving the AS update message or the sub-area update message, if the link state indicated by the AS update message does not exist in the node, the node updates the link state indicated by the AS update message. In Figure 15 In the figure, the solid arrowed line indicates the optimal process of transmitting the link state from node 1 to node 9, and the dashed arrowed line indicates the optimal process of transmitting the link state to other nodes.

[0173] It should be noted that, although the solid arrowed line directly connects node 4 to node 5, it only indicates that the destination address of the AS update message sent by node 4 to node 5 is the address of node 5. Similarly, the dashed arrowed line directly connects node 4 to some nodes, which also indicates that the destination address of the AS update message sent by node 4 to the some nodes is the address of the some nodes. That is, the node forwarding the AS update message in the sub-area 2 does not need to be processed in the control plane. In this way, flooding acceleration can be achieved within the sub-area. Compared with the hop-by-hop flooding mode, the flooding link state is reduced from the original 8 hops to 6 hops.

[0174] In addition, it should be noted that, in Figure 15 a physical link is established between adjacent nodes, Figure 16 which is not shown in the figure.

[0175] In addition, in order to better understand the process of updating the link state in the embodiments of the present application, as Figure 17 shown in the figure, the embodiments of the present application also provide the following process:

[0176] Step 1601, a first node obtains a first update message;

[0177] Step 1602, a flooding mode selection module 401 in the first node determines whether the link state indicated by the first update message belongs to a first sub-area.

[0178] Step 1603, in the case of belonging to the first sub-area, the first node uses a hop-by-hop flooding module 406 to flood the first update message in the first sub-area through the hop-by-hop flooding mode.

[0179] Step 1604, in the case of judging that the first node does not belong to the first sub-region, the first node uses the route forwarding flooding module 402 to perform flooding of the first update message in the first sub-region by using the route forwarding transmission mode.

[0180] Step 1605, the first node uses the hop-by-hop flooding module 406 to diffuse the first update message to the nodes outside the first sub-region by using the hop-by-hop flooding transmission mode.

[0181] In the embodiments of the present application, a method for determining the sub-regions in the AS is also provided, which is described below by taking the first node determining the sub-regions as an example. Figure 17 As shown in FIG. 17, the execution flow is as follows:

[0182] Step 1701, the first node acquires the network topology of the AS, the number of sub-regions in the AS, and the radius of the sub-regions, wherein the radius of the sub-region is the node number of the boundary node of the sub-region to the center node of the sub-region.

[0183] In the embodiments, the first node can acquire the configured number of sub-regions and the radius of the sub-regions. The first node can obtain the network topology of the AS based on the diffusion of the link state of the nodes in the AS based on the hop-by-hop transmission mode, or the first node acquires the configured network topology of the AS.

[0184] Alternatively, the first node obtains the network topology of the AS, the number of sub-regions in the AS, and the radius of the sub-regions from the management device of the AS.

[0185] Step 1702, the first node determines the center nodes of the sub-regions in the AS according to the number of sub-regions in the AS and the network topology.

[0186] In the embodiments, the first node can use the network topology of the AS to determine the diameter of the network topology, which refers to the connection line of the two nodes farthest apart in the network topology. Then the first node divides the diameter into a certain number of parts, and the certain number is equal to the number of sub-regions plus 1. The first node selects the dividing points of the adjacent two parts in the divided diameter, and determines the dividing points as the center nodes of the sub-regions in the AS.

[0187] Step 1703, the first node determines the nodes in the sub-regions in the AS according to the distance between the nodes other than the center nodes of the sub-regions in the AS and the center nodes of the sub-regions in the AS, and the radius of the sub-regions.

[0188] In the embodiment, for any node in the AS except the center nodes of the sub-areas, the first node can determine the distance between the node and the center nodes of the sub-areas. If the distance between the node and the center nodes of all the sub-areas is greater than the radius of the sub-area, the first node controls the node not to join any sub-area. If the distance between the node and the center node of at least one sub-area is less than the radius of the sub-area, the first node joins the node in the sub-area with the smallest distance to the center node. If the distance between the node and the center nodes of multiple sub-areas is less than the radius of the sub-area and the distances are the same, the first node calculates the average distance of the distance between the node and all the nodes in each sub-area, and the first node joins the node in the sub-area with the smallest average distance, or optionally one of them.

[0189] For the flow of Figure 18 , an example as shown in Figure 19 is also provided, the AS includes 18 nodes, R1 to R16. The first node obtains the number of sub-areas in the AS as 2, and the radius of the sub-area as 2. The first node obtains the diameter of the network topology as R1-R2-R4-R6-R8-R10-R12-R14-R16, and divides the diameter into 3 parts, i.e. R1-R2-R4-R6, R6-R8-R10-R12, and R12-R14-R16. R6 and R12 are selected as the center nodes of the two sub-areas, corresponding to the two initialized sub-areas, i.e. sub-area a={R6} and sub-area b={R12}.

[0190] For the remaining 14 nodes, the first node determines the distance between the 14 nodes and R6 and R14 respectively, and determines the sub-area a={R2, R3, R4, R5, R6, R7, R8} and the sub-area b={R9, R10, R11, R12, R13, R14, R16} based on the distance.

[0191] Each node can determine the sub-area in the AS by using the method of determining the sub-area by the first node. Since each node obtains the same network topology of the AS, the number of sub-areas in the AS, and the radius of the sub-area, and uses the same method to determine the sub-area, the sub-area determined by each node is the same.

[0192] The above is the first node determining the center node of the sub-area. Of course, in the embodiment of the present application, the first node can also acquire the configured center node of the sub-area and the radius of the sub-area. The first node determines the sub-area based on the center node of the sub-area and the radius of the sub-area. The manner of determining the sub-area is shown in the processing procedure of step 1703, which is not described here. In addition, in the embodiment of the present application, the technician can configure the sub-area in the AS in the first node, without the need for the first node to determine. The above is only an example of the first node, and other nodes determine the sub-area in the same manner. Or the first node determines the sub-area and provides it to other nodes in the AS. Or the management device of the AS determines the sub-area of the AS and provides it to each node in the AS.

[0193] It should be noted that each node in the AS cannot belong to multiple sub-areas at the same time.

[0194] In the embodiment, when the link state belongs to a link outside the sub-area, the routing forwarding transmission mode can be used to flood the link state in the sub-area, without using the hop-by-hop transmission flooding mode, so that the link state can be quickly flooded in the sub-area, and then the link state can be quickly flooded in the AS. Moreover, the AS includes one or more sub-areas, and when there is a link failure in a certain sub-area, the link state can be quickly flooded in the sub-area by using the routing forwarding flooding module 402, so that the convergence in the sub-area can be quickly completed, without affecting the nodes outside the sub-area, so that the failure can be isolated and the network reliability can be improved.

[0195] Figure 7 FIG. 1 is a structural diagram of an apparatus for updating a link state provided in the embodiment of the present application. The apparatus can be realized as part or all of the apparatus by software, hardware, or a combination of both. The apparatus provided in the embodiment of the present application can implement the method provided in the embodiment of the present application Figure 20 The flow, the apparatus is applied to a first node in an AS, the AS includes at least one sub-area, the at least one sub-area includes a first sub-area, the first sub-area includes the first node, and the apparatus includes an acquisition module 1910, an update module 1920, and a sending module 1930. The acquisition module 1910 can be the interface card 405 mentioned above. The sending module 1930 can be an integration of the flooding mode selection module 401, the routing forwarding flooding module 402, and the hop-by-hop flooding module 406 mentioned above, in which:

[0196] The acquisition module 1910 is configured to acquire a first update message, the first update message being used to indicate a link state of a first link, the first link being a link outside the first sub-area, and being configured to implement the acquisition function of step 701 and the implicit steps included in step 701.

[0197] The updating module 1920 is configured to update the link state indicated by the first update message if the link state indicated by the first update message does not exist in the first node, and can be specifically configured to implement the updating function of step 702 and perform the implicit steps included in step 702.

[0198] The sending module 1930 is configured to send the first update message to the nodes in the first sub-region except the first node by a routing and forwarding transmission mode, and can be specifically configured to implement the sending function of step 703 and perform the implicit steps included in step 703.

[0199] In a possible implementation, the first node is a node that first acquires the first update message among all the nodes in the first sub-region.

[0200] In a possible implementation, the sending module 1930 is configured to:

[0201] determine routing information, the routing information being used for sending a packet to a second node in the first sub-region, the first node and the second node being non-adjacent nodes;

[0202] send the first update message to the second node according to the routing information.

[0203] In a possible implementation, the sending module 1930 is configured to:

[0204] send the first update message to the nodes in the first sub-region except the first node by TCP.

[0205] In a possible implementation, the acquiring module 1910 is configured to:

[0206] generate the first update message when the first link fault is detected, the first update message being used for indicating that the link state of the first link is a fault state, the first link being a link through which the first node connects a neighbor node outside the first sub-region; or

[0207] receive the first update message sent by the neighbor node outside the first sub-region.

[0208] In a possible implementation, the sending module 1930 is further configured to:

[0209] send the first update message to the neighbor node outside the first sub-region by a hop-by-hop delivery flooding mode.

[0210] In a possible implementation, the sending module 1930 is further configured to:

[0211] The first update message is sent to a neighbor node in the first sub-region by a hop-by-hop delivery flooding manner.

[0212] In a possible implementation, the obtaining module 1910 is further configured to receive a second update message sent by a third node in the first sub-region, where the second update message is used to indicate a link state of a second link, and the second link is a link in the first sub-region.

[0213] The updating module 1920 is further configured to update the link state indicated by the second update message if the link state indicated by the second update message does not exist in the first node.

[0214] In a possible implementation, the obtaining module 1910 is further configured to receive the second update message by TCP.

[0215] The sending module 1930 is further configured to send the second update message to a neighbor node outside the first sub-region by a hop-by-hop delivery flooding manner.

[0216] In a possible implementation, the obtaining module 1910 is further configured to receive the second update message by a hop-by-hop delivery flooding manner.

[0217] The sending module 1930 is further configured to send the second update message to a neighbor node other than the third node by a hop-by-hop delivery flooding manner.

[0218] In a possible implementation, the sending module 1930 is further configured to:

[0219] Before sending the first update message to a node other than the first node in the first sub-region by a routing forwarding transmission manner, it is determined that the first link does not belong to the first sub-region.

[0220] The division of the modules in the embodiments of the present application is illustrative, and is merely a logical function division. In actual implementation, another division manner can also be used. In addition, each function module in each embodiment of the present application can be integrated in one processor, or can be physically separated, or two or more modules can be integrated into one module. The above integrated module can be realized in the form of hardware, or in the form of a software function module.

[0221] Figure 14 FIG. 1 is a structural diagram of an apparatus for updating a link state provided in an embodiment of the present application. The apparatus can be realized as part or all of the apparatus by software, hardware, or a combination of both. The apparatus provided in the embodiments of the present application can implement the methods provided in the embodiments of the present application. Figure 21The flow is applied to a first node in an AS, the AS includes at least one sub-area, the at least one sub-area includes a first sub-area, the first sub-area includes the first node, and the device includes a generating module 2010 and a sending module 2020. The generating module 2010 can be an integration of the previously mentioned flooding mode selection module 401, the routing forwarding flooding module 402 and the hop-by-hop flooding module 406, and the sending module 2020 can be the previously mentioned interface card 405.

[0222] The generating module 2010 is configured to detect a first link fault, generate an AS update message and a sub-area update message. The AS update message is used to indicate a link state of the first link to nodes in the AS, and the sub-area update message is used to indicate the link state of the first link to nodes in the first sub-area. The first link is a link connecting the first node and a neighbor node in the first sub-area. The generating module 2010 can be specifically used to implement the generating function of step 1401 and perform the implicit steps included in step 1401.

[0223] The sending module 2020 is configured to send the AS update message and the sub-area update message. The sending module 2020 can be specifically used to implement the sending function of step 1402 and perform the implicit steps included in step 1402.

[0224] In a possible implementation, the sending module 2020 is configured to:

[0225] send the sub-area update message to neighbor nodes in the first sub-area except for the neighbor node connected by the first link through a hop-by-hop delivery flooding mode;

[0226] send the AS update message to neighbor nodes of the first node except for the neighbor node connected by the first link through the hop-by-hop delivery flooding mode.

[0227] The division of the modules in the embodiments of the present application is illustrative, and is merely a logical function division. In actual implementation, another division mode can also be used. In addition, the function modules in each embodiment of the present application can be integrated in one processor, or can be physically separated, or two or more modules can be integrated into one module. The integrated module can be realized in the form of hardware or in the form of a software function module.

[0228] Figure 11 Fig. 1 is a structural diagram of an apparatus for updating a link state provided in an embodiment of the present application. The apparatus can be realized as part or all of the apparatus in the form of software, hardware or a combination of both. The apparatus provided in the embodiments of the present application can implement the methods provided in the embodiments of the present application. Figure 22The flow, the device is applied to an AS, the AS includes at least one sub-region, the at least one sub-region includes a first sub-region, the first sub-region includes a first node and a target node, and the device includes a receiving module 2110 and an updating module 2120, the receiving module 2110 can be the interface card 405 mentioned in the foregoing, and the updating module 2120 is not shown in the foregoing, wherein:

[0229] The receiving module 2110 is configured to receive a first update message sent by the first node by using a route forwarding transmission mode, and the first update message is used to indicate a link state of a first link outside the first sub-region.

[0230] The updating module 2120 is configured to update the link state indicated by the first update message, if the link state indicated by the first update message does not exist in the target node.

[0231] In a possible implementation, the receiving module 2110 is further configured to receive the first update message sent by the first node by using a hop-by-hop delivery flooding mode.

[0232] The updating module 2120 is further configured to update the link state indicated by the first update message, if the link state indicated by the first update message does not exist in the target node.

[0233] In a possible implementation, as shown in the figure, Figure 23 The device further includes:

[0234] The sending module 2130 is configured to send the first update message to a neighbor node outside the first sub-region by using a hop-by-hop delivery flooding mode, and the sending module 2130 can be an integration of the flooding mode selection module 401, the route forwarding flooding module 402 and the hop-by-hop flooding module 406 mentioned in the foregoing.

[0235] The division of the modules in the embodiments of the present application is illustrative, and is merely a logical function division; when actually implemented, another division mode can also be used; in addition, each function module in each embodiment of the present application can be integrated in one processor, or can be physically separated, or two or more modules can be integrated into one module. The integrated module can be realized in the form of hardware, or in the form of a software function module.

[0236] Figure 17Figure 1 is a structural diagram of a device for determining sub-regions provided in an embodiment of the present application. The device can be implemented as part or all of the device by software, hardware or a combination of both. The device provided in an embodiment of the present application can implement the method provided in an embodiment of the present application ​ The flow, the device is applied to a node in an AS, and the device includes an acquisition module 2310 and a determination module 2320. The acquisition module 2310 and the determination module 2320 can be the sub-region acquisition module 407 mentioned above. The device provided in an embodiment of the present application can implement the method provided in an embodiment of the present application

[0237] The acquisition module 2310 is configured to acquire a network topology of the AS, a number of sub-regions in the AS and a radius of a sub-region, the radius of the sub-region being a number of nodes between a boundary node of the sub-region and a center node of the sub-region. The acquisition module 2310 can be specifically configured to implement an acquisition function of step 1701 and perform implicit steps included in step 1701.

[0238] The determination module 2320 is configured to:

[0239] determine the center node of each sub-region in the AS according to the number of sub-regions in the AS and the network topology;

[0240] determine a node in each sub-region in the AS according to distances between other nodes in the AS except the center nodes of the sub-regions and the center nodes of the sub-regions in the AS and the radius of the sub-region. The determination module 2320 can be specifically configured to implement a determination function of step 1702 and perform implicit steps included in step 1702.

[0241] The division of the modules in the embodiments of the present application is illustrative, and is merely a logical function division. In actual implementation, another division manner can be used. In addition, each function module in each embodiment of the present application can be integrated in one processor, or can be physically separated, or two or more modules can be integrated into one module. The integrated module can be implemented in the form of hardware or in the form of a software function module.

[0242] In the embodiments described above, all or part of the embodiments can be implemented by software, hardware, firmware or any combination thereof, and when implemented by software, all or part of the embodiments can be implemented in the form of a computer program product. The computer program product includes one or more computer instructions, and when the computer program instructions are loaded and executed on a server or terminal, all or part of the processes or functions described in the embodiments of the present application are generated. 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 one website site, computer, server or data center to another website site, computer, server or data center through wired (such as coaxial cable, optical fiber, digital subscriber line) or wireless (such as infrared, wireless, microwave, etc.). The computer readable storage medium can be any available medium accessible by a server or terminal or a data storage device such as a server, data center, etc. integrated with one or more available media. The available media can be a magnetic medium (such as a floppy disk, a hard disk and a magnetic tape, etc.), an optical medium (such as a digital video disk (Digital Video Disk, DVD), etc.), or a semiconductor medium (such as a solid state disk, etc.).

Claims

1. A method of updating a link state, characterized by, The method is applied to an autonomous system (AS), the AS comprises at least one sub-area, the at least one sub-area comprises a first sub-area, the first sub-area comprises a first node, and the method comprises the following steps: The first node acquires a first update message, the first update message is used for indicating a link state of a first link; If the link state indicated by the first update message does not exist in the first node, the first node updates the link state indicated by the first update message; In a case where the first link is a link outside the first sub-area, the first node transmits the first update message to nodes in the first sub-area except the first node by a route forwarding transmission mode, the route forwarding mode is a forwarding mode in which the first update message only passes through a data plane forwarding when passing through a transit node and does not pass through a control plane processing. In a case where the first link is a link inside the first sub-area, the first node transmits the first update message to neighbor nodes inside the first sub-area by a hop-by-hop transmission flooding mode.

2. The method of claim 1, wherein, The first node is a node that first acquires the first update message among all nodes in the first sub-area.

3. The method according to claim 1 or 2, characterized in that, The first node transmits the first update message to nodes in the first sub-area except the first node by a route forwarding transmission mode, comprising the following steps: The first node determines route information, the route information is used for transmitting a packet to a second node inside the first sub-area, the first node and the second node are non-adjacent nodes; The first node transmits the first update message to the second node according to the route information.

4. The method according to claim 1 or 2, characterized in that, The first node transmits the first update message to nodes in the first sub-area except the first node by a route forwarding transmission mode, comprising the following steps: The first node transmits the first update message to nodes in the first sub-area except the first node by a transmission control protocol (TCP).

5. The method according to claim 1 or 2, characterized in that, The first node acquires a first update message, comprising the following steps: The first node detects that the first link is faulty, generates the first update message, the first update message is used for indicating that a link state of the first link is a fault state, the first link is a link connecting a neighbor node outside the first sub-area to the first node; or The first node receives the first update message transmitted by the neighbor node outside the first sub-area.

6. The method of claim 1 or 2, wherein, The method further comprises the following steps: The first node transmits the first update message to the neighbor node outside the first sub-area by a hop-by-hop transmission flooding mode.

7. The method according to claim 1 or 2, characterized in that, In a case where the first link is a link outside the first sub-area, the method further comprises the following steps: The first node transmits the first update message to neighbor nodes inside the first sub-area by a hop-by-hop transmission flooding mode.

8. The method of claim 1 or 2, wherein, The method further comprises the following steps: The first node receives a second update message transmitted by a third node in the first sub-area, the second update message is used for indicating a link state of a second link, and the second link is a link inside the first sub-area. If the link state indicated by the second update message does not exist in the first node, the first node updates the link state indicated by the second update message.

9. The method of claim 8, wherein, The first node receives a second update message sent by a third node in the first sub-area, including: The first node receives the second update message through TCP; The method further includes: The first node sends the second update message to neighbor nodes outside the first sub-area through the hop-by-hop delivery flooding manner.

10. The method of claim 8, wherein, The first node receives a second update message sent by a third node in the first sub-area, including: The first node receives the second update message through the hop-by-hop delivery flooding manner; The method further includes: The first node sends the second update message to neighbor nodes other than the third node through the hop-by-hop delivery flooding manner.

11. A method of updating a link state, characterized by, The method is applied to an autonomous system (AS), the AS includes at least one sub-area, the at least one sub-area includes a first sub-area, the first sub-area includes a first node, and the method includes: The first node detects a first link failure, generates an AS update message and a sub-area update message, the AS update message is used to indicate a link state of the first link to nodes in the AS, the sub-area update message is used to indicate the link state of the first link to nodes in the first sub-area, and the first link is a link connecting the first node and a neighbor node in the first sub-area; The first node sends the sub-area update message to neighbor nodes in the first sub-area other than the neighbor node connected by the first link through the hop-by-hop delivery flooding manner; The first node sends the AS update message to neighbor nodes of the first node other than the neighbor node connected by the first link through the hop-by-hop delivery flooding manner, so that neighbor nodes of the first node which do not belong to the first sub-area send the AS update message to nodes in the sub-area through a routing forwarding manner, and the routing forwarding manner is a forwarding manner in which the AS update message only passes through data plane forwarding when passing through a transit node and does not pass through control plane processing.

12. A method of updating a link state, characterized by, The method is applied to an autonomous system (AS), the AS includes at least one sub-area, the at least one sub-area includes a first sub-area, the first sub-area includes a first node and a target node, and the method includes: In a case where the first link is a link outside the first sub-area, the target node receives a first update message sent by the first node through a routing forwarding transmission manner, the first update message is used to indicate a link state of the first link, and the routing forwarding manner is a forwarding manner in which the first update message only passes through data plane forwarding when passing through a transit node and does not pass through control plane processing. In a case where the first link is a link in the first sub-area, the target node receives a first update message sent by the first node through a hop-by-hop flooding manner. If the link state indicated by the first update message does not exist in the target node, the target node updates the link state indicated by the first update message.

13. The method of claim 12, wherein, In a case where the first link is a link outside the first sub-region, the method further comprises: The target node receives the first update message sent by the first node in a hop-by-hop delivery flooding manner.

14. The method according to claim 12 or 13, characterized in that, The method further comprises: The target node sends the first update message to a neighbor node outside the first sub-region in a hop-by-hop delivery flooding manner.

15. An apparatus for updating a link state, the apparatus comprising: The application is applied to an autonomous system (AS), and the AS comprises at least one sub-region, the at least one sub-region comprises a first sub-region, the first sub-region comprises a first node, and the application is applied to the first node, and the application comprises: An obtaining module is configured to obtain a first update message, the first update message being used to indicate a link state of a first link; An updating module is configured to, if the link state indicated by the first update message does not exist in the first node, update the link state indicated by the first update message. A sending module is configured to: In a case where the first link is a link outside the first sub-region, the sending module is configured to send the first update message to a node in the first sub-region except the first node in a route forwarding transmission manner, the route forwarding manner being a forwarding manner in which the first update message only passes through a data plane for forwarding when passing through a transit node, and does not pass through a control plane for processing. In a case where the first link is a link inside the first sub-region, the first node sends the first update message to a neighbor node inside the first sub-region in a hop-by-hop delivery flooding manner.

16. The apparatus of claim 15, wherein, The first node is a node that first obtains the first update message among all nodes in the first sub-region.

17. The apparatus of claim 15 or 16, wherein, The sending module is configured to: Determine routing information, the routing information being used to send a packet to a second node in the first sub-region, the first node and the second node being non-adjacent nodes; and Send the first update message to the second node according to the routing information.

18. The apparatus of claim 15 or 16, wherein, The sending module is configured to: Send the first update message to a node in the first sub-region except the first node in a transmission control protocol (TCP).

19. The apparatus of claim 15 or 16, wherein, The obtaining module is configured to: Detect that the first link is faulty, and generate the first update message, the first update message being used to indicate that a link state of the first link is a fault state, the first link being a link through which the first node connects a neighbor node outside the first sub-region; or Receive the first update message sent by a neighbor node outside the first sub-region.

20. The apparatus of claim 15 or 16, wherein, The sending module is further configured to: Send the first update message to a neighbor node outside the first sub-region in a hop-by-hop delivery flooding manner.

21. The apparatus of claim 15 or 16, wherein, The sending module is further configured to: In a case where the first link is a link outside the first sub-region, send the first update message to a neighbor node inside the first sub-region in a hop-by-hop delivery flooding manner.

22. The apparatus of claim 15 or 16, wherein, The obtaining module is further configured to receive a second update message sent by a third node in the first sub-region, the second update message being used to indicate a link state of a second link, the second link being a link within the first sub-region; The updating module is further configured to update the link state indicated by the second update message if the link state indicated by the second update message does not exist in the first node.

23. The apparatus of claim 22, wherein, The obtaining module is further configured to receive the second update message through TCP. The sending module is further configured to send the second update message to a neighbor node outside the first sub-region through the hop-by-hop delivery flooding manner.

24. The apparatus of claim 22, wherein, The obtaining module is further configured to receive the second update message through the hop-by-hop delivery flooding manner. The sending module is further configured to send the second update message to a neighbor node other than the third node through the hop-by-hop delivery flooding manner.

25. An apparatus for updating a link state, the apparatus comprising: The application is applied to an autonomous system (AS), the AS includes at least one sub-region, the at least one sub-region includes a first sub-region, the first sub-region includes a first node, the application is applied to the first node, and the application includes: A generating module is configured to detect a first link fault, generate an AS update message and a sub-region update message, the AS update message being used to indicate a link state of the first link to nodes in the AS, and the sub-region update message being used to indicate the link state of the first link to nodes within the first sub-region, the first link being a link connecting the first node and a neighbor node within the first sub-region; A sending module is configured to: send the sub-region update message to a neighbor node other than the neighbor node connected by the first link among neighbor nodes within the first sub-region through the hop-by-hop delivery flooding manner; send the AS update message to a neighbor node other than the neighbor node connected by the first link among neighbor nodes of the first node through the hop-by-hop delivery flooding manner, so that a neighbor node not belonging to the first sub-region among the neighbor nodes of the first node sends the AS update message to nodes in a sub-region to which the neighbor node belongs through a routing forwarding manner, the routing forwarding manner being a forwarding manner in which the AS update message only passes through data plane forwarding and does not pass through control plane processing when passing through a relay node.

26. An apparatus for updating a link state, the apparatus comprising: The application is applied to an autonomous system (AS), the AS includes at least one sub-region, the at least one sub-region includes a first sub-region, the first sub-region includes a first node and a target node, the application is applied to the target node, and the application includes: A receiving module is configured to: receive a first update message sent by the first node through a routing forwarding transmission manner in a case where a first link is a link outside the first sub-region, the first update message being used to indicate a link state of the first link, the routing forwarding manner being a forwarding manner in which the first update message only passes through data plane forwarding and does not pass through control plane processing when passing through a relay node; receive a first update message sent by the first node through a hop-by-hop flooding manner in a case where the first link is a link within the first sub-region. An updating module, configured to update the link state indicated by the first update message if the link state indicated by the first update message does not exist in the target node.

27. The apparatus of claim 26, wherein, The receiving module is further configured to receive the first update message sent by the first node by a hop-by-hop delivery flooding manner if the first link is a link outside the first sub-region.

28. The apparatus of claim 26 or 27, wherein, The apparatus further includes: A sending module, configured to send the first update message to a neighbor node outside the first sub-region by a hop-by-hop delivery flooding manner.

29. A computing device, comprising: The computing device includes a processor and a memory, wherein: The memory has stored computer instructions; The processor executes the computer instructions to implement the method in any one of claims 1-14.

30. A computer-readable storage medium, characterized in that, The computer readable storage medium has stored computer instructions, when the computer instructions in the computer readable storage medium are executed by a computing device, cause the computing device to execute the method in any one of claims 1-14.

Images