CN106385364A - Route updating method and device - Google Patents
Route updating method and device Download PDFInfo
- Publication number
- CN106385364A CN106385364A CN201610807592.7A CN201610807592A CN106385364A CN 106385364 A CN106385364 A CN 106385364A CN 201610807592 A CN201610807592 A CN 201610807592A CN 106385364 A CN106385364 A CN 106385364A
- Authority
- CN
- China
- Prior art keywords
- route
- change
- routing node
- routing
- prefix
- 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.)
- Withdrawn
Links
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
-
- 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/04—Interdomain routing, e.g. hierarchical routing
-
- 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/12—Shortest path evaluation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a route updating method and device. The route updating method and device are applied to the route nodes. The method comprises: when a link state changing occurs in a network, a first topology path tree is calculated; according to the first topology path tree and a second topology path tree stored prior to the changing of the link state changing, determining whether there are route nodes with path changing or not; and when there are the route nodes with path changing, obtaining the route prefix of the route nodes with the path changing, executing the route calculation of the prefix portion of the route, and performing route updating of the route node with the path changing according to the route calculation result of the route prefix portion. According to the invention, the route convergence performance is improved.
Description
Technical field
The present invention relates to network communication technology field, more particularly, to a kind of route renewing method and device.
Background technology
Based on the internal gateway dynamic routing protocol of link-state information, such as OSPF (Open Shortest Path
First, ospf), IS-IS (Intermediate System-to-Intermediate System, in
Between system to intermediate system) etc., can be very good to support catenet, and there is higher routing convergence performance, therefore obtain
It is widely applied.It is applied to the typical feature of catenet so that the quality of the router-level topology performance of link-state routing protocol
Become an important indicator of weighing device performance.
The router running link-state routing protocol to other router advertisements link-state information of oneself, includes company
The neighbor router that connects, IP (Internet Protocol, Internet protocol) network segment of configuration etc., meanwhile, collect other routers
The link-state information of notice, calculates topological path and this topological path with oneself as root according to all link-state informations
The route of upper each router.
When link-state information arbitrary in network changes, router need to recalculate topological path, and updates complete
Portion route, and leads to routing convergence inefficiency.
Content of the invention
It is an object of the invention to provide a kind of route renewing method and device, in order to the routing node for path change
Update route, improve routing convergence efficiency.
For achieving the above object, the invention provides technical scheme：
The present invention provides a kind of route renewing method, is applied to routing node, methods described includes：
When there is link-state change in network, calculate the first topological path tree；
According to the second topological path tree preserving before described first topological path tree and link-state change, judge whether
There is the routing node of path change；
When there is the routing node of described path change, obtain the route prefix of the routing node of described path change；
The router-level topology of execution routing prefix part, and according to the router-level topology result of routing prefix part to described path
The routing node of change carries out routing update.
The present invention also provides a kind of routing update device, is applied to routing node, and described device includes：
Topological computing module, for when there is link-state change in network, calculating the first topological path tree；According to institute
The the second topological path tree preserving before stating the first topological path tree and link-state change, judges whether path change
Routing node；When there is the routing node of described path change, obtain the route prefix of the routing node of described path change；
Prefix route computing module, for executing the router-level topology of routing prefix part, and according to routing prefix part
Router-level topology result carries out routing update to the routing node of described path change.
By above description as can be seen that the present invention contrasts to the topological path before and after link-state change, find road
The routing node of footpath change, and then carry out routing update for the routing node of this change, improve the convergence efficiency of route.
Brief description
Fig. 1 is the route renewing method flow chart shown in the embodiment of the present invention；
Fig. 2A to Fig. 2 C is the SPT schematic diagram shown in the embodiment of the present invention；
Fig. 3 is the structural representation of the routing node shown in the embodiment of the present invention；
Fig. 4 is the structural representation of the routing update device shown in the embodiment of the present invention.
Specific embodiment
Here will in detail exemplary embodiment be illustrated, its example is illustrated in the accompanying drawings.Explained below is related to
During accompanying drawing, unless otherwise indicated, the same numbers in different accompanying drawings represent same or analogous key element.Following exemplary embodiment
Described in embodiment do not represent all embodiments consistent with the present invention.On the contrary, they be only with such as appended
The example of the consistent apparatus and method of some aspects being described in detail in claims, the present invention.
It is the purpose only merely for description specific embodiment in terminology used in the present invention, and be not intended to be limiting the present invention.
" a kind of ", " described " and " being somebody's turn to do " of singulative used in the present invention and appended claims is also intended to including most
Form, unless context clearly shows that other implications.It is also understood that term "and/or" used herein refers to and wraps
Containing one or more associated any or all possible combination listing project.
It will be appreciated that though various information may be described using term first, second, third, etc. in the present invention, but this
A little information should not necessarily be limited by these terms.These terms are only used for same type of information is distinguished from each other out.For example, without departing from
In the case of the scope of the invention, the first information can also be referred to as the second information, and similarly, the second information can also be referred to as
One information.Depending on linguistic context, word as used in this " if " can be construed to " ... when " or " when ...
When " or " in response to determining ".
The embodiment of the present invention proposes a kind of route renewing method, and the method is entered to the topological path before and after link-state change
Row contrast, finds the routing node of path change, and then carries out routing update for the routing node of this change, improve route
Convergence efficiency.
Referring to Fig. 1, it is an embodiment flow chart of route renewing method of the present invention, this embodiment is to route renewal process
It is described.
Step 101, when there is link-state change in network, calculates the first topological path tree.
Calculate interactive link status information between the routing node of route based on Link State, this link-state information includes
The route prefix of routing node, for example, routing node A is configured with route prefix 10.0.0.0/24, then notice in routing node A
Link-state information in comprise this route prefix 10.0.0.0/24.
The routing node of the embodiment of the present invention receives the route prefix information of other routing nodes, generates route prefix table
, for recording the corresponding relation of routing node and route prefix, referring to table 1.
Table 1
Table 1 is route prefix list item example.For example, the corresponding route prefix 10.0.0.0/24 of routing node A and
20.0.0.0/24.
When exist in network link-state change (for example, routing node configuration IP network section change, or, neighbours route
Node changes) when, the link-state information of change is advertised to all routing nodes by routing node change is detected, thus touching
Send out each routing node and recalculate topological path.The embodiment of the present invention is by the topology according to current link conditions change calculations
Path is referred to as the first topological path tree.
The present invention can calculate the first topological path using SPF (Shortest Path First, SPF) algorithm
Tree, this first topological path tree is the SPT (Shortest with current routing node as root adopting SPF algorithm to calculate
Path Tree, shortest path tree).
Step 102, according to the second topological path tree preserving before described first topological path tree and link-state change,
Judge whether the routing node of path change.
Topological path before this link-state change is referred to as the second topological path tree by the embodiment of the present invention.When according to step
Rapid 101 when obtaining the first topological path tree, compares the first topological path tree and the second topological path tree, the road of accessed path change
By node.
Step 103, when there is the routing node of described path change, obtains the road of the routing node of described path change
By prefix.
According to the judged result of step 102, when there is the routing node of path change, before the route of inquiry local record
Sew list item, obtain route prefix corresponding with the routing node of this path change, go to step 104.
Step 104, the router-level topology of execution routing prefix part, and entered according to the router-level topology result of routing prefix part
Row routing update.
For example, when the judgement by step 102 has newly-increased routing node, execution step 103 obtains newly-increased route section
The route prefix of point, then, calculates, by step 104, the route reaching this route prefix, carries out routing update.
Additionally, no matter the judged result of step 102 whether there is the routing node of path change, the present invention is to the first topology
The constant routing node in path that path tree and the second topological path tree obtain more afterwards, before further determining whether to there is route
Sew change, specifically, routing node can judge whether to route according to the route prefix of other routing node periodic advertisement
Prefix changes.When there is route prefix change, obtain the route prefix of change, the route prefix according to this change updates road
By, for example, route prefix is changed into 60.0.0.0/24 from 40.0.0.0/24, then delete the route reaching the 40.0.0.0/24 network segment,
The newly-increased route reaching the 60.0.0.0/24 network segment.
When the routing node that there is not path change, do not exist yet change route prefix when, current link shape is described
State change is probably to be caused by backup path change, does not constitute impact to the current topological path calculating, need not update route.
By foregoing description as can be seen that the present invention updates only for the routing node of path change or the route prefix of change
Route, that is, each link-state change only update section branch is by raising routing convergence efficiency.
Additionally, can be seen that the execution of step 101～step 103 from the description of step 101～step 104 is topological road
Footpath is processed, and step 104 execution is that route prefix is processed, and therefore, the present invention can take out a topological computing module and execute step
Rapid 101～step 103, completes the process of topological path.When routing node runs multiple Routing Protocol based on Link State,
The plurality of Routing Protocol based on Link State can share topological computing module, i.e. so that topology is calculated independent of each link shape
State Routing Protocol.Multiple link-state routing protocols can share the route prefix that topological computing module obtains, and then, execution is each
Router-level topology and renewal.
Now, introduce routing update process taking Intermediate System to Intermediate System as a example.
The routing node running Intermediate System to Intermediate System generates LSPDU (Link State according to the network topology structure around oneself
Protocol Data Unit, Link State Protocol Data Unit), abbreviation LSP.This LSP includes the neighbours road adjacent with oneself
IP network segment information (route prefix) by configuration on nodal information and interface.The LSP of generation is advertised to by IS-IS routing node
Other IS-IS routing nodes, receive the LSP of other IS-IS routing node notices meanwhile.Each IS-IS routing node is according to receipts
The all LSP collecting, adopt SPF algorithm to calculate the SPT with oneself as root.
Referring to Fig. 2A, it is the SPT that routing node A is calculated with oneself for root, this SPT includes routing node A～G.Route section
Point A, after the LSP collecting other routing nodes, locally generates the route prefix list item of each routing node, referring to table 2.
Table 2
Link between B and C disconnects, and after B detects link-state change, is advertised to other routing nodes.A receives
After the notice of B, recalculate SPT, as shown in Figure 2 B.SPT and SPT shown in Fig. 2 B relatively shown in Fig. 2A, finds generation topology and becomes
Routing node C, D, the E changing, these three routing nodes do not exist in SPT shown in Fig. 2 B, therefore, should delete local preservation
The route prefix list item of C, D, E node, the route prefix list item in routing node A is as shown in table 3.
Table 3
Correspondingly, routing node A only needs to delete the route reaching routing node C, D, E, that is, delete and reach
30.0.0.0/24, the route of 50.0.0.0/24,70.0.0.0/24 network segment.
Additionally, from table 2 and table 3 as can be seen that the route prefix of path unchanged routing node A, B, F, G does not also become
Change, therefore, the route reaching 10.0.0.0/24,20.0.0.0/24,40.0.0.0/24 network segment does not need to update.
It is assumed that increasing routing node H newly on the basis of Fig. 2 B, and the IP network section on routing node F and G changes, by
40.0.0.0/24 it is changed into 60.0.0.0/24, routing node A updates route prefix list item according to the LSP receiving, as shown in table 4.
Table 4
Link change triggering routing node A recalculates SPT, as shown in Figure 2 C.SPT shown in comparison diagram 2B, finds newly-increased
Node H, obtains the route prefix list item of the H of local record, calculates the route reaching H (network segment 90.0.0.0/24).Meanwhile, send out
The route prefix of unchanged routing node F and G in existing path changes, and is changed into 60.0.0.0/24 from 40.0.0.0/24, therefore,
Delete the route reaching the 40.0.0.0/24 network segment, increase the route reaching the 60.0.0.0/24 network segment.
It is assumed that on the basis of Fig. 2 C, the IP network section on only routing node B and H changes, and is become by 90.0.0.0/24
For 80.0.0.0/24, routing node A updates route prefix list item according to the LSP receiving, as shown in table 5.
Table 5
The change of route prefix equally triggers routing node A and recalculates SPT, but result of calculation is constant, as shown in Figure 2 C,
There is no the routing node of change in topology.Now, confirm the route prefix (80.0.0.0/24 is changed into from 90.0.0.0/24) of change,
Delete the route reaching the 90.0.0.0/24 network segment, increase the route reaching the 80.0.0.0/24 network segment.
If, each routing node, in addition to running Intermediate System to Intermediate System, also runs ospf protocol, then ospf protocol need not be counted again
The route prefix calculated topological path and obtain change routing node, the topological path that can be directly calculated using Intermediate System to Intermediate System
And the route prefix obtaining, execute follow-up routing update, improve routing update efficiency, save system resource.
Corresponding with the embodiment of aforementioned route renewing method, present invention also offers the embodiment of routing update device.
The embodiment of routing update device of the present invention can be applied on routing node.Device embodiment can pass through software
Realize it is also possible to be realized by way of hardware or software and hardware combining.As a example implemented in software, as on a logical meaning
Device, be to be formed by corresponding computer program instructions in the processor run memory of its place equipment.From hardware
For aspect, as shown in figure 3, being a kind of hardware structure diagram of routing update device place of the present invention equipment, except shown in Fig. 3
Outside processor and nonvolatile memory, in embodiment device be located equipment generally according to this equipment actual functional capability,
Other hardware can also be included, this is repeated no more.
Refer to Fig. 4, be the structural representation of the routing update device in one embodiment of the invention.This routing update fills
Put including topological computing module 401 and prefix route computing module 402, wherein：
Topological computing module 401, for when there is link-state change in network, calculating the first topological path tree；Root
According to the second topological path tree preserving before described first topological path tree and link-state change, judge whether that path becomes
The routing node changed；When there is the routing node of described path change, obtain the route of the routing node of described path change
Prefix；
Prefix route computing module 402, for executing the router-level topology of routing prefix part, and according to routing prefix part
Router-level topology result routing update is carried out to the routing node of described path change.
Further,
Described topology computing module 401, is additionally operable to the route prefix according to the notice of other routing nodes, judges that path is constant
Routing node whether there is route prefix change；When there is route prefix change, obtain the route prefix of change；
Described prefix route computing module 402, is additionally operable to the route prefix according to described change and updates route.
Further, described device also includes：
Entry updating module, before calculating the first topological path tree in described topology computing module 401, receives other
The route prefix of routing node notice；Update route prefix list item, before described route prefix list item record routing node and route
The corresponding relation sewed；
Described topology computing module 401 obtains the route prefix of the routing node of described path change, including：
Inquire about described route prefix list item, obtain route prefix corresponding with the routing node of described path change.
Further, described topology computing module 401 calculates the first topological path tree, including：
First topological path tree is calculated using SPF SPF algorithm, described first topological path tree is for calculating
The shortest path tree SPT with current routing node as root coming.
Further, described device also includes：
When routing node runs multiple Routing Protocol based on Link State, the plurality of route based on Link State
Agreement shares described topology computing module 401 to obtain the route prefix of the routing node of change.
In said apparatus, the process of realizing of the function of unit and effect specifically refers to corresponding step in said method
Realize process, will not be described here.
For device embodiment, because it corresponds essentially to embodiment of the method, thus real referring to method in place of correlation
The part applying example illustrates.Device embodiment described above is only schematically, wherein said as separating component
The unit illustrating can be or may not be physically separate, as the part that unit shows can be or can also
It is not physical location, you can with positioned at a place, or can also be distributed on multiple NEs.Can be according to actual
Need to select the purpose to realize the present invention program for some or all of module therein.Those of ordinary skill in the art are not paying
In the case of going out creative work, you can to understand and to implement.
The foregoing is only presently preferred embodiments of the present invention, not in order to limit the present invention, all essences in the present invention
Within god and principle, any modification, equivalent substitution and improvement done etc., should be included within the scope of protection of the invention.
Claims (10)
1. a kind of route renewing method, is applied to routing node it is characterised in that methods described includes：
When there is link-state change in network, calculate the first topological path tree；
According to the second topological path tree preserving before described first topological path tree and link-state change, judge whether
The routing node of path change；
When there is the routing node of path change, obtain the route prefix of the routing node of described path change；
The router-level topology of execution routing prefix part, and according to the router-level topology result of routing prefix part to described path change
Routing node carry out routing update.
2. the method for claim 1 is it is characterised in that methods described also includes：
According to the route prefix of other routing nodes notice, judge that the constant routing node in path whether there is route prefix and becomes
Change；
When there is route prefix change, obtain the route prefix of change；
Route prefix according to described change updates route.
3. the method for claim 1 is it is characterised in that before described calculating the first topological path tree, also include：
Receive the route prefix of other routing node notices；
Update route prefix list item, the corresponding relation of described route prefix list item record routing node and route prefix；
The route prefix of the described routing node obtaining described path change, including：
Inquire about described route prefix list item, obtain route prefix corresponding with the routing node of described path change.
4. the method for claim 1 is it is characterised in that described calculating the first topological path tree, including：
First topological path tree is calculated using SPF SPF algorithm, described first topological path tree is calculated
Shortest path tree SPT with current routing node as root.
5. the method for claim 1 it is characterised in that：
When routing node runs multiple Routing Protocol based on Link State, the step of described calculating the first topological path tree,
The routing node of the step of the described routing node judging whether path change and the described path change of described acquisition
The step of route prefix to be completed by independent topological computing module so that the plurality of Routing Protocol based on Link State is common
Obtain the route prefix of the routing node of change with described topology computing module.
6. a kind of routing update device, is applied to routing node it is characterised in that described device includes：
Topological computing module, for when there is link-state change in network, calculating the first topological path tree；According to described
The the second topological path tree preserving before one topological path tree and link-state change, judges whether the route of path change
Node；When there is the routing node of described path change, obtain the route prefix of the routing node of described path change；
Prefix route computing module, for executing the router-level topology of routing prefix part, and the route according to routing prefix part
Result of calculation carries out routing update to the routing node of described path change.
7. device as claimed in claim 6 it is characterised in that：
Described topology computing module, is additionally operable to the route prefix according to the notice of other routing nodes, judges the constant route in path
Node whether there is route prefix and changes；When there is route prefix change, obtain the route prefix of change；
Described prefix route computing module, is additionally operable to the route prefix according to described change and updates route.
8. device as claimed in claims 6 or 7 is it is characterised in that described device also includes：
Entry updating module, before calculating the first topological path tree in described topology computing module, receives other route sections
The route prefix of point notice；Update route prefix list item, described route prefix list item record routing node is right with route prefix
Should be related to；
Described topology computing module obtains the route prefix of the routing node of described path change, including：
Inquire about described route prefix list item, obtain route prefix corresponding with the routing node of described path change.
9. device as claimed in claim 6 is it is characterised in that described topology computing module calculates the first topological path tree, bag
Include：
First topological path tree is calculated using SPF SPF algorithm, described first topological path tree is calculated
Shortest path tree SPT with current routing node as root.
10. device as claimed in claim 6 is it is characterised in that described device also includes：
When routing node runs multiple Routing Protocol based on Link State, the plurality of Routing Protocol based on Link State
Share described topology computing module to obtain the route prefix of the routing node of change.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610807592.7A CN106385364A (en) | 2016-09-05 | 2016-09-05 | Route updating method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610807592.7A CN106385364A (en) | 2016-09-05 | 2016-09-05 | Route updating method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106385364A true CN106385364A (en) | 2017-02-08 |
Family
ID=57939073
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610807592.7A Withdrawn CN106385364A (en) | 2016-09-05 | 2016-09-05 | Route updating method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106385364A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108259357A (en) * | 2017-09-29 | 2018-07-06 | 新华三技术有限公司 | A kind of route convergent method and device |
| CN109104370A (en) * | 2018-07-06 | 2018-12-28 | 烽火通信科技股份有限公司 | A kind of prefix list realtime refreshing method and system |
| CN110830370A (en) * | 2019-12-03 | 2020-02-21 | 西安邮电大学 | IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol |
| CN112615786A (en) * | 2020-12-04 | 2021-04-06 | 北京神州泰岳软件股份有限公司 | Route determining method and device, electronic equipment and computer readable storage medium |
| CN115499363A (en) * | 2022-11-18 | 2022-12-20 | 南京易科腾信息技术有限公司 | Route updating method, system, storage medium and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101272393A (en) * | 2008-05-14 | 2008-09-24 | 杭州华三通信技术有限公司 | Routing computing method and network node based on link condition routing protocol |
| CN101483610A (en) * | 2009-02-26 | 2009-07-15 | 迈普（四川）通信技术有限公司 | Route updating method for link state routing protocol |
| US20120294166A1 (en) * | 2011-05-20 | 2012-11-22 | Brocade Communications Systems, Inc. | Techniques for efficiently updating routing information |
| CN102916879A (en) * | 2012-11-13 | 2013-02-06 | 烽火通信科技股份有限公司 | Rapid route convergence method |
-
2016
- 2016-09-05 CN CN201610807592.7A patent/CN106385364A/en not_active Withdrawn
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101272393A (en) * | 2008-05-14 | 2008-09-24 | 杭州华三通信技术有限公司 | Routing computing method and network node based on link condition routing protocol |
| CN101483610A (en) * | 2009-02-26 | 2009-07-15 | 迈普（四川）通信技术有限公司 | Route updating method for link state routing protocol |
| US20120294166A1 (en) * | 2011-05-20 | 2012-11-22 | Brocade Communications Systems, Inc. | Techniques for efficiently updating routing information |
| CN102916879A (en) * | 2012-11-13 | 2013-02-06 | 烽火通信科技股份有限公司 | Rapid route convergence method |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108259357A (en) * | 2017-09-29 | 2018-07-06 | 新华三技术有限公司 | A kind of route convergent method and device |
| CN108259357B (en) * | 2017-09-29 | 2021-08-24 | 新华三技术有限公司 | Route convergence method and device |
| CN109104370A (en) * | 2018-07-06 | 2018-12-28 | 烽火通信科技股份有限公司 | A kind of prefix list realtime refreshing method and system |
| CN110830370A (en) * | 2019-12-03 | 2020-02-21 | 西安邮电大学 | IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol |
| CN110830370B (en) * | 2019-12-03 | 2021-12-10 | 西安邮电大学 | IBGP (Internet protocol gateway protocol) transmission route updating method based on OSPF (open shortest Path first) protocol |
| CN112615786A (en) * | 2020-12-04 | 2021-04-06 | 北京神州泰岳软件股份有限公司 | Route determining method and device, electronic equipment and computer readable storage medium |
| CN115499363A (en) * | 2022-11-18 | 2022-12-20 | 南京易科腾信息技术有限公司 | Route updating method, system, storage medium and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10833976B2 (en) | Loop detection and avoidance for segment routed traffic engineered paths | |
| US9736263B2 (en) | Temporal caching for ICN | |
| US7633875B1 (en) | Method and system for accelerating route calculation in link state routing protocols | |
| CN106385364A (en) | Route updating method and device | |
| US6968393B1 (en) | Method and apparatus for an attribute oriented routing update | |
| US7869349B2 (en) | Method and system for deducing network routes by querying routers | |
| CN102057637B (en) | Routing-based proximity for communication networks | |
| US9007918B2 (en) | Techniques for efficiently updating routing information | |
| CN109155760A (en) | Path is grouped using fixed header size to record | |
| CN109361596A (en) | Route computing method, device and electronic equipment | |
| KR20190006066A (en) | Determination of route in communication network | |
| US7467226B2 (en) | Method and apparatus for flooding link state packets to achieve faster convergence | |
| WO2021254173A1 (en) | Routing processing method and related device | |
| Papán et al. | The survey of current IPFRR mechanisms | |
| CN108270677A (en) | A kind of fast route convergence method and device | |
| US20100202448A1 (en) | Routing-based proximity for communication networks | |
| EP3993356A1 (en) | Interdomain path calculation based on an abstract topology | |
| Mayr et al. | Crafting optimal and resilient iBGP-IP/MPLS overlays for transit backbone networks | |
| JP4759007B2 (en) | BGP simulation method, BGP simulation program, and simulation apparatus | |
| JP3949696B2 (en) | Protocol acceleration device | |
| CN105763446B (en) | A kind of link-state information processing method and processing device | |
| JP7527408B2 (en) | Transfer path generating method, device, network device, and storage medium | |
| JP2010199882A (en) | Communication system, path computation device, path computation method and program | |
| CN108259357B (en) | Route convergence method and device | |
| CN106936710A (en) | A kind of Mesh Group collocation methods and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Applicant after: Xinhua three Technology Co., Ltd. Address before: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Applicant before: Huasan Communication Technology Co., Ltd. |
|
| CB02 | Change of applicant information | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20170208 |
|
| WW01 | Invention patent application withdrawn after publication |