CN108881020B - Active trusted route management method and device and computer equipment thereof - Google Patents
Active trusted route management method and device and computer equipment thereof Download PDFInfo
- Publication number
- CN108881020B CN108881020B CN201710330968.4A CN201710330968A CN108881020B CN 108881020 B CN108881020 B CN 108881020B CN 201710330968 A CN201710330968 A CN 201710330968A CN 108881020 B CN108881020 B CN 108881020B
- Authority
- CN
- China
- Prior art keywords
- node
- source
- destination
- routing
- key value
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
- H04L45/748—Address table lookup; Address filtering using longest matching prefix
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a method and a device for active trusted route management and computer equipment thereof, belonging to the technical field of network communication. The method comprises the following steps: acquiring a destination key value in routing information and a source key value of a source node sending the routing information; according to a destination key value and a source key value in the same routing information, a mapping relation between a destination routing node and a source node sending the routing information is established; when an operation command of a target node is received, a target routing node or a source node matched with the target node is inquired in the obtained target key value and the source key value; and executing the operation command on the successfully matched destination routing node, the successfully matched source node, the source node mapped with the successfully matched destination routing node or the destination routing node mapped with the successfully matched source node. The invention can efficiently manage the credible route by establishing the mapping relation between the destination route node and the source node sending the route information.
Description
Technical Field
The present invention relates to the field of network communication technologies, and in particular, to a method and an apparatus for active trusted route management, and a computer device thereof.
Background
The current routing information generally comprises data of a destination address, a mask and a next hop, the data of the destination address and the mask form a key value of a prefix to uniquely determine a route, and the data of the destination address and the mask form prefix information for managing the route.
The trusted route is a route which can provide safety, reliability, controllability and controllability for a user and meet the service quality requirement of the user network for the user according to the expectation of the user and a network operator under any condition of the network, wherein the active trusted route is an important research direction. However, after adding new source information, how to effectively manage the route becomes a key point and a difficult point. At present, no better method is available for managing the active trusted route after the source information is added.
Disclosure of Invention
Based on this, it is necessary to provide a method and an apparatus for active trusted route management, and a computer device thereof, aiming at the problem that the active trusted route management is difficult.
A method of active trusted route management, the method comprising:
acquiring a destination key value in routing information and a source key value of a source node sending the routing information;
according to a destination key value and a source key value in the same routing information, a mapping relation between a destination routing node and a source node sending the routing information is established;
when an operation command of a target node is received, a target routing node or a source node matched with the target node is inquired in the obtained target key value and the source key value;
and executing the operation command on the successfully matched destination routing node, the successfully matched source node, the source node mapped with the successfully matched destination routing node or the destination routing node mapped with the successfully matched source node.
An apparatus of active trusted route management, the apparatus comprising:
a key value obtaining module, configured to obtain a destination key value in the routing information and a source key value of a source node that sends the routing information;
the mapping module is used for establishing a mapping relation between a destination routing node and a source node sending the routing information according to a destination key value and a source key value in the same routing information;
the query module is used for querying a destination routing node or a source node matched with the destination node in the obtained destination key value and the source key value when receiving an operation command of the destination node;
and the execution module is used for executing the operation command on the successfully matched destination routing node, the successfully matched source node, the source node mapped with the successfully matched destination routing node or the destination routing node mapped with the successfully matched source node.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the above-mentioned method of active trusted route management when executing the program.
According to the method, the device and the computer equipment for managing the active trusted route, the data of the source key value is added in the prefix information, and the mapping relation between the destination routing node and the source node sending the routing information is established according to the destination key value and the source key value in the same routing information, so that the source of the routing information can be known through the source key value, and the trusted route is efficiently managed according to the corresponding relation between the source node and the destination routing node.
Drawings
FIG. 1 is a flow diagram of a method of active trusted route management according to one embodiment of the present invention;
FIG. 2 is a data structure diagram of routing information according to one embodiment of the present invention;
FIG. 3 is a diagram illustrating a mapping relationship between a destination routing node and a source node according to an embodiment of the present invention;
FIG. 4 is a flow diagram of a method of active trusted route management according to another embodiment of the present invention;
FIG. 5 is a block diagram of an apparatus for active trusted route management according to one embodiment of the present invention;
fig. 6 is a block diagram of an apparatus for active trusted route management according to another embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Fig. 1 is a flowchart of a method for managing an active trusted route according to an embodiment of the present invention, in which a trusted route is distinguished from a normal route and has a trust identifier, and the trust identifier determines that the trusted route can be regarded as a sending object of an operation or an obtaining object of an operation target in some specific operation commands, for example, as a forwarding object of some routing information. When receiving the routing information sent by the credible route with the credibility mark, the routing information can not be treated as ordinary numerical information. A method of active trusted route management provided in an embodiment according to the present invention is shown in fig. 1 and includes the following steps S110, S120, S130 and S140.
S110, obtaining a destination key value in the routing information and a source key value of a source node sending the routing information.
The destination key value of the routing information and the source key value of the source node sending the routing information may be stored in the prefix information of the routing information, or may be stored in the data portion of the routing information in an agreed format. The source key value represents the position data of the source node sending the routing information, and the destination key value represents the position data of the destination routing node to be sent by the routing information.
Fig. 2 is a schematic diagram illustrating a data structure of routing information according to an embodiment of the present invention, where in this step, according to an example of this embodiment, the key value in the prefix information includes a destination key value and a source key value, and according to an example of this embodiment, as shown in fig. 2, the destination key value includes a destination address and a destination mask of a destination route, and the source key value includes a source address and a source mask of a source route that sends the routing information.
S120, according to a destination key value and a source key value in the same routing information, a mapping relation between a destination routing node and a source node sending the routing information is established.
According to an example of the embodiment, the expression form of the mapping relationship is various, including but not limited to, a table, a tree, and the like. Fig. 3 is a schematic diagram of a mapping relationship between a destination routing node and a source node according to an embodiment of the present invention, and as shown in fig. 3, the mapping relationship between the routing node and the source node is presented in a tree form, where a tree node (circle) stores a key value, and a chain node (square) hung below the tree node stores a corresponding relationship, according to an example of the present embodiment, for example, there are multiple routes, where destination addresses and masks are the same, but sources are different, such that in a case, there is only one corresponding tree node in the routing tree, but there are multiple chain nodes in a chain hung below the tree, which is the same for a source information tree. The corresponding square frame under the destination routing node stores a source node pointer source, a chain head pointer head and a next chain link point pointer next, and the corresponding square frame under the source node (namely the chain node hung under the source node) stores a destination routing node pointer prefix, a next chain link point pointer next and a chain head pointer head.
And S130, when receiving an operation command of the target node, inquiring a target routing node or a source node matched with the target node in the obtained target key value and the source key value.
According to an example of this embodiment, the operation command includes, but is not limited to, a search of the target node, an addition of the target node, and a deletion of the target node. The determination of the target node can be a successfully matched destination routing node, a successfully matched source node, a source node mapped with the successfully matched destination routing node or a successfully matched source node, and the specific selection is determined according to different operation commands.
In this step, the matching manner includes, but is not limited to, longest match or exact match, where the exact match determines, for example, whether the value class information of the target node and the value class information of the matching object are equal (i.e., completely consistent), and if equal, it indicates that the matching is successful, otherwise, it is determined that the matching is not possible. The following illustrates the longest mask match with respect to the longest match:
these two addresses "192.168.20.16/28 in the routing table; 192.168.0.0/16 "when address 192.168.20.19 is looked up, both entries" match ". That is, both entries contain the address to be looked up. In this case, the mask's longest route is 192.168.20.16/28 because its subnet mask (/28) is longer than the masks (/16) of the other entries, making it more explicit.
S140, the operation command is executed on the successfully matched destination routing node, the successfully matched source node, the source node mapped with the successfully matched destination routing node or the destination routing node mapped with the successfully matched source node.
In this step, according to one example of the present embodiment, for example: the method comprises the steps of carrying out new construction operation on a successfully matched destination routing node, carrying out new construction operation on a source node mapped with the successfully matched destination routing node, carrying out deletion operation on the successfully matched source node, carrying out deletion operation on the destination routing node mapped with the successfully matched source node, inquiring the source node mapped with the successfully matched destination routing node according to the successfully matched destination routing node or inquiring the destination routing node mapped with the successfully matched source node according to the successfully matched source node, inquiring all source nodes with the same source as the destination routing node according to the successfully matched destination routing node, and the like.
According to one example of the present embodiment, the matching manner includes, but is not limited to, longest match or exact match.
According to the implementation, the data of the source key value is added in the prefix information, and the mapping relation between the destination routing node and the source node sending the routing information is established according to the destination key value and the source key value in the same routing information, so that the source of the routing information can be known through the source key value, and the trusted routing is efficiently managed according to the corresponding relation between the source node and the destination routing node.
Fig. 4 is a flowchart of a method for active trusted route management according to another embodiment of the present invention, and the method for active trusted route management according to another embodiment of the present invention further includes step S121 on the basis of the steps S110, S120, S130, and S140 described above.
S121, establishing source nodes with the same source key value but different mapped destination routing nodes as a same source information chain, wherein pointers pointing to different destination routing nodes are stored in the source nodes of the same source information chain.
In this embodiment, source nodes with the same source of routing information but different destination routes are gathered together, as shown in fig. 3, in a source tree formed by homologous information chains, the source nodes on the same branched chain represent that the source nodes have the same source, and the source nodes on different branched chains in the source tree have different sources, wherein the up-down order of each branched chain can be determined according to the newly-built time sequence of the chain, and the sequence of the source nodes on the same branched chain can also be uniquely determined by the time sequence of the newly-built source nodes. The source node stores the pointer of the destination routing node, i.e. the source node records the address of the destination routing node. The source nodes with the same source of the routing information but different destination routes are converged into a homologous information chain, so that a user can conveniently search the routes with the same source of the routing information, and the management and the maintenance are facilitated.
According to the method for managing the active trusted route of the present embodiment, on the basis of the steps S110, S120, S121, S122, S130 and S140, the operation command includes finding a source route, and the method further includes:
when the matching result of the target node is a source node or a source node mapped with a target routing node successfully matched is inquired, inquiring a homologous information chain containing the matched source node according to a source key value of the source node;
inquiring a pointer which is stored in each source node in the homologous information chain and points to a destination routing node;
and inquiring the route pointed by the pointer pointing to the destination routing node.
According to an example of this embodiment, in the above three steps, each source node stores a pointer pointing to a destination routing node, and each pointer points to a route uniquely, so that a link point of the source node can trace back to a corresponding destination routing node, in the source information tree in fig. 3, a solid black circle represents a source node, a square below the circle represents a homologous link node, according to a homologous information chain of source nodes having the same source key value but different mapped destination routing nodes, a target node can be matched with the source node, or the target routing node can be matched with the destination routing node first, then the source node mapped with the destination routing node that is successfully matched is queried, and a homologous information chain of the source node is found, where a route corresponding to each source node on the homologous information chain is a route to be found.
The scenario of accessing all the same source trusted routes according to the specified source information according to the present embodiment is processed as follows:
1) searching a source information tree according to the specified source information, finding a corresponding node according to a specified matching mode (longest matching or accurate matching), and directly returning if the node corresponding to the source information cannot be matched;
2) judging whether a chain for storing a routing node pointing to the source information node is empty or not on the found source information tree node, and if the chain is empty, directly returning;
3) and traversing the nodes in the chain, finding the corresponding routing nodes according to the pointers in the nodes, and performing specified access operation until the tail of the chain.
A method for active trusted route management according to the present embodiment, on the basis of including the above steps S110, S120, S130 and S140, the method further includes:
and creating a routing tree comprising the destination routing node according to the prefix information comprising the destination key value, wherein the destination routing node of the routing tree stores the destination key value and/or the source key value, the routing tree is used for positioning to the routing node according to the destination address and the mask, and then confirming whether the source address is matched with the source address through traversing the source information chain hung below the routing node and through a source pointer in the chain node to the source tree.
In another example of this embodiment, source nodes with the same source but different destination routes of the routing information are aggregated together, as shown in fig. 3, in a source tree composed of homologous information chains, source nodes on the same branch chain indicate that the source nodes have the same source.
The routing tree can be determined according to the next hop data contained in the prefix information of the routing information, and because the routing information of different tasks has different trends, the next hop data is different, and the corresponding routing trees are different.
According to an example of this embodiment, the operation command includes a search for the source node according to prefix information, and the method includes (1) to (4):
(1) when receiving input prefix information, acquiring a target key value in the prefix information;
(2) and querying a routing tree according to the input prefix information. According to an example of this embodiment, the routing tree in this step has a corresponding relationship with the task identifier in the prefix information, and generally speaking, routing nodes traversed by the routing information under one task series have a correlation, so the routing tree can be created and queried by using the prefix information;
(3) and according to the obtained destination key value, searching a destination routing node of the destination key value matched with the obtained destination key value in the searched routing tree. According to an example of this embodiment, the query method, for example, traverses the routing tree, matches each traversed destination routing node, and queries the destination routing node of the destination key value that matches the obtained destination key value.
(4) And inquiring the source node mapped with the destination routing node.
The scenario of searching for an active trusted route according to the present embodiment is processed as follows:
1) searching a routing tree according to the prefix information, finding a corresponding node according to a specified matching mode (longest matching or accurate matching), and returning to null if no node corresponding to the prefix information exists;
2) judging whether a chain for storing the source information node is empty on the found routing tree node, and returning to the empty state if the chain is empty;
3) and traversing the nodes in the chain, comparing the pointed source information with the source information in the route searched this time according to a specified matching mode (longest matching or precise matching), and returning to null if the pointed source information cannot be matched with the source information in the route searched this time.
According to another embodiment of the present invention, the method for active trusted route management, where the operation command includes newly creating the source node, further includes, on the basis of the steps S110, S120, S130 and S140, the following steps:
creating a routing tree comprising the destination routing node according to the prefix information comprising the destination key, wherein the destination routing node of the routing tree stores the destination key and/or the source key;
when receiving input prefix information, acquiring a destination key value and a source key value in the prefix information;
inquiring a routing tree according to the input prefix information, and when the routing tree corresponding to the prefix information cannot be inquired in the existing routing tree, establishing a routing tree corresponding to the prefix information;
and when the routing tree has a destination key value matched with the obtained destination key value, obtaining a destination routing node corresponding to the matched destination key value, otherwise, newly building a destination routing node containing the destination key value on the inquired/newly built routing tree.
When the field used for storing the source key assignment on the obtained/newly-built destination routing node is empty, a homologous information chain containing a pointer pointing to the obtained/newly-built destination routing node is created, otherwise, the source key assignment of the obtained/newly-built routing node is inquired;
when the source key value in the input prefix information is not matched with the inquired source key value, traversing the inquired routing tree, and inquiring whether the source key values of other destination routing nodes on the routing tree can be matched with the source key value in the input prefix information;
when the source key value in the input prefix information can not be matched with the source key value in the traversed routing tree, a destination routing node containing the input source key value is newly built in the queried routing tree, a source information chain containing the source node of the input source key value is created, and a mapping relation between the newly-built destination routing node and the newly-built source node is created.
A scenario for adding an active trusted route according to an example of the present embodiment is processed as follows:
1) searching a routing tree according to the prefix information, finding out a corresponding node according to an accurate matching mode, and if the node corresponding to the prefix information does not exist, building a new node;
2) judging whether a chain for storing the source information node is empty or not on the found or newly-built routing tree node, and if so, inserting a new node into the chain;
3) traversing the nodes in the chain, comparing the source information pointed by the nodes with the source information in the newly added route, if the nodes cannot be matched, inserting new nodes into the chain and the source information tree, and establishing a corresponding relation;
4) and updating the route on the found or newly-built node by using the information of the active credible route to be newly added.
A scenario for deleting an active trusted route according to another example of the present embodiment is processed as follows:
(1) searching a routing tree according to the prefix information, finding out a corresponding node according to an accurate matching mode, and directly returning if no node corresponding to the prefix information exists;
(2) judging whether a chain for storing the source information node is empty on the found routing tree node, and if the chain is empty, directly returning;
(3) traversing nodes in the chain, comparing the pointed source information with the source information in the route to be deleted according to an accurate matching mode, and if the pointed source information and the source information cannot be matched, directly returning;
(4) removing the corresponding relation between the nodes in the chain and the nodes in the source information tree pointed by the nodes;
(5) deleting the nodes in the chain and the corresponding active entries; and if the chain for storing the source information node under the routing tree node is empty after deletion, deleting the routing tree node.
Since the identity of the route sending the routing information cannot be known according to the current routing information content, and the computer and the user cannot judge the reliability of the source route, the concept of the active trusted route is proposed and studied by the method of the embodiment.
Fig. 5 is a block diagram of an apparatus for active trusted route management according to an embodiment of the present invention, and the apparatus 10 for active trusted route management according to an embodiment of the present invention includes:
a key value obtaining module 11, configured to obtain a destination key value in the routing information and a source key value of a source node that sends the routing information;
the mapping module 12 is configured to create a mapping relationship between a destination routing node and a source node that sends the routing information according to a destination key value and a source key value in the same routing information;
the query module 13 is configured to query, when receiving an operation command of a target node, a target routing node or a source node that matches the target node in the obtained target key value and source key value;
and the executing module 14 is configured to execute the operation command on the successfully matched destination routing node, the successfully matched source node, the source node mapped to the successfully matched destination routing node, or the destination routing node mapped to the successfully matched source node.
Fig. 6 is a block diagram of an apparatus for active trusted route management according to another embodiment of the present invention, and further optionally, as shown in fig. 6, the apparatus further includes:
and a homologous information chain creating module 15, configured to create a homologous information chain from source nodes with the same source key value but different mapped destination routing nodes, where pointers pointing to different destination routing nodes are stored in the source nodes of the homologous information chain.
Optionally, the apparatus further comprises:
and the routing tree creating module is used for creating a routing tree comprising the destination routing node according to the prefix information comprising the destination key value, and the destination routing node of the routing tree stores the destination key value and/or the source key value.
The homologous information chain query module is used for querying a homologous information chain containing the matched source node according to a source key value of the source node when the result matched with the target node is the source node or the source node mapped by the target routing node matched with the target node is queried;
the destination key value query module is used for querying a pointer which is stored in each source node in the homologous information chain and points to a destination routing node;
and the route query module is used for querying the route pointed by the pointer pointing to the destination route node.
Optionally, the apparatus further comprises:
the destination key value acquisition module is used for acquiring a destination key value in the prefix information when the input prefix information is received;
a routing tree query module for querying the routing tree according to the input prefix information;
the routing node matching module is used for searching a destination routing node of a destination key value matched with the obtained destination key value in the searched routing tree according to the obtained destination key value;
and the source node query module is used for querying the source node mapped with the destination routing node.
Optionally, the apparatus further comprises:
the key value acquisition module is used for acquiring a destination key value and a source key value in prefix information when the input prefix information is received;
a routing tree query module for querying the routing tree according to the input prefix information;
and the node creating module is used for acquiring a destination routing node corresponding to the matched destination key value when the destination key value matched with the acquired destination key value exists on the routing tree, and otherwise, creating a destination routing node containing the destination key value.
A source key value query module, configured to create a homologous information chain including a pointer pointing to the obtained/newly-created destination routing node when a field used for storing a source key value on the obtained/newly-created destination routing node is empty, and otherwise, query the source key value of the obtained/newly-created routing node;
a routing tree traversal module, configured to traverse the queried routing tree when a source key value in the input prefix information does not match a queried source key value;
the node creating module is further configured to newly create a destination routing node including the input source key value in the queried routing tree, create a homologous information chain including the source node of the input source key value, and create a mapping relationship between the newly created destination routing node and the newly created source node, when neither the source key value in the input prefix information nor the source key value in the traversed routing tree can be matched.
According to another embodiment of the present invention, a computer device is provided, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor executes the computer program to implement the method for active trusted route management as described above.
In this embodiment, by adding a new source information tree in addition to the current routing tree using the prefix as the key value and maintaining the reference relationship between the two to organize and manage the active routing information, effective management of the active trusted route can be achieved, the use of the active trusted route is facilitated, and an effective new method is provided for maintenance of the active trusted route.
It will be understood by those skilled in the art that all or part of the processes in the methods of the embodiments described above may be implemented by hardware related to instructions of a computer program, which may be stored in a computer readable storage medium, for example, in the storage medium of a computer system, and executed by at least one processor in the computer system, so as to implement the processes of the embodiments including the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (9)
1. A method of active trusted route management, the method comprising:
acquiring a destination key value in routing information and a source key value of a source node sending the routing information;
according to a destination key value and a source key value in the same routing information, establishing a mapping relation between a destination routing node and a source node sending the routing information;
when an operation command of a target node is received, a target routing node or a source node matched with the target node is inquired in an obtained target key value and a source key value;
executing the operation command on the successfully matched destination routing node, the successfully matched source node, the source node mapped with the successfully matched destination routing node or the destination routing node mapped with the successfully matched source node;
wherein the operation command comprises searching a same source route; the method further comprises the following steps:
when the matching result of the target node is a source node or a source node mapped by a target routing node matched and matched with the target node is inquired, inquiring a homologous information chain containing the matched source node according to a source key value of the source node;
querying a pointer which is stored in each source node in the homologous information chain and points to the destination routing node;
and inquiring the route pointed by the pointer pointing to the destination routing node.
2. The method of claim 1, further comprising:
and establishing source nodes with the same source key value but different mapped destination routing nodes as a homologous information chain, wherein pointers pointing to different destination routing nodes are stored in the source nodes of the homologous information chain.
3. The method of claim 1, further comprising:
and creating a routing tree comprising the destination routing node according to the prefix information comprising the destination key, wherein the destination key and/or the source key are stored in the destination routing node of the routing tree.
4. The method of claim 3, wherein the operation command comprises searching a source node according to prefix information; the method comprises the following steps:
when receiving input prefix information, acquiring a target key value in the prefix information;
inquiring a routing tree according to the input prefix information;
according to the obtained target key assignment, searching a target routing node of the target key assignment matched with the obtained target key assignment in the searched routing tree;
and inquiring the source node mapped with the destination routing node.
5. The method of claim 3, wherein the operation command comprises newly creating the source node; the method further comprises the following steps:
when receiving input prefix information, acquiring a destination key value and a source key value in the prefix information;
inquiring a routing tree according to the input prefix information;
and when a destination key value matched with the obtained destination key value exists on the routing tree, obtaining a destination routing node corresponding to the matched destination key value, otherwise, newly building a destination routing node containing the destination key value.
6. The method of claim 5, further comprising:
when a field used for storing a source key value on the obtained/newly-built destination routing node is empty, creating a homologous information chain containing a pointer pointing to the obtained/newly-built destination routing node, and otherwise, inquiring the source key value of the obtained/newly-built routing node;
when the source key value in the input prefix information is not matched with the source key value of the query, traversing the queried routing tree;
when the source key value in the input prefix information can not be matched with the source key value in the traversed routing tree, a destination routing node containing the input source key value is newly built in the queried routing tree, a source information chain containing the source node of the input source key value is created, and a mapping relation between the newly-built destination routing node and the newly-built source node is created.
7. An apparatus for active trusted route management, the apparatus comprising:
a key value obtaining module, configured to obtain a destination key value in routing information and a source key value of a source node that sends the routing information;
the mapping module is used for establishing a mapping relation between a destination routing node and a source node sending the routing information according to a destination key value and a source key value in the same routing information;
the query module is used for querying a destination routing node or a source node matched with the destination node in the obtained destination key value and the source key value when receiving an operation command of the destination node;
the execution module is used for executing the operation command on the successfully matched destination routing node, the successfully matched source node, the source node mapped with the successfully matched destination routing node or the successfully matched source node;
wherein the operation command comprises searching a same source route; the device further comprises:
when the matching result of the target node is a source node or a source node mapped by a target routing node matched and matched with the target node is inquired, inquiring a homologous information chain containing the matched source node according to a source key value of the source node;
querying a pointer which is stored in each source node in the homologous information chain and points to the destination routing node;
and inquiring the route pointed by the pointer pointing to the destination routing node.
8. The apparatus of claim 7, further comprising:
and the homologous information chain creating module is used for creating source nodes with the same source key value but different mapped destination routing nodes into the homologous information chain, and pointers pointing to different destination routing nodes are stored in the source nodes of the homologous information chain.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method of active trusted route management according to any one of claims 1 to 6 when executing the program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710330968.4A CN108881020B (en) | 2017-05-11 | 2017-05-11 | Active trusted route management method and device and computer equipment thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710330968.4A CN108881020B (en) | 2017-05-11 | 2017-05-11 | Active trusted route management method and device and computer equipment thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108881020A CN108881020A (en) | 2018-11-23 |
| CN108881020B true CN108881020B (en) | 2020-11-06 |
Family
ID=64319502
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710330968.4A Active CN108881020B (en) | 2017-05-11 | 2017-05-11 | Active trusted route management method and device and computer equipment thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108881020B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112187640B (en) * | 2020-09-08 | 2022-02-18 | 烽火通信科技股份有限公司 | L3VPN service point-to-point route based query method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101635680A (en) * | 2009-08-07 | 2010-01-27 | 中国电信股份有限公司 | Service routing method and service routing system |
| CN102025600A (en) * | 2009-09-17 | 2011-04-20 | 中兴通讯股份有限公司 | Method, system and router for transmitting and receiving data |
| CN102215160A (en) * | 2010-04-07 | 2011-10-12 | 中兴通讯股份有限公司 | Data communication system and method |
| EP2434707A1 (en) * | 2010-09-23 | 2012-03-28 | Alcatel Lucent | Method and system for optimising routing between two network nodes, at least one of which is mobile |
| CN104980354A (en) * | 2015-06-26 | 2015-10-14 | 中国科学院大学 | Data transmission processing method and device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8428057B2 (en) * | 2007-03-14 | 2013-04-23 | Cisco Technology, Inc. | Optimizing return traffic paths using network address translation |
| US8374183B2 (en) * | 2010-06-22 | 2013-02-12 | Microsoft Corporation | Distributed virtual network gateways |
-
2017
- 2017-05-11 CN CN201710330968.4A patent/CN108881020B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101635680A (en) * | 2009-08-07 | 2010-01-27 | 中国电信股份有限公司 | Service routing method and service routing system |
| CN102025600A (en) * | 2009-09-17 | 2011-04-20 | 中兴通讯股份有限公司 | Method, system and router for transmitting and receiving data |
| CN102215160A (en) * | 2010-04-07 | 2011-10-12 | 中兴通讯股份有限公司 | Data communication system and method |
| EP2434707A1 (en) * | 2010-09-23 | 2012-03-28 | Alcatel Lucent | Method and system for optimising routing between two network nodes, at least one of which is mobile |
| CN104980354A (en) * | 2015-06-26 | 2015-10-14 | 中国科学院大学 | Data transmission processing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108881020A (en) | 2018-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106878262B (en) | Message detection method and device, and method and device for establishing local threat information library | |
| US10305776B2 (en) | Network verification | |
| WO2017148158A1 (en) | System for home gateway to recognize type of access device using cloud platform | |
| CN111193744B (en) | Firewall strategy inquiry and elastic expansion method, system, equipment and storage medium | |
| US20130322298A1 (en) | Network Topology Discovery | |
| CN109714239B (en) | Management message issuing method, VNFM (virtual network management frequency) equipment and server | |
| CN107566549B (en) | Method, device and equipment for processing network address translation mapping table | |
| CN110061921B (en) | Cloud platform data packet distribution method and system | |
| WO2021017907A1 (en) | Method and device for optimized inter-microservice communication | |
| CN108595505A (en) | The method and apparatus of data query | |
| KR20170067804A (en) | Method, apparatus for maintaining routing table and storage medium | |
| CN108881020B (en) | Active trusted route management method and device and computer equipment thereof | |
| CN107807976B (en) | IP home location query method and device | |
| CN108111422B (en) | DPDK-based data high-speed multi-path forwarding method and device | |
| US10454825B2 (en) | Hybrid routing table for routing network traffic | |
| US20160150010A1 (en) | Information processing apparatus, data save method, and information processing system | |
| CN116366548B (en) | Route matching method of IPv6 subnetwork | |
| CN112187640B (en) | L3VPN service point-to-point route based query method and device | |
| CN108268509B (en) | Configuration data management method and device | |
| CN103685367B (en) | Off-line download system and method | |
| CN109474712B (en) | IP geographic information determining method, server and storage medium | |
| CN107870925B (en) | Character string filtering method and related device | |
| CN115242716A (en) | IP address route reachability identification method based on BGP prefix tree | |
| TW202236136A (en) | Data storage method, apparatus, and device, and storage medium | |
| CN108768859B (en) | Data processing method, device and system |
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 |