CN109005121B - Route calculation method and device - Google Patents
Route calculation method and device Download PDFInfo
- Publication number
- CN109005121B CN109005121B CN201810973396.6A CN201810973396A CN109005121B CN 109005121 B CN109005121 B CN 109005121B CN 201810973396 A CN201810973396 A CN 201810973396A CN 109005121 B CN109005121 B CN 109005121B
- Authority
- CN
- China
- Prior art keywords
- routing
- lsp
- routing information
- route
- filtering
- 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/02—Topology update or discovery
- H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present disclosure provides a route calculation method and apparatus, which enable a first routing device to receive an LSP sent by a second routing device, where the second routing device and the first routing device are IS an IS-IS neighbor; if the routing information carried by the LSP is determined to be a filtering route, adding a filtering identifier to the routing information; updating a local routing table entry according to the routing information which is not added with the filtering identifier locally; and then broadcasting the LSP so that the IS-IS neighbor routing equipment of the routing equipment updates the routing table entry of the routing equipment according to the routing information carried by the LSP, thereby enabling other routing equipment to filter the routing information. Therefore, the method and the device can solve the problem of flow blockage caused by route calculation of the filtered route information, and optimize the route calculation result.
Description
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a method and an apparatus for calculating a route.
Background
The IS-IS (Intermediate System-to-Intermediate System, Intermediate System to Intermediate System) belongs to an IGP (internal Gateway Protocol) and IS used in an autonomous System. The IS-IS a link state protocol, and performs route calculation using an SPF (Shortest Path First) algorithm.
The IS-IS generally divided into a plurality of areas in a routing domain, each area IS at least provided with one router, each router maintains a corresponding LSDB (Link State DataBase) containing all LSPDUs (Link State Protocol Data units, LSP for short) of the area. Each IS (Intermediate System) generates an LSP. The LSP contains all link state information in the IS, and the IS can calculate the network topology of the IS-IS by using an SPF algorithm according to the LSP in the LSDB to generate a routing table entry of the IS-IS.
Disclosure of Invention
In view of the above, the present disclosure provides a method and an apparatus for route calculation to solve the problem of using an unreachable path as an optimal path in the prior art.
Specifically, the present disclosure is realized by the following technical solutions:
the present disclosure provides a route calculation method, which is applied to a first routing device, and includes:
receiving an LSP sent by second routing equipment, wherein the second routing equipment and the first routing equipment are IS-IS neighbors;
if the routing information carried by the LSP is determined to be a filtering route, adding a filtering identifier to the routing information;
updating a local routing table entry according to the routing information which is not added with the filtering identifier locally;
and broadcasting the LSP so that the IS-IS neighbor routing equipment of the routing equipment updates the routing table entry of the routing equipment according to the routing information carried by the LSP.
Based on the same concept, the present disclosure provides a route calculation apparatus, wherein the apparatus is applied to a first routing device, and the apparatus comprises:
a receiving unit, configured to receive an LSP sent by a second routing device, where the second routing device and the first routing device are IS an IS-IS neighbor;
an identification unit, configured to add a filtering identifier to the routing information if it is determined that the routing information carried by the LSP is a filtering route;
the updating unit is used for updating the local routing table entry according to the routing information which is not added with the filtering identifier;
and the first forwarding unit IS used for broadcasting the LSP so that the IS-IS neighbor routing equipment of the routing equipment updates the routing table entry of the routing equipment according to the routing information carried by the LSP.
Based on the same concept, the present disclosure also provides a computer-readable storage medium having stored therein a computer program which, when executed by a processor, implements any of the steps of the route calculation method.
Based on the same concept, the present disclosure also provides a computer device comprising a memory, a processor, a communication interface, and a communication bus; the memory, the processor and the communication interface are communicated with each other through the communication bus;
the memory is used for storing a computer program;
the processor is used for executing the computer program stored in the memory, and any step of the route calculation method is realized when the processor executes the computer program.
Therefore, the method and the device can enable the first routing device to receive the LSP sent by the second routing device, wherein the second routing device and the first routing device are IS-IS neighbors; if the routing information carried by the LSP is determined to be a filtering route, adding a filtering identifier to the routing information; updating a local routing table entry according to the routing information which is not added with the filtering identifier locally; and then broadcasting the LSP so that the IS-IS neighbor routing equipment of the routing equipment updates the routing table entry of the routing equipment according to the routing information carried by the LSP, thereby enabling other routing equipment to filter the routing information. Compared with the prior art, the method and the device have the advantages that the routing device can acquire the filtering routing information of other routing devices, so that the problem of traffic obstruction caused by routing calculation of the filtering routing information can be solved, and the routing calculation result is optimized.
Drawings
Fig. 1 IS an IS-IS networking schematic in an exemplary embodiment of the present disclosure;
FIG. 2 is a process flow diagram of a method of route calculation in an exemplary embodiment of the present disclosure;
FIG. 3 is a flow diagram of a route calculation interaction in an exemplary embodiment of the present disclosure;
FIG. 4 is a logical block diagram of a route calculation device in an exemplary embodiment of the present disclosure;
FIG. 5 is a logical block diagram of a computer device in an exemplary embodiment of the present disclosure.
Detailed Description
Please refer to fig. 1, which IS a schematic diagram of IS-IS networking, where an IS-IS neighbor relationship IS established on links connected to each other by routers Router a, Router B, Router C, Router D, and Router E, and assuming that two network segments connected to Router C are 17.1.1.0/24 and 17.1.2.0/24 respectively, routing information of the two network segments IS recorded in LSDB of IS-IS networking, so that routing devices Router a, Router B, Router C, Router D, and Router E in the networking can obtain LSP containing the routing information, so that the routing devices calculate an optimal path through an SPF algorithm according to the routing information in the LSP. For example, the next hops of the two network segment routes calculated for Router a are Router D and Router B, respectively, where the path from Router a to Router C is assumed to be optimal through Router B, and therefore 17.1.1.0/24 and 17.1.2.0/24 routes on Router a are preferred to have the next hop of Router B. When there is user traffic on Router A corresponding to 17.1.1.0/24 and 17.1.2.0/24 network segments, the path of the traffic goes through Router B to Router C and can correctly access the destination address.
If a user configures the IS-IS routing policy on Router B, the user traffic reaching 17.1.1.0/24 IS not allowed to be forwarded out through the device, i.e., the 17.1.1.0/24 route IS filtered out locally. However, no restriction is made on Router D and Router E, so that the traffic can reach Router C through Router D and Router E, thereby accessing 17.1.1.0/24 network segment correctly. Since Router A devices do not perceive Router B's routing policy, the LSDB saved 17.1.1.0/24 and 17.1.2.0/24 routes in IS-IS networking are unchanged. The next hop of Router A in 17.1.1.0/24 route calculated by SPF algorithm according to the route information in LSDB is still Router B, so that the traffic with the destination address of 17.1.1.0/24 will still be forwarded to Router B when arriving at Router A, and Router B discards the traffic of 17.1.1.0/24 according to the local routing policy, thus resulting in that no traffic of 17.1.1.0/24 is reachable.
Therefore, in the existing IS-IS network, if there are multiple paths between two routing devices, if any routing device configures a route, one of the multiple paths IS unreachable, and other routing devices do not need the route, because the routing device does not have a sensing mechanism to know the route configuration condition in the entire IS-IS network, the preferred path IS calculated by the SPF algorithm according to the own route, but the route of the unreachable path IS likely to be preferred, so that the traffic forwarding IS not smooth.
In order to solve the problems in the prior art, the present disclosure provides a method and an apparatus for route calculation, which enable a first routing device to receive an LSP sent by a second routing device, where the second routing device and the first routing device are IS an IS-IS neighbor; if the routing information carried by the LSP is determined to be a filtering route, adding a filtering identifier to the routing information; updating a local routing table entry according to the routing information which is not added with the filtering identifier locally; and then broadcasting the LSP so that the IS-IS neighbor routing equipment of the routing equipment updates the routing table entry of the routing equipment according to the routing information carried by the LSP, thereby enabling other routing equipment to filter the routing information. Therefore, the method and the device can solve the problem of flow blockage caused by route calculation of the filtered route information, and optimize the route calculation result. Compared with the prior art, the method and the device have the advantages that the routing device can acquire the filtering routing information of other routing devices, so that the problem of traffic obstruction caused by routing calculation of the filtering routing information can be solved, and the routing calculation result is optimized.
Referring to fig. 2, it is a processing flow chart of a route calculation method in an exemplary embodiment of the present disclosure, where the method is applied to a first routing device, and the method includes:
in this embodiment, a first routing device and a second routing device in the IS-IS networking may establish an IS-IS neighbor relationship on a link, where if the second routing device sets filtered routing information locally, the second routing device may add the filtered routing information to an LSP, and then broadcast the LSP in an IS of the second routing device to an IS-IS neighbor routing device of the second routing device, that IS, the first routing device, and if the second routing device also has other IS-IS neighbor routing devices, the other routing devices may also receive the LSP. Therefore, the first routing device may receive the LSP information sent by the second routing device, where the LSP carries the routing information filtered by the second routing device.
in an embodiment, the present disclosure adds a new CLV (Code/Length/Value, type \ Length \ numerical Value) field to the LSP, where a Code Value represents whether the route is filtering route information, for example, when the Code Value is 204, the routing device represents the filtering route information, and then after receiving the LSP, the first routing device further determines whether a Code Value in the CLV field in the LSP is a preset Value (for example, the Code Value is 204), and if so, determines that the route information carried by the LSP is the filtering route; if not, determining that the routing information carried by the LSP is not a filtering route.
When the first routing device determines that the LSP includes the filtered routing information, a filtering identifier may be added to the locally recorded routing information to indicate that the routing information is the filtered routing information, and the routing information is ignored when calculating the optimal path in the subsequent process.
As an embodiment, the first routing device may further analyze a prefix type field in a CLV field in the LSP, and when the prefix type field is 0, it indicates that the prefix type of the routing information in the LSP is an internet protocol fourth version IPv4 prefix; when the prefix type field is 1, the prefix type of the routing information in the LSP is an internet protocol sixth version IPv6 prefix; and then, analyzing the routing information carried in the LSP according to the prefix type.
Specifically, the Length Value in the CLV represents the Length of a Value field, and the range is 2-255; value is specific routing information, wherein the first byte may be a prefix type field, when the lowest position of the first byte is 0, the prefix is represented as an IPv4 prefix, and when the lowest position of the first byte is 1, the prefix is represented as an IPv6 prefix; the value filled from the second byte is IPv4 prefix address + mask or IPv6 address + mask length. The first routing device may parse specific routing information in the Value according to the parsed IPv4 prefix or IPv6 prefix.
in this embodiment, after the first routing device adds the filtering identifier to the routing information in the LSP, the first routing device may obtain the routing information to which the filtering identifier is not added locally, perform routing calculation to obtain a new routing table entry, and update the local routing table entry, thereby excluding the unreachable path in the local routing table entry.
In this embodiment, after the first routing device adds the filtering identifier to the routing device, the LSP may be broadcasted to IS-IS neighbor routing devices of the first routing device, so that when other routing devices receive the LSP, the routing device updates their own routing table entry according to the filtering route according to the method of the first routing device and continues to forward the routing table entry to their respective neighbor devices, thereby enabling the routing devices in the entire network to acquire the filtering route information and avoiding the filtering route information from participating in route forwarding calculation. It should be noted that, because the second routing device IS the sending end of the LSP, when the first routing device locally broadcasts the LSP to the IS-IS neighbor of the first routing device, even if the second routing device and the first routing device are in an IS-IS neighbor relationship, the LSP IS not forwarded back to the second routing device according to a flooding mechanism.
As an embodiment, when the first routing device sets the route filtering policy locally, the route information filtered on the local routing device may be added to the LSP of the local routing device, and the LSP of the local routing device IS sent to the IS-IS neighbor routing device of the local routing device through flooding, so that the routing device receiving the LSP processes the LSP according to the above method.
Therefore, when a certain routing device in the traffic forwarding path filters routing information, the routing information IS added into the CLV and encapsulated in the LSP and then flooded in the IS-IS network, so that other routing devices analyze the filtered routing information in the LSP after receiving the LSP and avoid the routing information from participating in routing calculation, and therefore, the routing IS screened from the source, inaccessible routing IS avoided from participating in routing calculation, and the traffic can be ensured to be accessible by other paths.
It should be noted that the route calculation function provided by the present disclosure may be an additional function of an existing routing device, and the first routing device may enable the route calculation function of the routing device by issuing a command line. When the first routing device enables the route calculation function, the above operation can be executed to realize route filtering; when the first routing device does not enable the routing computation function, if the first routing device receives the LSPs sent by other routing devices, the LSP may be directly forwarded to other IS-IS neighbor routing devices of the routing device without processing the LSP. Therefore, the first routing device can forward the received LSP to other neighbor devices even if the route calculation function is not enabled, so that the neighbor devices can realize the purpose of route filtering under the condition of enabling the route calculation function.
In order to make the objects, technical solutions and advantages of the present disclosure more clearly understood, the following description further details the solution of the present disclosure through fig. 3 based on the networking structure of fig. 1.
Please refer to fig. 3, which is an interaction flowchart of a routing device in an embodiment of the present disclosure, where the interaction flowchart includes:
step 301, establishing an IS-IS neighbor relation between Router A and Router B, wherein Router A enables the routing calculation function;
step 302, when filtering a certain piece of IS-IS routing information (17.1.1.0/24) in IS-IS on Router a, filling the filtered routing information (17.1.1.0/24) acquired through an IS-IS internal interface into a CLV, wherein the CLV IS Code 204, and the lowest Bit position 0 of the first byte in VALUE in the CLV indicates that the routing information IS IPv4 routing information, and encapsulating the CLV into an LSP generated by Router a;
step 303, flooding the LSP to an IS-IS neighbor Router B of Router A;
step 304, after the IS-IS on Router B receives the LSP, it first detects whether the IS-IS of the device enables the route calculation function, if not, it does not analyze and process the LSP, and only floods to other IS-IS neighbors, such as Router c.
Step 305, if it is detected that the RouterB enables the routing computation function, analyzing the LSP, obtaining neighboring node information and routing information (17.1.1.0/24) in the CLV with Code being 204, adding a filtering identifier to the routing information, and the routing information with the identifier does not participate in the routing computation of the routing device; carrying out ISPF calculation once, and carrying out optimization on the changed routing information again and refreshing a routing table entry; the LSP is flooded to other neighbors, such as the RouterC.
The method and the device realize that a certain specific router in the IS-IS network can be flexibly appointed to support the function, so that the routing equipment can or other routing equipment can filter out the routing information, thereby avoiding carrying out routing calculation on the inaccessible route and flooding the CLV to other neighbors; and other IS-IS routers which do not support the function do not analyze the CLV, but can normally flood to other neighbors, and do not influence other IS-IS routers which support the function.
Based on the same concept, the present disclosure also provides a route calculation apparatus, which may be implemented by software, or implemented by hardware, or implemented by a combination of hardware and software. Taking software implementation as an example, the route calculation device of the present disclosure is a logical device, and is implemented by reading a corresponding computer program instruction in a memory by a CPU of the device in which the route calculation device is located.
Referring to fig. 4, a routing computation apparatus 400 according to an exemplary embodiment of the present disclosure is applied to a first routing device, and a logical structure of the apparatus 400 includes, from a logical level:
a receiving unit 401, configured to receive an LSP sent by a second routing device, where the second routing device and the first routing device are IS an IS-IS neighbor;
an identifying unit 402, configured to add a filtering identifier to the routing information if it is determined that the routing information carried by the LSP is a filtering route;
an updating unit 403, configured to update a local routing table entry according to the routing information to which the filtering identifier is not locally added;
a first forwarding unit 404, configured to broadcast the LSP, so that an IS-IS neighbor routing device of the routing device updates a routing table entry of the routing device according to routing information carried by the LSP.
As an embodiment, the identifying unit 402 is specifically configured to determine whether a code value in a CLV field in the LSP is a preset value, and if so, determine that routing information carried by the LSP is a filtering route; if not, determining that the routing information carried by the LSP is not a filtering route.
As an embodiment, the apparatus further comprises:
an analyzing unit 405, configured to analyze a prefix type field in a CLV field in the LSP, where when the prefix type field is 0, a prefix type of the routing information in the LSP is an IPv4 prefix; when the prefix type field is 1, the prefix type of the routing information in the LSP is an IPv6 prefix; and analyzing the routing information carried in the LSP according to the prefix type.
As an embodiment, the apparatus further comprises:
the second forwarding unit 406 IS configured to add the filtered routing information set in the routing device to the LSP of the routing device, and broadcast the LSP of the routing device to the IS-IS neighbor routing device of the routing device, so that the neighbor routing device updates its routing table entry according to the routing information carried by the LSP.
Based on the same concept, the present disclosure also provides a computer device, as shown in fig. 5, including a memory 51, a processor 52, a communication interface 53, and a communication bus 54; wherein, the memory 51, the processor 52 and the communication interface 53 communicate with each other through the communication bus 54;
the memory 51 is used for storing computer programs;
the processor 52 is configured to execute the computer program stored in the memory 51, and when the processor 52 executes the computer program, any step of the route calculation method provided in the embodiment of the present disclosure is implemented.
The present disclosure further provides a computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements any step of the route calculation method provided in the embodiments of the present disclosure.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for embodiments of the computer device and the computer-readable storage medium, since they are substantially similar to the method embodiments, the description is relatively simple, and in relation to what is described in the partial description of the method embodiments.
In summary, the present disclosure may enable a first routing device to receive an LSP sent by a second routing device, where the second routing device and the first routing device are IS an IS-IS neighbor; if the routing information carried by the LSP is determined to be a filtering route, adding a filtering identifier to the routing information; updating a local routing table entry according to the routing information which is not added with the filtering identifier locally; and then broadcasting the LSP so that the IS-IS neighbor routing equipment of the routing equipment updates the routing table entry of the routing equipment according to the routing information carried by the LSP, thereby enabling other routing equipment to filter the routing information. Therefore, the method and the device can solve the problem of flow blockage caused by route calculation of the filtered route information, and optimize the route calculation result. Compared with the prior art, the method and the device have the advantages that the routing device can acquire the filtering routing information of other routing devices, so that the problem of traffic obstruction caused by routing calculation of the filtering routing information can be solved, and the routing calculation result is optimized.
The implementation process of the functions and actions of each unit in the above device is specifically described in the implementation process of the corresponding step in the above method, and is not described herein again.
For the device embodiments, since they substantially correspond to the method embodiments, reference may be made to the partial description of the method embodiments for relevant points. The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the application. One of ordinary skill in the art can understand and implement it without inventive effort.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (6)
1. A route calculation method applied to a first routing device, the method comprising:
receiving a link state protocol data unit (LSP) sent by second routing equipment, wherein the second routing equipment and the first routing equipment are neighbors from an intermediate system to an intermediate system (IS-IS);
judging whether a code value in a CLV field of the type length value in the LSP is a preset value to determine whether the routing information carried by the LSP is a filtering route, if so, determining that the routing information carried by the LSP is the filtering route; if not, determining that the routing information carried by the LSP is not a filtering route; if the routing information carried by the LSP is determined to be a filtering route, adding a filtering identifier to the routing information; the filtering route refers to a route which is locally set by the routing equipment and is filtered when the optimal path is calculated;
updating a local routing table entry according to the routing information which is not added with the filtering identifier locally;
broadcasting the LSP so that IS-IS neighbor routing equipment of the routing equipment updates routing list items of the routing equipment according to routing information carried by the LSP;
adding the filtered routing information set on the routing equipment into the LSP of the routing equipment, and broadcasting the LSP of the routing equipment to IS-IS neighbor routing equipment of the routing equipment so that the neighbor routing equipment updates the routing table entry of the neighbor routing equipment according to the routing information carried by the LSP.
2. The method of claim 1, wherein after determining that the routing information carried by the LSP is a filtered route, the method further comprises:
analyzing a prefix type field in a CLV field in the LSP, wherein when the prefix type field is 0, the prefix type of the routing information in the LSP is an IPv4 prefix of the fourth version of the Internet protocol; when the prefix type field is 1, the prefix type of the routing information in the LSP is an internet protocol sixth version IPv6 prefix;
and analyzing the routing information carried in the LSP according to the prefix type.
3. A route calculation apparatus, applied to a first routing device, the apparatus comprising:
a receiving unit, configured to receive a link state protocol data unit LSP sent by a second routing device, where the second routing device and the first routing device are neighbors from an intermediate system to an intermediate system IS-IS;
the identification unit is specifically configured to determine whether a code value in a CLV field in the LSP is a preset value to determine whether the routing information carried by the LSP is a filtering route, and if so, determine that the routing information carried by the LSP is the filtering route; if not, determining that the routing information carried by the LSP is not a filtering route; if the routing information carried by the LSP is determined to be a filtering route, adding a filtering identifier to the routing information; the filtering route refers to a route which is locally set by the routing equipment and is filtered when the optimal path is calculated;
the updating unit is used for updating the local routing table entry according to the routing information which is not added with the filtering identifier;
a first forwarding unit, configured to broadcast the LSP, so that an IS-IS neighbor routing device of the routing device updates a routing table entry of the routing device according to routing information carried by the LSP;
and the second forwarding unit IS used for adding the filtered routing information set on the routing device into the LSP of the routing device, and broadcasting the LSP of the routing device to the IS-IS neighbor routing device of the routing device, so that the neighbor routing device updates the routing table entry of the neighbor routing device according to the routing information carried by the LSP.
4. The apparatus of claim 3, further comprising:
an analyzing unit, configured to analyze a prefix type field in a CLV field in the LSP, where when the prefix type field is 0, a prefix type of the routing information in the LSP is an IPv4 prefix; when the prefix type field is 1, the prefix type of the routing information in the LSP is an IPv6 prefix; and analyzing the routing information carried in the LSP according to the prefix type.
5. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1-2.
6. A computer device, comprising a memory, a processor, a communication interface, and a communication bus; the memory, the processor and the communication interface are communicated with each other through the communication bus;
the memory is used for storing a computer program;
the processor is configured to execute the computer program stored in the memory, and when the processor executes the computer program, the processor implements the steps of the method according to any one of claims 1-2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810973396.6A CN109005121B (en) | 2018-08-24 | 2018-08-24 | Route calculation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810973396.6A CN109005121B (en) | 2018-08-24 | 2018-08-24 | Route calculation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109005121A CN109005121A (en) | 2018-12-14 |
| CN109005121B true CN109005121B (en) | 2021-06-29 |
Family
ID=64593875
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810973396.6A Active CN109005121B (en) | 2018-08-24 | 2018-08-24 | Route calculation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109005121B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102761493A (en) * | 2012-07-26 | 2012-10-31 | 杭州华三通信技术有限公司 | Multicast routing item updating method and device of multilink transparent internet |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101207555B (en) * | 2006-12-18 | 2010-07-14 | 中兴通讯股份有限公司 | Method for automatically clearing over loading bit in the course of avoiding path black hole |
| CN101272393B (en) * | 2008-05-14 | 2010-11-03 | 杭州华三通信技术有限公司 | Routing computing method and network node based on link condition routing protocol |
| CN101699800B (en) * | 2009-11-04 | 2011-11-16 | 杭州华三通信技术有限公司 | Method for storing neighbor information and device thereof |
| CN101984596B (en) * | 2010-11-04 | 2012-05-30 | 北京星网锐捷网络技术有限公司 | Method, device and routing equipment for avoiding black holes |
| CN103532872B (en) * | 2012-07-03 | 2016-08-17 | 杭州华三通信技术有限公司 | Reduce method and router that link state data bag floods |
| CN103685035B (en) * | 2012-09-26 | 2018-04-27 | 深圳市腾讯计算机系统有限公司 | Route renewing method, interchanger and system |
| US20140149782A1 (en) * | 2012-11-28 | 2014-05-29 | Telefonaktiebolaget L M Ericsson (Publ) | Method and apparatus for facilitating process restart in a multi-instance is-is system |
| US9398515B2 (en) * | 2013-10-17 | 2016-07-19 | Telefonaktiebolaget L M Ericsson (Publ) | VPNv4 route control for LTE X2 SON using import route maps and outbound route filtering |
| CN105227458B (en) * | 2014-07-01 | 2019-11-29 | 南京中兴新软件有限责任公司 | The route computing method and device of TRILL ISIS |
-
2018
- 2018-08-24 CN CN201810973396.6A patent/CN109005121B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102761493A (en) * | 2012-07-26 | 2012-10-31 | 杭州华三通信技术有限公司 | Multicast routing item updating method and device of multilink transparent internet |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109005121A (en) | 2018-12-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10541905B2 (en) | Automatic optimal route reflector root address assignment to route reflector clients and fast failover in a network environment | |
| US9749214B2 (en) | Software defined networking (SDN) specific topology information discovery | |
| CN108781182B (en) | Communication method and network element between SDN controllers by using BGP protocol | |
| US10637768B1 (en) | Enabling non-flexible-algorithm routers to participate in flexible-algorithm routing protocols | |
| US8942106B2 (en) | Method and apparatus for route optimization enforcement and verification | |
| CN102130834B (en) | Internet protocol (IP) routing method and router | |
| US9800493B2 (en) | Routing messages in a computer network using deterministic and probalistic source routes | |
| US9300569B2 (en) | Compressing data packet routing information using bloom filters | |
| CN110611616A (en) | Traffic scheduling method, system, device and medium based on Radius server | |
| US20230116548A1 (en) | Route Processing Method and Related Device | |
| CN102932255B (en) | Method and device for selecting tunnel path | |
| CN105637806A (en) | Method and apparatus for determining network topology, and centralized network state information storage device | |
| US10367732B2 (en) | Route control for internet exchange point | |
| CN105207904A (en) | Message processing method, device and router | |
| CN109005121B (en) | Route calculation method and device | |
| WO2022266905A1 (en) | Forwarding path generating method and apparatus, network device, and storage medium | |
| Cisco | ISO CLNS Commands | |
| CN109921989B (en) | BGP logical topology generation method and equipment | |
| JP6801075B2 (en) | How to get path information for data packets and devices | |
| CN113381934B (en) | Differential service code point DSCP (distributed service control point) drainage method and device | |
| CN109688060B (en) | Link grouping configuration method and device and router | |
| WO2023036087A1 (en) | Routing advertisement method, path establishment method, service data transmission method and autonomous system border router | |
| CN116208542A (en) | Path announcement method, path calculation method, electronic device, and readable 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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230612 Address after: 310052 11th Floor, 466 Changhe Road, Binjiang District, Hangzhou City, Zhejiang Province Patentee after: H3C INFORMATION TECHNOLOGY Co.,Ltd. Address before: 310052 Changhe Road, Binjiang District, Hangzhou, Zhejiang Province, No. 466 Patentee before: NEW H3C TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right |