CN112187640B - L3VPN service point-to-point route based query method and device - Google Patents
L3VPN service point-to-point route based query method and device Download PDFInfo
- Publication number
- CN112187640B CN112187640B CN202010932605.XA CN202010932605A CN112187640B CN 112187640 B CN112187640 B CN 112187640B CN 202010932605 A CN202010932605 A CN 202010932605A CN 112187640 B CN112187640 B CN 112187640B
- Authority
- CN
- China
- Prior art keywords
- node
- reachable
- intermediate node
- uni port
- route
- 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
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000013507 mapping Methods 0.000 claims abstract description 13
- 230000008569 process Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/36—Backward learning
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/46—Interconnection of networks
- H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
-
- 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/70—Routing based on monitoring results
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a query method and a device based on L3VPN service point-to-point routing, wherein the query method comprises the following steps: determining a source node and a sink node, and taking the source node as a current computing node; determining an intermediate node according to the matching degree of a target IP pointed by the network side route of the current computing node and the IP of the UNI port of the host node; setting a reachable mark for the intermediate node according to the direct condition of the intermediate node relative to the host node; forming a mapping relation among the current computing node, the intermediate node and the reachable mark of the intermediate node, and recording the mapping relation into the routing information; and refreshing the reachable mark of the previous node from the host node to the source node according to the routing information so as to obtain the reachable route from the source node to the host node. In the invention, when a user operates point-to-point routing, the reachable point-to-point routing is inquired, the operation range is focused into a plurality of network elements and a plurality of routes, the interference caused by excessive nodes and routes is eliminated, and the accuracy of user operation is improved.
Description
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a query method and a query device based on L3VPN service point-to-point routing.
Background
With the rapid development of telecommunication services, the scale of a transmission network is continuously enlarged, the scale of an L3VPN service model is larger and larger, the number of network elements involved in a single L3VPN reaches thousands, and the route of the single L3VPN reaches the million level. For the large-scale L3VPN service of the existing network, when a user checks or operates the route of a specific node, the following problems exist: finding a route from one node to another is too cumbersome, due to the large order of magnitude of the routes involved; moreover, because there are too many nodes and routes, the interference is too strong, and routing operations from one node to another are more error prone.
Disclosure of Invention
The invention provides a query method and a query device based on L3VPN service point-to-point routing, aiming at querying the reachable point-to-point routing when a user operates the point-to-point routing, so that the operation range is focused into a plurality of network elements and a plurality of routes from thousands of nodes and million-level routes, the user can operate the point-to-point routing according to the focused reachable route, the interference caused by excessive nodes and routes is eliminated, the correctness of user operation is improved, and the technical problems that the routing from one node to another node is too troublesome to find and the operation of the routing from one node to another node is easy to make mistakes are solved.
To achieve the above object, according to an aspect of the present invention, there is provided an inquiry method based on L3VPN service point-to-point routing, the inquiry method including:
determining a source node and a sink node, and taking the source node as a current computing node;
determining an intermediate node according to the matching degree of a target IP pointed by the network side route of the current computing node and the IP of the UNI port of the destination node;
setting a reachable mark for the intermediate node according to the direct condition of the intermediate node relative to the host node;
forming a mapping relation among the current computing node, the intermediate node and the reachable mark of the intermediate node, and recording the mapping relation into routing information;
and refreshing the reachable mark of the last node from the sink node to the source node according to the routing information so as to obtain the reachable route from the source node to the sink node.
Preferably, the setting a reachable flag for the intermediate node according to the direct condition of the intermediate node relative to the sink node includes:
acquiring the IP of the UNI port of the intermediate node, and judging whether the IP of the UNI port of the intermediate node is completely matched with the IP of the UNI port of the host node;
and if the intermediate nodes are completely matched, the intermediate nodes can directly reach the host nodes, and the reachable marks of the intermediate nodes are set to be reachable.
Preferably, after the determining whether the IP of the UNI port of the intermediate node is completely matched with the IP of the UNI port of the sink node, the method further includes:
if not, judging whether the IP of the UNI port of the intermediate node and the IP of the UNI port of the host node are in the same network segment or a super network segment;
if the network segment is the same network segment or the super network segment, the intermediate node can directly reach the host node, and the reachable mark of the intermediate node is set to be reachable.
Preferably, the determining whether the IP of the UNI port of the intermediate node and the IP of the UNI port of the destination node are in the same network segment or a super network segment further includes:
if not, the intermediate node can not reach the host node directly, the reachable mark of the intermediate node is set as unreachable, and the intermediate node is used as the current computing node.
Preferably, the fact that the IP of the UNI port of the intermediate node completely matches the IP of the UNI port of the sink node means that the IP address and the mask of the UNI port of the intermediate node are completely the same as those of the UNI port of the sink node.
Preferably, said refreshing the reachable flag of the last node from the sink node to the source node according to the routing information to obtain the reachable route from the source node to the sink node comprises:
the target node with the reachable mark is taken out from the routing information;
obtaining the previous node of the target node according to the mapping relation in the routing information, refreshing the reachable mark of the previous node until all node refreshing from the host node to the source node is completed so as to update the routing information;
and deleting all intermediate nodes marked as unreachable in the updated routing information to obtain the reachable route from the source node to the host node.
Preferably, the determining the intermediate node according to the matching degree of the destination IP in the network-side route of the current computing node and the IP of the UNI port of the destination node includes:
acquiring at least one network side route of the current computing node, and traversing the network side route to obtain a target IP pointed by the network side route;
judging whether the destination IP pointed by the network side route is completely matched with the IP of the UNI port of the destination node;
and if the matching is complete, the opposite end node of the network side route is taken as the intermediate node.
Preferably, after the determining whether the destination IP pointed by the network-side route is completely matched with the IP of the UNI port of the destination node, the method further includes:
if not, judging whether the destination IP pointed by the network side route and the IP of the UNI port of the destination node are in the same network segment or a super network segment;
and if the network segment is the same network segment or the super network segment, taking the opposite end node of the network side route as an intermediate node.
Preferably, the determining whether the destination IP pointed by the network side route and the IP of the UNI port of the destination node are in the same network segment or a super network segment further includes:
if the current computing node is not in the same network segment or the super network segment, judging whether the current computing node is provided with a default route;
and if the default route is set, taking the opposite end node of the default route of the current computing node as an intermediate node.
To achieve the above object, according to one aspect of the present invention, there is provided a query apparatus including at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor and programmed to perform the query method of the present invention.
Generally, compared with the prior art, the technical scheme of the invention has the following beneficial effects: the invention provides a query method and a device based on L3VPN service point-to-point routing, wherein the query method comprises the following steps: determining a source node and a sink node, and taking the source node as a current computing node; determining an intermediate node according to the matching degree of a target IP pointed by the network side route of the current computing node and the IP of the UNI port of the destination node; setting a reachable mark for the intermediate node according to the direct condition of the intermediate node relative to the host node; forming a mapping relation among the current computing node, the intermediate node and the reachable mark of the intermediate node, and recording the mapping relation into routing information; and refreshing the reachable mark of the last node from the sink node to the source node according to the routing information so as to obtain the reachable route from the source node to the sink node.
In the invention, when a user operates point-to-point routing, the reachable point-to-point routing is inquired, so that the operation range is focused into several network elements and several routes from thousands of nodes and million routes, the user can operate the point-to-point routing according to the focused reachable route, the interference caused by excessive nodes and routes is eliminated, and the operation accuracy of the user is improved.
Drawings
Fig. 1 is a schematic flowchart of an L3VPN service point-to-point route-based query method according to an embodiment of the present invention;
fig. 2 is a schematic data structure diagram of routing information according to an embodiment of the present invention;
FIG. 3 is a schematic flow chart illustrating step 20 of FIG. 1 according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of an inquiry apparatus according to an 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. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
Example 1:
referring to fig. 1, the present embodiment provides an inquiry method based on an L3VPN service point-to-point route, where the inquiry method includes the following steps:
step 10: and determining a source node and a sink node, and taking the source node as a current computing node.
In this embodiment, a current computing node list is established, and the source node is added to the current computing node list. Firstly, the source node is taken as the current computing node, and then the reachable route from the source node to the host node is obtained according to the following steps 20 to 50.
Step 20: and determining the intermediate node according to the matching degree of the target IP pointed by the network side route of the current computing node and the IP of the UNI port of the destination node.
The uni (user Network interface) port refers to a user Network interface, and the user equipment submits applications for acquiring, revoking and modifying optical bandwidth resources to the optical Network through the user Network interface.
The intermediate node refers to a node which needs to pass from a source node to a sink node, and the number of the intermediate nodes is at least one.
The current computing node correspondingly comprises at least one network side route, and each network side route is subjected to matching analysis.
The detailed implementation process of step 20 is shown in fig. 3 and the corresponding text.
Step 30: and setting a reachable mark for the intermediate node according to the direct condition of the intermediate node relative to the host node.
In this embodiment, the IP of the UNI port of the intermediate node is obtained, and whether the IP of the UNI port of the intermediate node is completely matched with the IP of the UNI port of the host node is determined; and if the intermediate nodes are completely matched, the intermediate nodes can directly reach the host nodes, and the reachable marks of the intermediate nodes are set to be reachable. Wherein, the IP of the UNI port of the intermediate node is completely matched with the IP of the UNI port of the sink node, which means that the IP address and the mask of the UNI port of the intermediate node are completely the same as the IP and the mask of the UNI port of the sink node.
If not, judging whether the IP of the UNI port of the intermediate node and the IP of the UNI port of the host node are in the same network segment or a super network segment; if the network segment is the same network segment or the super network segment, the intermediate node can directly reach the host node, and the reachable mark of the intermediate node is set to be reachable. If not, the intermediate node can not reach the host node directly, the reachable mark of the intermediate node is set as unreachable, and the intermediate node is used as the current computing node. Namely, the intermediate node is added into the current computing node list, and the intermediate node is used as the current computing node to execute the steps 20-50, so as to obtain the reachable route from the source node to the host node.
Step 40: and forming a mapping relation among the current computing node, the intermediate node and the reachable mark of the intermediate node, and recording the mapping relation into routing information.
With reference to fig. 2, the data structure of the routing information includes reachable flags of the current computing node, the intermediate node, and the intermediate node, where a reachable flag is reachable indicating that the intermediate node can reach the sink node, and a reachable flag is unreachable indicating that the intermediate node cannot reach the sink node. In an actual application scenario, the reachable flag is represented by "True" and the reachable flag is represented by "False".
The intermediate node refers to the first node in the network-side route from the current computing node to the sink node, that is, in data transmission, the data packet is forwarded to the intermediate node by the current computing node.
Wherein, because the node may be configured with protection, there may be multiple routes to the sink node, so the current compute node may correspond to one or more intermediate nodes.
Step 50: and refreshing the reachable mark of the last node from the sink node to the source node according to the routing information so as to obtain the reachable route from the source node to the sink node.
In this embodiment, a target node with a reachable flag is taken out from the routing information; obtaining the previous node of the target node according to the mapping relation in the routing information, refreshing the reachable mark of the previous node until all node refreshing from the host node to the source node is completed so as to update the routing information; and deleting all intermediate nodes marked as unreachable in the updated routing information to obtain the reachable route from the source node to the host node.
For example, the source node is node a1, the sink node is node a2, the source node a1 is used as the current computing node, the obtained routing information is node a1- > node B (intermediate node), and the reachable flag of node B is unreachable; taking the node B as the current computing node, and taking the obtained routing information as node B- > node C (intermediate node), wherein the reachable mark of the node C is unreachable; taking the node C as the current computing node, the obtained routing information is the node C- > node D, the reachable label of the node D is unreachable, taking the node D as the current computing node, the obtained routing information is the node D- > node A2 (host node), and the reachable label of the node D is reachable.
The refreshing process comprises the following steps: taking the node D as a target node, taking the last node of the node D as a node C, refreshing the reachable mark of the node C to be reachable, taking the node C as a target node, taking the last node of the node C as a node B, refreshing the reachable mark of the node B to be reachable, and thus obtaining the reachable route from the source node to the host node as follows: a1- > B- > C- > D- > A2.
In this embodiment, when a user operates point-to-point routing, the reachable route from point to point is queried, so that the operation range is focused into several network elements and several routes from thousands of nodes and millions of routes, the user can operate the point-to-point routing according to the focused reachable route, interference caused by excessive nodes and routes is eliminated, and the accuracy of user operation is improved.
Example 2:
in this embodiment, an implementation process of step 20 is specifically described, and referring to fig. 3, the step 20 specifically includes the following steps:
step 201: and acquiring at least one network side route of the current computing node, and traversing the network side route to obtain a destination IP pointed by the network side route.
Step 202: and judging whether the destination IP pointed by the network side route is completely matched with the IP of the UNI port of the destination node, if so, executing a step 203, and if not, executing a step 204.
Wherein, the IP address and the mask of the IP perfect matching finger are identical, for example, the IP address and the mask are both 1.1.1.1/24.
Step 203: and if the matching is complete, the opposite end node of the network side route is taken as the intermediate node.
Step 204: if not, judging whether the destination IP pointed by the network side route and the IP of the UNI port of the destination node are the same network segment or the super network segment, if so, executing the step 205; if not, go to step 206.
Wherein, the same network segment is exemplified as follows: the IP1 is 1.1.1.1/24, the IP2 is 1.1.1.2/24, the masks of the two IPs are the same, and the two IPs are calculated on the same network segment through a 24-bit mask.
Super/sub network segment example: the IP1 is 1.1.0.0/16, the IP2 is 1.1.1.1/24, the mask of the IP2 is smaller than that of the IP1, and the IP are in the same network segment according to the calculation of a smaller mask, in this case, the IP with a smaller mask is a super network segment of the IP with a larger mask, the IP with a larger mask is a sub network segment of the IP with a smaller mask, the IP1 is a super network segment of the IP2, and the IP2 is a sub network segment of the IP 1.
Step 205: and if the network segment is the same network segment or the super network segment, taking the opposite end node of the network side route as an intermediate node.
Step 206: and if the current computing node is not in the same network segment or the super network segment, judging whether the current computing node is provided with a default route.
And if the default route is set, taking the opposite end node of the default route of the current computing node as an intermediate node. The default route is a preconfigured route, and is taken when the next hop cannot be found in the process of forwarding the data packet.
Example 3:
referring to fig. 4, fig. 4 is a schematic structural diagram of an inquiry apparatus according to an embodiment of the present invention. The querying device of the present embodiment comprises one or more processors 41 and a memory 42. In fig. 4, one processor 41 is taken as an example.
The processor 41 and the memory 42 may be connected by a bus or other means, such as the bus connection in fig. 4.
The memory 42 may include, among other things, high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device. In some embodiments, memory 42 may optionally include memory located remotely from processor 41, which may be connected to processor 41 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
It should be noted that, for the information interaction, execution process and other contents between the modules and units in the apparatus and system, the specific contents may refer to the description in the embodiment of the method of the present invention because the same concept is used as the embodiment of the processing method of the present invention, and are not described herein again.
Those of ordinary skill in the art will appreciate that all or part of the steps of the various methods of the embodiments may be implemented by associated hardware as instructed by a program, which may be stored on a computer-readable storage medium, which may include: a Read Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and the like.
It will be understood by those skilled in the art that the foregoing is only a preferred embodiment of the present invention, and is not intended to limit the invention, and that any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (10)
1. An inquiry method based on L3VPN service point-to-point route is characterized in that the inquiry method comprises the following steps:
step 10: determining a source node and a sink node, and taking the source node as a current computing node;
step 20: determining an intermediate node according to the matching degree of a target IP pointed by the network side route of the current computing node and an IP of a User Network Interface (UNI) port of a host node;
step 30: setting a reachable mark for the intermediate node according to the direct condition of the intermediate node relative to the host node; the intermediate node refers to a first node in a network side route from a current computing node to a host node; if the intermediate node can not reach the destination node directly, setting a reachable mark of the intermediate node as unreachable, and taking the intermediate node as the current computing node to execute the steps 20-50;
step 40: forming a mapping relation among the current computing node, the intermediate node and the reachable mark of the intermediate node, and recording the mapping relation into routing information;
step 50: refreshing the reachable mark of the previous node from the host node to the source node according to the routing information so as to obtain a reachable route from the source node to the host node; wherein, the target node with the reachable mark is taken out from the routing information; and obtaining the previous node of the target node according to the mapping relation in the routing information, refreshing the reachable mark of the previous node until all node refreshing from the host node to the source node is completed, so as to update the routing information.
2. The query method of claim 1, wherein the setting of the reachable flag for the intermediate node according to the direct situation of the intermediate node with respect to the sink node comprises:
acquiring the IP of the UNI port of the intermediate node, and judging whether the IP of the UNI port of the intermediate node is completely matched with the IP of the UNI port of the host node;
and if the intermediate nodes are completely matched, the intermediate nodes can directly reach the host nodes, and the reachable marks of the intermediate nodes are set to be reachable.
3. The method according to claim 2, wherein said determining whether the IP of the UNI port of the intermediate node and the IP of the UNI port of the sink node completely match further comprises:
if not, judging whether the IP of the UNI port of the intermediate node and the IP of the UNI port of the host node are in the same network segment or a super network segment;
if the network segment is the same network segment or the super network segment, the intermediate node can directly reach the host node, and the reachable mark of the intermediate node is set to be reachable.
4. The query method according to claim 3, wherein determining whether the IP of the UNI port of the intermediate node and the IP of the UNI port of the sink node are in the same segment or a super segment further comprises:
if not, the intermediate node can not reach the host node directly, the reachable mark of the intermediate node is set as unreachable, and the intermediate node is used as the current computing node.
5. The query method according to claim 4, wherein the IP of the UNI port of the intermediate node completely matches the IP of the UNI port of the sink node, which means that the IP address and mask of the UNI port of the intermediate node are completely the same as the IP address and mask of the UNI port of the sink node.
6. The query method according to claim 4, wherein, in the updated routing information, all intermediate nodes marked as unreachable are deleted, and a reachable route from the source node to the sink node is obtained.
7. The query method according to claim 1, wherein the determining the intermediate node according to the matching degree of the destination IP in the network-side route of the current computing node and the IP of the UNI port of the destination node comprises:
acquiring at least one network side route of the current computing node, and traversing the network side route to obtain a target IP pointed by the network side route;
judging whether the destination IP pointed by the network side route is completely matched with the IP of the UNI port of the destination node;
and if the matching is complete, the opposite end node of the network side route is taken as the intermediate node.
8. The method according to claim 7, wherein said determining whether the destination IP pointed by the network-side route completely matches the IP of the UNI port of the sink node further comprises:
if not, judging whether the destination IP pointed by the network side route and the IP of the UNI port of the destination node are in the same network segment or a super network segment;
and if the network segment is the same network segment or the super network segment, taking the opposite end node of the network side route as an intermediate node.
9. The method according to claim 8, wherein said determining whether the destination IP pointed by the network side route and the IP of the UNI port of the sink node are in the same segment or a super segment further comprises:
if the current computing node is not in the same network segment or the super network segment, judging whether the current computing node is provided with a default route;
and if the default route is set, taking the opposite end node of the default route of the current computing node as an intermediate node.
10. An interrogation apparatus comprising at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor and programmed to perform the method of querying as claimed in any one of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010932605.XA CN112187640B (en) | 2020-09-08 | 2020-09-08 | L3VPN service point-to-point route based query method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010932605.XA CN112187640B (en) | 2020-09-08 | 2020-09-08 | L3VPN service point-to-point route based query method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112187640A CN112187640A (en) | 2021-01-05 |
| CN112187640B true CN112187640B (en) | 2022-02-18 |
Family
ID=73924907
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010932605.XA Active CN112187640B (en) | 2020-09-08 | 2020-09-08 | L3VPN service point-to-point route based query method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112187640B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112600954B (en) * | 2021-03-04 | 2021-06-25 | 城云科技（中国）有限公司 | IPv4 address matching method, electronic device and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108881020A (en) * | 2017-05-11 | 2018-11-23 | 中兴通讯股份有限公司 | The method, apparatus and its computer equipment of active credible routing management |
| CN110855721A (en) * | 2020-01-15 | 2020-02-28 | 武汉思普崚技术有限公司 | Method, equipment and storage medium for searching network logic path |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105721305B (en) * | 2016-01-19 | 2019-04-16 | 烽火通信科技股份有限公司 | The method of L3VPN route iteration outlet |
| US10250552B1 (en) * | 2016-04-27 | 2019-04-02 | Cisco Technology, Inc. | L3VPN service with single IGP/BGP session from a multi-homed CE with fast convergence using EVPN |
| CN107547333B (en) * | 2016-06-29 | 2020-02-21 | 华为技术有限公司 | Method and apparatus for implementing combined virtual private network VPN |
| CN106161228B (en) * | 2016-08-01 | 2019-10-11 | 杭州迪普科技股份有限公司 | A kind of method and apparatus of publication routing |
| CN108601055B (en) * | 2018-03-23 | 2020-08-04 | 烽火通信科技股份有限公司 | Method and system for deploying L3 VPN in L TE mobile backhaul network |
| CN110636005B (en) * | 2019-08-21 | 2021-03-02 | 北京邮电大学 | Knowledge routing method and device for knowledge center network |
-
2020
- 2020-09-08 CN CN202010932605.XA patent/CN112187640B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108881020A (en) * | 2017-05-11 | 2018-11-23 | 中兴通讯股份有限公司 | The method, apparatus and its computer equipment of active credible routing management |
| CN110855721A (en) * | 2020-01-15 | 2020-02-28 | 武汉思普崚技术有限公司 | Method, equipment and storage medium for searching network logic path |
Non-Patent Citations (1)
| Title |
|---|
| PTN网络L2VPN和L3VPN协调保护技术研究;吴满全;《信息通信》;20190415(第04期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112187640A (en) | 2021-01-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6968393B1 (en) | Method and apparatus for an attribute oriented routing update | |
| US8724494B2 (en) | Network multi-path discovery | |
| CN102215136B (en) | Flow topology generation method and device | |
| US20130322298A1 (en) | Network Topology Discovery | |
| CN107547242B (en) | The acquisition methods and device of VM configuration information | |
| JP5234544B2 (en) | Network configuration information acquisition method and apparatus | |
| CN113810287B (en) | Data retrieval and pushing method based on NDN and SDN | |
| CN110061921B (en) | Cloud platform data packet distribution method and system | |
| US20150370906A1 (en) | System and method for mapping identifier with locator using bloom filter | |
| CN114401319B (en) | Request processing method, device, server and storage medium | |
| CN112187640B (en) | L3VPN service point-to-point route based query method and device | |
| CN101945110B (en) | Configuration method and device of address resolution protocol entry | |
| US10536368B2 (en) | Network-aware routing in information centric networking | |
| US11689442B2 (en) | Routing in fat tree networks using negative disaggregation advertisements | |
| CN118216125A (en) | A message processing method and device | |
| CN109768909A (en) | Message forwarding method and device | |
| CN111800338B (en) | Cross-AS EVPN route interaction method and device | |
| US20070025346A1 (en) | System and method for creating a routing table | |
| CN106713140B (en) | Support the cooperative retransmission method of a variety of label distribution protocols and MPLS equipment | |
| US7423974B2 (en) | Disabling mutually recursive routes | |
| CN102413038B (en) | Processing method and system for inaccessibility of next hop of route | |
| CN113315708B (en) | System, method, computer equipment and storage medium for realizing grid gateway | |
| CN105391638A (en) | OSPF and ISIS routing traffic data fusion method and system | |
| WO2016183732A1 (en) | Data packet forwarding method and network device | |
| CN117896333B (en) | Message forwarding method, system, device 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 |