A computing power routing oscillation detection method, related equipment, storage medium and computer program product

Abstract

This application provides a method, related equipment, storage medium, and computer program product for detecting routing oscillations. The method is applied to a first node and includes: the first node receiving a first message sent by a second node; wherein the first message includes at least first information, which includes one or more of the second node's first identification information, first computing power information, and first routing information; and determining whether routing oscillations exist based on the first information. That is, the first node can determine whether routing oscillations exist based on the first information carried in the first message, without requiring a globally shared routing policy in the Autonomous System (AS), thereby quickly detecting whether routing oscillations exist and improving the detection efficiency of routing oscillations.

Description

Technical Field

[0001] This application relates to the field of computing power networks, and in particular to a method for detecting computing power routing oscillations, related equipment, storage media, and computer program products. Background Technology

[0002] Computing power has become a crucial infrastructure for the digital industry, and the trend of extending computing power to the edge and even beyond the edge is growing. Simultaneously, computing power networks are evolving from traditional topology routing to computing power routing, which can be broadly categorized into centralized and distributed computing power routing schemes. Distributed routing schemes primarily rely on extending existing Interior Gateway Protocols (IGPs) and Border Gateway Protocols (BGPs) to transmit computing power information. BGP allows each Autonomous System (AS) to independently formulate and regulate its routing policies for local justification, often leading to policy conflicts. Numerous studies have shown that BGP policy conflicts can cause routing oscillations.

[0003] Currently, when detecting BGP route oscillations, each AS needs to globally share its routing policies or historical routing information. However, for BGP route security, many ASs do not globally share their routing policies or historical routing information, which makes the route oscillation detection process time-consuming and reduces the efficiency of route oscillation detection. Summary of the Invention

[0004] This application provides a method, related equipment, storage medium, and computer program product for detecting routing oscillations, which can improve the detection efficiency of routing oscillations and does not require a globally shared routing policy in the AS.

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

[0006] In a first aspect, embodiments of this application provide a method for detecting computing power routing oscillations, the method being applied to a first node, the method comprising:

[0007] Receive a first message sent by a second node; wherein the first message includes at least first information, the first information including one or more of the second node's first identification information, first computing power information, and first routing information;

[0008] Based on the first piece of information, determine whether routing oscillations exist.

[0009] Secondly, embodiments of this application provide a method for detecting computing power routing oscillations, the method being applied to a second node, the method comprising:

[0010] When the current computing power information and / or the current routing information is updated, the first information is generated based on one or more of the first identification information, the first computing power information and the first routing information of the second node;

[0011] A first message is generated based on the first information, and the first message is sent to the first node so that the first node can perform route oscillation detection processing based on the first message.

[0012] Thirdly, embodiments of this application provide a first node, which includes: a receiving unit and a judging unit; wherein...

[0013] The receiving unit is configured to receive a first message sent by the second node; wherein the first message includes at least first information, and the first information includes one or more of the second node's first identification information, first computing power information, and first routing information;

[0014] The judgment unit is used to determine whether there is routing oscillation based on the first information.

[0015] Fourthly, embodiments of this application provide a first node, the first node comprising: a first processor and a first memory; wherein,

[0016] The first memory is used to store computer programs that can run on the processor;

[0017] The first processor is configured to execute the computing power routing oscillation detection method as described above when running the computer program.

[0018] Fifthly, embodiments of this application provide a second node, the second node comprising: a generating unit and a sending unit; wherein,

[0019] The generation unit is configured to generate first information based on one or more of the first identification information, first computing power information, and first routing information of the second node when the current computing power information and / or the current routing information is detected to be updated; and to generate a first message based on the first information.

[0020] The sending unit is used to send the first message to the first node so that the first node can perform routing oscillation detection processing based on the first message.

[0021] Sixthly, embodiments of this application provide a second node, the second node comprising: a second processor and a second memory; wherein,

[0022] The second memory is used to store computer programs that can run on the processor;

[0023] The second processor is configured to execute the computing power routing oscillation detection method as described above when running the computer program.

[0024] In a seventh aspect, embodiments of this application provide a computer-readable storage medium storing computer program code, which, when executed by a computer, implements the computing power routing oscillation detection method as described above.

[0025] Eighthly, embodiments of this application provide a computer program product, including a computer program that, when executed by a processor, implements the computing power routing oscillation detection method as described above.

[0026] This application provides a method, related equipment, storage medium, and computer program product for detecting computing power routing oscillations. A first node receives a first message sent by a second node. The first message includes at least first information, which includes one or more of the second node's first identification information, first computing power information, and first routing information. Based on the first information, it is determined whether routing oscillations exist. When the second node detects that the current computing power information and / or the current routing information has been updated, it generates the first information based on one or more of the second node's first identification information, first computing power information, and first routing information. Based on the first information, a first message is generated and sent to the first node. Therefore, when the second node detects that the current computing power information and / or the current routing information has been updated, it can generate first information based on one or more of the first identification information, the first computing power information, and the first routing information of the second node. Then, it can generate a first message based on the first information and send the first message to the first node, so that the first node can determine whether there is routing oscillation based on the first information carried by the first message. That is, the embodiments of this application can detect computing power routing oscillation by using the first information sent by neighboring nodes, without the need for AS global shared routing policy, so as to quickly detect whether there is BGP routing oscillation, thereby improving the detection efficiency of routing oscillation. Attached Figure Description

[0027] Figure 1 This is a schematic diagram of the computing power routing oscillation detection method proposed in the embodiments of this application. Figure 1 ;

[0028] Figure 2 This is a schematic diagram of the computing power routing oscillation detection method proposed in the embodiments of this application. Figure 2 ;

[0029] Figure 3 This is a schematic diagram of the first preset field structure proposed in the embodiments of this application;

[0030] Figure 4 This is a schematic diagram of the computing power routing oscillation detection method proposed in the embodiments of this application. Figure 3 ;

[0031] Figure 5 A schematic diagram of the composition structure of the first node proposed in the embodiments of this application. Figure 1 ;

[0032] Figure 6 A schematic diagram of the composition structure of the first node proposed in the embodiments of this application. Figure 2 ;

[0033] Figure 7 A schematic diagram of the composition structure of the second node proposed in the embodiments of this application. Figure 1 ;

[0034] Figure 8 A schematic diagram of the composition structure of the second node proposed in the embodiments of this application. Figure 2 . Detailed Implementation

[0035] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are only for explaining the relevant application and not for limiting the application. Furthermore, it should be noted that, for ease of description, only the parts related to the relevant application are shown in the accompanying drawings.

[0036] Computing power has become a crucial infrastructure for the digital industry, and the trend of extending computing power to the edge and even beyond the edge is gaining momentum. Simultaneously, with the diversification of industry computing power demands and the enhancement of terminal computing power, ubiquitous computing power will become a new industry paradigm. Under the computing power network architecture, full-granularity computing power at the edge, device, and cloud becomes a resource that is visible, schedulable, and routable across the entire network. The computing power network is evolving from traditional topology routing to computing power routing, enabling entirely new network architectures and business deployment and delivery models, thus facilitating the digital transformation of the entire industry. In particular, cloud-based computing resources are shifting from the current closed model to an open model under the computing power network architecture, placing new demands on the granularity of computing power routing.

[0037] As one of the key technologies of computing power networks, computing power routing can be generally divided into centralized computing power routing schemes and distributed computing power routing schemes. Among them, centralized computing power routing schemes mainly rely on IPv6+ technologies, such as SRV6 and SR policy, to centrally orchestrate computing routes and complete end-to-end routing and flexible scheduling of computing power. Distributed routing schemes mainly rely on extending the original intra-domain IGP protocol and inter-domain BGP protocol to complete the transmission of computing power information.

[0038] BGP is a path vector protocol used to exchange routing information between ASs (Application Systems). It is currently the only inter-domain routing protocol used on the Internet. BGP allows each AS to independently formulate and regulate its routing policies for local justification, which often leads to policy conflicts. Many studies have shown that BGP policy conflicts can cause route oscillations, where each involved AS repeatedly selects the same BGP route. BGP route oscillations significantly reduce end-to-end network performance and decrease the overall efficiency of Internet infrastructure. There are two solutions to the BGP route oscillation problem: static and dynamic. Static solutions mainly rely on programs to pre-analyze routing policies to check for conflicts. Dynamic solutions use protocol extensions to suppress or completely prevent BGP route oscillations. Each AS must share its own policy information, as ASs cannot individually check for route oscillations. However, in reality, many ASs do not widely share their routing policies. Furthermore, the current BGP route oscillation solution, Damping, uses penalty values ​​to measure the stability of a route; higher penalty values ​​indicate greater instability. However, this method is ineffective for Internal Border Gateway Protocol (IBGP) neighbor routes.

[0039] In summary, currently, when detecting BGP route oscillations, each AS needs to globally share its routing policies or historical routing information. However, for BGP routing security, many ASs do not globally share their routing policies or historical routing information, resulting in a time-consuming route oscillation detection process and thus reducing the efficiency of route oscillation detection.

[0040] To address the issue of time-consuming routing oscillation detection processes, which reduces detection efficiency, this application provides a method, related equipment, storage medium, and computer program product for detecting routing oscillations. A first node receives a first message from a second node. The first message includes at least first information, which includes one or more of the second node's first identification information, first computing power information, and first routing information. Based on the first information, the system determines whether routing oscillations exist. When the second node detects an update to the current computing power information and / or the current routing information, it generates the first information based on one or more of the second node's first identification information, first computing power information, and first routing information. The system generates a first message based on the first information and sends the first message to the first node. Therefore, when the second node detects that the current computing power information and / or the current routing information has been updated, it can generate first information based on one or more of the first identification information, the first computing power information, and the first routing information of the second node. Then, it can generate a first message based on the first information and send the first message to the first node, so that the first node can determine whether there is routing oscillation based on the first information carried by the first message. That is, the embodiments of this application can detect computing power routing oscillation by using the first information sent by neighboring nodes, without the need for AS global shared routing policy, thereby quickly detecting whether there is BGP routing oscillation and improving the detection efficiency of routing oscillation.

[0041] The technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings.

[0042] This application provides a method for detecting computing power routing oscillations, which is applied to the first node. Figure 1 This is a schematic diagram of the computing power routing oscillation detection method proposed in the embodiments of this application. Figure 1 ,like Figure 1 As shown, the method for detecting computing power routing oscillations may include the following steps:

[0043] Step 101: Receive the first message sent by the second node; wherein the first message includes at least first information, and the first information includes one or more of the second node's first identification information, first computing power information, and first routing information.

[0044] In an embodiment of this application, the first node receives a first message sent by the second node.

[0045] It should be noted that in the embodiments of this application, the first node can be a neighbor node of the second node, such as an IBGP neighbor or an External Border Gateway Protocol (EBGP) neighbor of the second node. This application does not specifically limit the type of the first node.

[0046] It should be noted that, in the embodiments of this application, the second node can be any node that has undergone an optimal route change, and this application does not specifically limit the type of the second node.

[0047] It should be noted that, in the embodiments of this application, the first message may be an update message, and this application does not specifically limit the message type of the first message.

[0048] It should be noted that, in the embodiments of this application, the first information may include one or more of the first identification information, first computing power information and first routing information of the second node, or other information. This application does not specifically limit the number and type of information included in the first information.

[0049] It should be noted that, in the embodiments of this application, the composition structure of the first information can be as shown in the following formula (1).

[0050] BRTI = {ID, [M] old M new ],[R old ,R new ]} (1)

[0051] Where BRTI represents the first information, ID represents the first identification information, and M represents the first identification information. old M represents the computing power information before the update. new R represents the updated computing power information. old R represents the second routing information corresponding to the computing power information before the update. new This indicates the third routing information corresponding to the updated computing power information.

[0052] It should be noted that, in the embodiments of this application, the first identification information may include the node number, such as the router-ID of the BGP protocol, or generally the loopback address of the device (such as 1.1.1.1). This application does not specifically limit the information type of the first identification information.

[0053] It should be noted that, in the embodiments of this application, the first computing power information may include computing power information before the update and computing power information after the update.

[0054] It should be noted that in the embodiments of this application, the BGP route will change due to the change in computing power information. Therefore, the computing power information before the update and the computing power information after the update can correspond to different routing information.

[0055] It should be noted that, in the embodiments of this application, the first routing information includes the second routing information corresponding to the computing power information before the update and the third routing information corresponding to the computing power information after the update.

[0056] It should be noted that, in the embodiments of this application, the second routing information and the third routing information may be the same or different, and this application does not specifically limit the types of information included in the second routing information and the third routing information.

[0057] Step 102: Determine whether there is routing oscillation based on the first information.

[0058] In the embodiments of this application, after receiving the first message sent by the second node, the first node can determine whether there is routing oscillation based on the first information.

[0059] Furthermore, in the embodiments of this application, when the first node determines whether there is routing oscillation based on the first information, it can determine whether to update the current routing information based on the currently stored routing information, the second routing information, and the third routing information; if the current routing information is not updated, it is determined that there is no routing oscillation; if the current routing information is updated, it can determine whether there is routing oscillation based on the first identification information and the first routing information.

[0060] For example, in an embodiment of this application, when the first node determines whether to update the current routing information based on the currently stored routing information, the second routing information, and the third routing information, it can compare the second routing information and the third routing information with the current routing information. If the current routing information, i.e. the optimal path, has not changed, then the current routing information is not updated, and it is determined that there is no routing oscillation; if the optimal path has changed, then the current routing information is updated.

[0061] It should be noted that, in the embodiments of the application, when updating the current routing information, the first node can determine whether there is routing oscillation based on the first identification information and the first routing information.

[0062] It should be noted that, in the embodiments of the application, when the first node determines whether there is routing oscillation based on the first identification information and the first routing information, it can determine that there is routing oscillation if the second identification information stored locally is the same as the first identification information and the current routing information is partially or completely the same as the first routing information; or, if the second identification information is different from the first identification information, the first message is sent to the neighboring node corresponding to the first node, and the first routing information and the attribute information corresponding to the first routing information are stored.

[0063] In other words, in the embodiments of the application, the first node can determine whether there is routing oscillation based on the first identification information and the first routing information carried in the first message. If the ID of the node stored locally (i.e., the second identification information) is the same as the first identification information carried in the first message, and the current routing information is partially or completely the same as the first routing information, then it is determined that there is routing oscillation. That is, the embodiments of this application can quickly detect routing oscillation based on the local routing information carried in the first message, thereby improving the stability of the system and services, and thus improving resource utilization.

[0064] Furthermore, in the embodiments of this application, after determining that routing oscillation exists, the first node can perform routing oscillation suppression processing based on a first preset strategy; wherein, the first preset strategy includes at least actively performing routing oscillation suppression processing, and / or, reporting alarm information to the control device so that the control device performs routing oscillation suppression processing.

[0065] For example, in the embodiments of this application, after determining that routing oscillation exists, the first node can report an alarm to the controller through telemetry, and the controller can further react to suppress routing oscillation. Or, the first node can handle it itself, for example, it can set a preset period to parse the message messages with the same ID that have routing oscillation, but not send out a route update operation, thereby suppressing routing oscillation.

[0066] In summary, the first node can receive a first message sent by the second node. The first message includes at least first information, which includes one or more of the second node's first identification information, first computing power information, and first routing information. The first node can then determine whether routing oscillation exists based on the first identification information and first routing information carried in the first message. If the node ID (i.e., the second identification information) stored locally is the same as the first identification information carried in the first message, and the current routing information is partially or completely the same as the first routing information, then routing oscillation is determined to exist. That is, the embodiments of this application can quickly detect routing oscillation based on the local routing information carried in the first message, thereby improving the stability of the system and services, and thus improving resource utilization.

[0067] This application provides a method for detecting routing oscillations in computing power. The method is applied to a first node, which receives a first message sent by a second node. The first message includes at least first information, which includes one or more of the following: first identification information of the second node, first computing power information, and first routing information. The method determines whether routing oscillations exist based on the first information. Therefore, the first node can receive the first message sent by the second node and then determine whether routing oscillations exist based on the first information carried in the first message. In other words, this application embodiment can detect computing power routing oscillations through the first information sent by neighboring nodes, without requiring a globally shared routing policy in the AS (Autonomous System), thus enabling rapid detection of BGP routing oscillations and improving the detection efficiency.

[0068] Based on the above embodiments, another embodiment of this application provides a method for detecting computing power routing oscillations, which is applied to a second node. Figure 2 This is a schematic diagram of the computing power routing oscillation detection method proposed in the embodiments of this application. Figure 2 ,like Figure 2 As shown, the method for detecting computing power routing oscillations may include the following steps:

[0069] Step 201: When the current computing power information is detected and / or the current routing information is updated, generate first information based on one or more of the first identification information, first computing power information and first routing information of the second node.

[0070] In embodiments of this application, when the second node detects that the current computing power information and / or the current routing information has been updated, it can generate first information based on one or more of the first identification information, the first computing power information, and the first routing information of the second node.

[0071] It should be noted that, in the embodiments of this application, the second node can be any node that has undergone an optimal route change, and this application does not specifically limit the type of the second node.

[0072] It should be noted that, in the embodiments of this application, the first identification information may include the node number, such as the router-ID of the BGP protocol, or generally the loopback address of the device (such as 1.1.1.1). This application does not specifically limit the information type of the first identification information.

[0073] It should be noted that, in the embodiments of this application, the first computing power information may include computing power information before the update and computing power information after the update.

[0074] It should be noted that in the embodiments of this application, the BGP route will change due to the change in computing power information. Therefore, the computing power information before the update and the computing power information after the update can correspond to different routing information.

[0075] It should be noted that, in the embodiments of this application, the first routing information includes the second routing information corresponding to the computing power information before the update and the third routing information corresponding to the computing power information after the update.

[0076] Step 202: Generate a first message based on the first information and send the first message to the first node so that the first node can perform route oscillation detection processing based on the first message.

[0077] In the embodiments of this application, when the second node detects that the current computing power information and / or the current routing information has been updated, it can generate first information based on one or more of the first identification information, the first computing power information and the first routing information of the second node, and then generate a first message based on the first information and send the first message to the first node.

[0078] It should be noted that, in the embodiments of this application, the first message may be an update message, and this application does not specifically limit the type of the first message.

[0079] It should be noted that, in the embodiments of this application, when the second node generates the first message based on the first information, it can encapsulate the first information into the first preset field of the second message to generate the first message; wherein, the first preset field is used to characterize the attribute list of the first information, and the attribute list includes one or more of the following: attribute label, attribute type, attribute length, and attribute data.

[0080] It should be noted that, in the embodiments of this application, the second message may be an update message, and this application does not specifically limit the type of the second message.

[0081] It should be noted that, in the embodiments of this application, the first preset field can be a Path Attributes field, and this application does not specifically limit the type of the first preset field.

[0082] For example, in the embodiments of this application, Figure 3 This is a schematic diagram of the first preset field structure proposed in the embodiments of this application, as shown below. Figure 3 As shown, the type of the first preset field occupies 2 bytes and is divided into two fields: Flags (attribute label) and Type Code (attribute type value). Among them, the O, T, and E bits of Attr.Flags should be set to 1; O=1, T=1 indicates that the attribute is an optional transit attribute, that is, nodes that do not recognize the attribute will still receive the attribute and forward it to other BGP neighbors; E=1 indicates that the length of the attribute is extended to 2 bytes; the attribute type value (Type Code) is defined as follows: currently, the Internet Assigned Numbers Authority (IANA) defines 41-127 as unused numbers, and this application embodiment can temporarily use 41; the attribute data Data part can be used to represent the data of the first information. This application does not specifically limit the field type and number of fields included in the first preset field.

[0083] In summary, when the second node detects that the current computing power information and / or the current routing information has been updated, it can generate first information based on one or more of the first identification information, the first computing power information, and the first routing information of the second node, and encapsulate the first information into the first preset field of the second message to generate the first message. That is, in this embodiment of the application, the first information can be used as an extended attribute of BGP and transmitted to the BGP neighbor node (i.e., the first node) together with the update message (i.e. the first message) so that the first node can perform route oscillation detection processing based on the first message.

[0084] This application provides a method for detecting routing oscillations based on computing power. This method is applied to a second node. When the second node detects an update in current computing power information and / or current routing information, it generates first information based on one or more of its first identification information, first computing power information, and first routing information. Based on the first information, it generates a first message and sends the first message to the first node, enabling the first node to perform routing oscillation detection processing based on the first message. Therefore, the second node can generate first information based on one or more of its first identification information, first computing power information, and first routing information, and generate a first message based on the first information. The first message can then be sent to the first node, allowing the first node to perform routing oscillation detection processing based on the first message. This shortens the routing oscillation detection time and improves the detection efficiency.

[0085] Based on the above embodiments, another embodiment of this application provides a method for detecting computing power routing oscillations, which is applied to a first node and a second node. Figure 4 This is a schematic diagram of the computing power routing oscillation detection method proposed in the embodiments of this application. Figure 3 ,like Figure 4 As shown, the method for detecting computing power routing oscillations may include the following steps:

[0086] Step 301: When the second node detects that the current computing power information and / or the current routing information has been updated, it generates first information based on one or more of the first identification information, the first computing power information and the first routing information of the second node.

[0087] It should be noted that, in the embodiments of this application, the second node can be any node that has undergone an optimal route change, and this application does not specifically limit the type of the second node.

[0088] It should be noted that, in the embodiments of this application, the first identification information may include the node number, such as the router-ID of the BGP protocol, or generally the loopback address of the device (such as 1.1.1.1). This application does not specifically limit the information type of the first identification information.

[0089] It should be noted that, in the embodiments of this application, the first computing power information may include computing power information before the update and computing power information after the update.

[0090] It should be noted that in the embodiments of this application, the BGP route will change due to the change in computing power information. Therefore, the computing power information before the update and the computing power information after the update can correspond to different routing information.

[0091] It should be noted that, in the embodiments of this application, the first routing information includes the second routing information corresponding to the computing power information before the update and the third routing information corresponding to the computing power information after the update.

[0092] Step 302: The second node generates a first message based on the first information and sends the first message to the first node.

[0093] It should be noted that, in the embodiments of this application, the first message may be an update message, and this application does not specifically limit the type of the first message.

[0094] It should be noted that, in the embodiments of this application, when the second node generates the first message based on the first information, it can encapsulate the first information into the first preset field of the second message to generate the first message; wherein, the first preset field is used to characterize the attribute list of the first information, and the attribute list includes one or more of the following: attribute label, attribute type, attribute length, and attribute data.

[0095] It should be noted that, in the embodiments of this application, the second message may be an update message, and this application does not specifically limit the type of the second message.

[0096] It should be noted that, in the embodiments of this application, the first preset field can be a Path Attributes field, and this application does not specifically limit the type of the first preset field.

[0097] For example, in the embodiments of this application, such as Figure 3 As shown, the type of the first preset field occupies 2 bytes and is divided into two fields: Flags (attribute label) and Type Code (attribute type value). Among them, the O, T, and E bits of Attr.Flags should be set to 1; O=1, T=1 indicates that the attribute is an optional transit attribute, that is, nodes that do not recognize the attribute will still receive the attribute and forward it to other BGP neighbors; E=1 indicates that the attribute length is extended to 2 bytes; the attribute type value (Type Code) is defined as follows: currently, the Internet Assigned Numbers Authority (IANA) defines 41-127 as unused numbers, and this application embodiment can temporarily use 41; the attribute data Data part can be used to represent the data of the first information. This application does not specifically limit the field type and number of fields included in the first preset field.

[0098] It should be noted that in the embodiments of this application, the first node can be a neighbor node of the second node, such as an IBGP neighbor or an EBGP neighbor of the second node. This application does not specifically limit the type of the first node.

[0099] Step 303: The first node determines whether there is routing oscillation based on the first information.

[0100] Furthermore, in the embodiments of this application, when the first node determines whether there is routing oscillation based on the first information, it can determine whether to update the current routing information based on the currently stored routing information, the second routing information, and the third routing information; if the current routing information is not updated, it is determined that there is no routing oscillation; if the current routing information is updated, it can determine whether there is routing oscillation based on the first identification information and the first routing information.

[0101] For example, in an embodiment of this application, when the first node determines whether to update the current routing information based on the currently stored routing information, the second routing information, and the third routing information, it can compare the second routing information and the third routing information with the current routing information. If the current routing information, i.e. the optimal path, has not changed, then the current routing information is not updated, and it is determined that there is no routing oscillation; if the optimal path has changed, then the current routing information is updated.

[0102] It should be noted that, in the embodiments of the application, when updating the current routing information, the first node can determine whether there is routing oscillation based on the first identification information and the first routing information.

[0103] It should be noted that, in the embodiments of the application, when the first node determines whether there is routing oscillation based on the first identification information and the first routing information, it can determine that there is routing oscillation if the second identification information stored locally is the same as the first identification information and the current routing information is partially or completely the same as the first routing information; or, if the second identification information is different from the first identification information, the first message is sent to the neighboring node corresponding to the first node, and the first routing information and the attribute information corresponding to the first routing information are stored.

[0104] In other words, in the embodiments of the application, the first node can determine whether there is routing oscillation based on the first identification information and the first routing information carried in the first message. If the ID of the node stored locally (i.e., the second identification information) is the same as the first identification information carried in the first message, and the current routing information is partially or completely the same as the first routing information, then it is determined that there is routing oscillation. That is, the embodiments of this application can quickly detect routing oscillation based on the local routing information carried in the first message, thereby improving the stability of the system and services, and thus improving resource utilization.

[0105] Furthermore, in the embodiments of this application, after determining that routing oscillation exists, the first node can perform routing oscillation suppression processing based on a first preset strategy; wherein, the first preset strategy includes at least actively performing routing oscillation suppression processing, and / or, reporting alarm information to the control device so that the control device performs routing oscillation suppression processing.

[0106] For example, in the embodiments of this application, after determining that routing oscillation exists, the first node can report an alarm to the controller through telemetry, and the controller can further react to suppress routing oscillation. Or, the first node can handle it itself, for example, it can set a preset period to parse the message messages with the same ID that have routing oscillation, but not send out a route update operation, thereby suppressing routing oscillation.

[0107] In summary, when the second node detects an update in the current computing power information and / or the current routing information, it can generate first information based on one or more of the second node's first identification information, first computing power information, and first routing information. This first information is then encapsulated in the first preset field of the second message to generate the first message. In other words, this embodiment can treat the first information as an extended attribute of BGP and transmit it along with the update message (i.e., the first message) to the BGP neighbor node (i.e., the first node). The first node can then determine whether routing oscillation exists based on the first identification information and the first routing information carried in the first message. If the locally stored node ID (i.e., the second identification information) is the same as the first identification information carried in the first message, and the current routing information is partially or completely identical to the first routing information, then routing oscillation is determined to exist. This embodiment can quickly detect routing oscillation based on the local routing information carried in the first message, thereby improving system and service stability and ultimately increasing resource utilization.

[0108] This application provides a method for detecting computing power routing oscillations. The method is applied to a first node and a second node. The first node receives a first message sent by the second node. The first message includes at least first information, which includes one or more of the second node's first identification information, first computing power information, and first routing information. Based on the first information, it is determined whether routing oscillations exist. When the second node detects that the current computing power information and / or the current routing information has been updated, it generates the first information based on one or more of the second node's first identification information, first computing power information, and first routing information. Based on the first information, a first message is generated and sent to the first node. Therefore, when the second node detects that the current computing power information and / or the current routing information has been updated, it can generate first information based on one or more of the first identification information, the first computing power information, and the first routing information of the second node. Then, it can generate a first message based on the first information and send the first message to the first node, so that the first node can determine whether there is routing oscillation based on the first information carried by the first message. That is, the embodiments of this application can detect computing power routing oscillation by using the first information sent by neighboring nodes, without the need for AS global shared routing policy, thereby quickly detecting whether there is BGP routing oscillation and improving the detection efficiency of routing oscillation.

[0109] Based on the above embodiments, another embodiment of this application provides a method for detecting routing oscillations using computing power. This method can check for routing oscillations using local routing information of an AS domain, without requiring globally shared routing policies or historical routing information. Furthermore, this application embodiment detects BGP routing oscillations by defining BGP Routing Transmitting Information (BRTI), creating BRTI (i.e., first information), and transmitting BRTI. It also proposes an extension method and transmission method based on the BGP protocol, as well as a method for suppressing routing oscillations.

[0110] It should be noted that in the embodiments of this application, after the egress computing power router receives the computing power information of the cloud resource pool, the egress computing power router will use the BGP protocol to advertise the computing power information to the network. Each intermediate hop device will forward the BGP route update message, and finally the ingress computing power router will receive the target route. When a service arrives, it will forward the service message to the corresponding destination resource pool according to the destination address in the service message. Currently, the frequency of collecting computing power information will affect the sending of BGP messages, thus affecting the route selection. By default, the route advertisement period between IBGP neighbors is 15 seconds, and the advertisement period between EBGP neighbors is 30 seconds. Because computing power information changes constantly, when the computing power information changes, it will trigger BGP to send route update messages. When intermediate nodes receive the route update messages, route cancellation and updates will occur, which will cause route oscillation.

[0111] It should be noted that in the embodiments of this application, the network topology is assumed to be represented by G, where G = (N, E); where N represents network nodes and E represents edges connecting nodes. After the network protocol is enabled, the routing table is relatively stable, indicating that no path oscillation has occurred. Computing power information can be sent to neighbors along with the BGP route prefix attribute. Due to changes in computing power information, BGP routes will change, requiring the sending of route cancellation and announcement messages to BGP neighbors. Assuming the node experiencing route changes is marked as w, and r represents a route or path, let... The optimal route (i.e., third-party routing information) for node W after the change in computing power information. The optimal route (i.e., the second route information) is generated after the computing power information collected by node w last time.

[0112] It should be noted that in the embodiments of this application, an information structure BRTI (i.e., first information) is defined to represent the routing information before and after the change in computing power information and the changes in BGP routing information. BRTI (i.e., first information) can include three parts, as shown in the above formula (1), where ID represents the number of the network node, which can be the router-ID of the BGP protocol in actual use, generally the loopback address of the device (such as 1.1.1.1), M represents the specific changes in computing power information, which consists of the previous computing power information (i.e., computing power information before the update) and the current computing power information (updated computing power information), and R represents the changes in routing, which includes the previous best route (i.e., second routing information) and the best route after the change in routing information (i.e., third routing information). BRTI (i.e., first information) will be sent to the BGP neighbor node together with the update message (i.e., first message) as an extended attribute of BGP.

[0113] Furthermore, in the embodiments of this application, the rules for creating and transmitting BRTI may include the following: wherein, the principles for creating BRTI include: (1) if the current optimal path on the router (i.e., the second node) has not changed, the node (i.e., the second node) will not send a BGP route update message (i.e., the first message), nor will it create BRTI information (i.e., the first information); (2) if the current optimal route on the router changes, the node (i.e., the second node) will create a BGP route update message (i.e., the first message), and simultaneously create a BRTI message, which will be transmitted to BGP along with the BGP route update message. Neighbor (i.e., the first node); the rules for passing BRTI include: (1) When a border gateway node (i.e., the first node) receives a route update message (i.e., the first message) with BRTI from a neighbor node (i.e., the second node), if the current optimal path has not changed after the route decision, it does not need to forward the BRTI to other neighbor nodes, nor does it need to send BGP route update messages to other neighbor nodes; (2) If the current optimal path has changed after the route decision, the node must hand over the BRTI received without modification along with the local route update report to other neighbor nodes. The node only needs to record the ID information in the BRTI.

[0114] It should be noted that, in the embodiments of this application, the first node's use of BRTI to detect BGP route oscillation rules may include the following: (1) When the border network node (BGP speaker) receives the BRTI message (i.e., the first message), if the current optimal path has not changed after the path decision (i.e., the current routing information is not updated), then no route oscillation is detected; (2) Otherwise, the current and previous optimal paths of the BRTI are first recorded. Then, the ID (i.e., the first identification information) is extracted from the BRTI (i.e., the first information), and it is determined whether the ID (i.e., the first identification information) is the same as the ID (i.e., the second identification information) stored locally. If the IDs are different, the BRTI is forwarded. If the ID (i.e., the first identification information) is the same as the ID (i.e., the second identification information) stored locally, and the R (i.e., the first routing information) part in the BRTI also appears again, it can be determined that a route oscillation has occurred.

[0115] It should be noted that, in the embodiments of this application, the first routing information may include the second routing information and the third routing information, and this application does not specifically limit the number and type of information included in the first routing information.

[0116] It should be noted that, in the embodiments of this application, the second routing information and the third routing information may be the same or different, and this application does not specifically limit the types of information included in the second routing information and the third routing information.

[0117] It should be noted that, in the embodiments of this application, when the first node determines whether there is routing oscillation, it can determine whether to update the current routing information based on the currently stored routing information, the second routing information, and the third routing information; if the current routing information is not updated, it is determined that there is no routing oscillation; if the current routing information is updated, it can determine whether there is routing oscillation based on the first identification information and the first routing information.

[0118] For example, in an embodiment of this application, when the first node determines whether to update the current routing information based on the currently stored routing information, the second routing information, and the third routing information, it can compare the second routing information and the third routing information with the current routing information. If the current routing information, i.e. the optimal path, has not changed, then the current routing information is not updated, and it is determined that there is no routing oscillation; if the optimal path has changed, then the current routing information is updated.

[0119] It should be noted that, in the embodiments of the application, when updating the current routing information, the first node can determine whether there is routing oscillation based on the first identification information and the first routing information.

[0120] It should be noted that, in the embodiments of the application, when the first node determines whether there is routing oscillation based on the first identification information and the first routing information, it can determine that there is routing oscillation if the second identification information stored locally is the same as the first identification information and the current routing information is partially or completely the same as the first routing information; or, if the second identification information is different from the first identification information, the first message is sent to the neighboring node corresponding to the first node, and the first routing information and the attribute information corresponding to the first routing information are stored.

[0121] In other words, in the embodiments of the application, the first node can determine whether there is routing oscillation based on the first identification information and the first routing information carried in the first message. If the ID of the node stored locally (i.e., the second identification information) is the same as the first identification information carried in the first message, and the current routing information is partially or completely the same as the first routing information, then it is determined that there is routing oscillation. That is, the embodiments of this application can quickly detect routing oscillation based on the local routing information carried in the first message, thereby improving the stability of the system and services, and thus improving resource utilization.

[0122] Furthermore, in the embodiments of this application, after determining that routing oscillation exists, the first node can perform routing oscillation suppression processing based on a first preset strategy; wherein, the first preset strategy includes at least actively performing routing oscillation suppression processing, and / or, reporting alarm information to the control device so that the control device performs routing oscillation suppression processing.

[0123] For example, in the embodiments of this application, after determining that routing oscillation exists, the first node can report an alarm to the controller through telemetry, and the controller can further react to suppress routing oscillation. Or, the first node can handle it itself, for example, it can set a preset period to parse the message messages with the same ID that have routing oscillation, but not send out a route update operation, thereby suppressing routing oscillation.

[0124] It should be noted that, in the embodiments of the application, BRTI (i.e., first information) can be carried through extended BGP messages. This embodiment of the application can use extended BGP to construct and transmit BRTI. The routing parameters of BGP are carried through the path attribute of the route update message (i.e., the first message). RFC4271 defines the Path Attribute (i.e., the first preset field) as having a type that occupies 2 bytes and is divided into two fields: Flags (attribute label) and Type Code (attribute type value). The format of the BRTI attribute defined in this embodiment of the application is as shown above. Figure 3 As shown, the O, T, and E bits of Attr.Flags in the BRTI attribute should be set to 1; O=1, T=1 indicates that the attribute is an optional transit attribute, that is, nodes that do not recognize the attribute will still receive the attribute and forward it to other BGP neighbors; E=1 indicates that the attribute length is extended to 2 bytes; the BRTI attribute type value (Type Code) is defined as follows, currently IANA defines 41-127 as unused numbers, and this application embodiment tentatively uses 41; the BRTI attribute data Data part is the BRTI data.

[0125] In summary, when the second node detects an update in the current computing power information and / or the current routing information, it can generate first information based on one or more of the second node's first identification information, first computing power information, and first routing information. This first information is then encapsulated in the first preset field of the second message to generate the first message. In other words, this embodiment can treat the first information as an extended attribute of BGP and transmit it along with the update message (i.e., the first message) to the BGP neighbor node (i.e., the first node). The first node can then determine whether routing oscillation exists based on the first identification information and the first routing information carried in the first message. If the locally stored node ID (i.e., the second identification information) is the same as the first identification information carried in the first message, and the current routing information is partially or completely identical to the first routing information, then routing oscillation is determined to exist. This embodiment can quickly detect routing oscillation based on the local routing information carried in the first message, thereby improving system and service stability and ultimately increasing resource utilization.

[0126] This application provides a method for detecting computing power routing oscillations. The method is applied to a first node and a second node. The first node receives a first message sent by the second node. The first message includes at least first information, which includes one or more of the second node's first identification information, first computing power information, and first routing information. Based on the first information, it is determined whether routing oscillations exist. When the second node detects that the current computing power information and / or the current routing information has been updated, it generates the first information based on one or more of the second node's first identification information, first computing power information, and first routing information. Based on the first information, a first message is generated and sent to the first node. Therefore, when the second node detects that the current computing power information and / or the current routing information has been updated, it can generate first information based on one or more of the first identification information, the first computing power information, and the first routing information of the second node. Then, it can generate a first message based on the first information and send the first message to the first node, so that the first node can determine whether there is routing oscillation based on the first information carried by the first message. That is, the embodiments of this application can detect computing power routing oscillation by using the first information sent by neighboring nodes, without the need for AS global shared routing policy, thereby quickly detecting whether there is BGP routing oscillation and improving the detection efficiency of routing oscillation.

[0127] Based on the above embodiments, this application provides a first node. Figure 5 Schematic diagram of the composition structure of the first node Figure 1 ,like Figure 5 As shown, the first node 10 includes: a receiving unit 11 and a judging unit 12; wherein,

[0128] The receiving unit 11 is used to receive a first message sent by the second node; wherein the first message includes at least first information, and the first information includes one or more of the second node's first identification information, first computing power information, and first routing information;

[0129] The judgment unit 12 is used to determine whether there is routing oscillation based on the first information.

[0130] In the embodiments of this application, further, Figure 6 Schematic diagram of the composition structure of the first node Figure 2 ,like Figure 6 As shown, the first node 10 proposed in this application embodiment may further include a first processor 13, a first memory 14 storing instructions executable by the first processor 13, and further, the first node 10 may also include a first communication interface 15 and a first bus 16 for connecting the first processor 13, the first memory 14 and the first communication interface 15.

[0131] In the embodiments of this application, the first processor 13 can be at least one of the following: Application-Specific Integrated Circuit (ASIC), Digital Signal Processor (DSP), Digital Signal Processing Device (DSPD), Programmable Logic Device (PLD), Field Programmable Gate Array (FPGA), Central Processing Unit (CPU), Controller, Microcontroller, and Microprocessor. It is understood that for different devices, the electronic device used to implement the above-mentioned processor function can also be other types, and this application embodiment does not specifically limit this. The first node 10 may also include a first memory 14, which can be connected to the first processor 13. The first memory 14 is used to store executable program code, which includes computer operation instructions. The first memory 14 may include high-speed RAM memory and may also include non-volatile memory, such as at least two disk drives.

[0132] In embodiments of this application, the first bus 16 is used to connect the first communication interface 15, the first processor 13, and the first memory 14, as well as the mutual communication between these devices.

[0133] In embodiments of this application, the first memory 14 is used to store instructions and data.

[0134] Furthermore, in the embodiments of this application, the first processor 13 is used to receive a first message sent by the second node; wherein the first message includes at least first information, the first information including one or more of the second node's first identification information, first computing power information and first routing information; and determines whether there is routing oscillation based on the first information.

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

[0136] This application provides a first node that receives a first message sent by a second node. The first message includes at least first information, which includes one or more of the following: first identification information of the second node, first computing power information, and first routing information. The first information is used to determine whether routing oscillation exists. Therefore, the first node can receive the first message sent by the second node and then determine whether routing oscillation exists based on the first information carried in the first message. In other words, this application embodiment can detect computing power routing oscillation through the first information sent by neighboring nodes, without requiring a globally shared routing policy in the AS (Autonomous System), thus enabling rapid detection of BGP routing oscillation and improving the detection efficiency.

[0137] This application provides a computer-readable storage medium storing a program thereon, which, when executed by a processor, implements the computing power routing oscillation detection method as described above.

[0138] Specifically, the program instructions corresponding to the computing power routing oscillation detection method in this embodiment can be stored on storage media such as optical discs, hard disks, and USB flash drives. When the program instructions corresponding to the computing power routing oscillation detection method in the storage media are read or executed by an electronic device, the following steps are included:

[0139] Receive a first message sent by a second node; wherein the first message includes at least first information, the first information including one or more of the second node's first identification information, first computing power information, and first routing information;

[0140] Based on the first piece of information, determine whether routing oscillations exist.

[0141] This application also provides a computer program product, including a computer program that can be executed by a first processor 13 of a first node 10 to complete the steps described in any of the foregoing methods.

[0142] In the embodiments of this application, further, Figure 7 Schematic diagram of the composition structure of the second node Figure 1 ,like Figure 7 As shown, the second node 20 includes: a generation unit 21 and a sending unit 22; wherein,

[0143] The generation unit 21 is configured to generate first information based on one or more of the first identification information, first computing power information, and first routing information of the second node when the current computing power information and / or the current routing information is detected to be updated; and to generate a first message based on the first information.

[0144] The sending unit 22 is used to send the first message to the first node so that the first node can perform routing oscillation detection processing based on the first message.

[0145] In the embodiments of this application, further, Figure 8 Schematic diagram of the composition structure of the second node Figure 2 ,like Figure 8 As shown, the second node 20 proposed in this application embodiment may further include a second processor 23, a second memory 24 storing instructions executable by the second processor 23, and further, the second node 20 may also include a second communication interface 25 and a second bus 26 for connecting the second processor 23, the second memory 24 and the second communication interface 25.

[0146] In the embodiments of this application, the second processor 23 can be at least one of the following: Application-Specific Integrated Circuit (ASIC), Digital Signal Processor (DSP), Digital Signal Processing Device (DSPD), Programmable Logic Device (PLD), Field-Programmable Gate Array (FPGA), Central Processing Unit (CPU), Controller, Microcontroller, and Microprocessor. It is understood that for different devices, the electronic device used to implement the above-mentioned processor function can also be other types, and this application embodiment does not specifically limit this. The second node 20 may also include a second memory 24, which can be connected to the second processor 23. The second memory 24 is used to store executable program code, which includes computer operation instructions. The second memory 24 may include high-speed RAM memory and may also include non-volatile memory, such as at least two disk drives.

[0147] In embodiments of this application, the second bus 26 is used to connect the second communication interface 25, the second processor 23, and the second memory 24, as well as the mutual communication between these devices.

[0148] In embodiments of this application, the second memory 24 is used to store instructions and data.

[0149] Furthermore, in the embodiments of this application, the second processor 23 is configured to generate first information based on one or more of the first identification information, first computing power information, and first routing information of the second node when it detects that the current computing power information and / or the current routing information has been updated; generate a first message based on the first information, and send the first message to the first node so that the first node performs routing oscillation detection processing based on the first message.

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

[0151] This application provides a second node. When the second node detects an update in current computing power information and / or current routing information, it generates first information based on one or more of the second node's first identification information, first computing power information, and first routing information. Based on the first information, it generates a first message and sends the first message to the first node, enabling the first node to perform routing oscillation detection processing based on the first message. Therefore, the second node can generate first information based on one or more of the second node's first identification information, first computing power information, and first routing information, and generate a first message based on the first information. The first message can then be sent to the first node, allowing the first node to perform routing oscillation detection processing based on the first message. This shortens the routing oscillation detection time and improves the routing oscillation detection efficiency.

[0152] This application provides a computer-readable storage medium storing a program thereon, which, when executed by a processor, implements the computing power routing oscillation detection method as described above.

[0153] Specifically, the program instructions corresponding to the computing power routing oscillation detection method in this embodiment can be stored on storage media such as optical discs, hard disks, and USB flash drives. When the program instructions corresponding to the computing power routing oscillation detection method in the storage media are read or executed by an electronic device, the following steps are included:

[0154] When the current computing power information and / or the current routing information is updated, the first information is generated based on one or more of the first identification information, the first computing power information and the first routing information of the second node;

[0155] A first message is generated based on the first information, and the first message is sent to the first node so that the first node can perform route oscillation detection processing based on the first message.

[0156] This application also provides a computer program product, including a computer program that can be executed by a second processor 23 of a second node 20 to perform the steps described in any of the foregoing methods.

[0157] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of hardware embodiments, software embodiments, or embodiments combining software and hardware aspects. Furthermore, this application can take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage and optical storage) containing computer-usable program code.

[0158] This application is described with reference to schematic and / or block diagrams of implementations of methods, apparatus (systems), and computer program products according to embodiments of this application. It should be understood that each block of the schematic and / or block diagrams can be implemented by computer program instructions, and combinations of blocks in the schematic and / or block diagrams can be implemented. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create a machine for implementing the schematic and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0159] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in the implementation flow diagram. Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0160] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0161] The above description is merely a preferred embodiment of this application and is not intended to limit the scope of protection of this application.

Claims

1. A method for detecting computing power routing oscillations, characterized in that, The method is applied to the first node, and the method includes: Receive a first message sent by a second node; wherein the first message includes at least first information, the first information including the second node's first identification information, first computing power information, and first routing information; the first computing power information includes computing power information before the update and computing power information after the update, and the first routing information includes second routing information corresponding to the computing power information before the update and third routing information corresponding to the computing power information after the update; Based on the first information, determine whether routing oscillations exist; The step of determining whether routing oscillations exist based on the first information includes: Based on the currently stored routing information, the second routing information, and the third routing information, determine whether to update the current routing information; Without updating the current routing information, it is determined that there is no routing oscillation; When updating the current routing information, it is determined whether routing oscillation exists based on the first identification information and the first routing information; The step of determining whether routing oscillation exists based on the first identification information and the first routing information includes: If the second identifier information stored locally is the same as the first identifier information, and the current routing information is partially or completely the same as the first routing information, then routing oscillation is determined to exist; or, If the second identification information is different from the first identification information, the first message is sent to the neighboring node corresponding to the first node, and the first routing information and the attribute information corresponding to the first routing information are stored.

2. The method according to claim 1, characterized in that, The method further includes: After determining that routing oscillation exists, routing oscillation suppression processing is performed based on a first preset strategy; wherein, the first preset strategy includes at least actively performing the routing oscillation suppression processing, and / or, reporting alarm information to the control device so that the control device performs the routing oscillation suppression processing.

3. A method for detecting computing power routing oscillations, characterized in that, The method is applied to the second node, and the method includes: When the current computing power information and / or the current routing information is updated, first information is generated based on the first identification information, the first computing power information, and the first routing information of the second node; the first computing power information includes the computing power information before the update and the computing power information after the update, and the first routing information includes the second routing information corresponding to the computing power information before the update and the third routing information corresponding to the computing power information after the update. A first message is generated based on the first information, and the first message is sent to the first node so that the first node can perform route oscillation detection processing based on the first message. The route oscillation is determined based on the current route information, the second route information, and the third route information to determine whether to update the current route information. If the current route information is updated, and the second identifier information obtained based on the first identifier information and the first route information is the same as the first identifier information stored locally, and the current route information is partially or completely the same as the first route information, then route oscillation is determined to exist. Alternatively, if the second identifier information is different from the first identifier information, the first message is sent to the neighboring node corresponding to the first node, and the first route information and the attribute information corresponding to the first route information are stored.

4. The method according to claim 3, characterized in that, The generation of the first message based on the first information includes: The first information is encapsulated into a first preset field of the second message to generate the first message; wherein the first preset field is used to at least characterize the attribute list of the first information, and the attribute list includes one or more of the following: attribute label, attribute type, attribute length, and attribute data.

5. A first node, characterized in that, The first node includes: a receiving unit and a judging unit; wherein, The receiving unit is configured to receive a first message sent by the second node; wherein the first message includes at least first information, the first information including the second node's first identification information, first computing power information, and first routing information; the first computing power information includes computing power information before the update and computing power information after the update, and the first routing information includes second routing information corresponding to the computing power information before the update and third routing information corresponding to the computing power information after the update; The judgment unit is used to determine whether routing oscillation exists based on the first information; wherein, determining whether routing oscillation exists based on the first information includes: determining whether to update the current routing information based on the locally stored current routing information, the second routing information, and the third routing information; if the current routing information is not updated, it is determined that there is no routing oscillation; if the current routing information is updated, it is determined whether routing oscillation exists based on the first identification information and the first routing information; wherein, determining whether routing oscillation exists based on the first identification information and the first routing information includes: if the locally stored second identification information is the same as the first identification information, and the current routing information is partially or completely the same as the first routing information, it is determined that routing oscillation exists; or, if the second identification information is different from the first identification information, the first packet is sent to the neighbor node corresponding to the first node, and the first routing information and the attribute information corresponding to the first routing information are stored.

6. A first node, characterized in that, The first node includes: a first processor and a first memory; wherein, The first memory is used to store computer programs that can run on the processor; The first processor is configured to perform the method as described in any one of claims 1-2 when running the computer program.

7. A second node, characterized in that, The second node includes: a generation unit and a transmission unit; wherein, The generation unit is configured to generate first information based on the first identification information, first computing power information, and first routing information of the second node when the current computing power information and / or the current routing information is detected to be updated; and to generate a first message based on the first information; the first computing power information includes computing power information before the update and computing power information after the update, and the first routing information includes second routing information corresponding to the computing power information before the update and third routing information corresponding to the computing power information after the update; The sending unit is configured to send the first message to the first node, so that the first node performs route oscillation detection processing based on the first message; wherein, the route oscillation is determined based on the current route information, the second route information, and the third route information to determine whether to update the current route information. If the current route information is updated, and the second identifier information obtained based on the first identifier information and the first route information is the same as the first identifier information stored locally, and the current route information is partially or completely the same as the first route information, route oscillation is determined to exist; or, if the second identifier information is different from the first identifier information, the first message is sent to the neighbor node corresponding to the first node, and the first route information and the attribute information corresponding to the first route information are stored.

8. A second node, characterized in that, The second node includes: a second processor and a second memory; wherein, The second memory is used to store computer programs that can run on the processor; The second processor is configured to perform the method as described in any one of claims 3-4 when running the computer program.

9. A computer-readable storage medium, characterized in that, The storage medium stores computer program code, which, when executed by a computer, performs the method described in any one of claims 1-2 or 3-4.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the method according to any one of claims 1-2 or 3-4.

Images