CN114567589A - Identification method and device for route reporting - Google Patents
Identification method and device for route reporting Download PDFInfo
- Publication number
- CN114567589A CN114567589A CN202210164049.5A CN202210164049A CN114567589A CN 114567589 A CN114567589 A CN 114567589A CN 202210164049 A CN202210164049 A CN 202210164049A CN 114567589 A CN114567589 A CN 114567589A
- Authority
- CN
- China
- Prior art keywords
- route
- mask
- prefix
- determining
- routes
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 66
- 238000012544 monitoring process Methods 0.000 claims abstract description 128
- 230000008569 process Effects 0.000 description 18
- 238000012545 processing Methods 0.000 description 5
- 230000000007 visual effect Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 230000006872 improvement Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
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/14—Routing performance; Theoretical aspects
Abstract
The application provides a method and a device for identifying route reporting, wherein the method comprises the following steps: traversing a first number of routes by taking a root node as a starting point in a radix tree, and recording a first traversal position after traversing the first number of routes, wherein the first route is stored in the first traversal position; sending a first route updating message to a monitoring end, wherein the first route updating message comprises a first number of routes traversed before a first traversal position and a first route; after receiving a second route updating message sent by a BGP neighbor, judging the size relationship between a first route and a second route included in the second route updating message; determining whether the second route is reported to the monitoring end through the first route updating message according to the judgment result; and if the first route update message is reported to the monitoring end, sending a third route update message to the monitoring end, wherein the third route update message comprises the second route.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for identifying a route report.
Background
At present, if a user wants to check the route, neighbor state and other related information of a BGP neighbor in a certain network device, the user may input various check commands after logging in the network device, and display the check results through a screen of the network device.
The Border Gateway Protocol (BGP) Monitoring Protocol (BMP) is a Protocol for Monitoring BGP neighbors, and can access routes, neighbor states, and other related information of the BGP neighbors, and can periodically display statistical information of the above contents.
The network device to be monitored is called a client, and the monitoring server is called a monitoring end. One client can be connected with a plurality of monitoring terminals. The administrator configures a connected monitoring end (by configuring the address and port number of the monitoring end, the client establishes a TCP connection with the monitoring end) and a BGP neighbor to be monitored in the client.
After the administrator configures the monitored BGP neighbors in the client, the client sends BMP messages to the monitoring end according to the reporting period. After receiving the BMP message, the monitor terminal analyzes the message content according to the BMP protocol and the BGP protocol, and presents the message content to the user through a visual interface.
In the process of monitoring BGP neighbors, if the monitoring is started after the BGP neighbors receive the routes, the client needs to traverse the local routing table of the current equipment, package the routes received by the BGP neighbors and report the packaged routes. In the reporting process, if a route of a BGP neighbor is updated or a new route is added, the client needs to determine whether the route corresponding to the update needs to be reported, thereby increasing the overhead of the client.
In addition, with the continuous improvement and refinement of the BMP protocol, the route monitored by the client side of the BGP neighbor is subdivided into a pre-policy (pre-policy) mode and a post-policy (post-policy) mode (wherein pre-policy refers to the route and the route attribute received by the BGP neighbor that are monitored before the policy is applied, and post-policy refers to the route and the route attribute received by the BGP neighbor that are monitored after the policy is applied). When the monitoring mode changes, for example, the pre-policy mode is switched to the post-policy mode, the client needs to explicitly send a route withdrawal message to the server to notify the server to delete the route reported in the old mode. However, before the client sends the route withdrawal message, the client also needs to traverse the local routing table of the current device and obtain the route monitored by the old mode, which is also a small overhead for the client.
In both cases of uploading, the client needs to set a flag indicating whether the route of the BGP neighbor has been reported, so that how to perform what kind of processing on the route of the BGP neighbor can be accurately determined. However, when the number of routes is large, a large amount of memory resources of the client will be occupied.
Disclosure of Invention
In view of this, the present application provides a method and an apparatus for identifying route reporting, so as to solve the problem that when an existing client sets an identifier indicating whether a route of a BGP neighbor has been reported, if the number of routes is large, the memory resource occupied by the client is occupied.
In a first aspect, the present application provides a method for identifying a route report, where the method is applied to a client, a radix tree is configured in the client, and a route of a BGP neighbor is stored in the radix tree, and the method includes:
traversing a first number of routes by taking a root node as a starting point in the radix tree, and recording a first traversal position after traversing the first number of routes, wherein the first route is stored in the first traversal position;
sending a first route updating message to a monitoring end, wherein the first route updating message comprises a first number of routes traversed before the first traversal position and the first route;
after receiving a second route update message sent by the BGP neighbor, judging the size relationship between the first route and a second route included in the second route update message;
determining whether the second route is reported to the monitoring end through the first route updating message or not according to the judgment result;
and if the first route update message is reported to the monitoring end, sending a third route update message to the monitoring end, wherein the third route update message comprises the second route.
In a second aspect, the present application provides an identification apparatus for route reporting, where the apparatus is applied to a client, a radix tree is configured in the client, and a route of a BGP neighbor is stored in the radix tree, and the apparatus includes: the device comprises a traversing unit, a sending unit, a first judging unit, a receiving unit and a determining unit.
The traversal unit is used for traversing a first number of routes in the radix tree by taking a root node as a starting point, and recording a first traversal position after traversing the first number of routes, wherein the first route is stored in the first traversal position;
a sending unit, configured to send a first route update packet to a monitoring end, where the first route update packet includes a first number of routes traversed before the first traversal position and the first route;
a first determining unit, configured to determine, after the receiving unit receives a second route update packet sent by the BGP neighbor, a size relationship between the first route and a second route included in the second route update packet;
a determining unit, configured to determine, according to a determination result, whether the second route has been reported to the monitoring end through the first route update packet;
the sending unit is further configured to send a third route update message to the monitoring terminal if the first route update message is reported to the monitoring terminal, where the third route update message includes the second route.
In a third aspect, the present application provides a network device comprising a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to perform the method provided by the first aspect of the present application.
Therefore, by applying the identification method and the identification device for route reporting provided by the application, in the radix tree, the client traverses a first number of routes by taking the root node as a starting point, and records a first traversal position after traversing the first number of routes, wherein the first route is stored in the first traversal position; the method comprises the steps that a client sends a first route updating message to a monitoring end, wherein the first route updating message comprises a first number of routes traversed before a first traversal position and a first route; after receiving a second route updating message sent by a BGP neighbor, a client judges the size relationship between a first route and a second route included in the second route updating message; according to the judgment result, the client determines whether the second route is reported to the monitoring end through the first route updating message; and if the first route update message is reported to the monitoring end, the client sends a third route update message to the monitoring end, wherein the third route update message comprises the second route.
Therefore, the BGP neighbor routes are stored in the radix tree ordered according to the lexicographical order, and whether the BGP neighbor routes are reported to the monitoring end can be judged without recording reporting marks in the BGP neighbor routes by virtue of the characteristic of the lexicographical order. The problem that memory resources of the client are occupied if the number of the routes is large when the existing client sets the reported identification for the routes of the BGP neighbor is solved, batch reporting and real-time reporting of the BGP neighbor routes are realized without occupying extra memory, and related operations of reported BGP neighbor routes are cancelled.
Drawings
Fig. 1 is a flowchart of an identification method for route reporting according to an embodiment of the present application;
fig. 2 is a structural diagram of an identification apparatus for route reporting according to an embodiment of the present application;
fig. 3 is a hardware structure of a network device according to an embodiment of the present disclosure.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the corresponding listed items.
It is to be understood that although the terms first, second, third, etc. may be used herein to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the present application. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
The method for identifying a route report provided in the embodiment of the present application is described in detail below. Referring to fig. 1, fig. 1 is a flowchart of an identification method for route reporting according to an embodiment of the present application. The method is applied to the client. The identification method for route reporting provided by the embodiment of the application can comprise the following steps.
In particular, the monitoring server is called a monitoring end, and the monitored network device is called a client. When a user checks the route, the neighbor state and other related information of the BGP neighbor in the network equipment, the client can send a route updating message to the monitoring end in real time or in batch according to the reporting period. After receiving the route updating message, the monitoring end analyzes the message content according to the BMP protocol and the BGP protocol, and presents the message content to the user through a visual interface.
In an embodiment of the application, a radix (radix) tree is configured in the client, and routes of BGP neighbors are stored in a lexicographic order in the radix tree. The lexicographic order is that the destination Internet Protocol (IP) addresses included in the route are sorted according to their sizes, and the smaller the destination IP address is, the closer to the root node is.
In a reporting period, the client traverses a first number of routes by taking the root node as a starting point, and records a first traversal position after traversing the first number of routes, and the first route is stored in the first traversal position.
The method comprises the steps that the functions in the protocol supported in the client side need to be dispatched in a balanced mode, and in order to avoid the problem that the other functions cannot be dispatched in time due to the fact that the occupied time of one-time processing of certain operations is too long, managers can determine the first number according to experience values. For example, the first number is 50.
The first traversal position consists of the tree type of the radix tree where the first traversal position is located and the first route. The first route is the last route traversed in the current traversal process.
It should be noted that the neighbor BGP routes may contain different types. For example, IPv4 unicast routing, IPv6 unicast routing. Different types of routes will typically be stored in different radix trees. The tree type refers to that the traversal is the radix tree of the IPv4 unicast routing type, or the traversal is currently the radix tree of the IPv6 unicast routing type.
Further, in this embodiment of the present application, after the client finishes the traversal, a notification event is started, where the notification event includes the first traversal position. And when the next reporting period comes, calling the notification event, and starting the second traversal by taking the first traversal position as a starting point. Or after the client finishes the traversal, starting a timer, acquiring a first traversal position when the timer is overtime, and starting a second traversal by taking the first traversal position as a starting point.
Specifically, according to the description in step 120, after traversing the first number of routes, the client follows the BMP protocol and the BGP protocol to generate a first route update packet, where the first route update packet includes the first number of routes and the first route.
The client sends a first route updating message to the monitoring end. And after receiving the first route updating message, the monitoring end analyzes the message content and presents the message content to the user through a visual interface.
Specifically, according to the description in step 120, after sending the first route update packet to the monitoring end, the client waits for entering the next reporting period.
If so, the client receives a second route updating message sent by the BGP neighbor, wherein the second route updating message comprises a second route. The second route may be a new route or the second route may be a route attribute update of a previously synchronized historical route.
And after acquiring the second route from the second route updating message, the client judges the size relationship between the first route and the second route.
Further, the client determines a size relationship between the first route and the second route, and the specific process is as follows: according to the radix tree of the dictionary ordering mode, the client judges the size relationship between the first route and the second route; the BGP neighbor route is stored in a radix tree according to the size of a target IP address, and the target IP address included in the route which is far away from the root node is small.
Further, the first traversal position further comprises a tree type of a radix tree where the first traversal position is located; the first route comprises a first route prefix and a first mask; the second route comprises a second route prefix and a second mask;
the client judges the size relationship between the first route and the second route according to the radix tree of the dictionary sequence arrangement mode, and the specific process is as follows:
if the second route is matched with the tree type of the radix tree, that is, the route type of the second route is matched with the tree type of the radix tree, for example, the route type of the second route is an IPv4 unicast route, and the tree type of the radix tree is an IPv4 unicast route, the client determines the size of the first route prefix and the size of the second route prefix.
And if the second route prefix is smaller than the first route prefix, the client determines that the second route is smaller than the first route, and if the second route prefix is larger than the first route prefix, the client determines that the second route is larger than the first route. For example, the second route is 1.1.0.0/24, the first route is 1.1.1.0/32, the second route prefix is smaller than the first route prefix, and the client determines that the second route is smaller than the first route.
If the second routing prefix is the same as the first routing prefix, the client judges the sizes of the second mask and the first mask; and if the second mask is smaller than the first mask, the client determines that the second route is smaller than the first route, and if the second mask is larger than the first mask, the client determines that the second route is larger than the first route. For example, if the second route is 1.1.0.0/24 and the first route is 1.1.0.0/32, the second route prefix is the same as the first route prefix, and the client determines the sizes of the second mask and the first mask. In this example, the second mask is less than the first mask, and the client determines that the second route is less than the first route.
If the second mask is the same as the first mask, the client judges the positions of the second route and the first route in the conflict chain; and if the position of the second route in the conflict chain is before the position of the first route in the conflict chain, the client determines that the second route is smaller than the first route, otherwise, the client determines that the second route is larger than the first route. For example, the second route is 2.1.0.0/24-a, the first route is 2.1.0.0/24-b, then the second route prefix is the same as the first route prefix, the second mask is the same as the first mask, and the client determines that the second route is an equivalent route to the first route. The client traverses the collision chain, and determines the position of the second route and the first route in the collision chain by comparing the sizes of the key attributes (for example, pathid values in the addpath attributes). And if the position of the second route in the collision chain is before the position of the first route in the collision chain, or if the position of the second route in the collision chain is the same as the position of the first route in the collision chain, the client determines that the second route is smaller than or equal to the first route.
Specifically, according to the description in step 130, after the client determines that the second route is directly related to the first route in size, according to the determination result, the client determines whether the second route has been reported to the monitoring end through the first route update packet.
Further, the client determines whether the second route is reported to the monitoring terminal through the first route update message according to the judgment result, and the specific process is as follows:
if the second route is smaller than or equal to the first route, the client determines that the position of the second route in the radix tree is before the first traversal position, and the second route is reported to the monitoring end through the first route updating message.
If the second route is larger than the first route, the client determines that the position of the second route in the radix tree is at the first traversal position, and the second route is not reported to the monitoring end through the first route updating message.
Specifically, according to the description of step 140, if the second route is reported to the monitoring end through the first route update packet, the client generates and sends a third route update packet to the monitoring end, where the third route update packet includes the second route.
And after receiving the third route updating message, the monitoring end acquires the second route from the third route updating message. And updating the historical route stored in the local place in advance according to the second route.
Further, if the second route is not reported to the monitoring end through the first route update message, the client updates the radix tree according to the second route. The updating radix tree specifically comprises the following steps: if the second route is the new route, the client stores the second route into a radix tree; and if the second route is the route attribute update of the historical route, the client updates the historical route in the radix tree into the second route.
In the next reporting period, the client traverses a second number of routes again in the radix tree by taking the first traversal position as a starting point, and records a second traversal position after traversing the second number of routes, wherein the second number of routes comprise the second route.
The client follows the BMP protocol and the BGP protocol to generate a fourth route updating message, and the fourth route updating message comprises a second number of routes and the routes stored in the second traversal position.
And the client sends a fourth route updating message to the monitoring end. And after receiving the fourth route updating message, the monitoring end analyzes the message content and presents the message content to the user through a visual interface.
In this embodiment of the application, if the second route is not reported to the monitoring end through the first route update message, the client may report to the monitoring end through the route update message in a subsequent reporting period when the traversed route includes the second route.
The second number may be the same as or different from the first number, and the administrator may determine the second number according to the current status of the network device and an empirical value.
Therefore, by applying the identification device for route reporting provided by the application, in the radix tree, the client traverses a first number of routes by taking the root node as a starting point, and records a first traversal position after traversing the first number of routes, wherein the first route is stored in the first traversal position; the method comprises the steps that a client sends a first route updating message to a monitoring end, wherein the first route updating message comprises a first number of routes traversed before a first traversal position and a first route; after receiving a second route updating message sent by a BGP neighbor, a client judges the size relationship between a first route and a second route included in the second route updating message; according to the judgment result, the client determines whether the second route is reported to the monitoring end through the first route updating message; and if the first route update message is reported to the monitoring end, the client sends a third route update message to the monitoring end, wherein the third route update message comprises the second route.
Therefore, the BGP neighbor routes are stored in the radix tree ordered according to the lexicographical order, and whether the BGP neighbor routes are reported to the monitoring end can be judged without recording reporting marks in the BGP neighbor routes by virtue of the characteristic of the lexicographical order. The problem that memory resources of the client are occupied if the number of the routes is large when the existing client sets the reported identification for the routes of the BGP neighbor is solved, batch reporting and real-time reporting of the BGP neighbor routes are realized without occupying extra memory, and related operations of reported BGP neighbor routes are cancelled.
Optionally, in this embodiment of the application, after the client sends the first route update packet to the monitoring end, the method further includes a processing procedure that after the client monitors the mode switch, the monitoring end should be reported with a route revocation packet, and a processing procedure that after the client reports the route revocation packet, the client receives the route update packet.
Specifically, the client may execute the foregoing steps 110 to 150 in the configured first monitoring mode, and when the client switches from the first monitoring mode to the second monitoring mode, the client needs to cancel the route reported by the route update packet in the first monitoring mode.
The first monitoring mode and the second monitoring mode may be specifically a pre-policy (pre-policy) mode and a post-policy (post-policy) mode.
The process of reporting the route revocation message to the monitoring terminal by the client is as follows:
when the monitoring mode is determined to be switched from the first monitoring mode to the second monitoring mode, the client records the first traversal position as the traversal end position, that is, the client determines that the traversal end position is included before the traversal end position, and the route stored in the radix tree needs to be cancelled.
In the radix tree, the client traverses the third number of routes again by taking the root node as a starting point, and records a third traversal position after traversing the third number of routes, wherein the third traversal position stores the third route.
And the client judges the size relationship between the third route and the first route. It is understood that the process of determining the size relationship between the third route and the first route by the client is the same as the process of determining the size relationship between the second route and the first route by the client, and will not be repeated here.
If the third route is smaller than or equal to the first route, the client determines that the third traversal position is before the first traversal position, and both the route stored before the third traversal position and the third route stored in the third traversal position need to be cancelled.
The client follows the BMP protocol and the BGP protocol to generate a first revocation route message, and the first revocation route message comprises a third number of routes and a third route.
The client sends a first route revocation message to the monitoring terminal.
It should be noted that, when the client reaches the traversal end position through one traversal, the time consumption is too long, and other functions of the protocol cannot be scheduled normally, so that the client can reach the traversal end position after multiple traversals. For example, the client reaches 20% of the distance between the root node and the traversal end location through the third traversal location, the client reaches 40% of the distance through the fourth traversal location, and so on.
And after the client finishes the traversal, starting a notification event, wherein the notification event comprises a third traversal position. And when the next reporting period comes, calling the notification event, and starting the fourth traversal by taking the third traversal position as a starting point. Or after the client finishes the traversal, starting a timer, acquiring a third traversal position when the timer is over, and starting the traversal for the fourth time by taking the third traversal position as a starting point.
And after receiving the first route canceling message, the monitoring end analyzes the message content and locally deletes the route reported by the client in advance.
And after the client sends the first route withdrawal message to the monitoring terminal, waiting for entering the next reporting period.
If so, the client receives a fifth route update message sent by the BGP neighbor, where the fifth route update message includes a fourth route. The fourth route may be a new route or the fourth route may be a route attribute update for a prior synchronized historical route.
And after acquiring the fourth route from the fifth route updating message, the client judges the size relationship among the first route, the third route and the fourth route.
Further, the client determines a size relationship among the first route, the third route, and the fourth route, and the specific process is as follows:
according to the radix tree of the dictionary sequence arrangement mode, the client respectively judges the size relationship between the fourth route and the first route and the size relationship between the fourth route and the third route; the BGP neighbor route is stored in a radix tree according to the size of a destination IP address, and the route close to the root node comprises the destination IP address which is small.
Further, the first traversal position includes a tree type of the radix tree where the first traversal position is located; the first route comprises a first route prefix and a first mask; the fourth route comprises a fourth route prefix and a fourth mask;
the client judges the size relationship between the fourth route and the first route according to the radix tree of the dictionary sequence arrangement mode, and the specific process is as follows:
if the route type of the fourth route is matched with the tree type of the radix tree, that is, the route type of the fourth route is matched with the tree type of the radix tree, for example, the route type of the fourth route is an IPv4 unicast route, and the tree type of the radix tree is an IPv4 unicast route, the client determines the size of the prefix of the fourth route and the size of the prefix of the first route.
If the prefix of the fourth route is smaller than the prefix of the first route, the client determines that the fourth route is smaller than the first route, and if the prefix of the fourth route is larger than the prefix of the first route, the client determines that the fourth route is larger than the first route; if the fourth routing prefix is the same as the first routing prefix, the client judges the sizes of the fourth mask and the first mask; if the fourth mask is smaller than the first mask, the client determines that the fourth route is smaller than the first route, and if the fourth mask is larger than the first mask, the client determines that the fourth route is larger than the first route; if the fourth mask is the same as the first mask, the client judges the positions of the fourth route and the first route in the conflict chain; and if the position of the fourth route in the conflict chain is before the position of the first route in the conflict chain, or if the position of the fourth route in the conflict chain is the same as the position of the first route in the conflict chain, determining that the fourth route is smaller than or equal to the first route, otherwise, determining that the fourth route is larger than the first route by the client.
It is understood that the process of determining the size relationship between the fourth route and the first route by the client is the same as the process of determining the size relationship between the second route and the first route by the client, and is not described here by way of example.
Further, the third traversal position comprises a tree type of a radix tree where the third traversal position is located; the third route comprises a third route prefix and a third mask; the fourth route comprises a fourth route prefix and a fourth mask;
the client judges the size relationship between the fourth route and the third route according to the radix tree of the dictionary sequence arrangement mode, and the specific process is as follows:
if the route type of the fourth route is matched with the tree type of the radix tree, the client judges the sizes of the fourth route prefix and the third route prefix; if the prefix of the fourth route is smaller than the prefix of the third route, the client determines that the fourth route is smaller than the third route, and if the prefix of the fourth route is larger than the prefix of the third route, the client determines that the fourth route is larger than the third route; if the fourth route prefix is the same as the third route prefix, the client judges the sizes of the fourth mask and the third mask; if the fourth mask is smaller than the third mask, the client determines that the fourth route is smaller than the third route, and if the fourth mask is larger than the third mask, the client determines that the fourth route is larger than the third route; if the fourth mask code is the same as the third mask code, the client judges the positions of the fourth route and the third route in the conflict chain; and if the position of the fourth route in the collision chain is before the position of the third route in the collision chain, or if the position of the fourth route in the collision chain is the same as the position of the third route in the collision chain, the client determines that the fourth route is smaller than or equal to the third route, otherwise, the client determines that the fourth route is larger than the third route.
It is understood that the process of determining the size relationship between the fourth route and the third route by the client is the same as the process of determining the size relationship between the second route and the first route by the client, and is not described here by way of example.
From the above judgment:
in an implementation case, if the fourth route is less than or equal to the first route, the client determines that the position of the fourth route in the radix tree is before or the same as the traversal end position, and the fourth route is a route to be withdrawn; if the fourth route is less than or equal to the third route, the client determines that the position of the fourth route in the radix tree is before or the same as the third traversal position; and in the last reporting period, the client terminal reports the message to the monitoring terminal through the first withdrawn route.
At this time, the client only updates the radix tree and does not send the route withdrawal message to the monitoring end any more.
In another implementation case, if the fourth route is less than or equal to the first route, the client determines that the position of the fourth route in the radix tree is before or the same as the traversal end position, and the fourth route is a route to be withdrawn; if the fourth route is larger than the third route, the client determines that the position of the fourth route in the radix tree is behind the third traversal position; in the last reporting period, the client does not report to the monitoring end through the first withdrawn routing message.
At this time, the client follows the BMP protocol and the BGP protocol to generate the second revocation route packet including the fourth route, and updates the radix tree.
And the client sends a second revocation routing message to the monitoring end. After receiving the first route canceling message, the monitoring end analyzes the message content and locally deletes the route reported by the client in advance.
In another implementation case, if the third route is greater than the first route, the client determines that the position of the third route in the radix tree is after the traversal end position, and the third route is not a route to be withdrawn. At this time, the client clears the traversal end position and the third traversal position, and does not start the notification event or the timer any more.
It should be noted that after the monitoring mode of the client is switched, the route update message after the monitoring mode is switched needs to be reported to the monitoring terminal again, so that the monitoring terminal stores the route after the monitoring mode is switched.
In the radix tree, the client traverses the fourth number of routes by taking the root node as a starting point again, and records a fourth traversal position after traversing the fourth number of routes, and a sixth route is stored in the fourth traversal position.
And after traversing the fourth number of routes, the client follows the BMP protocol and the BGP protocol to generate a sixth route updating message, wherein the sixth route updating message comprises the fourth number of routes and the sixth route.
And in the second monitoring mode, the client sends a sixth routing update message to the monitoring terminal. And after receiving the sixth routing update message, the monitoring end analyzes the message content and presents the message content to the user through a visual interface.
The fourth quantity may be the same as or different from the first quantity, the second quantity, and the third quantity, and the administrator may determine the fourth quantity according to the current status of the network device and an empirical value.
Based on the same inventive concept, the embodiment of the application also provides a route reporting identification device corresponding to the route reporting identification method. Referring to fig. 2, fig. 2 is a device for identifying route reporting provided in the embodiment of the present application, where the device is applied to a client, a radix tree is configured in the client, and a route of a BGP neighbor is stored in the radix tree, and the device includes: the device comprises a traversing unit 210, a sending unit 220, a first judging unit 230, a receiving unit 240 and a determining unit 250.
The traversal unit 210 is configured to traverse a first number of routes in the radix tree with a root node as a starting point, and record a first traversal position after traversing the first number of routes, where a first route is stored in the first traversal position;
the sending unit 220 is configured to send a first route update packet to a monitoring end, where the first route update packet includes a first number of routes traversed before the first traversal position and the first route;
the first determining unit 230 is configured to determine, after the receiving unit 240 receives the second route update packet sent by the BGP neighbor, a size relationship between the first route and the second route included in the second route update packet;
the determining unit 250 is configured to determine, according to a determination result, whether the second route has been reported to the monitoring end through the first route update packet;
the sending unit 220 is further configured to send a third route update packet to the monitoring terminal if the first route update packet is reported to the monitoring terminal, where the third route update packet includes the first route.
Optionally, the apparatus further comprises: an updating unit (not shown in the figure) configured to update the radix tree according to the second route if the update message is not reported to the monitoring end through the first route;
the traversal unit 210 is further configured to, in a next reporting period, traverse a second number of routes again in the radix tree with the first traversal position as a starting point, and record a second traversal position after traversing the second number of routes, where the second number of routes includes the second route;
the sending unit 220 is further configured to send a fourth route update packet to the monitoring end, where the fourth route update packet includes the second number of routes and the routes stored in the second traversal position.
Optionally, the first determining unit 230 is specifically configured to determine a size relationship between the first route and the second route according to the radix tree in a lexicographic order arrangement;
the BGP neighbor route is stored in the radix tree according to the size of the destination IP address, and the route close to the root node comprises the destination IP address which is small.
Optionally, the first traversal position further comprises a tree type of a radix tree where the first traversal position is located; the first route comprises a first route prefix and a first mask; the second route comprises a second route prefix and a second mask;
the first determining unit 230 is further specifically configured to determine the size of the first routing prefix and the size of the second routing prefix if the routing type of the second route matches the tree type of the radix tree;
if the second route prefix is smaller than the first route prefix, determining that the second route is smaller than the first route, and if the second route prefix is larger than the first route prefix, determining that the second route is larger than the first route;
if the second routing prefix is the same as the first routing prefix, judging the sizes of the second mask and the first mask;
if the second mask is smaller than the first mask, determining that the second route is smaller than the first route, and if the second mask is larger than the first mask, determining that the second route is larger than the first route;
if the second mask is the same as the first mask, judging the positions of the second route and the first route in a conflict chain;
if the position of the second route in the conflict chain is before or the same as the position of the first route in the conflict chain, determining that the second route is smaller than or equal to the first route, otherwise, determining that the second route is larger than the first route.
Optionally, the determining unit 250 is specifically configured to, if the second route is less than or equal to the first route, determine that the second route has been reported to the monitoring end through the first route update packet;
and if the second route is larger than the first route, determining that the second route does not report to the monitoring end through the first route updating message.
Optionally, the apparatus further comprises: a recording unit (not shown in the figure) for recording the first traversal position as a traversal end position when it is determined that the monitoring mode has been switched from the first monitoring mode to the second monitoring mode;
the traversal unit 210 is further configured to traverse a third number of routes in the radix tree with the root node as a starting point, and record a third traversal position after traversing the third number of routes, where the third traversal position stores the third route;
the sending unit 220 is further configured to send a first route revocation message to the monitoring end if the third route is less than or equal to the first route, where the first route revocation message includes the third number of routes and the third route;
a second determining unit (not shown in the figure), configured to determine, after the receiving unit 240 receives a fifth route update packet sent by the BGP neighbor, a size relationship between the first route, the third route, and a fourth route included in the fifth route update packet;
the sending unit 220 is further configured to update the radix tree and not send a route withdrawal packet to the monitoring end any more if the fourth route is less than or equal to the first route and the fourth route is less than or equal to the third route.
Optionally, the sending unit 220 is further configured to send a second route revocation message to the monitoring end if the fourth route is smaller than the first route and the fourth route is larger than the third route, where the second route revocation message includes the fourth route, and update the radix tree.
Optionally, the second determining unit (not shown in the figure) is specifically configured to determine, according to the radix tree in a lexicographical ordering manner, a size relationship between the fourth route and the first route, and a size relationship between the fourth route and the third route, respectively;
the BGP neighbor route is stored in the radix tree according to the size of the destination IP address, and the route close to the root node comprises the destination IP address which is small.
Optionally, the first traversal position comprises a tree type of a radix tree in which the first traversal position is located; the first route comprises a first route prefix and a first mask; the fourth route comprises a fourth route prefix and a fourth mask;
the second determining unit (not shown in the figure) is further specifically configured to determine, if the route type of the fourth route matches the tree type of the radix tree, the size of the fourth route prefix and the size of the first route prefix;
if the fourth route prefix is smaller than the first route prefix, determining that the fourth route is smaller than the first route, and if the fourth route prefix is larger than the first route prefix, determining that the fourth route is larger than the first route;
if the fourth routing prefix is the same as the first routing prefix, judging the sizes of the fourth mask and the first mask;
determining that the fourth route is smaller than the first route if the fourth mask is smaller than the first mask, and determining that the fourth route is larger than the first route if the fourth mask is larger than the first mask;
if the fourth mask is the same as the first mask, judging the positions of the fourth route and the first route in a conflict chain;
if the position of the fourth route in the conflict chain is before or the same as the position of the first route in the conflict chain, determining that the fourth route is smaller than or equal to the first route, otherwise, determining that the fourth route is larger than the first route.
Optionally, the third traversal position includes a tree type of a radix tree in which the third traversal position is located; the third route comprises a third route prefix and a third mask; the fourth route comprises a fourth route prefix and a fourth mask;
the second determining unit (not shown in the figure) is further specifically configured to determine the size of the fourth route prefix and the size of the third route prefix if the route type of the fourth route matches the tree type of the radix tree;
determining that the fourth route is smaller than the third route if the fourth route prefix is smaller than the third route prefix, and determining that the fourth route is larger than the third route if the fourth route prefix is larger than the third route prefix;
if the fourth routing prefix is the same as the third routing prefix, judging the sizes of the fourth mask and the third mask;
determining that the fourth route is smaller than the third route if the fourth mask is smaller than the third mask, and determining that the fourth route is larger than the third route if the fourth mask is larger than the third mask;
if the fourth mask code is the same as the third mask code, judging the positions of the fourth route and the third route in a collision chain;
if the position of the fourth route in the conflict chain is before or the same as the position of the third route in the conflict chain, determining that the fourth route is smaller than or equal to the third route, otherwise, determining that the fourth route is larger than the third route.
Optionally, the apparatus further comprises: a clearing unit (not shown in the figure) configured to clear the traversal ending position and the third traversal position if the third route is greater than the first route;
the traversal unit 210 is further configured to traverse a fourth number of routes in the radix tree with the root node as a starting point, and record a fourth traversal position after traversing the fourth number of routes, where a sixth route is stored in the fourth traversal position;
the sending unit 220 is further configured to send, in the second monitoring mode, a sixth route update packet to the monitoring end, where the sixth route update packet includes a fourth number of routes traversed before the fourth traversal position and the sixth route.
Therefore, by applying the identification method and the identification device for route reporting provided by the application, in the radix tree, the client traverses a first number of routes by taking the root node as a starting point, and records a first traversal position after traversing the first number of routes, wherein the first route is stored in the first traversal position; the method comprises the steps that a client sends a first route updating message to a monitoring end, wherein the first route updating message comprises a first number of routes traversed before a first traversal position and a first route; after receiving a second route updating message sent by a BGP neighbor, a client judges the size relationship between a first route and a second route included in the second route updating message; according to the judgment result, the client determines whether the second route is reported to the monitoring end through the first route updating message; and if the first route update message is reported to the monitoring end, the client sends a third route update message to the monitoring end, wherein the third route update message comprises the second route.
Therefore, the BGP neighbor routes are stored in the radix tree ordered according to the lexicographical order, and whether the BGP neighbor routes are reported to the monitoring end can be judged without recording reporting marks in the BGP neighbor routes by virtue of the characteristic of the lexicographical order. The problem that memory resources of the client are occupied if the number of the routes is large when the existing client sets the reported identification for the routes of the BGP neighbor is solved, batch reporting and real-time reporting of the BGP neighbor routes are realized without occupying extra memory, and related operations of reported BGP neighbor routes are cancelled.
Based on the same inventive concept, an embodiment of the present application further provides a network device, as shown in fig. 3, including a processor 310, a transceiver 320, and a machine-readable storage medium 330, where the machine-readable storage medium 330 stores machine-executable instructions capable of being executed by the processor 310, and the processor 310 is caused by the machine-executable instructions to perform the identification method for route reporting provided by the embodiment of the present application. The aforementioned identification apparatus for route reporting shown in fig. 2 can be implemented by using a hardware structure of a network device shown in fig. 3.
The computer-readable storage medium 330 may include a Random Access Memory (RAM) and a Non-volatile Memory (NVM), for example, at least one disk Memory. Optionally, the computer-readable storage medium 330 may also be at least one memory device located remotely from the processor 310.
The Processor 310 may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the Integrated Circuit can also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components.
In the embodiment of the present application, the processor 310 reads the machine executable instructions stored in the machine readable storage medium 330, and the machine executable instructions cause the processor 310 itself and the transceiver 320 to perform the identification method of route reporting described in the embodiment of the present application.
In addition, the embodiment of the present application provides a machine-readable storage medium 330, where the machine-readable storage medium 330 stores machine-executable instructions, and when the machine-executable instructions are called and executed by the processor 310, the machine-executable instructions cause the processor 310 itself and the calling transceiver 320 to perform the identification method for route reporting described in the embodiment of the present application.
The implementation process of the functions and actions of each unit in the above device is specifically described in the implementation process of the corresponding step in the above method, and is not described herein again.
For the device embodiments, since they substantially correspond to the method embodiments, reference may be made to the partial description of the method embodiments for relevant points. The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the application. One of ordinary skill in the art can understand and implement it without inventive effort.
For the embodiments of the identification device and the machine-readable storage medium for route reporting, the contents of the related methods are substantially similar to those of the foregoing embodiments, so that the description is relatively simple, and for the relevant points, reference may be made to the partial description of the embodiments of the methods.
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the scope of protection of the present application.
Claims (12)
1. A method for identifying route report is characterized in that the method is applied to a client, a radix tree is configured in the client, and routes of BGP neighbors are stored in the radix tree, and the method comprises the following steps:
traversing a first number of routes by taking a root node as a starting point in the radix tree, and recording a first traversal position after traversing the first number of routes, wherein the first route is stored in the first traversal position;
sending a first route updating message to a monitoring end, wherein the first route updating message comprises a first number of routes traversed before the first traversal position and the first route;
after receiving a second route updating message sent by the BGP neighbor, judging the size relationship between the first route and a second route included in the second route updating message;
determining whether the second route is reported to the monitoring end through the first route updating message or not according to the judgment result;
and if the first route update message is reported to the monitoring end, sending a third route update message to the monitoring end, wherein the third route update message comprises the second route.
2. The method of claim 1, further comprising:
if the radix tree is not reported to the monitoring end through the first route updating message, updating the radix tree according to the second route;
in the next reporting period, traversing a second number of routes in the radix tree by taking the first traversal position as a starting point, and recording a second traversal position after traversing the second number of routes, wherein the second number of routes comprise the second route;
and sending a fourth route updating message to the monitoring end, wherein the fourth route updating message comprises the second number of routes and the routes stored in the second traversal position.
3. The method according to claim 1, wherein the determining a size relationship between the first route and the second route included in the second route update packet specifically includes:
judging the size relationship between the first route and the second route according to the radix tree in a dictionary sequence arrangement mode;
the BGP neighbor route is stored in the radix tree according to the size of a destination IP address, and the route close to the root node comprises the small destination IP address.
4. The method of claim 3, wherein the first traversal position further comprises a tree type of a radix tree in which the first traversal position is located; the first route comprises a first route prefix and a first mask; the second route comprises a second route prefix and a second mask;
the determining, by the radix tree arranged in a lexicographic order, a magnitude relationship between the first route and the second route specifically includes:
if the route type of the second route is matched with the tree type of the radix tree, judging the sizes of the first route prefix and the second route prefix;
if the second route prefix is smaller than the first route prefix, determining that the second route is smaller than the first route, and if the second route prefix is larger than the first route prefix, determining that the second route is larger than the first route;
if the second routing prefix is the same as the first routing prefix, judging the sizes of the second mask and the first mask;
if the second mask is smaller than the first mask, determining that the second route is smaller than the first route, and if the second mask is larger than the first mask, determining that the second route is larger than the first route;
if the second mask code is the same as the first mask code, judging the positions of the second route and the first route in a conflict chain;
if the position of the second route in the conflict chain is before or the same as the position of the first route in the conflict chain, determining that the second route is smaller than or equal to the first route, otherwise, determining that the second route is larger than the first route.
5. The method according to claim 4, wherein the determining, according to the determination result, whether the second route has been reported to the monitoring end via the first route update packet specifically includes:
if the second route is smaller than or equal to the first route, determining that the second route is reported to the monitoring end through the first route updating message;
and if the second route is larger than the first route, determining that the second route is not reported to the monitoring end through the first route updating message.
6. The method according to claim 1, wherein after sending the first route update packet to the monitoring end, the method further comprises:
when the monitoring mode is determined to be switched from the first monitoring mode to the second monitoring mode, recording the first traversal position as a traversal end position;
traversing a third number of routes by taking the root node as a starting point in the radix tree, and recording a third traversal position after traversing the third number of routes, wherein the third traversal position stores the third route;
if the third route is less than or equal to the first route, sending a first route revocation message to the monitoring terminal, wherein the first route revocation message comprises the third number of routes and the third route;
after receiving a fifth route update message sent by the BGP neighbor, judging the size relationship among the first route, the third route and a fourth route included in the fifth route update message;
and if the fourth route is less than or equal to the first route and the fourth route is less than or equal to the third route, updating the radix tree and not sending a route withdrawal message to the monitoring end any more.
7. The method of claim 6, further comprising:
and if the fourth route is smaller than the first route and larger than the third route, sending a second route canceling message to the monitoring end, wherein the second route canceling message comprises the fourth route, and updating the radix tree.
8. The method according to claim 7, wherein the determining a size relationship between fourth routes included in the first route, the third route, and the fifth route update packet specifically includes:
according to the radix tree in a dictionary sequence arrangement mode, respectively judging the size relationship between the fourth route and the first route and the size relationship between the fourth route and the third route;
the BGP neighbor route is stored in the radix tree according to the size of a destination IP address, and the route close to the root node comprises the small destination IP address.
9. The method of claim 8, wherein the first traversal position comprises a tree type of a radix tree in which the first traversal position is located; the first route comprises a first route prefix and a first mask; the fourth route comprises a fourth route prefix and a fourth mask;
the determining, by the radix tree arranged in a lexicographic order, a size relationship between the fourth route and the first route specifically includes:
if the route type of the fourth route is matched with the tree type of the radix tree, judging the sizes of the fourth route prefix and the first route prefix;
if the fourth route prefix is smaller than the first route prefix, determining that the fourth route is smaller than the first route, and if the fourth route prefix is larger than the first route prefix, determining that the fourth route is larger than the first route;
if the fourth routing prefix is the same as the first routing prefix, judging the sizes of the fourth mask and the first mask;
determining that the fourth route is smaller than the first route if the fourth mask is smaller than the first mask, and determining that the fourth route is larger than the first route if the fourth mask is larger than the first mask;
if the fourth mask is the same as the first mask, judging the position of the fourth route and the first route in a conflict chain;
if the position of the fourth route in the conflict chain is before or the same as the position of the first route in the conflict chain, determining that the fourth route is smaller than or equal to the first route, otherwise, determining that the fourth route is larger than the first route.
10. The method of claim 8, wherein the third traversal position comprises a tree type of a radix tree at which the third traversal position is located; the third route comprises a third route prefix and a third mask; the fourth route comprises a fourth route prefix and a fourth mask;
the determining, by the radix tree arranged in a lexicographic order, a magnitude relationship between the fourth route and the third route specifically includes:
if the route type of the fourth route is matched with the tree type of the radix tree, judging the sizes of the fourth route prefix and the third route prefix;
determining that the fourth route is smaller than the third route if the fourth route prefix is smaller than the third route prefix, and determining that the fourth route is larger than the third route if the fourth route prefix is larger than the third route prefix;
if the fourth routing prefix is the same as the third routing prefix, judging the sizes of the fourth mask and the third mask;
determining that the fourth route is less than the third route if the fourth mask is less than the third mask, and determining that the fourth route is greater than the third route if the fourth mask is greater than the third mask;
if the fourth mask code is the same as the third mask code, judging the positions of the fourth route and the third route in a collision chain;
if the position of the fourth route in the conflict chain is before or the same as the position of the third route in the conflict chain, determining that the fourth route is smaller than or equal to the third route, otherwise, determining that the fourth route is larger than the third route.
11. The method of claim 6, further comprising:
if the third route is larger than the first route, clearing the traversal ending position and the third traversal position;
traversing a fourth number of routes by taking the root node as a starting point in the radix tree, and recording a fourth traversal position after traversing the fourth number of routes, wherein a sixth route is stored in the fourth traversal position;
and sending a sixth route updating message to the monitoring end in the second monitoring mode, wherein the sixth route updating message comprises a fourth number of routes traversed before the fourth traversal position and the sixth route.
12. An identification device for route reporting is characterized in that the device is applied to a client, a radix tree is configured in the client, and routes of BGP neighbors are stored in the radix tree, and the device comprises: the device comprises a traversing unit, a sending unit, a first judging unit, a receiving unit and a determining unit;
the traversal unit is used for traversing a first number of routes in the radix tree by taking a root node as a starting point, and recording a first traversal position after traversing the first number of routes, wherein the first route is stored in the first traversal position;
a sending unit, configured to send a first route update packet to a monitoring end, where the first route update packet includes a first number of routes traversed before the first traversal position and the first route;
a first determining unit, configured to determine, after the receiving unit receives a second route update packet sent by the BGP neighbor, a size relationship between the first route and a second route included in the second route update packet;
a determining unit, configured to determine, according to a determination result, whether the second route has been reported to the monitoring end through the first route update packet;
the sending unit is further configured to send a third route update message to the monitoring terminal if the first route update message is reported to the monitoring terminal, where the third route update message includes the first route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210164049.5A CN114567589A (en) | 2022-02-22 | 2022-02-22 | Identification method and device for route reporting |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210164049.5A CN114567589A (en) | 2022-02-22 | 2022-02-22 | Identification method and device for route reporting |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114567589A true CN114567589A (en) | 2022-05-31 |
Family
ID=81713268
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210164049.5A Pending CN114567589A (en) | 2022-02-22 | 2022-02-22 | Identification method and device for route reporting |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114567589A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115277418A (en) * | 2022-07-31 | 2022-11-01 | 深圳市风云实业有限公司 | BGP network operation and maintenance system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6553002B1 (en) * | 1997-08-29 | 2003-04-22 | Ascend Communications, Inc. | Apparatus and method for routing data packets through a communications network |
| CN101848157A (en) * | 2010-05-14 | 2010-09-29 | 北京星网锐捷网络技术有限公司 | Method for controlling generation of routing update message and network equipment thereof |
| CN102291296A (en) * | 2011-08-04 | 2011-12-21 | 中兴通讯股份有限公司 | Updating method and system of routing table |
| US20120127997A1 (en) * | 2010-11-22 | 2012-05-24 | Force 10 Networks, Inc. | Method for optimizing a network prefix-list search |
| CN112565072A (en) * | 2020-11-02 | 2021-03-26 | 鹏城实验室 | Router compression method, router and storage medium |
| US20210258242A1 (en) * | 2020-02-18 | 2021-08-19 | Nokia Solutions And Networks Oy | Loop detection in multiprotocol label switching |
-
2022
- 2022-02-22 CN CN202210164049.5A patent/CN114567589A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6553002B1 (en) * | 1997-08-29 | 2003-04-22 | Ascend Communications, Inc. | Apparatus and method for routing data packets through a communications network |
| CN101848157A (en) * | 2010-05-14 | 2010-09-29 | 北京星网锐捷网络技术有限公司 | Method for controlling generation of routing update message and network equipment thereof |
| US20120127997A1 (en) * | 2010-11-22 | 2012-05-24 | Force 10 Networks, Inc. | Method for optimizing a network prefix-list search |
| CN102291296A (en) * | 2011-08-04 | 2011-12-21 | 中兴通讯股份有限公司 | Updating method and system of routing table |
| US20210258242A1 (en) * | 2020-02-18 | 2021-08-19 | Nokia Solutions And Networks Oy | Loop detection in multiprotocol label switching |
| CN112565072A (en) * | 2020-11-02 | 2021-03-26 | 鹏城实验室 | Router compression method, router and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 王云生: ""集中式路由体系结构下BFD协议软件的设计与实现"", 《中国优秀硕士学位论文全文数据库（信息科技I辑）》, 15 April 2014 (2014-04-15) * |
| 耿岚岚: ""软件定义移动自组织网络路由技术研究"", 《中国优秀硕士学位论文全文数据库（信息科技I辑）》, 15 January 2020 (2020-01-15) * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115277418A (en) * | 2022-07-31 | 2022-11-01 | 深圳市风云实业有限公司 | BGP network operation and maintenance system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7483972B2 (en) | Network security monitoring system | |
| US8989002B2 (en) | System and method for controlling threshold testing within a network | |
| US8432807B2 (en) | Network traffic analysis using a flow table | |
| US10693976B2 (en) | Method and system for dynamic discovery of service functions | |
| CN106059793B (en) | Routing information processing method and device based on graceful restart | |
| JP2011087302A (en) | Device and method for bgp route monitoring, and program | |
| US9167031B2 (en) | Distributed processing system and distributed processing method | |
| CN109495567B (en) | Static routing deployment method, device and system | |
| US9621512B2 (en) | Dynamic network action based on DHCP notification | |
| US20060168263A1 (en) | Monitoring telecommunication network elements | |
| US10757099B2 (en) | System and method for providing fraud control | |
| CN108418806A (en) | A kind of processing method and processing device of message | |
| CN109240796A (en) | Virtual machine information acquisition methods and device | |
| CN114567589A (en) | Identification method and device for route reporting | |
| CN113132227A (en) | Method, device, computer equipment and storage medium for updating routing information | |
| CN107528929B (en) | ARP (Address resolution protocol) entry processing method and device | |
| CN115242892B (en) | Stream identifier acquisition method, device, equipment and medium | |
| CA2987316A1 (en) | Local object instance discovery for metric collection on network elements | |
| JP2006270781A (en) | Resource management apparatus, resource management system and method | |
| CN108833282A (en) | Data forwarding method, system, device and SDN switch | |
| CN115277418A (en) | BGP network operation and maintenance system | |
| JP2009206845A (en) | Test system of communication network | |
| Cisco | Cisco Management Information Base (MIB) User Quick Reference Software Release 9.21 | |
| US9379943B2 (en) | Network service manager device using the COPS protocol to configure a virtual private network | |
| Cisco | Cisco Management Information Base (MIB) User Quick Reference Software Release 9.1 September 1992 |
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 |