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

Abstract

The embodiment of the invention provides a computing power routing oscillation detection method, related equipment, a storage medium and a computer program product, the method is applied to a first node, and the method comprises the following steps: the first node receives a first message sent by a second node; wherein the first message at least comprises first information, and the first information comprises one or more of first identification information, first computing power information and first routing information of the second node; according to the embodiment of the invention, whether the routing oscillation exists or not is judged based on the first information, that is, the first node can judge whether the routing oscillation exists or not based on the first information carried by the first message, and an autonomous system (AS) does not need to globally share a routing strategy, so that whether the routing oscillation exists or not can be quickly detected, and the detection efficiency of the routing oscillation is improved.

Description

Technical Field

[0001] The present application relates to the field of computing power networks, and in particular to a computing power routing oscillation detection method, related equipment, storage medium and computer program product. Background Art

[0002] Computing power has become a vital digital industry infrastructure, and the sinking of computing power to the edge and even beyond the edge has become an industry trend. At the same time, the computing power network has further transformed from traditional topology routing to computing power routing. Computing power routing can generally be divided into centralized computing power routing solutions and distributed computing power routing solutions. Among them, the distributed routing solution mainly relies on the expansion of the original intra-domain interior gateway protocol (IGP) and inter-domain border gateway protocol (BorderGateway Protocol, BGP) to complete the transmission of computing power information. BGP allows each AS to independently formulate and regulate its routing policies for local rationality reasons, which often leads to policy conflicts. Many studies have shown that BGP policy conflicts can lead to routing oscillations.

[0003] Currently, when detecting whether there is BGP route flapping, each AS needs to globally share routing policies or historical routing information; however, for the sake of BGP routing security, many ASs do not globally share their routing policies or historical routing information, which results in a long detection process for route flapping, thereby reducing the detection efficiency of route flapping. Summary of the invention

[0004] The implementation law of this application provides a computing power routing oscillation detection method, related equipment, storage medium and computer program product, which can improve the detection efficiency of routing oscillation without the need for AS global shared routing strategy.

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

[0006] In a first aspect, an embodiment of the present application provides a computing power routing oscillation detection method, the method is applied to a first node, and the method includes:

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

[0008] It is determined whether there is routing oscillation based on the first information.

[0009] In a second aspect, an embodiment of the present application provides a computing power routing oscillation detection method, which is applied to a second node, and the method includes:

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

[0011] A first message is generated based on the first information, and the first message is sent to a first node, so that the first node performs routing oscillation detection processing based on the first message.

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

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

[0014] The determining unit is configured to determine whether routing oscillation occurs based on the first information.

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

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

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

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

[0019] The generating unit is configured to 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 when the current computing power information and / or the current routing information is updated; and generate a first message based on the first information;

[0020] The sending unit is configured to send the first message to a first node, so that the first node performs routing oscillation detection processing based on the first message.

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

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

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

[0024] In a seventh aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program code is stored. When the computer program code is executed by a computer, the computing power routing oscillation detection method as described above is implemented.

[0025] In an eighth aspect, an embodiment of the present application provides a computer program product, including a computer program, which, when executed by a processor, implements the computing power routing oscillation detection method as described above.

[0026] The embodiments of the present application provide a computing power routing oscillation detection method, related equipment, storage medium and computer program product, wherein a first node receives a first message sent by a second node; wherein the first message includes at least first information, and the first information includes one or more of first identification information, first computing power information and first routing information of the second node; based on the first information, it is determined whether routing oscillation exists; when the second node detects that the current computing power information and / or the current routing information is updated, the second node generates first information based on one or more of the first identification information, first computing power information and first routing information of the second node; a first message is generated based on the first information, and the first message is sent to the first node. It can be seen that when the second node detects that the current computing power information and / or the current routing information is updated, it can generate the 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 the 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 embodiment of the present application can detect computing power routing oscillation through the first information sent by the neighboring node, without the need for AS global shared routing policy, so that it can quickly detect whether there is BGP routing oscillation, thereby improving the detection efficiency of routing oscillation. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 The computing power routing oscillation detection method proposed in the embodiment of the present application is shown in FIG. Figure 1 ;

[0028] Figure 2 The computing power routing oscillation detection method proposed in the embodiment of the present application is shown in FIG. Figure 2 ;

[0029] Figure 3 A schematic diagram of the first preset field structure proposed in an embodiment of the present application;

[0030] Figure 4 The computing power routing oscillation detection method proposed in the embodiment of the present application is shown in FIG. Figure 3 ;

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

[0032] Figure 6 Schematic diagram of the composition structure of the first node proposed in the embodiment of the present application Figure 2 ;

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

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

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

[0036] Computing power has become a vital digital industry infrastructure, and the sinking of computing power to the edge and even beyond the edge has become an industry trend. At the same time, with the diversification of industry computing power needs and the enhancement of terminal computing power, the ubiquity of computing power will become a new industry form. Under the computing power network architecture, the full-granularity computing power of the end, edge, and cloud becomes a resource visible, schedulable, and routable across the entire network. The computing power network has further transformed from traditional topology routing to computing power routing, thereby enabling a new network architecture and business deployment and delivery model, and helping the digital transformation of the entire industry; among them, the computing power resources in the cloud have been transformed from the current closed mode to an open mode under the computing power network architecture, which puts forward new requirements for the granularity of computing power routing.

[0037] As one of the key technologies of computing power network, computing power routing can be generally divided into centralized computing power routing solutions and distributed computing power routing solutions. Among them, the centralized computing power routing solution mainly relies on IPV6+ technology, such as SRV6, SR policy and other centralized orchestration computing routes to complete end-to-end routing and flexible scheduling of computing power; the distributed routing solution mainly relies on the expansion of 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 for exchanging routing information between ASes. BGP is the only inter-domain routing protocol currently used on the Internet. BGP allows each AS to independently formulate and regulate its routing policy for local rationality reasons, which often leads to policy conflicts. Many studies have shown that BGP policy conflicts can lead to routing oscillations, that is, each AS domain involved repeatedly selects the same BGP route; BGP routing oscillations can significantly lead to poor end-to-end network performance and reduce the overall efficiency of the Internet infrastructure. There are two solutions to the BGP routing oscillation problem: static and dynamic. Among them, the static solution mainly relies on the program to pre-analyze the routing policy to check whether the policy conflicts; the dynamic solution is to suppress or completely prevent BGP routing oscillations by extending the protocol; and each AS must share its own policy information, because the AS cannot check routing oscillations individually. However, in fact, many ASes do not widely share their routing policies; in addition, the current BGP routing oscillation solution Dampening can use a penalty value to measure the stability of a route. The higher the penalty value, the more unstable the route, but this method is invalid for internal Border Gateway Protocol (IBGP) neighbor routes.

[0039] In summary, when detecting whether BGP route flapping exists, each AS needs to share routing policies or historical routing information globally. However, for the sake of BGP route security, many ASs do not share their routing policies or historical routing information globally, which results in a long detection process for route flapping, thereby reducing the detection efficiency of route flapping.

[0040] In order to solve the problem that the current detection process of routing oscillation is time-consuming, thereby reducing the detection efficiency of routing oscillation, the embodiment of the present application provides a computing power routing oscillation detection method, related equipment, storage medium and computer program product, wherein a first node receives a first message sent by a second node; wherein the first message includes at least first information, and the first information includes one or more of the first identification information, first computing power information and first routing information of the second node; based on the first information, it is determined whether routing oscillation exists; when the second node detects that the current computing power information and / or the current routing information is updated, the first information is generated based on the first identification information, first computing power information and one or more of the first routing information of the second node; a first message is generated based on the first information, and the first message is sent to the first node. It can be seen that when the second node detects that the current computing power information and / or the current routing information is updated, it can generate the 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 the 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 embodiment of the present application can detect computing power routing oscillation through the first information sent by the neighboring node, without the need for AS global shared routing policy, so that it can quickly detect whether there is BGP routing oscillation, thereby improving the detection efficiency of routing oscillation.

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

[0042] The embodiment of the present application provides a computing power routing oscillation detection method, which is applied to a first node. Figure 1 The computing power routing oscillation detection method proposed in the embodiment of the present application is shown in FIG. Figure 1 ,like Figure 1 As shown, the computing power routing oscillation detection method may include the following steps:

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

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

[0045] It should be noted that in an embodiment of the present application, the first node may be a neighbor node of the second node, for example, it may be an IBGP neighbor or an External Border Gateway Protocol (EBGP) neighbor of the second node. The present application does not specifically limit the type of the first node.

[0046] It should be noted that, in the embodiments of the present application, the second node may be any node where an optimal route change occurs, and the present application does not specifically limit the type of the second node.

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

[0048] It should be noted that in an embodiment of the present application, the first information may include one or more of the first identification information of the second node, the first computing power information, and the first routing information, and may also include other information. The present application does not specifically limit the amount and type of information included in the first information.

[0049] It should be noted that, in the embodiment of the present 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] Wherein, BRTI represents the first information, ID represents the first identification information, and M old Indicates the computing power information before the update, M new Represents the updated computing power information, R old Indicates the second routing information corresponding to the computing power information before the update, R new Indicates the third routing information corresponding to the updated computing power information.

[0052] It should be noted that, in an embodiment of the present application, the first identification information may include the node number, for example, it may be the router-ID of the BGP protocol, which is generally the loopback address of the device (such as 1.1.1.1). The present application does not specifically limit the information type of the first identification information.

[0053] It should be noted that, in the embodiment of the present 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 the present application, due to changes in computing power information, the BGP route will change, so the computing power information before the update and the computing power information after the update can correspond to different routing information respectively.

[0055] It should be noted that, in an embodiment of the present 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 the present application, the second routing information and the third routing information may be the same or different, and the present application does not specifically limit the type of information included in the second routing information and the third routing information.

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

[0058] In an embodiment of the present application, after receiving the first message sent by the second node, the first node may determine whether routing oscillation occurs based on the first information.

[0059] Further, in an embodiment of the present 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 current routing information, the second routing information, and the third routing information stored locally; 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 be determined whether there is routing oscillation based on the first identification information and the first routing information.

[0060] Exemplarily, in an embodiment of the present application, when the first node determines whether to update the current routing information based on the current routing information, the second routing information, and the third routing information stored locally, the second routing information and the third routing information can be compared with the current routing information. If the current routing information, that is, the optimal path, has not changed, the current routing information is not updated, and it is determined that there is no routing oscillation; if the optimal path has changed, the current routing information is updated.

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

[0062] It should be noted that in the embodiment 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 when 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, when the second identification information is different from the first identification information, the first message 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.

[0063] That is to say, in the embodiment 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 locally stored node (that is, the second identification information) is the same as the first identification information carried by 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 embodiment of the present application can quickly detect routing oscillation based on the local routing information carried by the first message, thereby improving the stability of the system and business, and further improving resource utilization.

[0064] Furthermore, in an embodiment of the present application, after determining that routing oscillation exists, the first node may perform a process of suppressing routing oscillation based on a first preset strategy; wherein the first preset strategy at least includes actively performing a process of suppressing routing oscillation, and / or, reporting alarm information to a control device so that the control device performs a process of suppressing routing oscillation.

[0065] Illustratively, in an embodiment of the present application, after determining that routing oscillation exists, the first node may report an alarm to the controller through telemetry, and the controller may further respond to suppress routing oscillation, and / or the first node may process it itself, for example, a preset period may be set to parse the message message of routing oscillation with the same ID, but no routing update operation is issued, thereby suppressing routing oscillation.

[0066] To summarize, the first node can 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 first identification information, first computing power information and first routing information of the second node. Then, 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 locally stored node (i.e., the second identification information) is the same as the first identification information carried by the first message, and the current routing information is partially or completely the same as the first routing information, it is determined that there is routing oscillation, that is, the embodiment of the present application can perform rapid detection of routing oscillation based on the local routing information carried by the first message, thereby improving the stability of the system and the business, and further improving resource utilization.

[0067] The embodiment of the present application provides a method for detecting computing power routing oscillation, which is applied to a first node, and the first node receives a first message sent by a second node; wherein the first message includes at least first information, and the first information includes one or more of the first identification information of the second node, the first computing power information, and the first routing information; and whether routing oscillation exists is determined based on the first information. It can be seen that the first node can receive the first message sent by the second node, and then can determine whether routing oscillation exists based on the first information carried by the first message, that is, the embodiment of the present application can detect computing power routing oscillation through the first information sent by the neighboring node, without the need for AS global shared routing policy, so that whether BGP routing oscillation exists can be quickly detected, which improves the detection efficiency of routing oscillation.

[0068] Based on the above embodiment, another embodiment of the present application provides a computing power routing oscillation detection method, which is applied to the second node. Figure 2 The computing power routing oscillation detection method proposed in the embodiment of the present application is shown in FIG. Figure 2 ,like Figure 2 As shown, the computing power routing oscillation detection method may include the following steps:

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

[0070] In an embodiment of the present application, the second node can 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 detecting that the current computing power information and / or the current routing information is updated.

[0071] It should be noted that, in the embodiments of the present application, the second node may be any node where an optimal route change occurs, and the present application does not specifically limit the type of the second node.

[0072] It should be noted that, in an embodiment of the present application, the first identification information may include the node number, for example, it may be the router-ID of the BGP protocol, which is generally the loopback address of the device (such as 1.1.1.1). The present application does not specifically limit the information type of the first identification information.

[0073] It should be noted that, in the embodiment of the present 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 the present application, due to changes in computing power information, the BGP route will change, so the computing power information before the update and the computing power information after the update can correspond to different routing information respectively.

[0075] It should be noted that, in an embodiment of the present 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 performs routing oscillation detection based on the first message.

[0077] In an embodiment of the present application, after the second node detects that the current computing power information and / or the current routing information is updated, it can generate the 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 the 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 the present application, the first message may be an update message, and the present application does not specifically limit the type of the first message.

[0079] It should be noted that, in an embodiment of the present application, when the second node generates a first message based on the first information, it can encapsulate the first information into the first preset field of the second message, thereby generating the first message; wherein the first preset field is at least used to characterize the attribute list of the first information, and the attribute list includes one or more of the attribute tag, attribute type, attribute length and attribute data.

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

[0081] It should be noted that, in an embodiment of the present application, the first preset field may be a Path Attributes field, and the present application does not specifically limit the type of the first preset field.

[0082] For example, in the embodiments of the present application, Figure 3 This is a schematic diagram of the first preset field structure proposed in the embodiment of the present 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 tag) and Type Code (attribute type value); among them, the three bits O, T, and E of Attr.Flags should be set to 1; O=1, T=1, indicating that the attribute is an optional transmission attribute, that is, a node that does 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 the embodiment of the present application can tentatively use 41; the attribute data Data part can be used to represent the data of the first information. The present application does not specifically limit the field type and the number of fields included in the first preset field.

[0083] To summarize, when the second node detects that the current computing power information and / or the current routing information is updated, it can generate the 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, the embodiment of the present application can use the first information as an extended attribute of BGP, and pass it to the BGP neighbor node (that is, the first node) when sending an update message (that is, the first message), so that the first node can detect and process routing oscillations based on the first message.

[0084] The embodiment of the present application provides a method for detecting computing power routing oscillation, which is applied to a second node. When the second node detects that the current computing power information and / or the current routing information is updated, the second node 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; generates a first message based on the first information, and sends the first message to the first node, so that the first node performs routing oscillation detection based on the first message. It can be seen that the second node can generate the 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 generate the first message based on the first information, and then send the first message to the first node, so that the first node can perform routing oscillation detection based on the first message, thereby shortening the detection time of routing oscillation, and thus improving the detection efficiency of routing oscillation.

[0085] Based on the above embodiment, another embodiment of the present application provides a computing power routing oscillation detection method, which is applied to a first node and a second node. Figure 4 The computing power routing oscillation detection method proposed in the embodiment of the present application is shown in FIG. Figure 3 ,like Figure 4 As shown, the computing power routing oscillation detection method 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 is updated, the second node 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 the present application, the second node may be any node where an optimal route change occurs, and the present application does not specifically limit the type of the second node.

[0088] It should be noted that, in an embodiment of the present application, the first identification information may include the node number, for example, it may be the router-ID of the BGP protocol, which is generally the loopback address of the device (such as 1.1.1.1). The present application does not specifically limit the information type of the first identification information.

[0089] It should be noted that, in the embodiment of the present 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 the present application, due to changes in computing power information, the BGP route will change, so the computing power information before the update and the computing power information after the update can correspond to different routing information respectively.

[0091] It should be noted that, in an embodiment of the present 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 the present application, the first message may be an update message, and the present application does not specifically limit the type of the first message.

[0094] It should be noted that, in an embodiment of the present application, when the second node generates a first message based on the first information, it can encapsulate the first information into the first preset field of the second message, thereby generating the first message; wherein the first preset field is at least used to characterize the attribute list of the first information, and the attribute list includes one or more of the attribute tag, attribute type, attribute length and attribute data.

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

[0096] It should be noted that, in an embodiment of the present application, the first preset field may be a Path Attributes field, and the present application does not specifically limit the type of the first preset field.

[0097] For example, in the embodiments of the present application, Figure 3 As shown, the type of the first preset field occupies 2 bytes and is divided into two fields: Flags (attribute tag) and Type Code (attribute type value); among them, the three bits O, T, and E of Attr.Flags should be set to 1; O=1, T=1, indicating that the attribute is an optional transmission attribute, that is, a node that does 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 the embodiment of the present application can tentatively use 41; the attribute data Data part can be used to represent the data of the first information. The present application does not specifically limit the field type and the number of fields included in the first preset field.

[0098] It should be noted that, in the embodiments of the present application, the first node may be a neighbor node of the second node, for example, may be an IBGP neighbor or EBGP neighbor of the second node, and the present application does not specifically limit the type of the first node.

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

[0100] Further, in an embodiment of the present 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 current routing information, the second routing information, and the third routing information stored locally; 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 be determined whether there is routing oscillation based on the first identification information and the first routing information.

[0101] Exemplarily, in an embodiment of the present application, when the first node determines whether to update the current routing information based on the current routing information, the second routing information, and the third routing information stored locally, the second routing information and the third routing information can be compared with the current routing information. If the current routing information, that is, the optimal path, has not changed, the current routing information is not updated, and it is determined that there is no routing oscillation; if the optimal path has changed, the current routing information is updated.

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

[0103] It should be noted that in the embodiment 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 when 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, when the second identification information is different from the first identification information, the first message 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.

[0104] That is to say, in the embodiment 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 locally stored node (that is, the second identification information) is the same as the first identification information carried by 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 embodiment of the present application can quickly detect routing oscillation based on the local routing information carried by the first message, thereby improving the stability of the system and business, and further improving resource utilization.

[0105] Furthermore, in an embodiment of the present application, after determining that routing oscillation exists, the first node may perform a process of suppressing routing oscillation based on a first preset strategy; wherein the first preset strategy at least includes actively performing a process of suppressing routing oscillation, and / or, reporting alarm information to a control device so that the control device performs a process of suppressing routing oscillation.

[0106] Illustratively, in an embodiment of the present application, after determining that routing oscillation exists, the first node may report an alarm to the controller through telemetry, and the controller may further respond to suppress routing oscillation, and / or the first node may process it itself, for example, a preset period may be set to parse the message message of routing oscillation with the same ID, but no routing update operation is issued, thereby suppressing routing oscillation.

[0107] To summarize, when the second node detects that the current computing power information and / or the current routing information is updated, it can generate the first information based on the first identification information of the second node, the first computing power information and one or more of the first routing information, and encapsulate the first information into the first preset field of the second message to generate the first message, that is, the embodiment of the present application can use the first information as an extended attribute of BGP, and pass it to the BGP neighbor node (that is, the first node) when sending the update message (that is, the first message), and then 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 locally stored node (that is, the second identification information) is the same as the first identification information carried by the first message, and the current routing information is partially or completely the same as the first routing information, it is determined that there is routing oscillation, that is, the embodiment of the present application can quickly detect routing oscillation based on the local routing information carried by the first message, thereby improving the stability of the system and the business, and further improving resource utilization.

[0108] An embodiment of the present application provides a computing power routing oscillation detection method, which is applied to a first node and a second node, wherein the first node receives 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 first identification information, first computing power information, and first routing information of the second node; based on the first information, it is determined whether routing oscillation exists; when the second node detects that the current computing power information and / or the current routing information is updated, the second node generates first information based on one or more of the first identification information, first computing power information, and first routing information of the second node; a first message is generated based on the first information, and the first message is sent to the first node. It can be seen that when the second node detects that the current computing power information and / or the current routing information is updated, it can generate the 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 the 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 embodiment of the present application can detect computing power routing oscillation through the first information sent by the neighboring node, without the need for AS global shared routing policy, so that it can quickly detect whether there is BGP routing oscillation, thereby improving the detection efficiency of routing oscillation.

[0109] Based on the above embodiments, another embodiment of the present application provides a computing power routing oscillation detection method, which can check routing oscillation through local routing information of an AS domain, without the need for global shared routing policies or historical routing information. At the same time, the embodiment of the present application defines routing transformation information (BGP Routing Transmiting Information, BRTI) and creates BRTI (i.e., first information) and transmits BRTI. It detects BGP routing oscillation through BRTI, and proposes an extension method and transmission method based on the BGP protocol, as well as a method for suppressing routing oscillation.

[0110] It should be noted that in the embodiment of the present application, when 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 notify the computing power information to the network, and each hop device in the middle will forward the BGP route update message, and finally the ingress computing power router will receive the target route. When the business comes, the business message will be forwarded to the corresponding destination resource pool according to the target address in the business message. At present, the collection frequency of computing power information will affect the sending of BGP messages, thereby affecting the selection of routes. By default, the routing cycle between IBGP neighbors is 15 seconds, and the routing cycle between EBGP neighbors is 30 seconds. Because the computing power information changes all the time, when the computing power information changes, it will trigger BGP to send a routing update message. When the intermediate node receives the routing update message, the route will be revoked and updated, which will cause routing oscillation.

[0111] It should be noted that in the embodiments of the present application, it is assumed that the network topology is represented by G, G = (N, E); wherein N represents the network node, E represents the edge between the connected nodes, and after the network protocol is enabled, the routing table is relatively stable, indicating that no path oscillation occurs. The computing power information can be sent to neighbors as a BGP routing prefix attribute. Due to changes in computing power information, BGP routing will change, and it is necessary to send routing withdrawal and notification messages to BGP neighbors. Assume that the node where the routing change occurs is marked as w, r represents the route or path, and The optimal route of node W after the computing power information changes (i.e., the third routing information), The optimal route (i.e., the second routing information) generated after the computing power information collected by node w last time.

[0112] It should be noted that in the embodiment of the present application, an information structure BRTI (i.e., first information) is defined to indicate the routing information before and after the computing power information changes and the changes in the BGP routing information. BRTI (i.e., first information) may include three parts, as shown in the above formula (1), wherein ID indicates the number of the network node, which may 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 indicates the specific changes in the computing power information, which is composed of the last computing power information (i.e., the computing power information before the update) and the current computing power information (the computing power information after the update), and R indicates the changes in the routing, including the last optimal route (i.e., the second routing information) and the optimal route after the current routing information changes (i.e., the third routing information). BRTI (i.e., first information) will be transmitted to the BGP neighbor node together when sending an update message (i.e., the first message) as an extended attribute of BGP.

[0113] Furthermore, in an embodiment of the present application, the creation and transmission rules of BRTI may include the following contents; wherein, the creation principle of BRTI includes: (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), and will not create BRTI information (i.e., the first information); (2) if the current optimal route on the router has changed, the node (i.e., the second node) will create a BGP route update message (i.e., the first message), and at the same time create a BRTI message, and pass it to BGP along with the BGP route update message. neighbor (i.e., the first node); the transmission rules of BRTI include: (1) when a border gateway node (i.e., the first node) receives a routing update message (i.e., the first message) containing BRTI from a neighbor node (i.e., the second node), if the current optimal path is not changed after the routing decision, there is no need to forward the BRTI to other neighbor nodes, and there is no need to send BGP routing update messages to other neighbor nodes; (2) if the current optimal path is changed after the routing decision, the node must transfer the received BRTI without modification together with the local routing update report to other neighbor nodes, and the node only needs to record the ID information in the BRTI.

[0114] It should be noted that, in the embodiment of the present application, the first node uses BRTI to detect BGP route oscillation rules, which 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 is not changed after the path decision (i.e., the current routing information is not updated), then no route oscillation is detected; (2) Otherwise, first record the current and previous optimal paths of the BRTI. Then extract the ID (i.e., the first identification information) from the BRTI (i.e., the first information), and determine whether the ID (i.e., the first identification information) is the same as the locally stored ID (i.e., the second identification information). If the ID is different, continue to forward the BRTI. If the ID (i.e., the first identification information) is the same as the locally stored ID (i.e., the second identification information), and the R (i.e., the first routing information) part in the BRTI also appears again, it can be determined that path oscillation has occurred.

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

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

[0117] It should be noted that in an embodiment of the present application, when the first node determines whether there is routing oscillation, it can determine whether to update the current routing information based on the current routing information, the second routing information and the third routing information stored locally; 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 be determined whether there is routing oscillation based on the first identification information and the first routing information.

[0118] Exemplarily, in an embodiment of the present application, when the first node determines whether to update the current routing information based on the current routing information, the second routing information, and the third routing information stored locally, the second routing information and the third routing information can be compared with the current routing information. If the current routing information, that is, the optimal path, has not changed, the current routing information is not updated, and it is determined that there is no routing oscillation; if the optimal path has changed, the current routing information is updated.

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

[0120] It should be noted that in the embodiment 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 when 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, when the second identification information is different from the first identification information, the first message 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.

[0121] That is to say, in the embodiment 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 locally stored node (that is, the second identification information) is the same as the first identification information carried by 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 embodiment of the present application can quickly detect routing oscillation based on the local routing information carried by the first message, thereby improving the stability of the system and business, and further improving resource utilization.

[0122] Furthermore, in an embodiment of the present application, after determining that routing oscillation exists, the first node may perform a process of suppressing routing oscillation based on a first preset strategy; wherein the first preset strategy at least includes actively performing a process of suppressing routing oscillation, and / or, reporting alarm information to a control device so that the control device performs a process of suppressing routing oscillation.

[0123] Illustratively, in an embodiment of the present application, after determining that routing oscillation exists, the first node may report an alarm to the controller through telemetry, and the controller may further respond to suppress routing oscillation, and / or the first node may process it itself, for example, a preset period may be set to parse the message message of routing oscillation with the same ID, but no routing update operation is issued, thereby suppressing routing oscillation.

[0124] It should be noted that in the embodiment of the application, BRTI (i.e., the first information) can be carried by extending the BGP message. The embodiment of the present application can use extended BGP to construct and transmit BRTI. The routing parameters of BGP are carried by the path attributes of the routing update message (i.e., the first message). RFC4271 defines that the type of Path Attribute (i.e., the first preset field) occupies 2 bytes and is divided into two fields: Flags (attribute tag) and Type Code (attribute type value). The format of the BRTI attribute defined in the embodiment of the present application is as above. Figure 3 As shown, the three bits O, T, and E of Attr.Flags in the BRTI attribute should be set to 1; O=1, T=1 indicates that the attribute is an optional transmission 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 BRTI attribute type value (Type Code) is defined as follows, currently IANA defines 41-127 as unused numbers, and the embodiment of this application tentatively uses 41; the BRTI attribute data Data part is the BRTI data.

[0125] To summarize, when the second node detects that the current computing power information and / or the current routing information is updated, it can generate the first information based on the first identification information of the second node, the first computing power information and one or more of the first routing information, and encapsulate the first information into the first preset field of the second message to generate the first message, that is, the embodiment of the present application can use the first information as an extended attribute of BGP, and pass it to the BGP neighbor node (that is, the first node) when sending the update message (that is, the first message), and then 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 locally stored node (that is, the second identification information) is the same as the first identification information carried by the first message, and the current routing information is partially or completely the same as the first routing information, it is determined that there is routing oscillation, that is, the embodiment of the present application can quickly detect routing oscillation based on the local routing information carried by the first message, thereby improving the stability of the system and the business, and further improving resource utilization.

[0126] An embodiment of the present application provides a computing power routing oscillation detection method, which is applied to a first node and a second node, wherein the first node receives 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 first identification information, first computing power information, and first routing information of the second node; based on the first information, it is determined whether routing oscillation exists; when the second node detects that the current computing power information and / or the current routing information is updated, the second node generates first information based on one or more of the first identification information, first computing power information, and first routing information of the second node; a first message is generated based on the first information, and the first message is sent to the first node. It can be seen that when the second node detects that the current computing power information and / or the current routing information is updated, it can generate the 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 the 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 embodiment of the present application can detect computing power routing oscillation through the first information sent by the neighboring node, without the need for AS global shared routing policy, so that it can quickly detect whether there is BGP routing oscillation, thereby improving the detection efficiency of routing oscillation.

[0127] Based on the above embodiment, the embodiment of the present application provides a first node, Figure 5 The structure diagram 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 configured to receive a first message sent by a second node; wherein the first message includes at least first information, and the first information includes one or more of first identification information, first computing power information, and first routing information of the second node;

[0129] The determining unit 12 is configured to determine whether routing oscillation occurs based on the first information.

[0130] In the embodiments of the present application, further, Figure 6 The structure diagram of the first node Figure 2 ,like Figure 6 As shown, the first node 10 proposed in the embodiment of the present application may also include a first processor 13, a first memory 14 storing executable instructions of 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 embodiment of the present application, the first processor 13 may be at least one of an Application Specific Integrated Circuit (ASIC), a Digital Signal Processor (DSP), a Digital Signal Processing Device (DSPD), a Programmable Logic Device (PLD), a Field Programmable Gate Array (FPGA), a Central Processing Unit (CPU), a controller, a microcontroller, and a microprocessor. It can be understood that for different devices, the electronic device used to implement the above-mentioned processor function may also be other, and the embodiment of the present application is not specifically limited. The first node 10 may also include a first memory 14, which may be connected to the first processor 13, wherein the first memory 14 is used to store executable program code, the program code includes computer operation instructions, and the first memory 14 may include a high-speed RAM memory, and may also include a non-volatile memory, for example, at least two disk memories.

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

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

[0134] Further, in an embodiment of the present application, the above-mentioned first processor 13 is used to receive a first message sent by a second node; wherein the first message includes at least first information, and the first information includes one or more of the first identification information, first computing power information and first routing information of the second node; based on the first information, it is determined whether there is routing oscillation.

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

[0136] The embodiment of the present application provides a first node, the first node receives a first message sent by a second node; wherein the first message includes at least first information, the first information includes one or more of the first identification information of the second node, the first computing power information, and the first routing information; based on the first information, it is determined whether there is routing oscillation. It can be seen that the first node can receive the first message sent by the second node, and then it can determine whether there is routing oscillation based on the first information carried by the first message, that is, the embodiment of the present application can detect computing power routing oscillation through the first information sent by the neighboring node, without the need for AS global shared routing policy, so that it can quickly detect whether there is BGP routing oscillation, which improves the detection efficiency of routing oscillation.

[0137] An embodiment of the present application provides a computer-readable storage medium on which a program is stored. When the program is executed by a processor, the computing power routing oscillation detection method as described above is implemented.

[0138] Specifically, a program instruction corresponding to a computing power routing oscillation detection method in this embodiment can be stored on a storage medium such as a CD, a hard disk, a USB flash drive, etc. When the program instruction corresponding to a computing power routing oscillation detection method in the storage medium is 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, and the first information includes one or more of first identification information, first computing power information, and first routing information of the second node;

[0140] It is determined whether there is routing oscillation based on the first information.

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

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

[0143] The generating unit 21 is configured to 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 when the current computing power information and / or the current routing information is updated; and generate a first message based on the first information;

[0144] The sending unit 22 is configured to send the first message to a first node, so that the first node performs routing oscillation detection based on the first message.

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

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

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

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

[0149] Furthermore, in an embodiment of the present application, the above-mentioned second processor 23 is used to 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 when it detects that the current computing power information and / or the current routing information is 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 and processing based on the first message.

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

[0151] The embodiment of the present application provides a second node, when the second node detects the current computing power information, and / or the current routing information is updated, the second node generates the first information based on the first identification information, the first computing power information and one or more of the first routing information of the second node; generates the first message based on the first information, and sends the first message to the first node, so that the first node performs routing oscillation detection and processing based on the first message. It can be seen that the second node can generate the first information based on the first identification information, the first computing power information and one or more of the first routing information of the second node, and generate the first message based on the first information, and then send the first message to the first node, so that the first node can perform routing oscillation detection and processing based on the first message, thereby shortening the detection time of routing oscillation, and then improving the detection efficiency of routing oscillation.

[0152] An embodiment of the present application provides a computer-readable storage medium on which a program is stored. When the program is executed by a processor, the computing power routing oscillation detection method as described above is implemented.

[0153] Specifically, a program instruction corresponding to a computing power routing oscillation detection method in this embodiment can be stored on a storage medium such as a CD, a hard disk, a USB flash drive, etc. When the program instruction corresponding to a computing power routing oscillation detection method in the storage medium is read or executed by an electronic device, the following steps are included:

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

[0155] A first message is generated based on the first information, and the first message is sent to a first node, so that the first node performs routing oscillation detection processing based on the first message.

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

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

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

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

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

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

Claims

1. A computing power routing oscillation detection method, characterized in that: The method is applied to a first node, and the method comprises: Receive a first message sent by a second node; wherein the first message includes at least first information, and the first information includes one or more of first identification information, first computing power information, and first routing information of the second node; It is determined whether there is routing flapping based on the first information.

2. The method according to claim 1, characterized in that The first computing power information includes computing power information before updating and computing power information after updating, the first routing information includes second routing information corresponding to the computing power information before updating and third routing information corresponding to the computing power information after updating, and the determining whether routing oscillation occurs based on the first information includes: Determining whether to update the current routing information based on the currently stored routing information, the second routing information, and the third routing information; When the current routing information is not updated, it is determined that there is no routing flapping.

3. The method according to claim 2, characterized in that The method further comprises: In the case of updating the current routing information, it is determined whether routing oscillation exists based on the first identification information and the first routing information.

4. The method according to claim 3, characterized in that The determining whether there is route flapping based on the first identification information and the first route information includes: When 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, determining that routing flapping exists; or, When the second identification information is different from the first identification information, the first message is sent to a neighboring node corresponding to the first node, and the first routing information and attribute information corresponding to the first routing information are stored.

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

6. A computing power routing oscillation detection method, characterized in that: The method is applied to the second node, and the method includes: When it is detected that the current computing power information and / or the current routing information is updated, generating the first information based on one or more of the first identification information of the second node, the first computing power information, and the first routing information; A first message is generated based on the first information, and the first message is sent to a first node, so that the first node performs routing oscillation detection processing based on the first message.

7. The method according to claim 6, characterized in that The generating a first message based on the first information includes: Encapsulate the first information into a first preset field of a second message to generate the first message; wherein the first preset field is at least used to characterize an attribute list of the first information, and the attribute list includes one or more of an attribute tag, an attribute type, an attribute length, and attribute data.

8. 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 a second node; wherein the first message includes at least first information, and the first information includes one or more of first identification information, first computing power information, and first routing information of the second node; The determining unit is configured to determine whether routing oscillation occurs based on the first information.

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

10. A second node, characterized in that: The second node includes: a generating unit and a sending unit; wherein, The generating unit is configured to generate 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 when the current computing power information and / or the current routing information is updated; and generate a first message based on the first information; The sending unit is configured to send the first message to a first node, so that the first node performs routing oscillation detection processing based on the first message.

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

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

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

Images