BGP loop processing method and device, computer equipment and storage medium

Abstract

The invention relates to a BGP loop processing method and device, computer equipment, a computer readable storage medium and a computer program product. The method comprises the following steps: acquiring the number of adjacent routing nodes; according to the number of the adjacent routing nodes, the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes are transmitted by using the current routing node and the adjacent routing nodes until path closed loop is completed; according to the current routing information and the adjacent routing information, judging whether a BGP loop appears in networking of the data center network; wherein the current routing information and the adjacent routing information both comprise a random autonomous system number of local routing equipment and an identifier of a virtual routing forwarding instance; under the condition that a BGP loop appears in networking of a data center network, the priority of an information transmission path of an adjacent routing node is reduced. By adopting the method, the BGP loop can be effectively solved in a route continuous oscillation scene.

Description

Technical Field

[0001] The present application relates to the field of data communication technology, and in particular to a BGP loop processing method, apparatus, computer equipment, computer-readable storage medium, and computer program product. Background Art

[0002] BGP (Border Gateway Protocol) is an important part of the inter-data center network, which helps to implement dynamic, flexible and efficient routing strategies. In the data center network, a loop usually refers to a circular path in the network topology, and the loop between data centers is also called a BGP loop. When a data packet is forwarded in the network, if there is a loop, the data packet may continue to circulate in the loop, resulting in data loss and confusion, network performance degradation, reduced routing stability, fault monitoring and fault recovery, etc.

[0003] A common BGP loop detection method is to detect loops through the AS path between BGP routers. The AS path is a set of AS numbers contained in the BGP route update, which indicates the path of the data packet from the source AS to the destination AS. When a BGP router receives an AS path containing its own AS number, it means that a loop has been detected. Another common BGP loop detection method is to detect loops through the BGP route update information between BGP routers. The router will check the received BGP route update information. If it finds that a certain route information will cause a loop, it will reject the route information or take other measures to avoid the occurrence of loops. However, the above methods have limitations in some specific scenarios (such as the scenario of continuous route oscillation) and cannot effectively solve BGP loops.

[0004] Therefore, there is an urgent need for a BGP loop processing method, apparatus, computer device, computer-readable storage medium, and computer program product that can effectively resolve BGP loops in a scenario of continuous route oscillation. Summary of the invention

[0005] Based on this, it is necessary to provide a BGP loop processing method, apparatus, computer equipment, computer-readable storage medium and computer program product that can effectively solve BGP loops in a scenario of continuous route oscillation in response to the above technical problems.

[0006] In a first aspect, the present application provides a BGP loop processing method, including:

[0007] The data center network includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and the at least one adjacent routing node; the method includes:

[0008] Get the number of nodes adjacent to the routing node;

[0009] According to the number of nodes of the adjacent routing nodes, the current routing node and the adjacent routing nodes are used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes until the path closure is completed;

[0010] According to the current routing information and the adjacent routing information, determine whether a BGP loop occurs in the data center network; wherein the current routing information and the adjacent routing information both include a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance;

[0011] In the event of a BGP loop in the data center network, lower the priority of the information transmission path of the adjacent routing nodes.

[0012] In one embodiment, judging whether a BGP loop occurs in the data center network networking according to the current routing information and the adjacent routing information includes:

[0013] Get the adjacent routing information received by the current routing node;

[0014] Determine, based on the current routing information and adjacent routing information received by the current routing node, whether the two have the same random autonomous system number;

[0015] When the same random autonomous system number exists, it is determined that a BGP loop occurs in the data center network.

[0016] In one embodiment, the method further comprises:

[0017] Get the adjacent routing information received by the current routing node;

[0018] Analyze whether there is a BGP loop record in the adjacent routing information received by the current routing node;

[0019] When there is a BGP loop record in the current routing information, it is determined that a BGP loop occurs in the data center network.

[0020] In one embodiment, the method of transmitting the current routing information of the current routing node and the adjacent routing information of the adjacent routing node by using the current routing node and the adjacent routing node according to the number of nodes of the adjacent routing node until the path closure is completed includes:

[0021] When the number of adjacent routing nodes is two, the upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the upstream adjacent routing node;

[0022] Transmitting the current routing information to the current routing node using an upstream adjacent routing node;

[0023] Using the current routing node to transmit the current routing information to a downstream adjacent routing node;

[0024] Utilize the downstream adjacent routing node to transmit adjacent routing information to the upstream adjacent routing node;

[0025] The upstream adjacent routing node is used to transmit the current routing information and the adjacent routing information to the current routing node to complete the path closure.

[0026] In one embodiment, the method of transmitting the current routing information of the current routing node and the adjacent routing information of the adjacent routing node by using the current routing node and the adjacent routing node according to the number of nodes of the adjacent routing node until the path closure is completed includes:

[0027] In the case where the number of adjacent routing nodes is three nodes, the first upstream adjacent routing node is connected to the second upstream adjacent routing node, the second upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the second upstream adjacent routing node;

[0028] Transmitting the first upstream routing information to a second upstream adjacent routing node using a first upstream adjacent routing node;

[0029] Using a second upstream adjacent routing node to transmit the first upstream routing information and the second upstream routing information to the current routing node;

[0030] Using the current routing node to transmit the first upstream routing information, the second upstream routing information and the current routing information to a downstream adjacent routing node;

[0031] According to a preset transmission strategy, using a downstream adjacent routing node to stop further transmission of the first upstream routing information and the second upstream routing information, and transmitting the current routing information to a second upstream adjacent routing node;

[0032] The second upstream adjacent routing node is used to transmit the current routing information and the downstream adjacent routing information to the current routing node to complete the path closure.

[0033] In one embodiment, when a BGP loop occurs in the data center network, reducing the priority of the information transmission path of the adjacent routing node includes:

[0034] In the case of a BGP loop in the data center network, determining a target routing node for transmitting the same random autonomous system number from adjacent routing nodes;

[0035] Lower the priority of the information transmission path of the target routing node.

[0036] In a second aspect, the present application further provides a BGP loop processing device, including:

[0037] The data center network includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and the at least one adjacent routing node;

[0038] An acquisition module is used to obtain the number of nodes adjacent to the routing node;

[0039] An information transmission module, used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes according to the number of nodes of the adjacent routing nodes, until the path closure is completed;

[0040] A BGP loop judgment module is used to judge whether a BGP loop occurs in the data center network networking according to the current routing information and the adjacent routing information; wherein the current routing information and the adjacent routing information both include a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance;

[0041] The processing module is used to reduce the priority of the information transmission path of the adjacent routing node when a BGP loop occurs in the data center network.

[0042] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0043] The data center network includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and the at least one adjacent routing node; the method includes:

[0044] Get the number of nodes adjacent to the routing node;

[0045] According to the number of nodes of the adjacent routing nodes, the current routing node and the adjacent routing nodes are used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes until the path closure is completed;

[0046] According to the current routing information and the adjacent routing information, determine whether a BGP loop occurs in the data center network; wherein the current routing information and the adjacent routing information both include a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance;

[0047] In the event of a BGP loop in the data center network, lower the priority of the information transmission path of the adjacent routing nodes.

[0048] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the following steps are implemented:

[0049] The data center network includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and the at least one adjacent routing node; the method includes:

[0050] Get the number of nodes adjacent to the routing node;

[0051] According to the number of nodes of the adjacent routing nodes, the current routing node and the adjacent routing nodes are used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes until the path closure is completed;

[0052] According to the current routing information and the adjacent routing information, determine whether a BGP loop occurs in the data center network; wherein the current routing information and the adjacent routing information both include a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance;

[0053] In the event of a BGP loop in the data center network, lower the priority of the information transmission path of the adjacent routing nodes.

[0054] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0055] The data center network includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and the at least one adjacent routing node; the method includes:

[0056] Get the number of nodes adjacent to the routing node;

[0057] According to the number of nodes of the adjacent routing nodes, the current routing node and the adjacent routing nodes are used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes until the path closure is completed;

[0058] According to the current routing information and the adjacent routing information, determine whether a BGP loop occurs in the data center network; wherein the current routing information and the adjacent routing information both include a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance;

[0059] In the event of a BGP loop in the data center network, lower the priority of the information transmission path of the adjacent routing nodes.

[0060] The above-mentioned BGP loop processing method, device, computer equipment, computer-readable storage medium and computer program product can more accurately detect whether there is a BGP loop in the data center network by obtaining the routing information of the current routing node and the adjacent routing node. By transmitting the routing information of the current routing node and the adjacent routing node until the path closure is completed, the method can timely discover the loop, thereby reducing the time for the data packet to circulate in the loop. In the case of detecting a BGP loop, the method can not only identify the loop, but also actively avoid the formation of the loop by reducing the priority of the information transmission path of the adjacent routing node, thereby improving the stability and reliability of the network. By avoiding and processing BGP loops, the method reduces the possibility of network attacks, helps to reduce data loss and confusion, improve network performance, reduce the risk of reduced routing stability, and simplify the process of fault monitoring and fault recovery. The method is particularly suitable for scenarios where routing continues to oscillate, and can effectively solve the BGP loop problem in such complex scenarios, enhancing the adaptability and robustness of the data center network. BRIEF DESCRIPTION OF THE DRAWINGS

[0061] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0062] Figure 1 A schematic diagram of a flow chart of a BGP loop processing method in an embodiment;

[0063] Figure 2 A schematic diagram of a flow chart of a BGP loop processing method in another embodiment;

[0064] Figure 3 A routing topology diagram of two adjacent routing nodes in one embodiment;

[0065] Figure 4 A routing topology diagram of three adjacent routing nodes in one embodiment;

[0066] Figure 5 A structural block diagram of a BGP loop processing device in an embodiment;

[0067] Figure 6 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0068] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0069] BGP (Border Gateway Protocol) is an important part of the inter-data center network, which helps to implement dynamic, flexible and efficient routing strategies. In the data center network, a loop usually refers to a circular path in the network topology, and the loop between data centers is also called a BGP loop. When a data packet is forwarded in the network, if there is a loop, the data packet may continue to circulate in the loop, resulting in data loss and confusion, network performance degradation, reduced routing stability, fault monitoring and fault recovery, etc.

[0070] A common BGP loop detection method is to detect loops through the AS path between BGP routers. The AS path is a set of AS numbers contained in the BGP route update, which indicates the path of the data packet from the source AS to the destination AS. When a BGP router receives an AS path containing its own AS number, it means that a loop has been detected. Another common BGP loop detection method is to detect loops through the BGP route update information between BGP routers. The router will check the received BGP route update information. If it finds that a certain route information will cause a loop, it will reject the route information or take other measures to avoid the occurrence of loops. However, the above methods have limitations in some specific scenarios (such as the scenario of continuous route oscillation) and cannot effectively solve BGP loops.

[0071] Based on the above traditional technologies, such as Figure 1 As shown, a BGP loop processing method is provided, and the method is applied to a server as an example for explanation. The data center network includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and at least one adjacent routing node; the method includes the following steps S102 to S108. Among them:

[0072] Step S102, obtaining the number of nodes adjacent to the routing node.

[0073] Specifically, in a data center network, there is a current routing node (i.e., the router being processed) and at least one adjacent routing node connected to it (i.e., other routers directly or indirectly connected to the current routing node). These routing nodes are interconnected through routing paths, forming the basis for network communication within or between data centers.

[0074] Obtaining the number of adjacent routing nodes means that in the process of implementing the BGP loop processing method, it is necessary to determine how many adjacent routing nodes are connected to the current routing node, in preparation for subsequent loop detection and processing, because loop detection needs to take into account the exchange of routing information between the current routing node and these adjacent routing nodes. Obtaining the number of adjacent routing nodes helps to understand the network topology around the current routing node in order to detect possible loops; and to determine which adjacent routing nodes need to exchange routing information and how to transmit this information.

[0075] Step S104, according to the number of nodes of the adjacent routing nodes, using the current routing node and the adjacent routing nodes, transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes until the path loop is completed.

[0076] Specifically, the current routing information refers to the routing information held by the current routing node, and the adjacent routing information refers to the routing information held by other nodes connected to the current routing node. Routing information includes the prefix of the reachable network, path attributes (such as AS path), and possible loop detection attributes.

[0077] By continuously exchanging routing information, each node can collect the complete path information starting from itself, passing through the adjacent routing nodes and returning to itself. This process will continue until a closed loop is formed, that is, the routing information finally returns to the starting node, indicating that a complete path has been formed.

[0078] Step S106, judging whether a BGP loop occurs in the data center network networking according to the current routing information and the adjacent routing information; wherein the current routing information and the adjacent routing information both include the random autonomous system number of the local routing device and the identifier of the virtual routing forwarding instance.

[0079] Specifically, the current routing information and adjacent routing information include two key parts:

[0080] Random Autonomous System Number (ASN) of the local routing device: This is a randomly generated number used to identify the local autonomous system to distinguish between different autonomous systems.

[0081] Virtual routing and forwarding instance identifier (vrfID): This is an identifier used to distinguish different virtual routing and forwarding instances (VRFs). In large networks, VRFs are used to create isolated routing and forwarding tables.

[0082] By comparing the routing information of the current routing node and the adjacent routing nodes, it is possible to determine whether there is a loop in the network. Specifically: if the random ASN or vrfID in the routing information received by the current routing node matches the ASN or vrfID in the routing information sent by itself, this indicates that the routing information has returned to the original sending node, thus detecting a loop. This match means that the propagation of routing information in the network forms a closed loop, and data packets may continue to circulate in this loop, causing network problems. Through this loop detection mechanism, BGP routing loops can be discovered and processed in a timely manner to prevent data packets from circulating infinitely in the loop.

[0083] Step S108, when a BGP loop occurs in the data center network, the priority of the information transmission path of the adjacent routing node is reduced.

[0084] Specifically, a BGP loop causes packets to circulate endlessly in the network, which not only consumes network resources but can also cause packet loss, network congestion, and performance degradation. In BGP, route selection is based on a series of path attributes, including the priority of the route. When a BGP loop is detected, the route selection can be influenced by adjusting the priority of the information transmission path of the routing node.

[0085] Specifically, lowering the priority of information transmission paths of adjacent routing nodes means that the information transmission paths of these routing nodes will be considered less preferred during the routing selection process, and therefore less likely to be selected as the best information transmission paths. Doing so can block or reduce the data traffic through these paths, thereby avoiding loops. By lowering the priority of loop paths, data packets can be effectively prevented from being sent to these paths, thereby breaking the loop and preventing data packets from circulating in the loop. Once the loop is resolved, the priority of the path can be readjusted to restore normal routing selection logic.

[0086] In the above-mentioned BGP loop processing method, by obtaining the routing information of the current routing node and the adjacent routing node, it is possible to more accurately detect whether there is a BGP loop in the data center network. By transmitting the routing information of the current routing node and the adjacent routing node until the path closure is completed, the method can timely discover the loop, thereby reducing the time for the data packet to circulate in the loop. In the case of a BGP loop being detected, the method can not only identify the loop, but also actively avoid the formation of the loop by reducing the priority of the information transmission path of the adjacent routing node, thereby improving the stability and reliability of the network. By avoiding and processing BGP loops, the method reduces the possibility of network attacks, helps to reduce data loss and confusion, improve network performance, reduce the risk of reduced routing stability, and simplify the process of fault monitoring and fault recovery. The method is particularly suitable for scenarios where routing continues to oscillate, and can effectively solve the BGP loop problem in such complex scenarios, enhancing the adaptability and robustness of the data center network.

[0087] In an exemplary embodiment, Figure 2 As shown, based on the current routing information and adjacent routing information, determine whether a BGP loop occurs in the data center network, including:

[0088] Step S202, obtaining adjacent routing information received by the current routing node;

[0089] Step S204, determining whether the current routing information and the adjacent routing information received by the current routing node have the same random autonomous system number;

[0090] Step S206: When the same random autonomous system number exists, it is determined that a BGP loop occurs in the data center network.

[0091] Specifically, during the information transmission (i.e. routing) process, the current routing node will receive adjacent routing information transmitted from its adjacent routing node, and the current routing node will compare its own routing information (i.e. current routing information) with the adjacent routing information. The focus of the comparison is to check whether there is the same random autonomous system number (ASN).

[0092] If the random ASN in the routing information of the current routing node is found to be the same as the random ASN in the routing information received from the adjacent routing node during the comparison process, it means that the current routing node has received a routing information that was once sent by itself. This situation usually means that there is a loop in the network because the routing information eventually returns to the original sending node.

[0093] When the same random ASN is detected, it can be determined that a BGP loop has occurred in the data center network. This loop may be caused by the circular propagation of routing information in the network, causing data packets to continuously circulate in the loop instead of being transmitted along the optimal path.

[0094] In this embodiment, specific attributes (such as random ASN) in BGP routing information are used to detect loops. By comparing the routing information between the current routing node and the adjacent routing nodes and checking whether the random ASN is the same, it is determined whether there is a BGP loop in the data center network. This can be applied to scenarios where routing continues to oscillate, and BGP loops can be discovered in a timely manner, thereby reducing the time that data packets circulate in the BGP loop.

[0095] In an exemplary embodiment, adjacent routing information received by a current routing node is obtained;

[0096] Analyze whether there is a BGP loop record in the adjacent routing information received by the current routing node;

[0097] When there is a BGP loop record in the current routing information, it is determined that a BGP loop occurs in the data center network.

[0098] Specifically, the current routing node needs to receive adjacent routing information from the adjacent routing nodes directly connected to it. For the adjacent routing information received from the adjacent routing nodes, the current routing node needs to analyze whether the routing information contains BGP loop records, which are a mark used to indicate whether a certain routing information has ever participated in a loop.

[0099] If the current routing node finds a BGP loop record in the adjacent routing information it receives, it means that the adjacent routing information has formed a loop during the propagation process in the network. The existence of a BGP loop record indicates that even if this adjacent routing information does not carry the loop attribute of the current routing node itself, it may also be a loop route.

[0100] Once a loop record is detected, the current routing node can determine that a BGP loop has occurred in the data center network. This loop may be caused by the circular propagation of routing information in the network, causing data packets to continuously circulate in the loop instead of being transmitted along the optimal path.

[0101] In this embodiment, by checking whether the routing information received from the adjacent routing node contains a BGP loop record, it is determined whether there is a BGP loop in the data center network. The BGP loop record is used to detect the loop, which can be applicable to the scenario of continuous routing oscillation and timely discover the loop, thereby reducing the time for the data packet to circulate in the BGP loop to maintain the stability and performance of the network.

[0102] In an exemplary embodiment, according to the number of nodes of the adjacent routing nodes, the current routing node and the adjacent routing nodes are used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes until the path loop is completed, including:

[0103] When the number of adjacent routing nodes is two, the upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the upstream adjacent routing node;

[0104] Utilize upstream adjacent routing nodes to transmit current routing information to the current routing node;

[0105] Using the current routing node to transmit the current routing information to the downstream adjacent routing node;

[0106] Utilize the downstream adjacent routing node to transmit adjacent routing information to the upstream adjacent routing node;

[0107] The upstream adjacent routing node is used to transmit the current routing information and adjacent routing information to the current routing node to complete the path closure.

[0108] Specifically, there are three routing nodes: a current routing node and two adjacent routing nodes (upstream adjacent routing node and downstream adjacent routing node). The upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected back to the upstream adjacent routing node, forming a closed loop.

[0109] The upstream adjacent routing node first transmits the current routing information to the current routing node, and then the current routing node transmits the received current routing information to the downstream adjacent routing node.

[0110] Then, the downstream adjacent routing node transmits its own adjacent routing information back to the upstream adjacent routing node.

[0111] Finally, the upstream adjacent routing node transmits the adjacent routing information received from the downstream adjacent routing node and its own current routing information to the current routing node.

[0112] Through this series of routing information transmission, a path loop is completed starting from the upstream adjacent routing node, passing through the current routing node and the downstream adjacent routing node, and finally returning to the upstream adjacent routing node.

[0113] In this closed loop process, each routing node will check whether the routing information transmitted to it contains its own loop attributes (such as the random autonomous system number of the local routing device and the identifier of the virtual routing forwarding instance). If it is found that the routing information contains its own loop attributes, it means that a BGP loop has been detected.

[0114] For example, Figure 3 As shown in FIG. 1 , a routing topology diagram is shown for two adjacent routing nodes, where the current routing node is RT1, the downstream adjacent routing node is RT2, and the upstream adjacent routing node is RT3.

[0115] 1. RT1 imports the static route 1.1.1.1 from RT3 and transmits the current routing information to RT2, carrying the random autonomous system number AS100;

[0116] 2. Since RT2 is configured with the AS-override command, it transmits its own adjacent routing information to RT3, carrying the random autonomous system number AS200;

[0117] 3. The AS200 carried in the adjacent routing information received by RT3 is different from its own AS100 and will not be considered as a BGP loop.

[0118] 4. RT1 imports static route 1.1.1.1 from RT3 again, preferentially selects its own adjacent routing information received by RT3, and transmits the adjacent routing information and its own current routing information to RT2, carrying AS100 and AS200.

[0119] 5. After RT2 detects the loop, it finds that the device loop attribute already contains RT1's device loop attribute AS100, and determines it to be a BGP loop. It lowers the priority of the 1.1.1.1 information transmission path sent by RT3 and issues a route withdrawal instruction to RT3.

[0120] 6. After RT1 receives the route withdrawal instruction from RT3, it continues to loop steps 1-5.

[0121] In this embodiment, by setting how to complete the path closure through the transmission of routing information in the case of two adjacent routing nodes and detect the BGP loop, the loop can be discovered and processed in time to maintain the stability and performance of the network.

[0122] In an exemplary embodiment, according to the number of nodes of the adjacent routing nodes, the current routing node and the adjacent routing nodes are used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes until the path loop is completed, including:

[0123] In the case where the number of adjacent routing nodes is three nodes, the first upstream adjacent routing node is connected to the second upstream adjacent routing node, the second upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the second upstream adjacent routing node;

[0124] Transmitting the first upstream routing information to the second upstream adjacent routing node using the first upstream adjacent routing node;

[0125] using the second upstream adjacent routing node to transmit the first upstream routing information and the second upstream routing information to the current routing node;

[0126] Using the current routing node to transmit the first upstream routing information, the second upstream routing information and the current routing information to the downstream adjacent routing node;

[0127] According to a preset transmission strategy, using a downstream adjacent routing node to stop continuing to transmit the first upstream routing information and the second upstream routing information, and transmitting the current routing information to the second upstream adjacent routing node;

[0128] The second upstream adjacent routing node is used to transmit the current routing information and the downstream adjacent routing information to the current routing node to complete the path closure.

[0129] Specifically, there are four routing nodes: a current routing node and three adjacent routing nodes (a first upstream adjacent routing node, a second upstream adjacent routing node, and a downstream adjacent routing node). The first upstream adjacent routing node is connected to the second upstream adjacent routing node, the second upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected back to the second upstream adjacent routing node, forming a closed loop.

[0130] The first upstream adjacent routing node first transmits its routing information (first upstream routing information) to the second upstream adjacent routing node. The second upstream adjacent routing node transmits the received first upstream routing information and its own routing information (second upstream routing information) to the current routing node. The current routing node transmits the received first upstream routing information, second upstream routing information, and its own routing information (current routing information) to the downstream adjacent routing node.

[0131] According to the preset transmission strategy, the downstream adjacent routing node stops transmitting the first upstream routing information and the second upstream routing information, and transmits the current routing information back to the second upstream adjacent routing node. Finally, the second upstream adjacent routing node transmits the current routing information received from the downstream adjacent routing node and its own downstream adjacent routing information to the current routing node, completing the path closure.

[0132] In this closed loop process, each routing node will check whether the routing information transmitted to it contains its own loop attributes (such as the random autonomous system number of the local routing device and the identifier of the virtual routing forwarding instance). If it is found that the routing information contains its own loop attributes, it means that a BGP loop has been detected.

[0133] For example, Figure 4 As shown, a routing topology diagram is shown for three adjacent routing nodes, wherein the first upstream adjacent routing node is RT1, the second upstream adjacent routing node is RT2, the current routing node is RT3, and the downstream adjacent routing node is RT4.

[0134] 1. RT2 receives the first upstream routing information originating from RT1, which carries AS100.

[0135] 2. After RT2 optimizes, it transmits the first upstream routing information and its own second upstream routing information to RT3, carrying AS100 and AS200.

[0136] 3. RT3 transmits the first upstream routing information, the second upstream routing information and the current routing information to RT4, carrying AS100, AS200 and AS300.

[0137] 4. RT4 deletes AS200 and AS100 in the neighbor export policy with RT2, and only carries AS 300 when transmitting the current routing information to RT2.

[0138] 5. When RT2 receives the current routing information from RT4, the AS300 it carries is different from the AS200 it receives, and it cannot determine the BGP loop. It then transmits the current routing information and downstream adjacent routing information to RT3, carrying AS200 and AS300.

[0139] 6. When RT3 receives the current routing information and downstream adjacent routing information, it determines that it is a BGP loop because it carries RT3's own AS300, reduces the priority of RT4's information transmission path, and issues a route withdrawal instruction to RT4.

[0140] 7. After RT2 receives the route withdrawal instruction from RT4, it continues to loop steps 1-6.

[0141] In this embodiment, by setting how to complete the path closure through the transmission of routing information in the case of two adjacent routing nodes and detect the BGP loop, the loop can be discovered and processed in time to maintain the stability and performance of the network.

[0142] In an exemplary embodiment, when a BGP loop occurs in a data center network, reducing the priority of an information transmission path of an adjacent routing node includes:

[0143] In the case of a BGP loop in the data center network, determine the target routing node that transmits the same random autonomous system number from the adjacent routing nodes;

[0144] Lower the priority of the information transmission path of the target routing node.

[0145] Specifically, when a BGP loop occurs in a data center network, it is first necessary to determine which routing nodes are involved in the formation of the BGP loop. This is usually done by analyzing loop attributes in the routing information (such as the Loop-detection attribute, which contains a random autonomous system number). From the adjacent routing nodes, it is necessary to determine the target routing nodes that have transmitted routing information containing the same random autonomous system number (ASN). These numbers are previously generated by local devices and added to the routing information to identify the source of the routing information. If a routing node receives a routing information containing a random ASN that is the same as its own ASN, this means that the routing node is part of the loop.

[0146] Once the target routing nodes are identified, i.e., those that participate in the loop formation and transmit the same random ASN, the next step is to reduce the priority of the information transmission paths of these nodes. Reducing the priority can be achieved by modifying the BGP path attributes, such as setting a lower local preference value or adding a specific community attribute to indicate that these paths should be given a lower priority.

[0147] In this embodiment, by lowering the priority of these paths, the traffic passing through these paths can be effectively reduced or avoided, thereby breaking the loop and preventing data packets from circulating infinitely in the loop. This helps maintain the stability and performance of the network because it can quickly respond to the occurrence of loops and take measures to resolve or mitigate the impact of the loops.

[0148] After the loop is processed, the network status needs to be continuously monitored to ensure that the loop has been successfully processed and no new loops are formed. If necessary, the routing policy can be adjusted according to the real-time status of the network to further optimize network performance and stability. In summary, this process is to deal with loop problems by identifying and reducing the information transmission path priority of adjacent routing nodes involved in the BGP loop to ensure network stability and efficiency.

[0149] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0150] Based on the same inventive concept, the embodiment of the present application also provides a BGP loop processing device for implementing the BGP loop processing method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations of one or more BGP loop processing device embodiments provided below can refer to the limitations of the BGP loop processing method above, and will not be repeated here.

[0151] In an exemplary embodiment, Figure 5 As shown, a BGP loop processing device is provided, including: a data center network group includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and the at least one adjacent routing node;

[0152] An acquisition module 502 is used to acquire the number of nodes adjacent to the routing node;

[0153] The information transmission module 504 is used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes by using the current routing node and the adjacent routing nodes according to the number of nodes of the adjacent routing nodes until the path closure is completed;

[0154] The BGP loop determination module 506 is used to determine whether a BGP loop occurs in the data center network according to the current routing information and the adjacent routing information; wherein the current routing information and the adjacent routing information both include the random autonomous system number of the local routing device and the identifier of the virtual routing forwarding instance;

[0155] The processing module 508 is used to reduce the priority of the information transmission path of the adjacent routing node when a BGP loop occurs in the data center network.

[0156] In an exemplary embodiment, the BGP loop judgment module 506 is also used to obtain adjacent routing information received by the current routing node; based on the current routing information and the adjacent routing information received by the current routing node, determine whether the two have the same random autonomous system number; when the same random autonomous system number exists, determine that a BGP loop occurs in the data center network.

[0157] In an exemplary embodiment, the BGP loop judgment module 506 is also used to obtain adjacent routing information received by the current routing node; analyze whether there is a BGP loop record in the adjacent routing information received by the current routing node; and determine that a BGP loop occurs in the data center network when there is a BGP loop record in the current routing information.

[0158] In an exemplary embodiment, the information transmission module 504 is also used for, when the number of adjacent routing nodes is two, the upstream adjacent routing node connects to the current routing node, the current routing node connects to the downstream adjacent routing node, and the downstream adjacent routing node connects to the upstream adjacent routing node; using the upstream adjacent routing node to transmit current routing information to the current routing node; using the current routing node to transmit current routing information to the downstream adjacent routing node; using the downstream adjacent routing node to transmit adjacent routing information to the upstream adjacent routing node; using the upstream adjacent routing node to transmit current routing information and adjacent routing information to the current routing node, to complete the path closure.

[0159] In an exemplary embodiment, the information transmission module 504 is also used for, when the number of nodes of the adjacent routing nodes is three nodes, the first upstream adjacent routing node is connected to the second upstream adjacent routing node, the second upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the second upstream adjacent routing node; using the first upstream adjacent routing node to transmit the first upstream routing information to the second upstream adjacent routing node; using the second upstream adjacent routing node to transmit the first upstream routing information and the second upstream routing information to the current routing node; using the current routing node to transmit the first upstream routing information, the second upstream routing information and the current routing information to the downstream adjacent routing node; according to a preset transmission strategy, using the downstream adjacent routing node to stop continuing to transmit the first upstream routing information and the second upstream routing information, and transmit the current routing information to the second upstream adjacent routing node; using the second upstream adjacent routing node to transmit the current routing information and the downstream adjacent routing information to the current routing node to complete the path closure.

[0160] In an exemplary embodiment, the processing module 508 is also used to determine a target routing node that transmits the same random autonomous system number from adjacent routing nodes when a BGP loop occurs in the data center network; and reduce the priority of the information transmission path of the target routing node.

[0161] Each module in the above-mentioned BGP loop processing device can be implemented in whole or in part by software, hardware and a combination thereof. Each of the above-mentioned modules can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to each of the above modules.

[0162] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Figure 6 As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store routing information. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a BGP loop processing method is implemented.

[0163] Those skilled in the art will understand that Figure 6 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0164] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:

[0165] The data center network includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and the at least one adjacent routing node; the method includes:

[0166] Get the number of nodes adjacent to the routing node;

[0167] According to the number of nodes of the adjacent routing nodes, the current routing node and the adjacent routing nodes are used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes until the path closure is completed;

[0168] According to the current routing information and the adjacent routing information, determine whether a BGP loop occurs in the data center network; wherein the current routing information and the adjacent routing information both include a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance;

[0169] In the event of a BGP loop in the data center network, lower the priority of the information transmission path of the adjacent routing nodes.

[0170] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0171] Get the adjacent routing information received by the current routing node;

[0172] According to the current routing information and the adjacent routing information received by the current routing node, determining whether the two have the same random autonomous system number;

[0173] When the same random autonomous system number exists, it is determined that a BGP loop occurs in the data center network.

[0174] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0175] Get the adjacent routing information received by the current routing node;

[0176] Analyze whether there is a BGP loop record in the adjacent routing information received by the current routing node;

[0177] When there is a BGP loop record in the current routing information, it is determined that a BGP loop occurs in the data center network.

[0178] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0179] When the number of adjacent routing nodes is two, the upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the upstream adjacent routing node;

[0180] Utilize upstream adjacent routing nodes to transmit current routing information to the current routing node;

[0181] Using the current routing node to transmit the current routing information to the downstream adjacent routing node;

[0182] Utilize the downstream adjacent routing node to transmit adjacent routing information to the upstream adjacent routing node;

[0183] The upstream adjacent routing node is used to transmit the current routing information and adjacent routing information to the current routing node to complete the path closure.

[0184] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0185] In the case where the number of adjacent routing nodes is three nodes, the first upstream adjacent routing node is connected to the second upstream adjacent routing node, the second upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the second upstream adjacent routing node;

[0186] Transmitting the first upstream routing information to the second upstream adjacent routing node using the first upstream adjacent routing node;

[0187] using the second upstream adjacent routing node to transmit the first upstream routing information and the second upstream routing information to the current routing node;

[0188] Using the current routing node to transmit the first upstream routing information, the second upstream routing information and the current routing information to the downstream adjacent routing node;

[0189] According to a preset transmission strategy, using a downstream adjacent routing node to stop continuing to transmit the first upstream routing information and the second upstream routing information, and transmitting the current routing information to the second upstream adjacent routing node;

[0190] The second upstream adjacent routing node is used to transmit the current routing information and the downstream adjacent routing information to the current routing node to complete the path closure.

[0191] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:

[0192] In the case of a BGP loop in the data center network, determine the target routing node that transmits the same random autonomous system number from the adjacent routing nodes;

[0193] Lower the priority of the information transmission path of the target routing node.

[0194] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0195] The data center network includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and the at least one adjacent routing node; the method includes:

[0196] Get the number of nodes adjacent to the routing node;

[0197] According to the number of nodes of the adjacent routing nodes, the current routing node and the adjacent routing nodes are used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes until the path closure is completed;

[0198] According to the current routing information and the adjacent routing information, determine whether a BGP loop occurs in the data center network; wherein the current routing information and the adjacent routing information both include a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance;

[0199] In the event of a BGP loop in the data center network, lower the priority of the information transmission path of the adjacent routing nodes.

[0200] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0201] Get the adjacent routing information received by the current routing node;

[0202] According to the current routing information and the adjacent routing information received by the current routing node, determining whether the two have the same random autonomous system number;

[0203] When the same random autonomous system number exists, it is determined that a BGP loop occurs in the data center network.

[0204] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0205] Get the adjacent routing information received by the current routing node;

[0206] Analyze whether there is a BGP loop record in the adjacent routing information received by the current routing node;

[0207] When there is a BGP loop record in the current routing information, it is determined that a BGP loop occurs in the data center network.

[0208] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0209] When the number of adjacent routing nodes is two, the upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the upstream adjacent routing node;

[0210] Utilize upstream adjacent routing nodes to transmit current routing information to the current routing node;

[0211] Using the current routing node to transmit the current routing information to the downstream adjacent routing node;

[0212] Utilize the downstream adjacent routing node to transmit adjacent routing information to the upstream adjacent routing node;

[0213] The upstream adjacent routing node is used to transmit the current routing information and adjacent routing information to the current routing node to complete the path closure.

[0214] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0215] In the case where the number of adjacent routing nodes is three nodes, the first upstream adjacent routing node is connected to the second upstream adjacent routing node, the second upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the second upstream adjacent routing node;

[0216] Transmitting the first upstream routing information to the second upstream adjacent routing node using the first upstream adjacent routing node;

[0217] using the second upstream adjacent routing node to transmit the first upstream routing information and the second upstream routing information to the current routing node;

[0218] Using the current routing node to transmit the first upstream routing information, the second upstream routing information and the current routing information to the downstream adjacent routing node;

[0219] According to a preset transmission strategy, using a downstream adjacent routing node to stop continuing to transmit the first upstream routing information and the second upstream routing information, and transmitting the current routing information to the second upstream adjacent routing node;

[0220] The second upstream adjacent routing node is used to transmit the current routing information and the downstream adjacent routing information to the current routing node to complete the path closure.

[0221] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0222] In the case of a BGP loop in the data center network, determine the target routing node that transmits the same random autonomous system number from the adjacent routing nodes;

[0223] Lower the priority of the information transmission path of the target routing node.

[0224] In one embodiment, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps:

[0225] The data center network includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and the at least one adjacent routing node; the method includes:

[0226] Get the number of nodes adjacent to the routing node;

[0227] According to the number of nodes of the adjacent routing nodes, the current routing node and the adjacent routing nodes are used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes until the path closure is completed;

[0228] According to the current routing information and the adjacent routing information, determine whether a BGP loop occurs in the data center network; wherein the current routing information and the adjacent routing information both include a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance;

[0229] In the event of a BGP loop in the data center network, lower the priority of the information transmission path of the adjacent routing nodes.

[0230] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0231] Get the adjacent routing information received by the current routing node;

[0232] According to the current routing information and the adjacent routing information received by the current routing node, determining whether the two have the same random autonomous system number;

[0233] When the same random autonomous system number exists, it is determined that a BGP loop occurs in the data center network.

[0234] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0235] Get the adjacent routing information received by the current routing node;

[0236] Analyze whether there is a BGP loop record in the adjacent routing information received by the current routing node;

[0237] When there is a BGP loop record in the current routing information, it is determined that a BGP loop occurs in the data center network.

[0238] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0239] When the number of adjacent routing nodes is two, the upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the upstream adjacent routing node;

[0240] Utilize upstream adjacent routing nodes to transmit current routing information to the current routing node;

[0241] Using the current routing node to transmit the current routing information to the downstream adjacent routing node;

[0242] Utilize the downstream adjacent routing node to transmit adjacent routing information to the upstream adjacent routing node;

[0243] The upstream adjacent routing node is used to transmit the current routing information and adjacent routing information to the current routing node to complete the path closure.

[0244] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0245] In the case where the number of adjacent routing nodes is three nodes, the first upstream adjacent routing node is connected to the second upstream adjacent routing node, the second upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the second upstream adjacent routing node;

[0246] Transmitting the first upstream routing information to the second upstream adjacent routing node using the first upstream adjacent routing node;

[0247] using the second upstream adjacent routing node to transmit the first upstream routing information and the second upstream routing information to the current routing node;

[0248] Using the current routing node to transmit the first upstream routing information, the second upstream routing information and the current routing information to the downstream adjacent routing node;

[0249] According to a preset transmission strategy, using a downstream adjacent routing node to stop continuing to transmit the first upstream routing information and the second upstream routing information, and transmitting the current routing information to the second upstream adjacent routing node;

[0250] The second upstream adjacent routing node is used to transmit the current routing information and the downstream adjacent routing information to the current routing node to complete the path closure.

[0251] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:

[0252] In the case of a BGP loop in the data center network, determine the target routing node that transmits the same random autonomous system number from the adjacent routing nodes;

[0253] Lower the priority of the information transmission path of the target routing node.

[0254] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0255] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0256] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0257] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A BGP loop processing method, characterized in that: The data center network includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and the at least one adjacent routing node; the method includes: Get the number of nodes adjacent to the routing node; According to the number of nodes of the adjacent routing nodes, the current routing node and the adjacent routing nodes are used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes until the path closure is completed; According to the current routing information and the adjacent routing information, determine whether a BGP loop occurs in the data center network; wherein the current routing information and the adjacent routing information both include a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance; In the event of a BGP loop in the data center network, lower the priority of the information transmission path of the adjacent routing nodes.

2. The method according to claim 1, characterized in that The determining, based on the current routing information and the adjacent routing information, whether a BGP loop occurs in the data center network networking includes: Get the adjacent routing information received by the current routing node; Determine, based on the current routing information and adjacent routing information received by the current routing node, whether the two have the same random autonomous system number; When the same random autonomous system number exists, it is determined that a BGP loop occurs in the data center network.

3. The method according to claim 1, characterized in that The method further comprises: Get the adjacent routing information received by the current routing node; Analyze whether there is a BGP loop record in the adjacent routing information received by the current routing node; When there is a BGP loop record in the current routing information, it is determined that a BGP loop occurs in the data center network.

4. The method according to claim 1, characterized in that: The method of transmitting the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes according to the number of nodes of the adjacent routing nodes, until the path closure is completed, includes: When the number of adjacent routing nodes is two, the upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the upstream adjacent routing node; Transmitting the current routing information to the current routing node using an upstream adjacent routing node; Using the current routing node to transmit the current routing information to a downstream adjacent routing node; Utilize the downstream adjacent routing node to transmit adjacent routing information to the upstream adjacent routing node; The upstream adjacent routing node is used to transmit the current routing information and the adjacent routing information to the current routing node to complete the path closure.

5. The method according to claim 1, characterized in that The method of transmitting the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes according to the number of nodes of the adjacent routing nodes, until the path closure is completed, includes: In the case where the number of adjacent routing nodes is three nodes, the first upstream adjacent routing node is connected to the second upstream adjacent routing node, the second upstream adjacent routing node is connected to the current routing node, the current routing node is connected to the downstream adjacent routing node, and the downstream adjacent routing node is connected to the second upstream adjacent routing node; Transmitting the first upstream routing information to a second upstream adjacent routing node using a first upstream adjacent routing node; Using a second upstream adjacent routing node to transmit the first upstream routing information and the second upstream routing information to the current routing node; Using the current routing node to transmit the first upstream routing information, the second upstream routing information and the current routing information to a downstream adjacent routing node; According to a preset transmission strategy, using a downstream adjacent routing node to stop further transmission of the first upstream routing information and the second upstream routing information, and transmitting the current routing information to a second upstream adjacent routing node; The second upstream adjacent routing node is used to transmit the current routing information and the downstream adjacent routing information to the current routing node to complete the path closure.

6. The method according to claim 2, characterized in that When a BGP loop occurs in the data center network, the priority of the information transmission path of the adjacent routing node is reduced, including: In the case of a BGP loop in the data center network, determining a target routing node for transmitting the same random autonomous system number from adjacent routing nodes; Lower the priority of the information transmission path of the target routing node.

7. A BGP loop processing device, characterized in that: The device comprises: The data center network includes a current routing node and at least one adjacent routing node, and at least one routing path is formed between the current routing node and the at least one adjacent routing node; the method includes: An acquisition module is used to obtain the number of nodes adjacent to the routing node; An information transmission module, used to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes according to the number of nodes of the adjacent routing nodes, until the path closure is completed; A BGP loop judgment module is used to judge whether a BGP loop occurs in the data center network networking according to the current routing information and the adjacent routing information; wherein the current routing information and the adjacent routing information both include a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance; The processing module is used to reduce the priority of the information transmission path of the adjacent routing node when a BGP loop occurs in the data center network.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images