WO2014040409A1

WO2014040409A1 - Routing management method and node

Info

Publication number: WO2014040409A1
Application number: PCT/CN2013/073392
Authority: WO
Inventors: 王铁英
Original assignee: 华为技术有限公司
Priority date: 2012-09-14
Filing date: 2013-03-28
Publication date: 2014-03-20
Also published as: CN103685034B; CN103685034A

Abstract

The present invention relates to the technical field of communications, and provided are a routing management method and node. The routing management method includes: a first node transmitting an update request to a second node, and receiving the routing entry version information about the second node transmitted by the second node; the first node determining a routing entry with the local routing entry version information being inconsistent with the routing entry version information about the second node; and the first node transmitting the information about the inconsistent routing entry to the second node, so that the first node and the second node update respective routing entries according to the information about the inconsistent routing entry. By means of the present invention, any node can update routing information, which reduces the burden of node management, thereby increasing the system performance.

Description

Method and node for routing management This application claims the priority of the Chinese application filed on September 14, 2012, the application number is 201210341766.7, and the name of the invention is "route management method and node", the entire contents of which are incorporated herein by reference. In the application. Technical field

The present invention relates to the field of communications technologies, and in particular, to a method and a node for routing management.

Background technique

HBa se is a distributed, column-oriented open source database. The HBa se system can include: management nodes, regional nodes, and terminals. The management node can be used to monitor the status of the regional node, load balancing of the area, divide the routing interval, direct the terminal to the corresponding regional node, etc.; the regional node can be used to process the request (read, write, browse, etc.) of the terminal.

A routing table refers to a table stored on a router or other network device. The table can store paths to specific terminals. In some cases, there are some metrics associated with these paths.

In the HBa se system, the routing table in each regional node is maintained and updated by the management node, so that each regional node processes the request of the corresponding terminal according to the routing table, and performs data transmission.

In the process of implementing the foregoing route management, the inventor has found that at least the following problems exist in the prior art: Since the routing table in each node is maintained and updated by the management node, the burden on the management node is increased, and the management node cannot Perform other operations in a timely manner, reducing system performance. Summary of the invention

The embodiment of the invention provides a method and a node for routing management, which solves the problem that the management node cannot perform other operations in time and reduces the performance of the system.

In order to achieve the above object, embodiments of the present invention use the following technical solutions:

A method of route management, including:

The first node sends an update request to the second node, and receives routing entry version information of the second node sent by the second node;

The first node determines that the local routing entry version information and the routing information of the second node are not Consistent routing entries;

The first node transmits the information of the inconsistent routing entry to the second node, so that the first node and the second node update the respective routing entry based on the information of the inconsistent routing entry.

A node that includes:

a transmitter, configured to send an update request to the second node; and configured to send, to the second node, the information of the routing entry whose local routing entry version information is inconsistent with the routing entry version information of the second node received by the receiver, so as to be a node and a second node update respective routing entries according to the information of the inconsistent routing entries;

The receiver is configured to receive routing entry version information of the second node sent by the second node, and a processor, configured to determine the inconsistent routing entry.

The method and node for routing management provided by the embodiment of the present invention, after the foregoing method, the first node sends an update request to the second node, and receives routing entry version information of the second node sent by the second node; a routing entry whose local routing entry version information is inconsistent with the routing entry version information of the second node; the first node sends the information of the inconsistent routing entry to the second node, so that the first node and the second node are based on the inconsistent routing entry The information updates the respective routing entries. It not only relies on the management node to update the routing table of other nodes, but any node can update the routing table, which reduces the burden on the management node and increases the system performance.

DRAWINGS

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the description of the embodiments will be briefly described. It is obvious that the drawings in the following description are only some embodiments of the present invention. It will be apparent to those skilled in the art that other drawings may be obtained from these drawings without the inventive labor.

FIG. 1 is a schematic structural diagram of a system applied in this embodiment;

FIG. 2 is a flow chart of the processing of the heartbeat of the management node ManagerNode according to the embodiment; FIG. 3 is a flow chart of the processing request of the cluster node Clus terNode processing terminal according to the embodiment; FIG. 4 is a routing process in a routing interval Range according to the embodiment. FIG. 5 is a flowchart of a method for routing management according to an embodiment of the present invention; FIG. 6 is a flowchart of another method for route management according to the embodiment;

FIG. 7 is a schematic structural diagram of routing entries and routing entry version information provided by the embodiment; FIG. 8 is a flowchart of another method for routing management according to the embodiment;

FIG. 9 is a schematic structural diagram of a node according to an embodiment of the present disclosure.

detailed description

The technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.

In order to more clearly describe the following embodiments, first, a brief introduction will be made to the system architecture of the embodiment and the method of processing the processing request of the terminal.

As shown in Figure 1, the system can include: a ManagerNode, and at least one Clus terNode.

The ManagerNode is a management node of the system, which is used to maintain the heartbeat of each cluster node and the management node, and records the state of each regional node. According to these records, the ManagerNode determines whether each node is online or unreachable, wherein the unreachable may not be normal. The data is transmitted, but the nodes are not necessarily offline.

The Clus terNode is a cluster node that serves the terminal, and all requests will be routed to the corresponding Clus terNode for processing.

In Figure 1, Rack_l (node cluster name) and Rack_2 (node cluster name) are represented on the two node machines, and all nodes form a node cluster. A/B/C, 1/2/3 indicates the cluster nodes that are rejected on different machines. The network Par tition may cause all Clus terNodes and ManagerNodes in Rack_1, and all Clus terNodes in Rack-1. All nodes in Rack_2 are unreachable, but all C lus terNodes in Rack-2 maintain a normal connection with the ManagerNode.

The functions of the ManagerNode may include, but are not limited to, each Clus terNode needs to confirm to the ManageNode when a node is unreachable; each Clus terNode may periodically Send a heartbeat request (including the connection status with the ManagerNode) to the ManagerNode, so that the ManagerNode determines and records whether the ClusterNode is online or unreachable according to the heartbeat request;

The LivingNode (Online Node) list can be stored in the ManagerNode to record a list of online node information and a list of unreachable node information.

As shown in Figure 2, for the ManagerNode heartbeat processing flow chart, the specific steps may include:

201. The ClusterNode sends a heartbeat request to the ManagerNode.

202, the ManagerNode receives the heartbeat request sent by the ClusterNode, and records the timestamp of the ClusterNode in the LivingNode list; if it is the first heartbeat request, returns a response, where the response may include a LivingNode list recorded by the ManagerNode, and an access node identifier in the system. Information, so that the ClusterNode obtains routing table information from the access node; if the heartbeat request includes other nodes and the connection status of the ManagerNode is false (failed connection), a response is returned, which is used to modify the routing table according to the response; if the heartbeat request is not If the connection status is false, the port will not return.

203. The ClusterNode receives the foregoing response sent by the ManagerNode.

204. After receiving the response, the ClusterNode sets the connection state with the ManagerNode to True (successful connection or reachable). The ManagerNode receives the heartbeat request of the ClusterNode or other requests, records the status of the ClusterNode as online, and records the timestamp.

The ManagerNode passively determines that the cluster node is unreachable. That is, after receiving the unreachable report request sent by the ClusterNode, the ManagerNode determines that the reported heartbeat record (timestamp) of the unreachable node included in the unreachable report request is judged to be unreachable. Whether the node is dropped and returns information to the ClusterNode that sent the unreachable report request. The unreachable report request may also include, but is not limited to, identification information of the unreachable node.

As shown in FIG. 3, it is a logic diagram of routing processing in a Range, where any Range may include at least one Clus terNode, and each Clus terNode may be a Master or a Slave in any Range. (backup node). The Master contained in each Range is the same as the information stored in the Slave. The Master can handle write and read operation requests, and Slave can process read operation requests. If the processing request is not processed by the access node, the routing request is first routed to the Master of the Range key that is included in the routing request, and the master is unreachable, and the processing request is a write request. Return processing failure response; If the processing request is a read request, the processing request can be further routed to the Range's slave according to the routing table.

The routing information of all nodes can be recorded in the routing table. For example, the Master information and Slave information contained in each Range of the system can be recorded.

Each ClusterNode is used to process the request of the corresponding terminal. For example, one of the ClusterNodes is as follows. As shown in FIG. 4, the step of the ClusterNode processing the terminal request may include:

401. The access node receives a processing request sent by the terminal, where the processing request includes processing the request.

Key;

402, determining whether the range of the Key included in the processing request is the range in which the access node is located, if not, executing step 403; if yes, proceeding to step 404;

403. Obtain the Master information of the Range where the Key is located;

4031, determining whether the Master obtained in 403 is online; if yes, go to step 4032; if no, go to step 406;

4032. Send the processing request to the master for processing;

404, determining whether the connection between the access node and the ManagerNode is normal; if normal, go to 4041; if not, proceed to step 405;

4041. Process the processing request locally;

405. Determine whether it is a read request or other request; if it is a read request, turn to 4041;

406;

406. Return the response that failed to process, and the process ends.

Some embodiments are provided below to specifically illustrate the solution.

Embodiment 1

The embodiment provides a method for routing management. As shown in FIG. 5, the method may include the following steps: 501. The first node sends an update request to the second node, and receives routing entry version information of the second node sent by the second node. . 502. The first node determines a routing entry in which the local routing entry version information is inconsistent with the routing entry version information of the second node.

503. The first node sends the information of the inconsistent routing entry to the second node, so that the first node and the second node update the respective routing entries according to the information of the inconsistent routing entry.

After the foregoing method, the first node sends an update request to the second node, and receives routing entry version information of the second node sent by the second node; the first node determines the local routing entry version information and the routing entry version of the second node. The routing entry with inconsistent information; the first node sends the information of the inconsistent routing entry to the second node, so that the first node and the second node update the respective routing entry according to the information of the inconsistent routing entry. It not only relies on the management node to update the routing table of other nodes, but any node can update the routing table, which reduces the burden on the management node and increases the system performance.

Embodiment 2

As an improvement, this embodiment provides another method for route management, which is a further extension of the method shown in FIG. 5, wherein the information of the inconsistent routing entry includes the first routing entry and the corresponding number of the first routing entry. A routing entry version information, as shown in Figure 6, can include the following steps:

601. Determine whether the first node and the management node are unreachable. If it is reachable, step 602 is performed; if it is not reachable, the process ends.

If the connection is reachable, the connection between the first node and the management node is normal. If the connection is unreachable, the connection between the first node and the management node is abnormal.

The first node and the second node may be S lave or Mas ter in the same routing interval or in different routing intervals, and the following takes the first node and the second node as S lave or Mas ter in the same routing interval as an example. Description.

The routing entry may include, but is not limited to: a Range corresponding to the routing entry, a list of the Range nodes, and the list of nodes may include, but is not limited to, information of the s ter, and S lave information.

As an implementation manner of this embodiment, the routing table of the node may include, but is not limited to: a routing entry list, and a routing entry version information list, and the routing entry list may include at least one The routing entry, the routing entry version information list may include corresponding at least one routing entry version information.

The method for determining whether a node is unreachable is not limited in this embodiment, and may be set according to actual needs, and details are not described herein again.

602. The first node sends an update request to the second node, and receives routing entry version information of the second node sent by the second node.

The update request may be used for, but not limited to, indicating that the first node and the second node update the respective routing table to the latest routing table, and the latest routing table may include, but is not limited to, the latest routing entries in the first node and the second node. The latest routing entry version information, etc.

As an implementation manner of this embodiment, the triggering condition that the first node sends the update request to the second node may be: but not limited to: the first node actively triggers after updating the local routing table; or, the first node period The sex sends an update request to the second node.

The routing table included in the node may be changed according to the actual situation. In this case, the corresponding routing entries and routing entry version information in the routing table need to be updated synchronously. The version number of the routing entry version information may change after the update.

Further, as shown in FIG. 7, a list of information included in the routing entry, and a list of information included in the routing entry version information.

The routing entry records information about different routing entries of the current system, and is mainly used for querying, judging, and forwarding of request routing. Each routing entry may include Range information 71, Repl icaNodeLi st (node list) 72 records the Range The distribution of data in the cluster nodes, that is, the Mas ter information 73 and the S lave information 74 included in the routing entry (which may include but are not limited to: S lave_l (741), S lave_2 (742), etc.), each Repl In icaNodeLi st 72, there can be no two identical nodes, but the same node can be in different routing entries.

Range can represent the routing interval, as can be expressed as, but not limited to, ( 0x0000 , OxFFFF), etc. There is no coincident Range between each routing entry, that is, there is no intersection between each Range, and all the Ranges of Range are a complete set, usually Range can be used as identification information for distinguishing routing entries and routing entry version information; each Clus terNode receives the request, according to the request Key, determining the Range corresponding to the Key from the routing entry list, and obtaining the node in the Repl icaNodeLi st corresponding to the Range, which is processed by the Range corresponding to the Range.

The routing entry version information records the changes and status of the routing entries and also records the status of routing entries that have occurred in history. The routing entry version information is used to maintain the consistency of routing entries for each node in the system.

The routing entry version information may include: Range information 75, Range-Sta te (status information) 76 is used to describe the status of the corresponding routing entry, and may include but is not limited to three states: Add, De lete, Modify (modify).

The Range value 75 in the routing entry version information is the same as the Range value 71 in the corresponding routing entry. For example, the Range value in the routing entry 1 version information is the same as the Range value in routing entry 1.

In this embodiment, the state of the routing entry is not limited, and may be set according to actual needs, and details are not described herein again.

Range-Ver s ion (77) records the version number of each routing entry after the routing entry has changed. Normally, the initial value is set to 0, each pair of corresponding routing entries is modified, and the version number is monotonically changed.

For example, the version number can be added/subtracted to a preset value. In addition, the routing entry with the highest/minimum version number in the same routing entry may be the latest routing entry.

The preset value is not limited in this embodiment, and may be set according to actual needs. For example, it may be: 1, or 2, etc., and details are not described herein again.

Further, it may be, but is not limited to, determining whether the corresponding routing entry and routing entry version information between the first node and the second node are consistent according to the version number.

The following is an example of routing table changes:

If the slave in the routing entry does not obtain the corresponding feedback information after sending the message to the Mas ter for more than the preset time, the slave determines whether the Mas ter in the routing entry is unreachable. The specific judgment method may be Not limited to: S lave sends an unreachable report request to the Manager, and root According to the information fed back by the Manager, the judgment is made. If the slave is reachable to the Manager and the Mas ter is unreachable between the Manager and the Manager, then the S lave can be modified to the s ter in the routing entry. Therefore, the corresponding routing table in the S lave storage Routing entries also need to be modified accordingly. Moreover, the version number of the routing entry version information corresponding to the modified routing entry is incremented by one. In this case, the status of the routing entry that can be included in this information can be Modify.

As an implementation manner of this embodiment, after receiving the update request sent by the first node, the second node determines whether the routing entry version information of the first node is the same as the routing entry version information of the second node, if not, Then, the second node sends the routing entry version information of the second node to the first node; if the same, the process ends.

As an implementation manner of this embodiment, the method for determining, by the second node, whether the routing entry version information of the first node is the same as the routing entry version information of the second node may be, but not limited to: the second node calculation is used to describe the second a second content identifier of the routing item version information content of the node; and then comparing whether the first content identifier is the same as the second content identifier, where the first content identifier is calculated by the first node and sent to the second node for description The identifier of the routing entry version information content of the first node.

If the first content identifier is different from the second content identifier, the routing entry version information of the first node is different from the routing entry version information of the second node.

As an implementation manner of this embodiment, the first content identifier and the second content identifier may be, but not limited to, Hash_Va lue (a name of a certain value), and at this time, the method for calculating the first content identifier and the second content identifier The method may be: performing a hash processing on the routing entry version information of the first node and the routing entry version information of the second node, to obtain the first content identifier and the second content identifier.

603. The first node determines a routing entry whose local routing entry version information is inconsistent with the routing entry version information of the second node.

The method for determining the inconsistent routing entries is not limited in this embodiment, and may be set according to actual needs, and details are not described herein again.

For example, an inconsistent routing entry can be determined based on the version number, that is, the version number is inconsistent. The routing entry version information is obtained, and the routing entry corresponding to the inconsistent routing entry version information is obtained. Further, after modifying a routing entry in the routing table and the corresponding routing entry version information, if the version number of the routing entry version information is added to a preset value, the routing entry version information with the largest version number is The latest routing entry version information; if the version number is reduced by the preset value, the routing entry version information with the smallest version number is the latest routing entry version information. Inconsistent routing entries may also include, but are not limited to, routing entries corresponding to the latest routing entry version information in the first node and the second node.

For example, the routing entry version information with the highest version number is used as the latest routing entry version information as an example (the following examples are all taken as an example), and the routing table of the second node includes: routing entry 1 version information, routing The version 2 version information and the version number of the routing entry 3 version information may be: 1, 2, 5, and the routing table of the first node includes: routing entry 1 version information, routing entry 2 version information, routing entry 3 version information version The numbers can be: 1, 3, 3, then the latest routing table can contain: version number 2 routing entry 1 version information and its corresponding routing entry, version number 3 routing entry 1 version information and its corresponding Routing entry, routing entry with version number 5, version information, and its corresponding routing entry.

604. The first node sends the information of the inconsistent routing entry to the second node, so that the first node and the second node update the respective routing entries according to the information of the inconsistent routing entry.

Further, the information of the inconsistent routing entry may include the first routing entry and the first routing entry version information corresponding to the first routing entry, where the first routing entry includes a routing entry with a newer routing entry version in the first node, and the first routing The entry version information includes routing entry version information corresponding to the first routing entry.

At this time, as exemplified in step 603, the first routing entry may include: a routing entry with a version number of 1 a routing entry corresponding to the version information, a routing entry with a version number of 3, and a routing entry corresponding to the version information. The first routing entry version information may include: a routing entry with version number 2 1 version information, a routing entry with version number 3, and 2 version information.

605. The second node updates the routing entry of the second node and the corresponding routing entry version information according to the first routing entry and the first routing entry version information. As an implementation manner of this embodiment, the second node may update the routing entry of the second node that has the same identification information as the identifier information of the first routing entry to the first routing entry, and at the same time, identify the second node. The routing entry version information having the same information as the identification information of the first routing entry version information is updated to the first routing entry version information.

Specifically, the second node may update the routing entry 1 to the routing entry corresponding to the version information of the routing entry 1 with the version number 2; and may update the routing entry 2 to the routing entry corresponding to the routing entry 2 version information of version 3. .

In this embodiment, the identification information of the routing entry identifier information and the routing entry version information is not limited, and may be set according to actual needs. For example, it may be a Range, and details are not described herein again.

Embodiment 3

This embodiment provides another method for route management, which is a further extension of the method shown in FIG. 5, wherein the information of the inconsistent routing entry includes routing entry version information of the routing entry version in the second node.

It should be noted that the difference between the third embodiment and the second embodiment is as follows: the information included in the information of the inconsistent routing entries is different, so that the corresponding operations performed by the first node and the second node are different, and the third embodiment and the second embodiment are different. The information may be executed separately or in combination, that is, the information of the inconsistent routing entry may include: the routing entry version information of the newer routing entry version in the second node, the first routing entry, and the first corresponding to the first routing entry. At least one of the routing entry version information.

As shown in FIG. 8, the following steps may be included: 801. Determine whether the first node and the management node are unreachable. If it is reachable, step 702 is performed; if it is not reachable, the process ends.

802. The first node sends an update request to the second node, and receives routing entry version information of the second node sent by the second node.

803. The first node determines a routing entry whose local routing entry version information is inconsistent with the routing entry version information of the second node.

804. The first node sends the information of the inconsistent routing entry to the second node, so that the first node and the second node update the respective routing entries according to the information of the inconsistent routing entry.

Further, the information of the inconsistent routing entry includes the routing entry version information of the routing entry version in the second node, and indicates that the second node sends the second routing entry to the first node, where the second routing entry may be the second node. A routing entry corresponding to the routing entry version information of the newer routing entry version.

805. The first node receives a second routing entry sent by the second node.

806. The first node updates the local routing entry and the corresponding routing entry version information according to the second routing entry.

As an implementation manner of this embodiment, the first node may update the routing entry of the first node and the identification information and the identification information of the second routing entry to the second routing entry; and then, the routing entry from the second node The second routing entry version information corresponding to the second routing entry is obtained in the version information. The routing entry version information of the first node and the identification information of the second routing entry version information is updated to the second routing entry version information.

The specific implementation manners of the steps in this embodiment are similar to the implementation manners in the second embodiment, and details are not described herein again.

After the foregoing method, the first node sends an update request to the second node, and receives routing entry version information of the second node sent by the second node; the first node determines the local routing entry version information and the routing entry version of the second node. The routing entry with inconsistent information; the first node sends the information of the inconsistent routing entry to the second node, so that the first node and the second node update the respective routing entry according to the information of the inconsistent routing entry. So that not only rely on the management node for other nodes By updating the routing table, any node can update the routing table, which reduces the burden on the management node and increases system performance.

Embodiment 4

This embodiment provides a node, as shown in FIG. 9, which may include:

The transmitter 91 is configured to send an update request to the second node, and send, to the second node, the information of the routing entry whose local routing entry version information is inconsistent with the routing entry version information of the second node, so as to facilitate the first node and the second node. Update the respective routing strips η according to the information of the inconsistent routing entries,

The receiver 92 is configured to receive routing entry version information of the second node sent by the second node, and the processor 93 is configured to determine an inconsistent routing entry.

Further, the information of the inconsistent routing entry sent by the sender 91 includes a first routing entry, and the first routing entry includes a routing entry with a newer version of the routing entry in the first node.

Further, the information of the inconsistent routing entry sent by the sender 91 includes the routing entry version information of the newer routing entry version in the second node;

The receiver 92 is further configured to receive a second routing entry sent by the second node, where the second routing entry is a routing entry corresponding to the routing entry version information of the new routing entry version of the second node;

The processor 93 is further configured to update the local routing entry and the corresponding routing entry version information according to the second routing entry.

Further, the processor 93 is configured to determine whether the first node is reachable to the management node, and the transmitter 91 is further configured to: if the processor determines that the first node is reachable to the management node, The node sends an update request;

The receiver 92 is further configured to receive routing entry version information of the second node sent by the second node. Further, the routing entry version information includes the same routing interval information, status information, and version number as the corresponding routing entry.

After the above method, the sender sends an update request to the second node, and the receiver receives the routing entry version information of the second node sent by the second node; the processor determines the local routing entry version information and the routing entry version of the second node Inconsistent routing entries; senders will be inconsistent The information of the routing entry is sent to the second node, so that the first node and the second node update the respective routing entries according to the information of the inconsistent routing entries. It not only relies on the management node to update the routing table of other nodes, but any node can update the routing table, which reduces the burden on the management node and increases the system performance.

Through the description of the above embodiments, those skilled in the art can clearly understand that the present invention can be implemented by means of software plus necessary general hardware, and of course, by hardware, but in many cases, the former is a better implementation. . Based on such understanding, the technical solution of the present invention, which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a readable storage medium, such as a floppy disk of a computer. A hard disk or optical disk or the like includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the methods described in various embodiments of the present invention.

The above is only the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope of the present invention. It should be covered by the scope of the present invention. Therefore, the scope of the invention should be determined by the scope of the claims.

Claims

claims

1. A route management method, characterized by including:

The first node sends an update request to the second node, and receives the routing entry version information of the second node sent by the second node;

The first node determines the routing entry whose local routing entry version information is inconsistent with the routing entry version information of the second node;

The first node sends the information of the inconsistent routing entries to the second node, so that the first node and the second node update their respective routing entries based on the information of the inconsistent routing entries.

2. The route management method according to claim 1, characterized in that, the information of the inconsistent routing entries includes a first routing entry and first routing entry version information corresponding to the first routing entry, and the first routing entry The entries include routing entries with a newer routing entry version in the first node, and the first routing entry version information includes routing entry version information corresponding to the first routing entry;

The first node and the second node updating their respective routing entries based on the information of the inconsistent routing entries includes:

The second node updates the routing entry of the second node and the corresponding routing entry version information according to the first routing entry and the first routing entry version information.

3. The route management method according to claim 1 or 2, characterized in that the information of the inconsistent routing entries includes routing entry version information with a newer routing entry version in the second node; the method further includes:

The first node receives the second routing entry sent by the second node, and the second routing entry is a routing entry corresponding to the routing entry version information with a newer routing entry version in the second node; information.

4. The route management method according to any one of claims 1 to 3, characterized in that the first node sends an update request to the second node and receives the route of the second node sent by the second node. Before entering the entry version information, the method also includes:

Determine whether the first node and the management node are reachable; The first node sends an update request to the second node, and receives the routing entry version information of the second node sent by the second node as:

If the first node and the management node are reachable, the first node sends an update request to the second node, and receives the routing entry version information of the second node sent by the second node.

5. The route management method according to any one of claims 1 to 4, characterized in that the routing entry version information includes the same routing interval information, status information, and version number as the corresponding routing entry.

6. A node, characterized by: including:

The sender is used to send an update request to the second node; and is also used to send the information of the routing entry in which the local routing entry version information is inconsistent with the routing entry version information of the second node received by the receiver to the second node, so as to facilitate the second node. A node and a second node update their respective routing entries based on the information of the inconsistent routing entries;

The receiver is configured to receive the routing entry version information of the second node sent by the second node; the processor is configured to determine the inconsistent routing entry.

7. The node according to claim 6, wherein the information about the inconsistent routing entries sent by the sender includes a first routing entry and first routing entry version information corresponding to the first routing entry, The first routing entry includes a routing entry with a newer version of the routing entry in the first node, and the first routing entry version information includes routing entry version information corresponding to the first routing entry.

8. The node according to claim 6 or 7, characterized in that the information of the inconsistent routing entries sent by the sender includes routing entry version information with a newer routing entry version in the second node;

The receiver is also configured to receive a second routing entry sent by the second node, where the second routing entry is a routing entry corresponding to the routing entry version information with a newer routing entry version in the second node;

The processor is further configured to update a local routing entry and corresponding routing entry version information according to the second routing entry.

9. The node according to any one of claims 6 to 8, characterized in that the processor is also used to determine whether the first node and the management node are reachable; The sender is also configured to send an update request to the second node if the processor determines that the first node and the management node are reachable;

The receiver is also configured to receive the routing entry version information of the second node sent by the second node.

10. The node according to any one of claims 6 to 9, characterized in that the routing entry version information includes the same routing interval information, status information, and version number as the corresponding routing entry.