Bgp loop processing method and device, computer device and storage medium

Abstract

The application 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 adjacent routing nodes, transmitting the current routing information of a current routing node and the adjacent routing information of adjacent routing nodes by using the current routing node and the adjacent routing nodes until the path closed loop is completed; judging whether a BGP loop occurs in a 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 comprise a random autonomous system number of a local routing device and the identification of a virtual routing forwarding instance; and in the case that the data center network networking has a BGP loop, the priority of the information transmission path of the adjacent routing node is reduced. By using the method, the BGP loop can be effectively solved in a routing continuous oscillation scene.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of data communication, and in particular to a BGP loop processing method and device, computer equipment, computer readable storage medium and computer program product. BACKGROUND

[0002] BGP (Border Gateway Protocol) is an important part of inter-data center network, which helps to achieve dynamic, flexible and efficient routing strategy. In the data center network, loop usually refers to the cyclic path in the network topology, and the loop existing between data centers is also called BGP loop. When data packets are forwarded in the network, if there is a loop, the data packets may circulate in the loop all the time, resulting in data loss and confusion, network performance degradation, routing stability reduction, fault monitoring and fault recovery, etc.

[0003] A common BGP loop detection method is to detect the loop through the AS path between BGP routers. AS path is a set of AS numbers contained in BGP route update, which represents the path of data packets from source AS to destination AS. When a BGP router receives an AS path containing its own AS number, it indicates that a loop is detected. Another common BGP loop detection method is to detect the loop through the BGP route update information between BGP routers. The router will check the received BGP route update information, and 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 loop. However, the above method has limitations in some specific scenarios (such as route continuous oscillation scenario) and cannot effectively solve the BGP loop.

[0004] Therefore, there is an urgent need for a BGP loop processing method, device, computer equipment, computer readable storage medium and computer program product, which can effectively solve the BGP loop in the route continuous oscillation scenario. SUMMARY

[0005] Therefore, there is an urgent need for a BGP loop processing method, device, computer equipment, computer readable storage medium and computer program product, which can effectively solve the BGP loop in the route continuous oscillation scenario.

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

[0007] The data center network is networked to include 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 comprises:

[0008] Obtaining the number of adjacent routing nodes;

[0009] 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 the adjacent routing nodes until a path loop is completed;

[0010] judging 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 a random autonomous system number of a local routing device and an identification of a virtual routing forwarding instance;

[0011] in the case that the BGP loop occurs in the data center network, reducing the priority of the information transmission path of the adjacent routing node.

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

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

[0014] determining whether there is a same random autonomous system number between the current routing information and the adjacent routing information received by the current routing node according to the current routing information and the adjacent routing information received by the current routing node;

[0015] in the case that there is the same random autonomous system number, determining that the BGP loop occurs in the data center network.

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

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

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

[0019] in the case that there is the BGP loop record in the current routing information, determining that the BGP loop occurs in the data center network.

[0020] In one embodiment, the 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 the adjacent routing nodes until a path loop is completed comprises:

[0021] in the case that the number of the adjacent routing nodes is two, an upstream adjacent routing node is connected to the current routing node, the current routing node is connected to a downstream adjacent routing node, and the downstream adjacent routing node is connected to the upstream adjacent routing node;

[0022] transmitting the current routing information from the upstream adjacent routing node to the current routing node;

[0023] transmitting the current routing information from the current routing node to the downstream adjacent routing node;

[0024] transmitting the adjacent routing information from the downstream adjacent routing node to the upstream adjacent routing node;

[0025] transmitting the current routing information and the adjacent routing information from the upstream adjacent routing node to the current routing node, completing the path loop.

[0026] In one of the embodiments, the transmitting the current routing information of the current routing node and the adjacent routing information of the adjacent routing node from the current routing node and the adjacent routing node according to the number of the adjacent routing nodes until the path loop is completed comprises:

[0027] when the number 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;

[0028] transmitting the first upstream routing information from the first upstream adjacent routing node to the second upstream adjacent routing node;

[0029] transmitting the first upstream routing information and the second upstream routing information from the second upstream adjacent routing node to the current routing node;

[0030] transmitting the first upstream routing information, the second upstream routing information and the current routing information from the current routing node to the downstream adjacent routing node;

[0031] according to the preset transmission strategy, stopping the downstream adjacent routing node from 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;

[0032] transmitting the current routing information and the downstream adjacent routing information from the second upstream adjacent routing node to the current routing node, completing the path loop.

[0033] In one of the embodiments, the lowering the priority of the information transmission path of the adjacent routing node in the case of the BGP loop of the data center network comprises:

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

[0035] decrease 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, comprising:

[0037] The data center network networking comprises 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] The acquisition module is configured to acquire the number of nodes of the adjacent routing node;

[0039] The information transmission module is configured to, according to the number of nodes of the adjacent routing node, utilize the current routing node and the adjacent routing node to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing node until the path loop is closed.

[0040] The BGP loop judgment module is configured to judge whether the data center network networking has a BGP loop according to the current routing information and the adjacent routing information; wherein the current routing information and the adjacent routing information both comprise a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance.

[0041] The processing module is configured to, in the case that the data center network networking has a BGP loop, decrease the priority of the information transmission path of the adjacent routing node.

[0042] In a third aspect, the present application further provides a computer device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the following steps when executing the computer program:

[0043] The data center network networking comprises 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 comprises:

[0044] The number of nodes of the adjacent routing node is acquired;

[0045] According to the number of nodes of the adjacent routing node, the current routing node and the adjacent routing node are utilized to transmit the current routing information of the current routing node and the adjacent routing information of the adjacent routing node until the path loop is closed.

[0046] Whether the data center network networking has a BGP loop is judged according to the current routing information and the adjacent routing information; wherein the current routing information and the adjacent routing information both comprise a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance.

[0047] In the case that a BGP loop occurs in the data center network, the priority of the information transmission path of the adjacent routing node is reduced.

[0048] In a fourth aspect, the present application also provides a computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to implement the following steps:

[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 comprises:

[0050] Obtaining the number of adjacent routing nodes;

[0051] According to the number of adjacent routing nodes, the current routing information of the current routing node and the adjacent routing information of the adjacent routing node are transmitted by using the current routing node and the adjacent routing node until the path loop is completed.

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

[0053] In the case that a BGP loop occurs in the data center network, the priority of the information transmission path of the adjacent routing node is reduced.

[0054] In a fifth aspect, the present application also provides a computer program product, which comprises a computer program, and the computer program is executed by a processor to implement the following steps:

[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 comprises:

[0056] Obtaining the number of adjacent routing nodes;

[0057] According to the number of adjacent routing nodes, the current routing information of the current routing node and the adjacent routing information of the adjacent routing node are transmitted by using the current routing node and the adjacent routing node until the path loop is completed.

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

[0059] In the case of BGP loop in the data center network, the priority of the information transmission path of the adjacent routing node is reduced.

[0060] The 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 is closed, the method can timely detect the loop, thereby reducing the time of the data packet circulating in the loop. In the case of detecting the BGP loop, the method not only can identify the loop, but also can 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 the BGP loop, the method reduces the possibility of network attack, helps to reduce data loss and confusion, improves network performance, reduces the risk of reducing routing stability, and simplifies the process of fault monitoring and fault recovery. The method is particularly suitable for routing continuous oscillation scenarios, can effectively solve the BGP loop problem in such complex scenarios, and enhances the adaptability and robustness of the data center network. BRIEF DESCRIPTION OF DRAWINGS

[0061] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the related art, the drawings needed to be used in the description of the embodiments of the present application or the related art will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and those skilled in the art can obtain other related drawings without creative labor on the basis of these drawings.

[0062] Figure 1 The flowchart of the BGP loop processing method in one embodiment;

[0063] Figure 2 The flowchart of the BGP loop processing method in another embodiment;

[0064] Figure 3 The routing topology graph in the case of two adjacent routing nodes in one embodiment;

[0065] Figure 4 The routing topology graph in the case of three adjacent routing nodes in one embodiment;

[0066] Figure 5 The structural block diagram of the BGP loop processing device in one embodiment;

[0067] Figure 6 The internal structure diagram of the computer equipment in one embodiment. DETAILED DESCRIPTION

[0068] In order to make the purposes, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and not intended to limit the present application.

[0069] BGP (Border Gateway Protocol) is an important part of inter-data center network, which helps to achieve dynamic, flexible and efficient routing strategy. In a data center network, a loop usually refers to a cyclic path in the network topology, and a loop existing between data centers is also called a BGP loop. When data packets are forwarded in the network, if there is a loop, the data packets may circulate in the loop all the time, causing data loss and confusion, network performance degradation, routing stability reduction, fault monitoring and fault recovery, etc.

[0070] A common method for detecting BGP loops is to detect loops through AS paths between BGP routers. AS path is a set of AS numbers contained in BGP route updates, indicating the path of data packets from the source AS to the destination AS. When a BGP router receives an AS path containing its own AS number, it indicates that a loop has been detected. Another common method for detecting BGP loops is to detect loops through BGP route update information between BGP routers. The router checks the received BGP route update information, and 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 the loop. However, the above methods have limitations in some specific scenarios (such as continuous route oscillation scenarios) and cannot effectively solve the BGP loop.

[0071] Based on the above traditional technology, as shown in Figure 1 A BGP loop processing method is provided. In this method, the server is taken as an example, the data center network networking 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 the following steps S102 to S108. Wherein:

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

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

[0074] The number of adjacent routing nodes is the number of adjacent routing nodes connected to the current routing node in the process of implementing the BGP loop processing method, which is for the subsequent loop detection and processing, because the loop detection needs to consider the exchange of routing information between the current routing node and the 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 deliver the information.

[0075] In step S104, according to the number of adjacent routing nodes, the current routing information of the current routing node and the adjacent routing information of the adjacent routing nodes are transmitted using the current routing node and the adjacent routing nodes until the path closed 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. The routing information includes the prefix of the reachable network, the path attribute (such as AS path) and the possible loop detection attribute, etc.

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

[0078] In step S106, according to the current routing information and the adjacent routing information, it is judged whether a BGP loop occurs in the data center network; 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 the adjacent routing information include two key parts:

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

[0081] Identifier of virtual routing forwarding instance (vrfID): this is an identifier used to distinguish different virtual routing and forwarding instances (VRF). In large networks, VRF is used to create isolated routing and forwarding tables.

[0082] By comparing the routing information of the current routing node and the adjacent routing node, it can be determined 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, it indicates that the routing information has returned to the original sending node, and thus a loop is detected. This match means that the propagation of routing information in the network forms a closed loop, and the data packet may continuously circulate in this loop, causing network problems. Through this loop detection mechanism, BGP routing loops can be detected and processed in time to avoid infinite circulation of data packets in the loop.

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

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

[0085] Specifically, reducing the priority of the information transmission path of the adjacent routing node means that the information transmission path of these routing nodes will be considered less preferred in the routing process, so it is less likely to be selected as the best information transmission path. This can prevent or reduce data traffic through these paths, thus avoiding the loop. By reducing the priority of the loop path, data packets can be effectively prevented from being sent to these paths, thus breaking the loop and preventing data packets from circulating in the loop. Once the loop is resolved, the priority of the path can be adjusted to restore normal routing logic.

[0086] In the BGP loop processing method, by obtaining the routing information of the current routing node and the adjacent routing node, whether the BGP loop exists in the data center network can be more accurately detected. By transmitting the routing information of the current routing node and the adjacent routing node until the path closed loop is completed, the method can timely find the loop, thereby reducing the time of the data packet circulating in the loop. In the case of detecting the BGP loop, the method not only can identify the loop, but also can 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 the BGP loop, the method reduces the possibility of network attacks, helps to reduce data loss and confusion, improves network performance, reduces the risk of reducing routing stability, and simplifies the process of fault monitoring and fault recovery. The method is particularly suitable for routing continuous oscillation scenarios, can effectively solve the BGP loop problem in such complex scenarios, and enhances the adaptability and robustness of the data center network.

[0087] In one exemplary embodiment, as shown in Figure 2 According to the current routing information and the adjacent routing information, it is determined whether the BGP loop exists in the data center network, comprising:

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

[0089] Step S204, according to the current routing information and the adjacent routing information received by the current routing node, determining whether there is the same random autonomous system number between them;

[0090] Step S206, in the case of the same random autonomous system number, determining that the BGP loop exists in the data center network.

[0091] Specifically, in the process of information transmission (i.e. routing), the current routing node will receive the 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 comparison is to check whether there is the same random autonomous system number (ASN).

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

[0093] When the same random ASN is detected, it can be determined that a BGP loop occurs in the data center network. The loop can be caused by the circular propagation of routing information in the network, resulting in continuous circulation of data packets in the loop instead of transmission along the best path.

[0094] In this embodiment, a specific attribute (such as a random ASN) in BGP routing information is used to detect a loop. By comparing the routing information between the current routing node and the adjacent routing node, it is checked whether the random ASNs are the same, to determine whether a BGP loop exists in the data center network. This can be applied to a routing persistent oscillation scenario, and the BGP loop can be detected in time, thereby reducing the time for data packets to circulate in the BGP loop.

[0095] In an exemplary embodiment, the current routing node receives adjacent routing information;

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

[0097] In the case where 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 node directly connected thereto. For the adjacent routing information received from the adjacent routing node, the current routing node needs to analyze whether the routing information contains a BGP loop record. The loop record is a mark indicating 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 ever formed a loop in the process of propagation in the network. The existence of the BGP loop record indicates that even if the adjacent routing information does not carry the loop attribute of the current routing node itself, it can also be a loop route.

[0100] Once the loop record is detected, the current routing node can determine that a BGP loop occurs in the data center network. The loop can be caused by the circular propagation of routing information in the network, resulting in continuous circulation of data packets in the loop instead of transmission along the best path.

[0101] In this embodiment, whether a BGP loop exists in the data center network is determined by checking whether the routing information received from the adjacent routing node contains a BGP loop record. The BGP loop record is used to detect a loop. This can be applied to a routing persistent oscillation scenario, and the loop can be detected in time, thereby reducing the time for data packets to circulate in the BGP loop, to maintain the stability and performance of the network.

[0102] In one exemplary embodiment, according to the number of 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 the path loop is completed, comprising:

[0103] In the case where 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] The current routing information is transmitted from the upstream adjacent routing node to the current routing node.

[0105] The current routing information is transmitted from the current routing node to the downstream adjacent routing node.

[0106] The adjacent routing information is transmitted from the downstream adjacent routing node to the upstream adjacent routing node.

[0107] The current routing information and the adjacent routing information are transmitted from the upstream adjacent routing node to the current routing node, and the path loop is completed.

[0108] Specifically, there are three routing nodes: one 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 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, the path loop from the upstream adjacent routing node, through the current routing node and the downstream adjacent routing node, and finally back to the upstream adjacent routing node is completed.

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

[0114] Exemplarily, as shown in Figure 3 , a routing topology diagram in the case of two adjacent routing nodes is shown. Among them, the current routing node is RT1, the downstream adjacent routing node is RT2, and the upstream adjacent routing node is RT3.

[0115] 1. RT1 introduces static route 1.1.1.1 from RT3, transmits the current routing information to RT2, and carries 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. RT3 receives the AS200 carried in its own adjacent routing information, which is different from its own AS100, and does not determine it as a BGP loop.

[0118] 4. RT1 again introduces static route 1.1.1.1 from RT3, prefers the 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 AS100 of RT1 is contained in the device loop attribute, and determines it as a BGP loop, reduces 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 receiving the route withdrawal instruction from RT3, RT1 continues to cycle steps 1-5.

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

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

[0123] In the case that the number of nodes adjacent to the current routing node is three, 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] The first upstream routing information is transmitted from the first upstream adjacent routing node to the second upstream adjacent routing node;

[0125] The first upstream routing information and the second upstream routing information are transmitted from the second upstream adjacent routing node to the current routing node;

[0126] The first upstream routing information, the second upstream routing information and the current routing information are transmitted from the current routing node to the downstream adjacent routing node;

[0127] According to a 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 to the second upstream adjacent routing node;

[0128] The current routing information and the downstream adjacent routing information are transmitted from the second upstream adjacent routing node to the current routing node, and the path is closed.

[0129] Specifically, there are four routing nodes: one 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 a 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, and the path is closed.

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

[0133] Exemplarily, as shown in Figure 4 Fig. 1, a routing topology diagram in the case of three adjacent routing nodes is shown. Among them, 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 originated by RT1, carrying AS100.

[0135] 2. After optimization, RT2 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 transmits the current routing information to RT2, carrying only AS300.

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

[0139] 6. When RT3 receives the current routing information and the downstream adjacent routing information, since it carries the AS300 of RT3 itself, it determines that it is a BGP loop, reduces the priority of the information transmission path of RT4, and issues a routing revocation instruction to RT4.

[0140] 7. After RT2 receives the routing revocation instruction of RT4, it continues to circulate steps 1-6.

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

[0142] In an exemplary embodiment, in the case of BGP loop in the data center network networking, the priority of the information transmission path of the adjacent routing node is reduced, comprising:

[0143] determining target routing nodes that transmit the same random autonomous system number from neighboring routing nodes in the case of BGP loop in data center network networking;

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

[0145] Specifically, when a BGP loop occurs in data center network networking, it is first necessary to determine which routing nodes participate in the formation of the BGP loop. This is usually done by analyzing the loop attribute (such as Loop-detection attribute, containing a random autonomous system number) in the routing information. From the neighboring routing nodes, it is necessary to determine which target routing nodes transmit routing information containing the same random autonomous system number (ASN). These numbers are generated and added to the routing information by the local device before, used to identify the source of the routing information. If the random ASN contained in the routing information received by a routing node is the same as its own ASN, it means that the routing node is part of the loop.

[0146] Once the target routing nodes are determined, i.e. those participating in the formation of the loop and transmitting the same random ASN, the next step is to lower the priority of the information transmission path of these nodes. Lowering the priority can be achieved by modifying the BGP path attribute, such as setting a lower local preference value (local-preference) or adding a specific community attribute (community attribute), indicating that these paths should be given a lower priority.

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

[0148] After handling the loop, it is necessary to continuously monitor the network state to ensure that the loop has been successfully handled and that no new loop has been formed. If necessary, routing strategies can be adjusted according to the real-time state of the network to further optimize network performance and stability. In summary, this process is to handle loop problems by identifying and lowering the priority of the information transmission path of the neighboring routing nodes participating in the BGP loop, to ensure the stability and efficiency of the network.

[0149] It should be understood that although each step in the flowchart involved in the embodiments described above is shown in sequence according to the arrow, the steps are not necessarily executed in the order indicated by the arrow. Unless otherwise specified herein, the execution of the steps is not strictly limited in sequence, and the steps can be executed in other orders. Moreover, at least some of the steps in the flowchart involved in the embodiments described above can include multiple steps or multiple stages, which are not necessarily executed at the same time but can be executed at different times, and the execution order of the steps or stages is not necessarily sequential but can be alternately or alternately executed with at least part of other steps or steps or stages in other steps.

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

[0151] In one exemplary embodiment, as shown in Figure 5 A BGP loop processing device is provided, comprising: a data center network networking comprising a current routing node and at least one adjacent routing node, the current routing node and the at least one adjacent routing node forming at least one routing path therebetween;

[0152] The acquisition module 502 is configured to acquire the number of nodes of the adjacent routing node.

[0153] The information transmission module 504 is configured to transmit 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 closed loop is completed.

[0154] The BGP loop judgment module 506 is configured to judge whether the data center network networking appears a BGP loop 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 identification of a virtual routing forwarding instance.

[0155] The processing module 508 is configured to reduce the priority of the information transmission path of the adjacent routing node in the case that the data center network networking appears a BGP loop.

[0156] In an example embodiment, the BGP loop judging module 506 is further configured to acquire the received adjacent route information of the current routing node; determine whether there is a same random autonomous system number between the current routing information and the received adjacent route information of the current routing node; and determine that the data center network is in a BGP loop in the case that there is the same random autonomous system number.

[0157] In an example embodiment, the BGP loop judging module 506 is further configured to acquire the received adjacent route information of the current routing node; analyze whether there is a BGP loop record in the received adjacent route information of the current routing node; and determine that the data center network is in a BGP loop in the case that there is the BGP loop record in the current routing information.

[0158] In an example embodiment, the information transmitting module 504 is further configured to, in the case that the number of the adjacent routing nodes is two, connect the upstream adjacent routing node to the current routing node, connect the current routing node to the downstream adjacent routing node, and connect the downstream adjacent routing node to the upstream adjacent routing node; transmit the current routing information from the upstream adjacent routing node to the current routing node; transmit the current routing information from the current routing node to the downstream adjacent routing node; transmit the adjacent routing information from the downstream adjacent routing node to the upstream adjacent routing node; and transmit the current routing information and the adjacent routing information from the upstream adjacent routing node to the current routing node to complete the path closed loop.

[0159] In an example embodiment, the information transmitting module 504 is further configured to, in the case that the number of the adjacent routing nodes is three, connect the first upstream adjacent routing node to the second upstream adjacent routing node, connect the second upstream adjacent routing node to the current routing node, connect the current routing node to the downstream adjacent routing node, and connect the downstream adjacent routing node to the second upstream adjacent routing node; transmit the first upstream routing information from the first upstream adjacent routing node to the second upstream adjacent routing node; transmit the first upstream routing information and the second upstream routing information from the second upstream adjacent routing node to the current routing node; transmit the first upstream routing information, the second upstream routing information and the current routing information from the current routing node to the downstream adjacent routing node; stop the downstream adjacent routing node from 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 according to a preset transmission strategy; and transmit the current routing information and the downstream adjacent routing information from the second upstream adjacent routing node to the current routing node to complete the path closed loop.

[0160] In an example embodiment, the processing module 508 is further configured to determine a target routing node transmitting the same random autonomous system number from the adjacent routing nodes in the case of BGP loop in the data center network, and reduce the priority of the information transmission path of the target routing node.

[0161] The modules in the BGP loop processing apparatus can be implemented by software, hardware or a combination thereof. The modules can be embedded in the processor of the computer device or independent of the processor, or stored in the memory of the computer device to be invoked by the processor.

[0162] In an example embodiment, a computer device is provided, which can be a server. The internal structure of the computer device can be as shown in FIG. 8. Figure 6 The computer device includes a processor, a memory, an input / output interface 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 configured 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 operating system and the computer program in the non-volatile storage medium. The database of the computer device is configured to store routing information. The input / output interface of the computer device is configured to exchange information between the processor and external devices. The communication interface of the computer device is configured to communicate with external terminals through a network connection. The computer program is executed by the processor to implement a BGP loop processing method.

[0163] Those skilled in the art can understand that Figure 6 The structure shown in FIG. 8 is only a block diagram of part of the structure related to the scheme of the present application, and does not constitute a limitation on the computer device to which the scheme of the present application is applied. The specific computer device can 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 example embodiment, a computer device is provided, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the following steps:

[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] obtaining a number of the adjacent routing nodes;

[0167] 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 the adjacent routing nodes until the path loop is completed;

[0168] judging whether the BGP loop appears 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 identification of the virtual routing forwarding instance;

[0169] decreasing the priority of the information transmission path of the adjacent routing node in the case that the BGP loop appears in the data center network.

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

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

[0172] determining whether the same random autonomous system number exists between the current routing information and the adjacent routing information received by the current routing node according to the current routing information and the adjacent routing information received by the current routing node;

[0173] determining that the BGP loop appears in the data center network in the case that the same random autonomous system number exists.

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

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

[0176] analyzing whether the BGP loop record exists in the adjacent routing information received by the current routing node;

[0177] determining that the BGP loop appears in the data center network in the case that the BGP loop record exists in the current routing information.

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

[0179] in the case that the number of the 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] transmitting the current routing information from the upstream adjacent routing node to the current routing node;

[0181] transmitting the current routing information from the current routing node to a downstream adjacent routing node;

[0182] transmitting the adjacent routing information from the downstream adjacent routing node to an upstream adjacent routing node;

[0183] transmitting the current routing information and the adjacent routing information from the upstream adjacent routing node to the current routing node, and completing the path loop.

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

[0185] In the case that 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;

[0186] transmitting the first upstream routing information from the first upstream adjacent routing node to the second upstream adjacent routing node;

[0187] transmitting the first upstream routing information and the second upstream routing information from the second upstream adjacent routing node to the current routing node;

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

[0189] According to a 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 to the second upstream adjacent routing node;

[0190] transmitting the current routing information and the downstream adjacent routing information from the second upstream adjacent routing node to the current routing node, and completing the path loop.

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

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

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

[0194] In one embodiment, a computer readable storage medium is provided, and the computer readable storage medium stores a computer program. The computer program is executed by a processor to implement the following steps:

[0195] The data center network networking comprises 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 comprises:

[0196] obtaining the number of nodes of the adjacent routing node;

[0197] 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 loop is completed;

[0198] judging whether the data center network networking appears a BGP loop according to the current routing information and the adjacent routing information; wherein the current routing information and the adjacent routing information both comprise a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance;

[0199] in the case that the data center network networking appears the BGP loop, reducing the priority of the information transmission path of the adjacent routing node.

[0200] In one embodiment, the computer program is further implemented when executed by the processor to perform the following steps:

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

[0202] determining whether there is a same random autonomous system number between the current routing information and the adjacent routing information received by the current routing node according to the current routing information and the adjacent routing information received by the current routing node;

[0203] in the case that there is the same random autonomous system number, determining that the data center network networking appears the BGP loop.

[0204] In one embodiment, the computer program is further implemented when executed by the processor to perform the following steps:

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

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

[0207] in the case that there is the BGP loop record in the current routing information, determining that the data center network networking appears the BGP loop.

[0208] In one embodiment, the computer program is further implemented when executed by the processor to perform the following steps:

[0209] in the case that the number of nodes of the adjacent routing node is two, an upstream adjacent routing node is connected to the current routing node, the current routing node is connected to a downstream adjacent routing node, and the downstream adjacent routing node is connected to the upstream adjacent routing node.

[0210] transmitting the current routing information from the upstream adjacent routing node to the current routing node;

[0211] transmitting the current routing information from the current routing node to the downstream adjacent routing node;

[0212] transmitting the adjacent routing information from the downstream adjacent routing node to the upstream adjacent routing node;

[0213] transmitting the current routing information and the adjacent routing information from the upstream adjacent routing node to the current routing node, to complete the path loop.

[0214] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

[0215] In the case that 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;

[0216] transmitting the first upstream routing information from the first upstream adjacent routing node to the second upstream adjacent routing node;

[0217] transmitting the first upstream routing information and the second upstream routing information from the second upstream adjacent routing node to the current routing node;

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

[0219] 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 to the second upstream adjacent routing node;

[0220] transmitting the current routing information and the downstream adjacent routing information from the second upstream adjacent routing node to the current routing node, to complete the path loop.

[0221] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

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

[0223] reducing 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 networking comprises 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 comprises:

[0226] Obtaining the number of nodes of the adjacent routing node;

[0227] According to the number of nodes of the adjacent routing node, 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 until the path loop is completed;

[0228] According to the current routing information and the adjacent routing information, judging whether the data center network networking appears a BGP loop; wherein, the current routing information and the adjacent routing information both comprise a random autonomous system number of a local routing device and an identification of a virtual routing forwarding instance;

[0229] In the case that the data center network networking appears the BGP loop, reducing the priority of the information transmission path of the adjacent routing node.

[0230] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

[0231] Obtaining 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 there is a same random autonomous system number between them;

[0233] In the case that there is the same random autonomous system number, determining that the data center network networking appears the BGP loop.

[0234] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

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

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

[0237] In the case that there is the BGP loop record in the current routing information, determining that the data center network networking appears the BGP loop.

[0238] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

[0239] In the case that the number of nodes of the adjacent routing nodes is two, the upstream adjacent routing node connects the current routing node, the current routing node connects the downstream adjacent routing node, and the downstream adjacent routing node connects the upstream adjacent routing node;

[0240] transmitting the current routing information from the upstream adjacent routing node to the current routing node;

[0241] transmitting the current routing information from the current routing node to the downstream adjacent routing node;

[0242] transmitting the adjacent routing information from the downstream adjacent routing node to the upstream adjacent routing node;

[0243] transmitting the current routing information and the adjacent routing information from the upstream adjacent routing node to the current routing node, and completing the path loop.

[0244] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

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

[0246] transmitting the first upstream routing information from the first upstream adjacent routing node to the second upstream adjacent routing node;

[0247] transmitting the first upstream routing information and the second upstream routing information from the second upstream adjacent routing node to the current routing node;

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

[0249] 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 to the second upstream adjacent routing node;

[0250] transmitting the current routing information and the downstream adjacent routing information from the second upstream adjacent routing node to the current routing node, and completing the path loop.

[0251] In one embodiment, the computer program, when executed by the processor, further implements the following steps:

[0252] In the case that the BGP loop occurs in the data center network, determining the target routing node which 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 equipment information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, displayed data, etc.) involved in the present application are all information and data authorized by the user or authorized by all parties, and the collection, use and processing of related data need to comply with relevant regulations.

[0255] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing related hardware through a computer program. 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 above-mentioned embodiments of each method. In the embodiments provided in the present application, any reference to memory, database or other medium can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (Read-Only Memory, ROM), magnetic tape, floppy disk, flash memory, optical storage, high-density embedded non-volatile memory, resistive random access memory (Resistive Random Access Memory, ReRAM), magnetoresistive random access memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric memory (Ferroelectric Random Access Memory, FRAM), phase change memory (Phase Change Memory, PCM), graphene memory, etc. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, etc. As an illustration but not limitation, RAM can be in various forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), etc. The database involved in the embodiments provided in the present application can include at least one of a relational database and a non-relational database. The non-relational database can include a distributed database based on a block chain, etc., without being limited thereto. The processor involved in the embodiments provided in the present application can be a general-purpose processor, a central processing unit, a graphics processing unit, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (Artificial Intelligence, AI) processor, etc., without being limited thereto.

[0256] Any technical features in the above embodiments can be combined, and for the sake of brevity, not all possible combinations are described above, however, any combination of these technical features is deemed to be within the scope of the present application.

[0257] The above embodiments only express several implementation manners of the present application, and the description is relatively specific and detailed, but it should not be understood as a limitation on the patent scope of the present application. It should be pointed out that, for ordinary skilled persons in the art, several modifications 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 should be subject to the appended claims.

Claims

1. A method for BGP loop handling, the method comprising: The method comprises the following steps: acquiring the number of the adjacent routing nodes; transmitting 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 the adjacent routing nodes until the path loop is completed, wherein: when the number of the adjacent routing nodes is two, the upstream adjacent routing node is connected with the current routing node, the current routing node is connected with the downstream adjacent routing node, and the downstream adjacent routing node is connected with the upstream adjacent routing node; the current routing information is transmitted from the upstream adjacent routing node to the current routing node, the current routing information is transmitted from the current routing node to the downstream adjacent routing node, the adjacent routing information is transmitted from the downstream adjacent routing node to the upstream adjacent routing node, and the current routing information and the adjacent routing information are transmitted from the upstream adjacent routing node to the current routing node to complete the path loop; judging whether the 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 comprise the random autonomous system number and the identification of the virtual routing forwarding instance of the local routing device; when the BGP loop occurs in the data center network, the priority of the information transmission path of the adjacent routing node is reduced.

2. The method of claim 1, wherein, The method further comprises the following steps: acquiring the adjacent routing information received by the current routing node; determining whether the same random autonomous system number exists between the current routing information and the adjacent routing information received by the current routing node according to the current routing information and the adjacent routing information received by the current routing node; when the same random autonomous system number exists, it is determined that the BGP loop occurs in the data center network.

3. The method of claim 1, wherein, The method further comprises the following steps: acquiring the adjacent routing information received by the current routing node; analyzing whether the BGP loop record exists in the adjacent routing information received by the current routing node; when the BGP loop record exists in the current routing information, it is determined that the BGP loop occurs in the data center network.

4. The method of claim 1, wherein, The method further comprises the following steps: when the number of the adjacent routing nodes is three, the first upstream adjacent routing node is connected with the second upstream adjacent routing node, the second upstream adjacent routing node is connected with the current routing node, the current routing node is connected with the downstream adjacent routing node, and the downstream adjacent routing node is connected with the second upstream adjacent routing node; the first upstream routing information is transmitted from the first upstream adjacent routing node to the second upstream adjacent routing node; the first upstream routing information and the second upstream routing information are transmitted from the second upstream adjacent routing node to the current routing node; transmitting, by the current routing node, the first upstream routing information, the second upstream routing information and the current routing information to a downstream neighboring routing node; stopping, by the downstream neighboring routing node, from continuing to transmit the first upstream routing information and the second upstream routing information according to a preset transmission strategy, and transmitting the current routing information to a second upstream neighboring routing node; transmitting, by the second upstream neighboring routing node, the current routing information and downstream neighboring routing information to the current routing node, to complete path closure.

5. The method of claim 2, wherein, The method comprises the following steps: In the case that the BGP loop occurs in the data center network, the priority of the information transmission path of the neighboring routing node is reduced. In the case that the BGP loop occurs in the data center network, the target routing node transmitting the same random autonomous system number is determined from the neighboring routing nodes.

6. A BGP loop handling apparatus characterized by comprising: The priority of the information transmission path of the target routing node is reduced. The device comprises: The data center network comprises a current routing node and at least one neighboring routing node, and at least one routing path is formed between the current routing node and the at least one neighboring routing node. The acquisition module is configured to acquire the number of the neighboring routing nodes. The information transmission module is configured to transmit the current routing information of the current routing node and the neighboring routing information of the neighboring routing nodes by using the current routing node and the neighboring routing nodes according to the number of the neighboring routing nodes, until path closure is completed, wherein: In the case that the number of the neighboring routing nodes is two, an upstream neighboring routing node is connected to the current routing node, the current routing node is connected to a downstream neighboring routing node, and the downstream neighboring routing node is connected to the upstream neighboring routing node. The current routing information is transmitted from the upstream neighboring routing node to the current routing node, from the current routing node to the downstream neighboring routing node, and from the downstream neighboring routing node to the upstream neighboring routing node, and the current routing information and the neighboring routing information are transmitted from the upstream neighboring routing node to the current routing node, to complete path closure. The BGP loop judgment module is configured to judge whether the BGP loop occurs in the data center network according to the current routing information and the neighboring routing information, wherein the current routing information and the neighboring routing information both comprise a random autonomous system number of a local routing device and an identifier of a virtual routing forwarding instance. 7.A computer device, comprising a memory and a processor, wherein the memory stores a computer program, and the computer device is configured to perform the method according to any one of claims 1-6. The processing module is configured to reduce the priority of the information transmission path of the neighboring routing node in the case that the BGP loop occurs in the data center network.

8. A computer-readable storage medium having stored thereon a computer program, characterized in that, The processor executes the computer program to implement the steps of the method in any one of claims 1 to 5.

9. A computer program product comprising a computer program, characterized in that, The computer program is executed by the processor to implement the steps of the method in any one of claims 1 to 5. The computer program is executed by the processor to implement the steps of the method in any one of claims 1 to 5.

Images