CN113422722B - Routing processing method and device - Google Patents

Routing processing method and device Download PDF

Info

Publication number
CN113422722B
CN113422722B CN202110664704.9A CN202110664704A CN113422722B CN 113422722 B CN113422722 B CN 113422722B CN 202110664704 A CN202110664704 A CN 202110664704A CN 113422722 B CN113422722 B CN 113422722B
Authority
CN
China
Prior art keywords
route
restarting
neighbor
routing
version
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
CN202110664704.9A
Other languages
Chinese (zh)
Other versions
CN113422722A (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.)
Ruijie Networks Co Ltd
Original Assignee
Ruijie Networks 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 Ruijie Networks Co Ltd filed Critical Ruijie Networks Co Ltd
Priority to CN202110664704.9A priority Critical patent/CN113422722B/en
Publication of CN113422722A publication Critical patent/CN113422722A/en
Application granted granted Critical
Publication of CN113422722B publication Critical patent/CN113422722B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/28Routing or path finding of packets in data switching networks using route fault recovery
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Abstract

The application discloses a routing processing method and a device, wherein the method comprises the following steps: updating neighbor version identification of restarting equipment after detecting that communication connection with the restarting equipment is disconnected; if the reestablishment of the communication connection with the restarting equipment is detected, the restarting equipment sends a routing table of the restarting equipment to enable the restarting equipment to respectively announce a routing set related to each assisting equipment after carrying out routing calculation according to the received routing table sent by each assisting equipment; if a route set sent by restarting equipment is received, updating route version identifiers of all routes contained in the route set in a route table into neighbor version identifiers, and adding the routes which are not contained in the route table in the route set and the route version identifiers thereof into the route table, wherein the route version identifiers are neighbor version identifiers, and the source identifiers are restarting equipment; and deleting the route of which the source identifier is a restarting device and the route version identifier is not a neighbor version identifier in the route table. The scheme can save CPU resources of the auxiliary equipment.

Description

Routing processing method and device
Technical Field
The present application relates to the field of communications technologies, and in particular, to a routing processing method and apparatus.
Background
Currently, the establishment of a neighbor relation between two network devices is a technical means often used in network topology, and the two network devices may establish a neighbor relation based on border gateway protocol (Border Gateway Protocol, BGP), label distribution protocol (Label Distribution Protocol, LDP), and so on. When one of the two network devices establishing the neighbor relation needs to restart or perform active-standby switching, the network device becomes a restarting device, and the other network device becomes an assisting device, and the assisting device assists the restarting device to complete restarting or performing active-standby switching so as to ensure that forwarding service is not interrupted, wherein the restarting device can be provided with a plurality of assisting devices.
When restarting equipment needs restarting or main/standby switching, communication connection between the restarting equipment and each auxiliary equipment is disconnected; after each assisting device detects that the communication connection with the restarting device is disconnected, a set identifier, such as a state, is added in each route related to the restarting device in a routing table of the assisting device; after restarting or main/standby switching is completed, restarting the equipment to establish communication connection with each auxiliary equipment again; after each assisting device detects that communication connection is reestablished with the restarting device, the assisting device sends a routing table of the assisting device to the restarting device, and the last sent routing table is an ending mark; after detecting the end identifier of each routing table, the restarting device performs routing calculation again and sends the routing set related to each assisting device to the corresponding assisting device respectively, and the last sent routing set is the end identifier; after each assisting device receives the route set sent by the restarting device, the routes in the route set sent by the restarting device are compared with the own route table one by one, if the route exists in the route table, the setting identification of the route is deleted, and after the ending identification is detected, all routes still carrying the setting identification in the route table are deleted.
In the above routing processing method, after each assisting device detects that the communication connection with the restarting device is disconnected, a setting identifier is added to each route related to the restarting device in its own routing table, if the routing table of the assisting device includes huge routing entries, it is necessary to traverse all the routing entries and add the setting identifier to the corresponding route, which greatly consumes resources of a central processor (Central Processing Unit, CPU) of the assisting device, and is not beneficial to rapid convergence of the route.
Disclosure of Invention
The embodiment of the application provides a routing processing method and a routing processing device, which are used for solving the problems that CPU resources of auxiliary equipment are greatly consumed, and quick convergence of routing is not facilitated in the prior art.
According to an embodiment of the present application, a route processing method is provided, which is applied to at least one auxiliary device that establishes a neighbor relation with a restarting device, where the method includes:
after detecting that the communication connection with the restarting equipment is disconnected, updating the neighbor version identification of the restarting equipment;
if the reestablishment of the communication connection with the restarting device is detected, the restarting device sends a routing table of the restarting device to enable the restarting device to respectively announce a routing set related to each assisting device after carrying out routing calculation according to the received routing table sent by each assisting device;
if a route set sent by the restarting device is received, updating route version identifiers of all routes contained in the route set in the route table to be the neighbor version identifiers, and adding the routes which are not contained in the route table in the route set and the route version identifiers thereof to be the neighbor version identifiers and the source identifiers to be the restarting device in the route table;
and deleting the route of which the source identifier is the restarting device and the route version identifier is not the neighbor version identifier in the route table.
Specifically, updating the neighbor version identifier of the restarting device specifically includes:
and adding a set value to the neighbor version identification of the restarting equipment.
Specifically, if the routing set adopts a tree structure, updating a routing version identifier of each route included in the routing set in the routing table to be the neighbor version identifier, adding a route which is not included in the routing table in the routing set and the routing version identifier thereof as the neighbor version identifier, and adding a source identifier as the restarting device in the routing table, wherein the method specifically comprises the following steps:
acquiring nodes in the route set pointed by the current pointer;
if the node pointed by the current pointer is determined to be the route, searching the route pointed by the current pointer in the route table;
if the route pointed by the current pointer is found in the route table, updating the route version identifier of the route pointed by the current pointer in the route table to the neighbor version identifier, and executing the step of acquiring the node in the route set pointed by the current pointer after the current pointer is moved to the next node in the route set;
if the route pointed by the current pointer is not found in the routing table, adding the route pointed by the current pointer into the routing table, setting a route version identifier of the added route as the neighbor version identifier and a source identifier as the restarting equipment, and executing the step of acquiring the node in the routing set pointed by the current pointer after the current pointer is moved to the next node in the routing set.
Optionally, the method further comprises:
and if the node pointed by the current pointer is determined to be the end identifier, executing the step of deleting the route of which the source identifier is the restarting equipment and the route version identifier is not the neighbor version identifier in the route table.
According to an embodiment of the present application, there is also provided a routing processing apparatus, which is applied to at least one auxiliary device that establishes a neighbor relation with a restarting device, where the apparatus includes:
the first updating module is used for updating the neighbor version identification of the restarting equipment after detecting that the communication connection between the restarting equipment and the restarting equipment is disconnected;
the sending module is used for sending a routing table of the restarting equipment to the restarting equipment if the reestablishment of the communication connection with the restarting equipment is detected, so that the restarting equipment can respectively announce a routing set related to each assisting equipment after carrying out routing calculation according to the received routing table sent by each assisting equipment;
the second updating module is configured to update, if a route set sent by the restarting device is received, a route version identifier of each route included in the route set in the route table to the neighbor version identifier, and add, in the route table, a route which is not included in the route table in the route set and its route version identifier to the neighbor version identifier, and a source identifier to the restarting device;
and the deleting module is used for deleting the route of which the source identifier is the restarting equipment and the route version identifier is not the neighbor version identifier in the route table.
Specifically, the first updating module is configured to update a neighbor version identifier of the restarting device, and specifically is configured to:
and adding a set value to the neighbor version identification of the restarting equipment.
Specifically, if the routing set adopts a tree structure, the second updating module is configured to update, to the neighbor version identifier, a routing version identifier of each route included in the routing set in the routing table, and add, to the routing table, a route not included in the routing table in the routing set, and a routing version identifier thereof, to the neighbor version identifier, and a source identifier to the restarting device, where the second updating module is specifically configured to:
acquiring nodes in the route set pointed by the current pointer;
if the node pointed by the current pointer is determined to be the route, searching the route pointed by the current pointer in the route table;
if the route pointed by the current pointer is found in the routing table, adding the route pointed by the current pointer into the routing table, setting a route version identifier of the added route as the neighbor version identifier and a source identifier as the restarting device, updating the route version identifier of the route pointed by the current pointer in the routing table as the neighbor version identifier, moving the current pointer to the next node of the routing set, and executing the step of acquiring the node in the routing set pointed by the current pointer;
and if the route pointed by the current pointer is not found in the routing table, moving the current pointer to the next node in the routing set, and executing the step of acquiring the node in the routing set pointed by the current pointer.
Optionally, the second updating module is further configured to:
and if the node pointed by the current pointer is determined to be the end mark, turning to the deleting module.
According to an embodiment of the present application, there is further provided an electronic device including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete communication with each other through the communication bus;
a memory for storing a computer program;
and the processor is used for realizing the steps of the method when executing the program stored in the memory.
According to an embodiment of the present application, there is also provided a computer-readable storage medium having stored therein a computer program which, when executed by a processor, implements the above-mentioned method steps.
The application has the following beneficial effects:
the embodiment of the application provides a routing processing method and a routing processing device, wherein after the disconnection of communication connection with restarting equipment is detected, neighbor version identifiers of the restarting equipment are updated; if the reestablishment of the communication connection with the restarting device is detected, the restarting device sends a routing table of the restarting device to enable the restarting device to respectively announce a routing set related to each assisting device after carrying out routing calculation according to the received routing table sent by each assisting device; if a route set sent by the restarting device is received, updating route version identifiers of all routes contained in the route set in the route table to be the neighbor version identifiers, and adding the routes which are not contained in the route table in the route set and the route version identifiers thereof to be the neighbor version identifiers and the source identifiers to be the restarting device in the route table; and deleting the route of which the source identifier is the restarting device and the route version identifier is not the neighbor version identifier in the route table. In the scheme, after the auxiliary equipment detects that communication connection with the restarting equipment is disconnected, neighbor version identifiers of the restarting equipment are directly updated without adding set identifiers in routes related to the restarting equipment in a routing table of the auxiliary equipment, after a routing set sent by the restarting equipment is received, the route version identifiers of the routes contained in the routing set in the routing table are updated to the neighbor version identifiers, the routes which are not contained in the routing table and are contained in the routing set in the routing table are added in the routing table, the route version identifiers of the routes are the neighbor version identifiers, the source identifiers are the restarting equipment, and finally, the routes which are contained in the routing table and are not the neighbor version identifiers in the routing table are deleted, so that the update of the routing table of the auxiliary equipment can be realized.
Drawings
FIG. 1 is a flow chart of a routing processing method in an embodiment of the present application;
fig. 2 is a schematic structural diagram of a routing processing device according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an electronic device according to the present application.
Detailed Description
Aiming at the problems that CPU resources of auxiliary equipment are greatly consumed and rapid convergence of routes is not facilitated in the prior art, the embodiment of the application provides a route processing method which is applied to at least one auxiliary equipment which respectively establishes a neighbor relation with restarting equipment, the flow of the method is shown in a figure 1, and the specific implementation steps are as follows:
s11: and updating the neighbor version identification of the restarting device after detecting that the communication connection with the restarting device is disconnected.
Because the auxiliary equipment and the restarting equipment are in neighbor relation, the auxiliary equipment and the restarting equipment are in communication connection, the auxiliary equipment can detect whether the communication connection with the restarting equipment is normal or not from time to time, and if the communication connection with the restarting equipment is detected to be disconnected, the neighbor version identification of the restarting equipment can be updated. The neighbor version identifier of the restarting device can be set according to actual needs, and is used for indicating the times of establishing communication connection with the restarting device.
S12: if the reestablishment of the communication connection with the restarting device is detected, the restarting device is sent with a routing table of the restarting device, so that the restarting device can respectively announce the routing set related to each assisting device after carrying out routing calculation according to the received routing table sent by each assisting device.
S13: if the route set sent by the restarting device is received, the route version identifiers of all routes contained in the route set in the route table are updated to neighbor version identifiers, and the routes which are not contained in the route table in the route set and the route version identifiers thereof are added in the route table to be neighbor version identifiers and source identifiers to the restarting device.
In order to facilitate the processing of routes in the routing table, each route in the routing table of the assisting device is provided with a route version identifier, if a route set sent by the restarting device is received, the route version identifiers of all routes included in the route set in the routing table are updated to neighbor version identifiers, and routes which are not included in the routing table in the route set and the route version identifiers thereof are added in the routing table to be neighbor version identifiers and source identifiers are restarting devices.
Wherein the route version identification is to indicate the route source, i.e. which time a communication connection is established with the restarting device.
S14: the source identifier of the deleting routing table is a route which is restarted by the device and the route version identifier is not a neighbor version identifier.
The source identifier is a restarting device, and the route version identifier is either a neighbor version identifier route or a route before the communication connection between the source identifier and the restarting device is disconnected, and the restarting device is restarted or the active/standby switching is performed, so that the routes are useless routes and can be deleted directly.
In the scheme, after the auxiliary equipment detects that communication connection with the restarting equipment is disconnected, neighbor version identifiers of the restarting equipment are directly updated without adding set identifiers in routes related to the restarting equipment in a routing table of the auxiliary equipment, after a routing set sent by the restarting equipment is received, the route version identifiers of the routes contained in the routing set in the routing table are updated to the neighbor version identifiers, the routes which are not contained in the routing table and are contained in the routing set in the routing table are added in the routing table, the route version identifiers of the routes are the neighbor version identifiers, the source identifiers are the restarting equipment, and finally, the routes which are contained in the routing table and are not the neighbor version identifiers in the routing table are deleted, so that the update of the routing table of the auxiliary equipment can be realized.
Specifically, the implementation process of updating the neighbor version identifier of the restarting device in S11 specifically includes:
the neighbor version identification of the restarting device is increased by a set value.
Since the neighbor version identifier is used to indicate that a communication connection is established with the restarting device, the set value may be set according to actual needs, for example, but not limited to, 1, 2, 3, and so on.
Specifically, the route set may take different forms, and a specific form is listed below for explanation, if the route set adopts a tree structure, in S13, the route version identifier of each route included in the route set in the route table is updated to be a neighbor version identifier, and the route which is not included in the route table in the route set and the route version identifier thereof are added in the route table to be a neighbor version identifier, and the source identifier is a restarting device, and the implementation process specifically includes:
acquiring nodes in a route set pointed by a current pointer;
if the node pointed by the current pointer is determined to be the route, searching the route pointed by the current pointer in a routing table;
if the route pointed by the current pointer is found in the route table, updating the route version identifier of the route pointed by the current pointer in the route table into a neighbor version identifier, and executing the step of acquiring the node in the route set pointed by the current pointer after moving the current pointer to the next node in the route set;
if the route pointed by the current pointer is not found in the routing table, adding the route pointed by the current pointer into the routing table, setting the route version identifier of the added route as a neighbor version identifier and a source identifier as restarting equipment, and executing the step of acquiring the node in the route set pointed by the current pointer after the current pointer is moved to the next node in the route set.
Because the route set adopts the tree structure, each node of the tree structure can store a route, a current pointer can be preset, the node of the route set pointed by the current pointer is the node to be processed currently, if the node pointed by the current pointer is determined to be the route, the route pointed by the current pointer is searched in the route table, if the route is searched in the route table, the route version identifier of the route in the route table is updated to be the neighbor version identifier, and after the current pointer is moved to the next node of the route set, the route pointed by the current pointer is executed for the next node; if the route is not found in the routing table, adding the route pointed by the current pointer into the routing table, setting the route version identifier of the added route as a neighbor version identifier and a source identifier as restarting equipment, and then executing the process for the next node after the current pointer is moved to the next node of the route set.
Optionally, the method further comprises:
if the node pointed by the current pointer is determined to be the end identifier, the step of deleting the route of which the source identifier is the restarting device and the route version identifier is not the neighbor version identifier in the route table is executed.
When the restarting device sends the route set, an end identifier is carried at last to indicate that all routes are sent, so that if the assisting device determines that the node pointed by the current pointer is the end identifier, the assisting device indicates that the traversal of all routes of the route set is completed, and therefore the step of deleting the routes of which the source identifier is the restarting device and the route version identifier is not the neighbor version identifier in the route table can be executed, and all routes related to the restarting device are updated.
Based on the same inventive concept, an embodiment of the present application provides a route processing apparatus, which is applied to at least one auxiliary device that respectively establishes a neighbor relation with a restarting device, where the structure of the apparatus is shown in fig. 2, and includes:
a first updating module 21, configured to update a neighbor version identifier of the restarting device after detecting that the communication connection with the restarting device is disconnected;
the sending module 22 is configured to send a routing table of the sending module to the restarting device if the reestablishment of the communication connection with the restarting device is detected, so that the restarting device performs routing calculation according to the received routing tables sent by the assisting devices, and then respectively announces routing sets related to the assisting devices;
a second updating module 23, configured to update, if a routing set sent by the restarting device is received, routing version identifiers of routes included in the routing set in the routing table to neighbor version identifiers, and add, in the routing table, a route not included in the routing table in the routing set and its routing version identifier to be a neighbor version identifier, and a source identifier to the restarting device;
and the deleting module 24 is configured to delete the route whose source identifier is a restarting device and whose route version identifier is not a neighbor version identifier in the route table.
In the scheme, after the auxiliary equipment detects that communication connection with the restarting equipment is disconnected, neighbor version identifiers of the restarting equipment are directly updated without adding set identifiers in routes related to the restarting equipment in a routing table of the auxiliary equipment, after a routing set sent by the restarting equipment is received, the route version identifiers of the routes contained in the routing set in the routing table are updated to the neighbor version identifiers, the routes which are not contained in the routing table and are contained in the routing set in the routing table are added in the routing table, the route version identifiers of the routes are the neighbor version identifiers, the source identifiers are the restarting equipment, and finally, the routes which are contained in the routing table and are not the neighbor version identifiers in the routing table are deleted, so that the update of the routing table of the auxiliary equipment can be realized.
Specifically, the first updating module 21 is configured to update a neighbor version identifier of the restarting device, and specifically is configured to:
the neighbor version identification of the restarting device is increased by a set value.
Specifically, if the routing set adopts a tree structure, the second updating module 23 is configured to update the routing version identifier of each route included in the routing set in the routing table to a neighbor version identifier, add, in the routing table, a route not included in the routing table in the routing set and its routing version identifier to be a neighbor version identifier, and source identifier to be used in the restarting device, specifically:
acquiring nodes in a route set pointed by a current pointer;
if the node pointed by the current pointer is determined to be the route, searching the route pointed by the current pointer in a routing table;
if the route pointed by the current pointer is found in the route table, updating the route version identifier of the route pointed by the current pointer in the route table into a neighbor version identifier, and executing the step of acquiring the node in the route set pointed by the current pointer after moving the current pointer to the next node in the route set;
if the route pointed by the current pointer is not found in the routing table, adding the route pointed by the current pointer into the routing table, setting the route version identifier of the added route as a neighbor version identifier and a source identifier as restarting equipment, and executing the step of acquiring the node in the route set pointed by the current pointer after the current pointer is moved to the next node in the route set.
Optionally, the second updating module 23 is further configured to:
if it is determined that the node pointed to by the current pointer is the end identifier, then the process proceeds to the delete module 24.
The embodiment of the present application further provides an electronic device, please refer to fig. 3, which includes a processor 310, a communication interface 320, a memory 330 and a communication bus 340, wherein the processor 310, the communication interface 320 and the memory 330 complete communication with each other through the communication bus 340.
A memory 330 for storing a computer program;
the processor 310 is configured to implement the routing processing method according to any one of the above embodiments when executing the program stored in the memory 330.
The communication interface 320 is used for communication between the electronic device and other devices.
The Memory may include random access Memory (Random Access Memory, RAM) or may include Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the aforementioned processor.
The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU), a network processor (Network Processor, NP), etc.; but also digital signal processors (Digital Signal Processing, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.
In the scheme, after the auxiliary equipment detects that communication connection with the restarting equipment is disconnected, neighbor version identifiers of the restarting equipment are directly updated without adding set identifiers in routes related to the restarting equipment in a routing table of the auxiliary equipment, after a routing set sent by the restarting equipment is received, the route version identifiers of the routes contained in the routing set in the routing table are updated to the neighbor version identifiers, the routes which are not contained in the routing table and are contained in the routing set in the routing table are added in the routing table, the route version identifiers of the routes are the neighbor version identifiers, the source identifiers are the restarting equipment, and finally, the routes which are contained in the routing table and are not the neighbor version identifiers in the routing table are deleted, so that the update of the routing table of the auxiliary equipment can be realized.
Accordingly, an embodiment of the present application further provides a computer readable storage medium having instructions stored therein, which when executed on a computer, cause the computer to perform the routing processing method according to any one of the above embodiments.
In the scheme, after the auxiliary equipment detects that communication connection with the restarting equipment is disconnected, neighbor version identifiers of the restarting equipment are directly updated without adding set identifiers in routes related to the restarting equipment in a routing table of the auxiliary equipment, after a routing set sent by the restarting equipment is received, the route version identifiers of the routes contained in the routing set in the routing table are updated to the neighbor version identifiers, the routes which are not contained in the routing table and are contained in the routing set in the routing table are added in the routing table, the route version identifiers of the routes are the neighbor version identifiers, the source identifiers are the restarting equipment, and finally, the routes which are contained in the routing table and are not the neighbor version identifiers in the routing table are deleted, so that the update of the routing table of the auxiliary equipment can be realized.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While alternative embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following appended claims be interpreted as including alternative embodiments and all such alterations and modifications as fall within the scope of the application.
It will be apparent to those skilled in the art that various modifications and variations can be made to the embodiments of the present application without departing from the spirit or scope of the embodiments of the application. Thus, if such modifications and variations of the embodiments of the present application fall within the scope of the claims and the equivalents thereof, the present application is also intended to include such modifications and variations.

Claims (8)

1. A routing processing method applied to at least one auxiliary device respectively establishing a neighbor relation with a restarting device, the method comprising:
after detecting that the communication connection with the restarting equipment is disconnected, updating the neighbor version identification of the restarting equipment;
if the reestablishment of the communication connection with the restarting device is detected, the restarting device sends a routing table of the restarting device to enable the restarting device to respectively announce a routing set related to each assisting device after carrying out routing calculation according to the received routing table sent by each assisting device;
if a route set sent by the restarting device is received, updating route version identifiers of all routes contained in the route set in the route table to be the neighbor version identifiers, and adding the routes which are not contained in the route table in the route set and the route version identifiers thereof to be the neighbor version identifiers and the source identifiers to be the restarting device in the route table;
deleting a route of which the source identifier is the restarting device and the route version identifier is not the neighbor version identifier in the route table;
if the route set adopts a tree structure, updating route version identifiers of all routes contained in the route set in the route table to the neighbor version identifiers, and adding the routes which are not contained in the route table in the route set and the route version identifiers thereof as the neighbor version identifier source identifiers as the restarting devices and the source identifiers as the restarting devices in the route table, wherein the method specifically comprises the following steps:
acquiring nodes in the route set pointed by the current pointer;
if the node pointed by the current pointer is determined to be the route, searching the route pointed by the current pointer in the route table;
if the route pointed by the current pointer is found in the route table, updating the route version identifier of the route pointed by the current pointer in the route table to the neighbor version identifier, and executing the step of acquiring the node in the route set pointed by the current pointer after the current pointer is moved to the next node in the route set;
if the route pointed by the current pointer is not found in the routing table, adding the route pointed by the current pointer into the routing table, setting a route version identifier of the added route as the neighbor version identifier and a source identifier as the restarting equipment, and executing the step of acquiring the node in the routing set pointed by the current pointer after the current pointer is moved to the next node in the routing set.
2. The method of claim 1, wherein updating the neighbor version identification of the restarting device comprises:
and adding a set value to the neighbor version identification of the restarting equipment.
3. The method as recited in claim 1, further comprising:
and if the node pointed by the current pointer is determined to be the end identifier, executing the step of deleting the route of which the source identifier is the restarting equipment and the route version identifier is not the neighbor version identifier in the route table.
4. A route processing apparatus for use in at least one assisting device that establishes a neighbor relation with a restarting device, the apparatus comprising:
the first updating module is used for updating the neighbor version identification of the restarting equipment after detecting that the communication connection between the restarting equipment and the restarting equipment is disconnected;
the sending module is used for sending a routing table of the restarting equipment to the restarting equipment if the reestablishment of the communication connection with the restarting equipment is detected, so that the restarting equipment can respectively announce a routing set related to each assisting equipment after carrying out routing calculation according to the received routing table sent by each assisting equipment;
the second updating module is configured to update, if a route set sent by the restarting device is received, a route version identifier of each route included in the route set in the route table to the neighbor version identifier, and add, in the route table, a route which is not included in the route table in the route set and its route version identifier to the neighbor version identifier, and a source identifier to the restarting device;
the deleting module is used for deleting the route of which the source identifier is the restarting device and the route version identifier is not the neighbor version identifier in the route table;
if the routing set adopts a tree structure, the second updating module is configured to update the routing version identifier of each route included in the routing set in the routing table to the neighbor version identifier, add, in the routing table, a route which is not included in the routing table in the routing set and its routing version identifier to the neighbor version identifier, and source identifier to the restarting device, where the second updating module is specifically configured to:
acquiring nodes in the route set pointed by the current pointer;
if the node pointed by the current pointer is determined to be the route, searching the route pointed by the current pointer in the route table;
if the route pointed by the current pointer is found in the route table, updating the route version identifier of the route pointed by the current pointer in the route table to the neighbor version identifier, and executing the step of acquiring the node in the route set pointed by the current pointer after the current pointer is moved to the next node in the route set;
if the route pointed by the current pointer is not found in the routing table, adding the route pointed by the current pointer into the routing table, setting a route version identifier of the added route as the neighbor version identifier and a source identifier as the restarting equipment, and executing the step of acquiring the node in the routing set pointed by the current pointer after the current pointer is moved to the next node in the routing set.
5. The apparatus of claim 4, wherein the first updating module is configured to update a neighbor version identification of the restarting device, in particular:
and adding a set value to the neighbor version identification of the restarting equipment.
6. The apparatus of claim 4, wherein the second update module is further to:
and if the node pointed by the current pointer is determined to be the end mark, turning to the deleting module.
7. An electronic device, characterized in that the electronic device comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are in communication with each other through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of any of claims 1-3 when executing a program stored on a memory.
8. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored therein a computer program which, when executed by a processor, implements the method steps of any of claims 1-3.
CN202110664704.9A 2021-06-16 2021-06-16 Routing processing method and device Active CN113422722B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110664704.9A CN113422722B (en) 2021-06-16 2021-06-16 Routing processing method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110664704.9A CN113422722B (en) 2021-06-16 2021-06-16 Routing processing method and device

Publications (2)

Publication Number Publication Date
CN113422722A CN113422722A (en) 2021-09-21
CN113422722B true CN113422722B (en) 2023-10-24

Family

ID=77788627

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110664704.9A Active CN113422722B (en) 2021-06-16 2021-06-16 Routing processing method and device

Country Status (1)

Country Link
CN (1) CN113422722B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6704795B1 (en) * 1999-10-12 2004-03-09 Cisco Technology, Inc. Technique for reducing consumption of router resources after BGP restart
CN1731760A (en) * 2005-08-05 2006-02-08 武汉理工大学 Ad Hoc network routing method based on flooding mechanism
CN101035080A (en) * 2007-04-16 2007-09-12 杭州华为三康技术有限公司 Elegant restart method, appointed middle system, neighbor router and broadcast network
US7466661B1 (en) * 2003-09-22 2008-12-16 Cisco Technology, Inc. Method and apparatus for establishing adjacency for a restarting router during convergence
CN101345698A (en) * 2007-07-10 2009-01-14 中兴通讯股份有限公司 Synchronization method for grace reboot
CN102255798A (en) * 2011-06-15 2011-11-23 福建星网锐捷网络有限公司 Method and line card for synchronizing route forwarding table items
CN103825817A (en) * 2014-02-18 2014-05-28 杭州华三通信技术有限公司 Achieving method and device of ceaseless routing after routing protocol restarting
WO2016197817A1 (en) * 2016-01-04 2016-12-15 中兴通讯股份有限公司 Method and apparatus for exiting graceful restart

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7756017B2 (en) * 2006-09-08 2010-07-13 The Uwm Research Foundation, Inc. System and method for scheduling routing table calculation in link state routing protocols
US9800503B2 (en) * 2012-12-03 2017-10-24 Aruba Networks, Inc. Control plane protection for various tables using storm prevention entries

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6704795B1 (en) * 1999-10-12 2004-03-09 Cisco Technology, Inc. Technique for reducing consumption of router resources after BGP restart
US7466661B1 (en) * 2003-09-22 2008-12-16 Cisco Technology, Inc. Method and apparatus for establishing adjacency for a restarting router during convergence
CN1731760A (en) * 2005-08-05 2006-02-08 武汉理工大学 Ad Hoc network routing method based on flooding mechanism
CN101035080A (en) * 2007-04-16 2007-09-12 杭州华为三康技术有限公司 Elegant restart method, appointed middle system, neighbor router and broadcast network
CN101345698A (en) * 2007-07-10 2009-01-14 中兴通讯股份有限公司 Synchronization method for grace reboot
CN102255798A (en) * 2011-06-15 2011-11-23 福建星网锐捷网络有限公司 Method and line card for synchronizing route forwarding table items
CN103825817A (en) * 2014-02-18 2014-05-28 杭州华三通信技术有限公司 Achieving method and device of ceaseless routing after routing protocol restarting
WO2016197817A1 (en) * 2016-01-04 2016-12-15 中兴通讯股份有限公司 Method and apparatus for exiting graceful restart

Also Published As

Publication number Publication date
CN113422722A (en) 2021-09-21

Similar Documents

Publication Publication Date Title
WO2016050158A1 (en) Learning a mac address in vxlan
US8842577B2 (en) Enabling media access control address mobility in an ethernet virtual private network
US20170286158A1 (en) Migration Of Virtual Machines
CN111934969B (en) Maintenance method and device of MAC forwarding table
CN103916277A (en) Method and device for not interrupting forwarding service in rebooting process
CN109412925B (en) Forwarding table item updating method based on VTEP and VTEP
CN111654437B (en) Message forwarding method and device based on data center
CN113810511B (en) ARP table updating method and device
CN110233801B (en) Route updating method and device
CN109728932B (en) SDN setting method, controller, switch and computer readable storage medium
CN102916885B (en) MSTP-based (Multiple Spanning Tree Protocol) network topology convergence method, equipment and system
CN113422722B (en) Routing processing method and device
CN109189403B (en) Operating system OS batch installation method and device and network equipment
CN103595562A (en) Method and device for determining terminal topological link and server device
CN111800338B (en) Cross-AS EVPN route interaction method and device
CN111682968B (en) Network access management method and system for communication equipment
CN109787835B (en) Session backup method and device
CN105338127A (en) Media access control MAC address table updating method, switch and system
CN114422427B (en) Flow balancing method and device, electronic equipment and storage medium
CN112737957B (en) Flow table aging method and device
CN112637053B (en) Method and device for determining backup forwarding path of route
CN115167907A (en) Terminal equipment upgrading method, server, electronic equipment and storage medium
CN107707480B (en) Message forwarding method and device
CN104780138A (en) Transparent transmission method and device for STP (Spanning Tree Protocol)/RSTP (Rapid Spanning Tree Protocol) message in private redundancy protocol network
CN109361781B (en) Message forwarding method, device, server, system and storage medium

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