CN113904973B - Route updating method, medium, device and computing equipment - Google Patents

Route updating method, medium, device and computing equipment Download PDF

Info

Publication number
CN113904973B
CN113904973B CN202111479959.4A CN202111479959A CN113904973B CN 113904973 B CN113904973 B CN 113904973B CN 202111479959 A CN202111479959 A CN 202111479959A CN 113904973 B CN113904973 B CN 113904973B
Authority
CN
China
Prior art keywords
target
route
routing
address information
strategy
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202111479959.4A
Other languages
Chinese (zh)
Other versions
CN113904973A (en
Inventor
陈松
史伟
洪浩
高冲
缪文粽
姚东东
张吉成
吴宇翔
胡杰杨
应鹏立
郑金仲
黄晓春
江源远
孟婷婷
吴子砚
李晓博
刘逸凡
徐潇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Netease Hangzhou Network Co Ltd
Original Assignee
Netease Hangzhou Network Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Netease Hangzhou Network Co Ltd filed Critical Netease Hangzhou Network Co Ltd
Priority to CN202111479959.4A priority Critical patent/CN113904973B/en
Publication of CN113904973A publication Critical patent/CN113904973A/en
Application granted granted Critical
Publication of CN113904973B publication Critical patent/CN113904973B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/14—Routing performance; Theoretical aspects

Abstract

The embodiment of the disclosure provides a route updating method, a medium, a device and a computing device, wherein the method comprises the following steps: receiving a route updating message, wherein the route updating message carries target node route prefix information and target neighbor node address information, determining target inhibition time in a plurality of preset inhibition time according to the target node route prefix information and the target neighbor node address information, and sending the route updating message to a target peer based on the target inhibition time so as to update the route. The method and the device can well avoid forming a routing loop, can well avoid route oscillation, and improve the reliability of the network.

Description

Route updating method, medium, device and computing equipment
Technical Field
The embodiment of the disclosure relates to the technical field of network transmission, and more particularly, to a route updating method, a medium, a device and a computing device.
Background
This section is intended to provide a background or context to the embodiments of the disclosure recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.
Border Gateway Protocol (BGP) is a routing Protocol that enables flexible forwarding in traditional network architectures. The BGP Protocol carries routing information of different network devices, transmits in a Transmission Control Protocol (TCP) manner, and obtains an optimal routing forwarding path through distributed computation. The BGP protocol is highly flexible and is becoming more and more widely used.
At present, in order to avoid Route oscillation caused by frequent Route change, when a BGP Route in a network device changes, the network device notifies a Route Reflector (RR) of the changed Route information, and the RR limits a period for issuing the same Route, and sends Route information to the other network devices in the autonomous domain only when the period ends, so as to ensure synchronization of the Route information of the entire network.
The inventor researches and discovers that: by performing the route update in the above manner, although the route oscillation can be well avoided, there is a risk of forming a route loop.
Disclosure of Invention
The present disclosure provides a route updating method, medium, device and computing device, so as to solve the problem that the current route updating method has a risk of forming a route loop.
In a first aspect of the disclosed embodiments, there is provided a route updating method, including:
receiving a route updating message, wherein the route updating message carries target node route prefix information and target neighbor node address information, the target node route prefix information is used for identifying a service of first network equipment, the target neighbor node address information is used for identifying a network address of second network equipment, the second network equipment is adjacent to the network equipment receiving the route updating message, and the first network equipment and the second network equipment both operate BGP;
determining target inhibition time in a plurality of preset inhibition times according to the target node routing prefix information and the target neighbor node address information;
and sending a route updating message to a target peer for route updating based on the target inhibition time, wherein the target peer is a network device which is in the same autonomous domain as the network device receiving the route updating message.
In a possible implementation manner, determining a target inhibition time among a plurality of preset inhibition times according to the target node routing prefix information and the target neighbor node address information includes: inquiring a routing updating strategy according to the routing prefix information of the target node and the address information of the target neighbor node, wherein the routing updating strategy comprises the routing prefix information of each node, the address information of the neighbor node and the corresponding relation of a plurality of inhibition times corresponding to the routing prefix information and/or the address information of the neighbor node; responding to the routing updating strategy comprising target node routing prefix information and target neighbor node address information, and determining a first strategy which is matched with the target node routing prefix information and the target neighbor node address information at the same time; determining a first inhibition time according to a first strategy; and determining the target inhibition time as a first inhibition time.
In a possible implementation manner, the route updating method further includes: responding to the routing updating strategy containing target node routing prefix information and target neighbor node address information, and determining a second strategy only matched with the target node routing prefix information and a third strategy only matched with the target neighbor node address information in the routing updating strategy; determining a second inhibition time according to a second strategy; and determining the target inhibition time as a second inhibition time.
In a possible implementation manner, the route updating method further includes: responding to the routing updating strategy containing the address information of the target neighbor node, and determining a third strategy which is only matched with the address information of the target neighbor node in the routing updating strategy; determining a third inhibition time according to a third strategy; and determining the target inhibition time as a third inhibition time.
In a possible implementation manner, the route updating method further includes: and determining the target inhibition time as a fourth inhibition time in response to the routing update strategy not containing the target routing prefix information nor the target neighbor address information.
In one possible embodiment, sending a route update message to the target peer based on the target suppression time includes: and responding to the determined moment of the target suppression time, and sending a route updating message to the target peer after the target suppression time is passed.
In a possible implementation manner, before querying the route update policy according to the target node route prefix information and the target neighbor node address information, the route update method further includes: and determining a route updating strategy according to the sensitivity of the business service to the fault.
In a possible implementation manner, before sending a route update message to the target peer for route update based on the target suppression time, the route update method further includes: and caching the target routing prefix information and the target neighbor address information in response to the target inhibition time being not zero.
In a possible implementation manner, the route updating method further includes: route update messages are received in response to route add operations and/or route withdraw operations.
In a second aspect, an embodiment of the present disclosure provides a route updating apparatus, including:
the receiving module is used for receiving a route updating message, the route updating message carries target node route prefix information and target neighbor node address information, the target node route prefix information is used for identifying service of first network equipment, the target neighbor node address information is used for identifying a network address of second network equipment, the second network equipment is adjacent to the network equipment for receiving the route updating message, and the first network equipment and the second network equipment both operate BGP;
the determining module is used for determining target inhibition time in a plurality of preset inhibition times according to the target node routing prefix information and the target neighbor node address information;
and the processing module is used for sending a route updating message to the target peer based on the target inhibition time so as to update the route, wherein the target peer is the network equipment which is in the same autonomous domain as the network equipment receiving the route updating message.
In a possible implementation, the determining module is specifically configured to: inquiring a routing updating strategy according to the routing prefix information of the target node and the address information of the target neighbor node, wherein the routing updating strategy comprises the routing prefix information of each node, the address information of the neighbor node and the corresponding relation of a plurality of inhibition times corresponding to the routing prefix information and/or the address information of the neighbor node; responding to the routing updating strategy comprising target node routing prefix information and target neighbor node address information, and determining a first strategy which is matched with the target node routing prefix information and the target neighbor node address information at the same time; determining a first inhibition time according to a first strategy; and determining the target inhibition time as a first inhibition time.
In one possible embodiment, the determining module is further configured to: responding to the routing updating strategy containing target node routing prefix information and target neighbor node address information, and determining a second strategy only matched with the target node routing prefix information and a third strategy only matched with the target neighbor node address information in the routing updating strategy; determining a second inhibition time according to a second strategy; and determining the target inhibition time as a second inhibition time.
In one possible embodiment, the determining module is further configured to: responding to the routing updating strategy containing the address information of the target neighbor node, and determining a third strategy which is only matched with the address information of the target neighbor node in the routing updating strategy; determining a third inhibition time according to a third strategy; and determining the target inhibition time as a third inhibition time.
In one possible embodiment, the determining module is further configured to: and determining the target inhibition time as a fourth inhibition time in response to the routing update strategy not containing the target routing prefix information nor the target neighbor address information.
In a possible implementation, the processing module is specifically configured to: and responding to the determined moment of the target suppression time, and sending a route updating message to the target peer after the target suppression time is passed.
In one possible implementation, the determining module, before being configured to query the route update policy according to the target node route prefix information and the target neighbor node address information, is further configured to: and determining a route updating strategy according to the sensitivity of the business service to the fault.
In a possible embodiment, the processing module, before being configured to send a route update message to the target peer for route update based on the target suppression time, is further configured to: and caching the target routing prefix information and the target neighbor address information in response to the target inhibition time being not zero.
In a possible implementation, the receiving module is further configured to: route update messages are received in response to route add operations and/or route withdraw operations.
In a third aspect, an embodiment of the present disclosure provides a computing device, including: a processor, and a memory communicatively coupled to the processor;
the memory stores computer-executable instructions;
the processor executes the computer-executable instructions stored by the memory to implement the route update method according to the first aspect of the present disclosure.
In a fourth aspect, an embodiment of the present disclosure provides a storage medium, in which computer program instructions are stored, and when the computer program instructions are executed, the method for updating a route according to the first aspect of the present disclosure is implemented.
In a fifth aspect, the embodiments of the present disclosure provide a computer program product, which includes a computer program, and when the computer program is executed by a processor, the method for updating a route according to the first aspect of the present disclosure is implemented.
According to the route updating method, the route updating medium, the route updating device and the route updating computing equipment, the route updating message is received, the route updating message carries target node route prefix information and target neighbor node address information, target inhibition time is determined in a plurality of preset inhibition time according to the target node route prefix information and the target neighbor node address information, and the route updating message is sent to a target peer based on the target inhibition time so as to update the route. According to the method and the device, the target inhibition time is determined in the preset inhibition times according to the target node routing prefix information and the target neighbor node address information, and then routing updating is carried out according to the target inhibition time, wherein the preset inhibition times can be flexibly configured according to different service requirements, so that a routing loop can be well prevented from being formed, routing oscillation can be well avoided, interference among different service models is reduced, and the reliability of a network is improved.
Drawings
The above and other objects, features and advantages of exemplary embodiments of the present disclosure will become readily apparent from the following detailed description read in conjunction with the accompanying drawings. Several embodiments of the present disclosure are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:
fig. 1 is a BGP network topology diagram provided by an embodiment of the disclosure;
fig. 2 is a schematic diagram of an application scenario provided in the embodiment of the present disclosure;
fig. 3 is a flowchart of a route updating method according to an embodiment of the present disclosure;
fig. 4 is a flowchart of a route updating method according to another embodiment of the disclosure;
fig. 5 is a BGP network topology diagram provided by another embodiment of the disclosure;
fig. 6 is a schematic structural diagram of a route updating apparatus according to an embodiment of the present disclosure;
FIG. 7 is a schematic diagram of a storage medium provided by an embodiment of the present disclosure;
fig. 8 is a schematic structural diagram of a computing device according to an embodiment of the present disclosure.
In the drawings, the same or corresponding reference numerals indicate the same or corresponding parts.
Detailed Description
The principles and spirit of the present disclosure will be described with reference to a number of exemplary embodiments. It is understood that these embodiments are given solely for the purpose of enabling those skilled in the art to better understand and to practice the present disclosure, and are not intended to limit the scope of the present disclosure in any way. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As will be appreciated by one skilled in the art, embodiments of the present disclosure may be embodied as a system, apparatus, device, method, or computer program product. Accordingly, the present disclosure may be embodied in the form of: entirely hardware, entirely software (including firmware, resident software, micro-code, etc.), or a combination of hardware and software.
According to an embodiment of the disclosure, a route updating method, a medium, a device and a computing device are provided.
In this context, it is to be understood that the terms referred to: BGP, which is a Protocol for calculating distribution routes in a network architecture, and includes an Internal Border Gateway Protocol (iBGP) and an External Border Gateway Protocol (eBGP), where iBGP indicates that all network devices are in the same autonomous domain, and eBGP indicates that the network devices are not in the same autonomous domain; RR, all BGP neighbor nodes in the network architecture need to be connected completely, RR is introduced as an intermediate node for simplifying the structure, all network equipment are connected with a route reflector, and the number of lines is reduced; the routing is oscillated, namely the routing is frequently added or withdrawn, so that the network transmission is intermittent and affects the network transmission quality; route inhibition, namely when the route information changes, the route information is not immediately notified to other BGP neighbor nodes, but the route information is firstly cached, and is notified after waiting for a set inhibition time period, so that route oscillation can be effectively reduced; the route notification is to issue route update information to all BGP neighbor nodes, so as to realize the route synchronization of the whole network; the peer, namely BGP neighbor node, represents the network equipment node which runs BGP protocol and is adjacent to the peer; and the route reflection service is a developed BGP application program and is used for receiving and transmitting BGP routes to replace the current RR equipment functions. Moreover, any number of elements in the drawings are by way of example and not by way of limitation, and any nomenclature is used solely for differentiation and not by way of limitation.
The principles and spirit of the present disclosure are explained in detail below with reference to several representative embodiments of the present disclosure.
Summary of The Invention
The inventor finds that in daily operation and maintenance, network line jitter or interruption and server maintenance restart often cause change of BGP (border gateway protocol) routing, and frequent routing change causes a router to frequently update a BGP routing table maintained by the router, so that routing oscillation is formed, and finally problems of network instability, unavailable service and the like are caused. The RR in the current network architecture adopts the time interval for limiting the release of the same route, and the time interval for releasing the same route updating message to the appointed peer (namely BGP neighbor nodes) is configured, so that when the current route is frequently changed, the route state is sent only when each period is finished, and the route oscillation caused by frequent change is avoided. With the rapid development of internet services, different services have respective special requirements on the network, and it is urgently needed to ensure the normal operation of the service network in the current network environment. Although the suppression strategy supported by the RR in the current network architecture can well avoid the routing oscillation, there is a risk of forming a routing loop.
Exemplarily, fig. 1 is a BGP network topology diagram provided by an embodiment of the present disclosure, as shown in fig. 1, in an overall network structure, S1 and S2 both represent servers, S1 and S2 establish iBGP neighbors, and S1 and S2 are redundant backups of each other; both the AR1 and the AR2 represent access layer devices, specifically, access switches or access routers, which are used to access servers, the AR1 and the S1 establish eBGP neighbors, and the AR2 and the S2 establish eBGP neighbors; BR1, BR2, BR3, and BR4 all represent border devices, such as border routers or border switches, for data transmission in a region, BR1 and BR2 establish eBGP neighbors with AR1, BR3 and BR4 establish eBGP neighbors with AR 2; CR1 and CR2 each represent core devices for inter-area data transfer; RR1 and RR2 each represent a route reflector for synchronizing routing information to core layer devices (i.e., core and edge devices). The core layer adopts RR1 and RR2 reflection routing to synchronize the core layer routing, and specifically comprises CR1, CR2, BR1, BR2, BR3, BR4 and other devices. The access layer specifically comprises AR1 and AR2, the access layer is connected with the core layer in an eBGP mode, the border devices BR1, BR2, BR3 and BR4 synchronize the accessed routes to RR1 and RR2, and then RR1 and RR2 are reflected to other routers in the same autonomous domain, so that the whole network intercommunication is realized. In order to realize high redundancy and reduce risks caused by network equipment faults, an anycast (anycast) technology is adopted for business, servers are deployed in different machine rooms, the same Internet Protocol (IP) address is used, the main-standby switching of the servers is controlled by a BGP routing principle, and finally the effect of high redundancy is realized. Specifically, firstly, the server S1 establishes an eBGP neighbor with the AR1, and issues its own 32-bit host route (i.e., service address) to the AR 1; then AR1 establishes eBGP neighbors with BR1 and BR2 respectively, and issues 32-bit host routes of S1 to BR1 and BR 2; BR1 and BR2 then synchronize the 32-bit host route of S1 to RR1 and RR 2. It is understood that the route distribution process of the server S2 is the same as S1. Finally, RR1 and RR2 receive the routing information that the two routes have the same prefix but different paths respectively, after RR1 and RR2 select the optimal route through the BGP routing principle, the server route is issued to all devices (namely CR1, CR2, BR1, BR2, BR3 and BR 4) of the subordinate core layer, and network intercommunication is realized.
In the normal processing flow, the RR is configured with a route update suppression time to prevent route oscillation caused by line jitter between network devices, and the default configured route update suppression time is, for example, 30 seconds. If the server S1 is currently the master device and has a fault, the AR1, the BR1, and the BR2 receive the route withdrawal message, and when withdrawing the route, the BR1 and the BR2 issue the route withdrawal information to the RR1 and the RR2, and after receiving the information, the RR1 and the RR2 check the suppression time, and after the suppression time is over, the message is notified to the network devices BR3, BR4, CR1, and CR2 in other core layers. Before the suppression time is over, the BR3, the BR4, the CR1 and the CR2 forward the received data packet of the access server S1 to the BR1 and the BR2, and the BR1 and the BR2 already withdraw the route, the BR1 and the BR2 forward the data packet to the CR1 and the CR2, so that the route of the access server S1 is looped, and the data packet is always transmitted in a circulating manner in the network, thereby occupying the network bandwidth and affecting the network performance. The BR3, BR4, CR1 and CR2 will not receive the routing information synchronized with RR1 and RR2 until the suppression time is over, and forward the data packet to the server S2. If the RR route update policy is set to be updated immediately, it may not be able to cope with the route oscillation caused by the line jitter between the network devices.
Based on the above problems, the present disclosure provides a route updating method, medium, device, and computing device, which replace a hardware routing device, RR, in a network architecture by providing a BGP route reflection service capable of flexibly configuring a route updating policy, so that the BGP reflection service configured with the route updating policy can well avoid route oscillation and also avoid forming a routing loop.
Application scene overview
An application scenario of the scheme provided by the present disclosure is first illustrated with reference to fig. 2. Fig. 2 is a schematic diagram of an application scenario provided by an embodiment of the present disclosure, as shown in fig. 2, in the application scenario, each network device runs BGP, when a route of a server 201 changes, such as a route is newly added or withdrawn, the server 201 sends a route update message to an adjacent access router 202, the access router 202 sends the route update message to an adjacent border router 203, the border router 203 sends the route update message to a route reflection server 204, the route reflection server 204 determines a target suppression time of the route update among a plurality of preset suppression times according to the route update message, and sends the route update message to a target peer (such as a core router 205) based on the target suppression time to perform the route update.
It should be noted that fig. 2 is only a schematic diagram of an application scenario provided by the embodiment of the present disclosure, and the embodiment of the present disclosure does not limit the devices included in fig. 2, nor limits the position relationship between the devices in fig. 2. For example, in the application scenario shown in fig. 2, a data storage device may be further included, and the data storage device may be an external memory with respect to the route reflection server 204, or may be an internal memory integrated in the route reflection server 204.
Exemplary method
A method for route updating according to an exemplary embodiment of the present disclosure is described below with reference to fig. 3 in conjunction with the application scenario of fig. 2. It should be noted that the above application scenarios are merely illustrated for the convenience of understanding the spirit and principles of the present disclosure, and the embodiments of the present disclosure are not limited in this respect. Rather, embodiments of the present disclosure may be applied to any scenario where applicable.
First, a route update method is described by way of a specific embodiment.
Fig. 3 is a flowchart of a route updating method according to an embodiment of the present disclosure. The method of the disclosed embodiments may be applied in a computing device, which may be a server or a server cluster or the like. As shown in fig. 3, the method of the embodiment of the present disclosure includes:
s301, receiving a routing update message, wherein the routing update message carries target node routing prefix information and target neighbor node address information.
The target node routing prefix information is used for identifying the service of the first network device, the target neighbor node address information is used for identifying the network address of the second network device, the second network device is adjacent to the network device which receives the routing update message, and the first network device and the second network device both operate BGP.
In the embodiment of the present disclosure, referring to fig. 1, the first network device is, for example, a server S1, the route prefix information of the server S1 identifies a corresponding service provided by the server S1, and accordingly, the second network device is a BR1 or a BR 2; the routing prefix information for the first network device, e.g., CR1, and CR1 identifies the connection service between CR1 and the connected network device, e.g., BR1, which is also CR 1. Illustratively, referring to fig. 2, the first network device is, for example, a server 201, and different service addresses of the server 201 are used for providing different service services. If a route for providing a service is newly added to the server 201, where the route is a service address used by the server 201 for providing the service, the server 201 sends a route update message to the neighboring access router 202, where the route update message carries route prefix information of the server 201 (i.e., the service address of the server 201) and a management address of the server 201 as address information of a neighboring node. After receiving the routing update message, the access router 202 updates the neighboring node address information in the routing update message to the management address of the access router 202, and then sends the routing update message to the neighboring border router 203, where the routing update message carries the routing prefix information of the server 201 and the management address of the access router 202 as the neighboring node address information. After receiving the routing update message, the border router 203 updates the neighboring node address information in the routing update message to the management address of the border router 203, and then sends the routing update message to the routing reflection server 204, where the routing update message carries the routing prefix information of the server 201 and the management address of the border router 203 as the neighboring node address information. The route reflection server 204 receives a route update message sent by an adjacent border router 203, the route reflection server 204 is a computing device executing the embodiment of the present disclosure, route prefix information of the server 201 carried by the route update message is target node route prefix information, a management address of the border router 203 carried by the route update message is target neighbor node address information, and correspondingly, the border router 203 is a second network device. It should be noted that after the route reflection server 204 is started, a BGP neighbor relationship is established with the border router 203 and the core router 205, and if the BGP neighbor relationship is failed to be established, the BGP neighbor relationship may be finally established through a retry mechanism, so that the route update message may be received.
Further, optionally, the method of the embodiment of the present disclosure further includes: route update messages are received in response to route add operations and/or route withdraw operations.
Illustratively, referring to fig. 2, if a route is newly added to the server 201, the server 201 sends a route update message to the route reflection server 204 sequentially through the adjacent access router 202 and the border router 203, and accordingly, the route reflection server 204 receives the route update message in response to a route addition operation of the server 201. If the server 201 cancels the route, the route update message is sent to the route reflection server 204 through the adjacent access router 202 and the border router 203 in sequence, and accordingly, the route reflection server 204 receives the route update message in response to the route cancellation operation of the server 201.
S302, determining target inhibition time in a plurality of preset inhibition times according to the target node routing prefix information and the target neighbor node address information.
In this step, the preset multiple inhibition times may be inhibition times of different nodes configured by the operation and maintenance personnel according to different service requirements, and it can be understood that the preset multiple inhibition times are used for meeting different service requirements, for example, after a route is changed, a route needs to be updated immediately by some nodes, the inhibition time may be set to be, for example, 0, which indicates that the route is updated immediately; on the other hand, if some nodes do not need to update the route immediately after the route is changed, the suppression time may be set to, for example, 30 seconds, which means that the route is updated after 30 seconds have elapsed. For example, referring to fig. 2, if a route is newly added to the server 201, where the route is a service address used by the server 201 to provide a corresponding service, and the route needs to be updated immediately, a corresponding suppression time, such as 0, may be set to indicate that the route is updated immediately; if the line between the border router 203 and the core router 205 is frequently interrupted, since the border router 203 and the core router 205 have redundant backup, and the route does not need to be updated immediately, the corresponding inhibition time may be set to 30 seconds, for example, to indicate that the route is updated after 30 seconds have elapsed. Illustratively, a preset plurality of suppression times may be stored in a database, such as Redis. After receiving the route update message, the target node route prefix information and the target neighbor node address information may be extracted from the route update message, and then the target inhibition time may be determined among a plurality of preset inhibition times according to the target node route prefix information and the target neighbor node address information. As to how to determine the target inhibition time among the preset multiple inhibition times according to the target node routing prefix information and the target neighbor node address information, reference may be made to subsequent embodiments, which are not described herein again.
S303, based on the target inhibition time, sending a route updating message to the target peer so as to update the route.
Wherein, the target peer is the network equipment in the same autonomous domain as the network equipment receiving the route updating message.
Illustratively, referring to fig. 2, the route reflection server 204 is a network device that receives a route update message, and the target peers are, for example, a border router 203 and a core router 205, and the border router 203, the core router 205 and the route reflection server 204 are under the same autonomous domain. In this step, after the target throttling time is determined, a route update message may be sent to the target peer for route update based on the target throttling time. Illustratively, the target throttling time is 0, which represents an immediate update of the route, and referring to fig. 2, the route reflection server 204 sends a route update message to the target peer (such as the core router 205) after determining that the target throttling time is 0, and accordingly, the target peer performs a route update immediately after receiving the route update message.
Further, optionally, before sending a route update message to the target peer based on the target suppression time for performing route update, the method of the embodiment of the present disclosure may further include: and caching the target routing prefix information and the target neighbor address information in response to the target inhibition time being not zero.
Illustratively, the target throttling time is, for example, 30 seconds, after determining that the target throttling time is not zero, the target routing prefix information and the target neighbor address information are cached in the queue, and after 30 seconds, the routing update message stored in the queue is sent to the target peer for routing update. By means of caching, route oscillation caused by frequent route change can be prevented.
The route updating method provided by the embodiment of the disclosure receives a route updating message, the route updating message carries target node route prefix information and target neighbor node address information, determines target inhibition time in a plurality of preset inhibition time according to the target node route prefix information and the target neighbor node address information, and sends the route updating message to a target peer based on the target inhibition time so as to update the route. According to the method and the device, the target inhibition time is determined in the preset inhibition times according to the target node routing prefix information and the target neighbor node address information, and then routing updating is carried out according to the target inhibition time, wherein the preset inhibition times can be flexibly configured according to different service requirements, so that a routing loop can be well prevented from being formed, routing oscillation can be well avoided, interference among different service models is reduced, and the reliability of a network is improved.
Fig. 4 is a flowchart of a route updating method according to another embodiment of the disclosure. On the basis of the above embodiments, the embodiments of the present disclosure further explain how to update the route. As shown in fig. 4, a method of an embodiment of the present disclosure may include:
s401, receiving a routing update message, wherein the routing update message carries target node routing prefix information and target neighbor node address information.
The target node routing prefix information is used for identifying the service of the first network device, the target neighbor node address information is used for identifying the network address of the second network device, the second network device is adjacent to the network device which receives the routing update message, and the first network device and the second network device both operate BGP.
For a detailed description of this step, reference may be made to the related description of S301 in the embodiment shown in fig. 3, and details are not repeated here.
In the embodiment of the present disclosure, the step S302 in fig. 3 may further include the following steps S402 to S413:
s402, inquiring a routing updating strategy according to the routing prefix information of the target node and the address information of the target neighbor node, wherein the routing updating strategy comprises the routing prefix information of each node, the address information of the neighbor node and the corresponding relation of a plurality of inhibition times corresponding to the routing prefix information and/or the address information of the neighbor node.
In this step, for example, a route update policy, such as a policy configured by operation and maintenance personnel according to different service requirements, may be stored in the database. Table 1 shows field information included in a route update policy according to an embodiment of the present disclosure. As shown in table 1, the route update policy contains three fields: routing prefix information (prefix), neighbor node address information (neighbor), and inter. The routing prefix information prefix and the neighbor node address information neighbor are both non-padding, and if none of the routing prefix information prefix, the neighbor node address information neighbor, and the suppression time interval are padded, it indicates that a default rule is adopted, that is, the default suppression time is, for example, 30 seconds. It will be appreciated that if a database is used to store the route update policies, each route update policy corresponds to a record in the database, where route prefix information may be used as a key.
TABLE 1
Name of field Meaning of a field Data type Whether or not it is necessary to
prefix Routing prefix information String Non-necessary filling
neighbor Neighbor node address information String Non-necessary filling
interval Inhibition time Int Must fill in
Illustratively, referring to fig. 2, one route update policy may be configured in the database as: the routing prefix information is the service address of the server 201, the neighbor node address information is the management address of the adjacent border router 203, and the inhibition time is 0 (namely, the routing is updated immediately); alternatively, a route update policy may be configured in the database as follows: the routing prefix information is the service address of the server 201, and the inhibition time is 0; alternatively, a route update policy may be configured in the database as follows: the neighbor node address information is the management address of the neighboring border router 203, and the suppression time is 30 seconds. By analogy, a plurality of routing update policies can be configured in the database according to different service requirements, and the routing update policies may include routing prefix information of each node, neighbor node address information, and a corresponding relationship of a plurality of inhibition times corresponding to the routing prefix information and/or the neighbor node address information.
Further, optionally, before querying the route update policy according to the destination node route prefix information and the destination neighbor node address information, the method of the embodiment of the present disclosure may further include: and determining a route updating strategy according to the sensitivity of the business service to the fault.
For example, referring to fig. 2, if a service provided by the server 201 fails and needs to update the route immediately, it may be determined that the suppression time in the route update policy is, for example, 0, which indicates immediate update. If the line between the border router 203 and the core router 205 is interrupted, and since the border router 203 and the core router 205 have redundant backups, and the route does not need to be updated immediately, it may be determined that the corresponding suppression time is, for example, 30 seconds, which indicates that the route is updated after 30 seconds have elapsed.
S403, judging whether the route updating strategy contains the target node route prefix information and the target neighbor node address information.
If the route updating strategy contains the target node route prefix information and the target neighbor node address information, executing the step S404; if the route update policy does not include the target node route prefix information nor the target neighbor node address information, step S413 is executed.
S404, responding to the route updating strategy containing the target node route prefix information and the target neighbor node address information, and judging whether the route updating strategy contains a first strategy which is matched with the target node route prefix information and the target neighbor node address information at the same time.
If the routing updating strategy contains a first strategy which is matched with the routing prefix information of the target node and the address information of the target neighbor node at the same time, executing the step S405; if it is determined that the route update policy does not include the first policy that matches the target node route prefix information and the target neighbor node address information at the same time, the step S407 is executed.
S405, determining a first inhibition time according to a first strategy.
And S406, determining the target inhibition time as a first inhibition time.
For the steps S405 and S406, the route update policy is queried according to the destination node route prefix information and the destination neighbor node address information, and if the query result is that the route update policy includes a first policy that matches the destination node route prefix information and the destination neighbor node address information at the same time, the corresponding first suppression time can be obtained. For example, referring to fig. 2, if the server 201 goes down, the route reflection server 204 receives a corresponding route update message, where the route update message carries route prefix information of the server 201 and a management address of the border router 203 as address information of a neighboring node. The route reflection server 204 queries a route update policy according to the route prefix information of the server 201 and the management address of the border router 203, determines a first policy that matches the route prefix information of the server 201 and the management address of the border router 203 at the same time, and further determines a first inhibition time according to the first policy, where the first inhibition time is a target inhibition time. If the line between the border router 203 and the core router 205 is interrupted, the route reflection server 204 receives a route update message between the border router 203 and the core router 205, where the route update message carries route prefix information of the core router 205 and a management address of the core router 205 serving as address information of a neighboring node. The route reflection server 204 queries a route update policy according to the route prefix information of the core router 205 and the management address of the core router 205, determines a first policy that matches the route prefix information of the core router 205 and the management address of the core router 205 at the same time, and further determines a first inhibition time according to the first policy, where the first inhibition time is a target inhibition time.
S407, responding to the route updating strategy containing the target node route prefix information and the target neighbor node address information, and judging whether the route updating strategy contains a second strategy only matched with the target node route prefix information.
If it is determined that the route update policy includes a second policy that only matches the destination node route prefix information, or it is determined that the route update policy includes a second policy that only matches the destination node route prefix information and a third policy (not shown in fig. 4) that only matches the destination neighbor node address information, then step S408 is performed; if it is determined that the route update policy does not include the second policy that matches only the route prefix information of the target node, step S410 is performed.
And S408, determining a second inhibition time according to a second strategy.
And S409, determining the target inhibition time as a second inhibition time.
For the steps S408 and S409, a route update policy is queried according to the destination node route prefix information and the destination neighbor node address information, and if the query result is that the route update policy includes a second policy only matched with the destination node route prefix information, or the route update policy includes a second policy only matched with the destination node route prefix information and a third policy only matched with the destination neighbor node address information, since the priority of the second policy is higher than that of the third policy, a corresponding second suppression time can be obtained according to the second policy, which is the destination suppression time. For example, referring to fig. 2, if the server 201 goes down, the route reflection server 204 receives a corresponding route update message, where the route update message carries route prefix information of the server 201 and a management address of the border router 203 as address information of a neighboring node. The route reflection server 204 queries a route update policy according to the route prefix information of the server 201 and the management address of the border router 203, queries a second policy only matching the route prefix information of the server 201 and a third policy only matching the management address of the border router 203, and determines to obtain a corresponding second suppression time, i.e., a target suppression time, according to the second policy.
S410, responding to the routing updating strategy containing the target neighbor node address information, and judging whether the routing updating strategy contains a third strategy only matched with the target neighbor node address information.
If the routing updating strategy contains a third strategy which is only matched with the target neighbor node address information, executing S411; if it is determined that the route update policy does not include the third policy that matches only the address information of the target neighbor node, the step S413 is performed.
And S411, determining a third inhibition time according to a third strategy.
And S412, determining the target inhibition time as a third inhibition time.
And for the steps S411 and S412, inquiring a route updating strategy according to the route prefix information of the target node and the address information of the target neighbor node, and if the inquiry result is that a third strategy only matched with the address information of the target neighbor node is included in the route updating strategy, determining to obtain corresponding third inhibition time according to the third strategy, wherein the third inhibition time is the target inhibition time. For example, referring to fig. 2, if the server 201 goes down, the route reflection server 204 receives a corresponding route update message, where the route update message carries route prefix information of the server 201 and a management address of the border router 203 as address information of a neighboring node. The route reflection server 204 queries a route update policy according to the route prefix information of the server 201 and the management address of the border router 203, queries a third policy that is only matched with the management address of the border router 203, and determines to obtain a corresponding third suppression time, that is, a target suppression time, according to the third policy.
S413, determining the target throttling time as a fourth throttling time in response to the routing update policy including neither the target routing prefix information nor the target neighbor address information.
This step may be understood as a default route update policy, and the fourth suppression time is, for example, 30 seconds. For example, referring to fig. 2, if the server 201 goes down, the route reflection server 204 receives a corresponding route update message, where the route update message carries route prefix information of the server 201 and a management address of the border router 203 as address information of a neighboring node. The route reflection server 204 queries a route update policy according to the route prefix information of the server 201 and the management address of the border router 203, and determines that the target inhibition time is 30 seconds if the route prefix information of the server 201 and the management address of the border router 203 are not queried.
It should be noted that the first policy, the second policy, the third policy, and the default route updating policy in step S413 are route updating policies set according to different service requirements, where the priority of the first policy is higher than that of the second policy, the priority of the second policy is higher than that of the third policy, the priority of the third policy is higher than that of the fourth policy, and the fourth policy may be understood as a default policy and may be used to prevent route oscillation.
In the embodiment of the present disclosure, the step S303 in fig. 3 may further include the following step S414:
and S414, responding to the determined moment of the target inhibition time, and sending a route updating message to the target peer after the target inhibition time is passed so as to update the route.
Illustratively, if the target throttling time is determined to be 0 at 10 o 'clock and 10 min, then the route update message is immediately sent to the target peer at 10 o' clock and 10 min since the target throttling time is 0. If it is determined at 10 o ' clock and 10 min that the target inhibition time is not 0, for example, the target inhibition time is 30 seconds, the target routing prefix information and the target neighbor address information are cached in the queue at 10 o ' clock and 10 min, and the routing update message stored in the queue is sent to the target peer at 10 o ' clock and 10 min and 40 seconds for routing update.
The routing updating method provided by the embodiment of the disclosure determines a corresponding routing updating strategy by querying the routing updating strategy according to the routing prefix information of the target node and the address information of the target neighbor node, wherein the routing updating strategy comprises the routing prefix information of each node, the address information of the neighbor node and the corresponding relationship of a plurality of inhibition times corresponding to the routing prefix information and/or the address information of the neighbor node, the routing updating strategy can be flexibly configured according to different service requirements, different priorities can be set, the priorities can be automatically judged, the operation of priority comparison is reduced, and the optimal routing updating strategy is determined. Therefore, the method can well avoid the formation of a routing loop, can well avoid the routing oscillation, reduces the interference between different service models, improves the reliability of the network, ensures the normal operation of sensitive services, and can cover all requirements of the current services.
On the basis of the above embodiments, the program product for implementing the above method according to the embodiments of the present disclosure may be referred to as a BGP server program, for example. Based on the BGP network topology of fig. 1, fig. 5 is a BGP network topology provided by another embodiment of the present disclosure, and as shown in fig. 5, an RR is replaced by a route reflection server running a BGP server. Based on the technical scheme provided by the disclosure, firstly, routing updating strategies corresponding to the servers S1 and S2 are respectively configured, wherein the routing prefix information is the routing prefix information of S1 and S2, the neighbor node address information is the management address of all core layer devices, and the inhibition time is 0. The routing prefix information of S1 and S2 is stored as keys in a database (e.g., Redis), respectively. When the server S1 goes down, the BR1 and the BR2 receive BGP route withdrawal messages and send the BGP route withdrawal messages to a BGP service program, wherein the BGP route withdrawal messages comprise neighbor node address information of the BR1 and the BR2, route prefix information of the server S1 and the like; the BGP service program searches the configured route updating strategy from the database through the route prefix information, and obtains the configured neighbor node address information and the inhibition time; the BGP service program compares whether the configured neighbor node address information is consistent with the neighbor node address information of BR1 or BR2, if so, the configured inhibition time is used for updating the route, wherein the inhibition time is 0 for example, which indicates immediate updating; the BGP service program synchronizes the received BGP route revocation message to all the devices of the core layer, and a forwarding path to the server S1 is switched to the server S2; when the line between the CR1 and the BR1 is frequently interrupted, the BGP service program receives a route update message between the CR1 and the BR1, which includes the route prefix information of the interface between the CR1 and the BR1, and updates the route according to the default time, such as the 30-second inhibition time, to prevent route oscillation because the configured route update policy cannot be found in the database.
In summary, the technical solution provided by the present disclosure has at least the following advantages:
(1) flexibility. Compared with the function of distinguishing according to the node neighbor address provided by the current RR, the function of distinguishing according to the node neighbor address based on the node route prefix information has more flexibility, and a specific route updating method can be configured for different services of the same neighbor. For example, in a device with neighbor node address information of 3.3.3.3.3, segment 10.0.0/16 is used as the interconnect address (i.e., management address), and segment 172.0.0.0/16 is used as the service address. Configuring a corresponding route updating strategy as follows: the specific route updating strategy for different service configurations of the same neighbor node can be realized by { "prefix": 10.0.0.0/16), "neighbor": 3.3.3"," interval ":30} and {" prefix ": 172.0.0.0/16)," neighbor ": 3.3.3.3", "interval":0 }.
(2) And (4) stability. In a conventional network architecture, RR is an independent router device, and if the device has a single point of failure, the route reflection service may also fail, resulting in impaired network stability. The method and the device decouple RR and physical equipment in the traditional network architecture, provide the virtualized cluster load route reflection service, and each equipment in the cluster is backup to each other, thereby eliminating single-point faults and ensuring continuous and stable operation of the service.
(3) And (5) consistency. In a conventional network architecture, an RR is an independent router device, information sharing needs to perform message synchronization with other devices, and routing information is inconsistent due to different message transmission speeds in the synchronization process. The virtualization cluster uses uniform storage resources, the message synchronization process among RR services is eliminated, routing information is uniformly stored by the cluster, and the problem that the routing information is inconsistent due to distributed computing is solved.
(4) The cost is low. The routing equipment for providing the route reflection service is high in cost, and the software program mode provided by the method is adopted to replace the routing equipment for providing the route reflection service, and only a server is needed, so that the hardware configuration requirement can be reduced, and the cost is reduced.
Exemplary devices
Having described the media of the exemplary embodiments of the present disclosure, the route update apparatus of the exemplary embodiments of the present disclosure is explained next with reference to fig. 6. The apparatus according to the exemplary embodiment of the present disclosure may implement each process in the foregoing route updating method embodiment, and achieve the same function and effect.
Fig. 6 is a schematic structural diagram of a route updating apparatus according to an embodiment of the present disclosure, and as shown in fig. 6, a route updating apparatus 600 according to an embodiment of the present disclosure includes: a receiving module 601, a determining module 602 and a processing module 603. Wherein:
a receiving module 601, configured to receive a route update message, where the route update message carries target node route prefix information and target neighbor node address information, the target node route prefix information is used to identify a service of a first network device, the target neighbor node address information is used to identify a network address of a second network device, the second network device is adjacent to the network device that receives the route update message, and both the first network device and the second network device operate BGP.
A determining module 602, configured to determine a target suppression time from a plurality of preset suppression times according to the target node routing prefix information and the target neighbor node address information.
The processing module 603 is configured to send a route update message to a target peer for route update based on the target suppression time, where the target peer is a network device in the same autonomous domain as the network device that receives the route update message.
In some embodiments, the determining module 602 may be specifically configured to: inquiring a routing updating strategy according to the routing prefix information of the target node and the address information of the target neighbor node, wherein the routing updating strategy comprises the routing prefix information of each node, the address information of the neighbor node and the corresponding relation of a plurality of inhibition times corresponding to the routing prefix information and/or the address information of the neighbor node; responding to the routing updating strategy comprising target node routing prefix information and target neighbor node address information, and determining a first strategy which is matched with the target node routing prefix information and the target neighbor node address information at the same time; determining a first inhibition time according to a first strategy; and determining the target inhibition time as a first inhibition time.
Optionally, the determining module 602 may further be configured to: responding to the routing updating strategy containing target node routing prefix information and target neighbor node address information, and determining a second strategy only matched with the target node routing prefix information and a third strategy only matched with the target neighbor node address information in the routing updating strategy; determining a second inhibition time according to a second strategy; and determining the target inhibition time as a second inhibition time.
Optionally, the determining module 602 may further be configured to: responding to the routing updating strategy containing the address information of the target neighbor node, and determining a third strategy which is only matched with the address information of the target neighbor node in the routing updating strategy; determining a third inhibition time according to a third strategy; and determining the target inhibition time as a third inhibition time.
Optionally, the determining module 602 may further be configured to: and determining the target inhibition time as a fourth inhibition time in response to the routing update strategy not containing the target routing prefix information nor the target neighbor address information.
In a possible implementation, the processing module 603 may be specifically configured to: and responding to the determined moment of the target suppression time, and sending a route updating message to the target peer after the target suppression time is passed.
In some embodiments, the determining module 602, before being configured to query the route update policy according to the target node route prefix information and the target neighbor node address information, may further be configured to: and determining a route updating strategy according to the sensitivity of the business service to the fault.
Optionally, before the processing module 603 is configured to send a route update message to the target peer based on the target suppression time for route update, the processing module may be further configured to: and caching the target routing prefix information and the target neighbor address information in response to the target inhibition time being not zero.
Optionally, the receiving module 601 may further be configured to: route update messages are received in response to route add operations and/or route withdraw operations.
The apparatus of the embodiment of the present disclosure may be configured to execute the scheme of the route updating method in any one of the method embodiments, and the implementation principle and the technical effect of the apparatus are similar, which are not described herein again.
Exemplary Medium
Having described the method of the exemplary embodiment of the present disclosure, next, a storage medium of the exemplary embodiment of the present disclosure will be described with reference to fig. 7.
Fig. 7 is a schematic diagram of a storage medium according to an embodiment of the disclosure. Referring to fig. 7, a storage medium 700 stores therein a program product for implementing the above method according to an embodiment of the present disclosure, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present disclosure is not limited thereto.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. The readable signal medium may also be any readable medium other than a readable storage medium.
Program code for carrying out operations of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user computing device, partly on the user device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN).
Exemplary computing device
Having described the methods, media, and apparatus of the exemplary embodiments of the present disclosure, a computing device of the exemplary embodiments of the present disclosure is described next with reference to fig. 8.
The computing device 800 shown in fig. 8 is only one example and should not impose any limitations on the functionality or scope of use of embodiments of the disclosure.
Fig. 8 is a schematic structural diagram of a computing device according to an embodiment of the present disclosure, and as shown in fig. 8, the computing device 800 is represented in the form of a general-purpose computing device. Components of computing device 800 may include, but are not limited to: the at least one processing unit 801 and the at least one memory unit 802, and a bus 803 connecting the various system components (including the processing unit 801 and the memory unit 802).
The bus 803 includes a data bus, a control bus, and an address bus.
The storage unit 802 may include readable media in the form of volatile memory, such as Random Access Memory (RAM)8021 and/or cache memory 8022, and may further include readable media in the form of non-volatile memory, such as Read Only Memory (ROM) 8023.
Storage unit 802 can also include a program/utility 8025 having a set (at least one) of program modules 8024, such program modules 8024 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
Computing device 800 may also communicate with one or more external devices 804 (e.g., keyboard, pointing device, etc.). Such communication may be through input/output (I/O) interfaces 805. Moreover, computing device 800 may also communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via network adapter 806. As shown in fig. 8, a network adapter 806 communicates with the other modules of the computing device 800 via the bus 803. It should be understood that although not shown in the figures, other hardware and/or software modules may be used in conjunction with computing device 800, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
It should be noted that although in the above detailed description several units/modules or sub-units/modules of the route update apparatus are mentioned, such a division is merely exemplary and not mandatory. Indeed, the features and functionality of two or more of the units/modules described above may be embodied in one unit/module, in accordance with embodiments of the present disclosure. Conversely, the features and functions of one unit/module described above may be further divided into embodiments by a plurality of units/modules.
Further, while the operations of the disclosed methods are depicted in the drawings in a particular order, this does not require or imply that these operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
While the spirit and principles of the present disclosure have been described with reference to several particular embodiments, it is to be understood that the present disclosure is not limited to the particular embodiments disclosed, nor is the division of aspects, which is for convenience only as the features in such aspects may not be combined to benefit. The disclosure is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims (9)

1. A method of route update, comprising:
receiving a route update message, wherein the route update message carries target node route prefix information and target neighbor node address information, the target node route prefix information is used for identifying a service of first network equipment, the target neighbor node address information is used for identifying a network address of second network equipment, the second network equipment is adjacent to the network equipment receiving the route update message, and the first network equipment and the second network equipment both operate a Border Gateway Protocol (BGP);
determining target inhibition time in a plurality of preset inhibition times according to the target node routing prefix information and the target neighbor node address information;
sending the route updating message to a target peer for route updating based on the target inhibition time, wherein the target peer is a network device in the same autonomous domain as the network device receiving the route updating message;
the determining the target inhibition time in a plurality of preset inhibition times according to the target node routing prefix information and the target neighbor node address information comprises the following steps:
inquiring a routing updating strategy according to the routing prefix information of the target node and the address information of the target neighbor node, wherein the routing updating strategy comprises the routing prefix information of each node, the address information of the neighbor node and the corresponding relation of a plurality of inhibition times corresponding to the routing prefix information and/or the address information of the neighbor node;
responding to the routing updating strategy to contain the target node routing prefix information and the target neighbor node address information, and determining a first strategy which is matched with the target node routing prefix information and the target neighbor node address information at the same time;
determining a first inhibition time according to the first strategy;
and determining the target inhibition time as the first inhibition time.
2. The route update method according to claim 1, further comprising:
in response to the routing update strategy comprising the target node routing prefix information and the target neighbor node address information, determining a second strategy which is only matched with the target node routing prefix information and a third strategy which is only matched with the target neighbor node address information in the routing update strategy;
determining a second inhibition time according to the second strategy;
and determining the target inhibition time as the second inhibition time.
3. The route update method according to claim 1, further comprising:
responding to the routing updating strategy to contain the target neighbor node address information, and determining a third strategy which is only matched with the target neighbor node address information in the routing updating strategy;
determining a third inhibition time according to the third strategy;
and determining the target inhibition time as the third inhibition time.
4. The route update method according to claim 1, further comprising:
and determining the target inhibition time to be a fourth inhibition time in response to the routing update strategy not containing the target routing prefix information nor the target neighbor address information.
5. The route update method of claim 1, the sending the route update message to a target peer based on the target throttling time, comprising:
and responding to the determined moment of the target inhibition time, and sending the route updating message to the target peer after the target inhibition time is passed.
6. The route updating method according to any one of claims 1 to 5, further comprising, before querying a route updating policy according to the target node route prefix information and the target neighbor node address information:
and determining the route updating strategy according to the sensitivity of the business service to the fault.
7. The route update method according to any one of claims 1 to 5, before sending the route update message to a target peer for route update based on the target suppression time, further comprising:
caching the target routing prefix information and the target neighbor address information in response to the target throttling time not being zero.
8. The route update method according to any of claims 1 to 5, further comprising:
receiving the route update message in response to a route add operation and/or a route withdraw operation.
9. A route update apparatus comprising:
a receiving module, configured to receive a route update message, where the route update message carries target node route prefix information and target neighbor node address information, where the target node route prefix information is used to identify a service of a first network device, the target neighbor node address information is used to identify a network address of a second network device, the second network device is adjacent to the network device that receives the route update message, and both the first network device and the second network device operate a border gateway protocol BGP;
a determining module, configured to determine a target suppression time among a plurality of preset suppression times according to the target node routing prefix information and the target neighbor node address information;
a processing module, configured to send the route update message to a target peer for route update based on the target suppression time, where the target peer is a network device in the same autonomous domain as a network device that receives the route update message;
the determining module is specifically configured to: inquiring a routing updating strategy according to the routing prefix information of the target node and the address information of the target neighbor node, wherein the routing updating strategy comprises the routing prefix information of each node, the address information of the neighbor node and the corresponding relation of a plurality of inhibition times corresponding to the routing prefix information and/or the address information of the neighbor node; responding to the routing updating strategy to contain the target node routing prefix information and the target neighbor node address information, and determining a first strategy which is matched with the target node routing prefix information and the target neighbor node address information at the same time; determining a first inhibition time according to the first strategy; and determining the target inhibition time as the first inhibition time.
CN202111479959.4A 2021-12-06 2021-12-06 Route updating method, medium, device and computing equipment Active CN113904973B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111479959.4A CN113904973B (en) 2021-12-06 2021-12-06 Route updating method, medium, device and computing equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111479959.4A CN113904973B (en) 2021-12-06 2021-12-06 Route updating method, medium, device and computing equipment

Publications (2)

Publication Number Publication Date
CN113904973A CN113904973A (en) 2022-01-07
CN113904973B true CN113904973B (en) 2022-03-08

Family

ID=79025534

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111479959.4A Active CN113904973B (en) 2021-12-06 2021-12-06 Route updating method, medium, device and computing equipment

Country Status (1)

Country Link
CN (1) CN113904973B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114500273B (en) * 2022-04-07 2022-06-28 北京盈通恒信电力科技有限公司 Method, device and system for power line carrier communication transmission

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101471811A (en) * 2007-12-28 2009-07-01 华为技术有限公司 Method and apparatus for restraining routing concussion
CN107888501A (en) * 2016-09-30 2018-04-06 中国电信股份有限公司 Sending method, RR, the network equipment and the network system of routing update message
WO2018170901A1 (en) * 2017-03-24 2018-09-27 Telefonaktiebolaget Lm Ericsson (Publ) Method and device for managing network based on border gateway protocol

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7430176B2 (en) * 2005-02-15 2008-09-30 Cisco Technology, Inc. Adaptive timing of update messages transmitted by routers employing the border gateway protocol
CN101483548B (en) * 2009-02-26 2011-01-19 中国人民解放军信息工程大学 Method and system for distance vector routing protocol self-recovery
EP3031183B1 (en) * 2013-08-05 2019-01-16 Telefonaktiebolaget LM Ericsson (publ) Method and apparatus for operating routing device and relevant routing device

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101471811A (en) * 2007-12-28 2009-07-01 华为技术有限公司 Method and apparatus for restraining routing concussion
CN107888501A (en) * 2016-09-30 2018-04-06 中国电信股份有限公司 Sending method, RR, the network equipment and the network system of routing update message
WO2018170901A1 (en) * 2017-03-24 2018-09-27 Telefonaktiebolaget Lm Ericsson (Publ) Method and device for managing network based on border gateway protocol

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Effect of MRAI timers and routing policies on BGP convergence times;Rajvir Gill等;《2012 IEEE 31st International Performance Computing and Communications Conference (IPCCC)》;20130111;第314-323页 *
基于SSFnet环境的BGP快速收敛方法研究;吴学会 等;《电脑知识与技术》;20150531;第11卷(第14期);第47-49页 *

Also Published As

Publication number Publication date
CN113904973A (en) 2022-01-07

Similar Documents

Publication Publication Date Title
US11868824B2 (en) Single node and multiple node datastore architecture in a network routing environment
Zhang et al. A survey on software defined networking with multiple controllers
CN108234306B (en) Network device, network method, and computer-readable storage medium
US7894335B2 (en) Redundant routing capabilities for a network node cluster
JP3184535B2 (en) data communication
CN108234302A (en) Keep the consistency in the distributed operating system of network equipment
Moazzeni et al. On reliability improvement of software-defined networks
JP4789425B2 (en) Route table synchronization method, network device, and route table synchronization program
CN113572831A (en) Communication method between Kubernetes clusters, computer equipment and medium
CN111753166A (en) Query broker for communicating dynamic system states
JP2002051083A (en) Protocol information management for inter-private network interface hierarchy network
US11824765B2 (en) Fast redirect of traffic when pods fail
US20180278577A1 (en) High availability bridging between layer 2 networks
CN109462511B (en) Network establishing method and device
WO2020057445A1 (en) Communication system, method, and device
CN113904973B (en) Route updating method, medium, device and computing equipment
CN110019484B (en) Database system, implementation method, management device, data interface device and medium
WO2020181733A1 (en) Vpc-based multi-data center intercommunication method and related device
CN115665026A (en) Cluster networking method and device
US9104562B2 (en) Enabling communication over cross-coupled links between independently managed compute and storage networks
CN114124780B (en) Route issuing method, device, electronic equipment and storage medium
Menaceur et al. Fault Tolerance and Failure Recovery Techniques in Software-Defined Networking: A Comprehensive Approach
CN117499206A (en) Communication exception handling method and computing device
CN116866266A (en) Forwarder AVF distribution method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant