CN103188149A - Routing computation method and router - Google Patents
Routing computation method and router Download PDFInfo
- Publication number
- CN103188149A CN103188149A CN2011104509159A CN201110450915A CN103188149A CN 103188149 A CN103188149 A CN 103188149A CN 2011104509159 A CN2011104509159 A CN 2011104509159A CN 201110450915 A CN201110450915 A CN 201110450915A CN 103188149 A CN103188149 A CN 103188149A
- Authority
- CN
- China
- Prior art keywords
- metric
- lsp
- availability ratio
- bandwidth availability
- node
- 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.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a routing computation method and a router, and belongs to the technical field of data communication. The routing computation method comprises the following steps: acquiring a link status protocol data unit LSP of each node in a network, wherein the LSP carries a first metric measure of a link and bandwidth usage efficiency of the link; computing a second metric measure of the link according to the bandwidth usage efficiency; computing the shortest path from the node to a destination node according to the first metric measure and the second metric measure. According to the routing computation method, the bandwidth usage efficiency of the link in the routing computation is considered, and a more reasonable route selection can be achieved.
Description
Technical field
The present invention relates to data communication technology field, particularly a kind of route computing method and router.
Background technology
The datacom device particularly present operational mode of router is based on all that IP route table carries out, and obtaining of IP route table be to produce by static state or dynamic routing protocol.Intermediate System-to-Intermediate System (ISIS) agreement is as a kind of dynamic IGRP (IGP), by in a territory, flooding, safeguard same LSD (LSDB), and then offer router and carry out route and calculate, it calculates shortest path based on SPF (SPF) algorithm.Described SPF algorithm specifically comprises: obtain source node to the link metric value (metric) of each link between destination node; The route cost of each paths of calculating from the source node to the destination node, the link metric value sum that described route cost is each link in the path; Choose the path of path cost minimum as shortest path.
The shortest path of present ISIS is the acquiescence metric of each producer's router by metric employing in calculating, and for example described acquiescence metric is 10.This metric is static index, does not consider the quality of current network operation, and the shortest path that calculates sometimes is not optimal path, thereby the optimum Route Selection after well the network enabled scale enlarges.
For example, for network topology shown in Figure 1, there are two paths in node A to node D, be respectively A-C-D and A-B-D, owing to be the Gigabit Ethernet mouth between the A-C, and be 100 m ethernet (FE) mouth between the A-B, therefore when the ISIS agreement is calculated route, finally can select this paths of A-C-D.But the expansion along with network size, bandwidth availability ratio between the A-C is increasing, even surpass 80%, but because the shortest path that ISIS calculates is by remaining A-C-D, therefore the data that mail to D from A remain from C, thereby cause the too high packet loss phenomenon that occurs of A-C link utilization, and the load between the A-B then flow is very low, bandwidth availability ratio is very little, even does not have flow.
As seen, there is defective in prior art, need improve and perfect.
Summary of the invention
The purpose of this invention is to provide a kind of route computing method and router, in route is calculated, consider the bandwidth availability ratio of link, to realize more reasonably Route Selection.
For achieving the above object, one aspect of the present invention provides a kind of route computing method, comprises the steps:
Obtain the Link State Protocol Data Unit LSP of each node in the network, carry first metric of link and the bandwidth availability ratio of link among the described LSP;
Calculate second metric of link according to described bandwidth availability ratio;
Calculate the shortest path that arrives destination node from this node according to described first metric and described second metric.
The present invention provides a kind of router on the other hand, comprising:
Acquiring unit, the Link State Protocol Data Unit LSP for obtaining each node of network carries first metric of link and the bandwidth availability ratio of link among the described LSP;
First computing unit is used for second metric according to described bandwidth availability ratio calculating link;
Second computing unit is used for calculating the shortest path that arrives destination node from this node according to described first metric and described second metric.
Compared with prior art, the invention has the beneficial effects as follows:
The present invention has introduced the bandwidth availability ratio of link in the route computational process of router, the shortest path that calculates based on described bandwidth availability ratio can accurately reflect the actual routing condition of network, the present invention provides the load balancing equal-cost route for the heavier link of load in the current large scale network, thus can be more intelligent carry out Route Selection.
Description of drawings
Fig. 1 is a kind of Route Selection schematic diagram of the prior art;
Fig. 2 is the flow chart according to the route computing method of the embodiment of the invention;
Fig. 3 is the detail flowchart of the route computing method of the embodiment of the invention;
Fig. 4 is the flow chart of anti-route flapping in the embodiment of the invention;
Fig. 5 is the structural representation according to the router of the embodiment of the invention.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, describe the present invention below in conjunction with the accompanying drawings and the specific embodiments.
In following embodiment of the present invention, the ISIS agreement is at the load that carries out having considered when route is calculated link, be the bandwidth availability ratio of link, described bandwidth availability ratio carried out SPF as a metric of link calculate that the route that calculates can accurately reflect the actual routing condition of network.In addition, the route that calculates according to bandwidth availability ratio can superpose in existing route, thereby form 2 or many equal-cost routes, make that router can be according to network load condition, the route of selecting from many equal-cost routes of intelligence is carried out forwarding of flow.
Suppose in one network, comprise many routers, every router abbreviates a node as in network, in the network topology, there is one or more accessibility path between each node, therefore need carries out route and calculate, select the shortest path to instruct forwarding of flow.
With reference to Fig. 2, the route computing method of the embodiment of the invention can comprise the steps:
Step 201: obtain the LSP of each node in the network, carry first metric of link and the bandwidth availability ratio of link among the described LSP;
Step 202: second metric that calculates link according to described bandwidth availability ratio;
Step 203: calculate the shortest path that arrives destination node from this node according to described first metric and described second metric.
In step 201, describedly obtain that the LSP of each node specifically comprises in the network: obtain the LSP that LSP that this node produces and other nodes are flooded to this node.Each node in the network is safeguarded a LSDB, preserves the LSP of the link of each node among the LSDB.In embodiments of the present invention, not only carry the metric (being described first metric) of acquiescence among the LSP, for example 10, also carry the bandwidth availability ratio of the link of each node.Described bandwidth availability ratio is link average discharge in the given time and the ratio of link bandwidth, and the described scheduled time can arrange as required, for example is set to 5 minutes.After node in the network gets access to the bandwidth availability ratio of link of this node, can carry this bandwidth availability ratio by LSP and be flooded to other nodes in the network.
Generally speaking, when the LSP of node in finding LSDB changes, will move the ISIS agreement immediately, carry out the SPF route and calculate.Because bandwidth availability ratio is a dynamic real-time process, all carry out SPF and calculate if router receives LSP that each bar carries bandwidth availability ratio, then the ISIS of whole network calculates frequently, also causes the route flapping of network easily.For fear of this problem, also introduced anti-route flapping measure in the embodiment of the invention, be specially:
In LSP, also carry the high threshold values thresholding of bandwidth availability ratio low valve valve thresholding and bandwidth availability ratio, when the bandwidth availability ratio that the LSP that receives when node carries is lower than bandwidth availability ratio low valve valve thresholding, abandon described LSP; The bandwidth availability ratio that carries as LSP that node receives floods to described LSP according to predetermined period between bandwidth availability ratio low valve valve thresholding and the high threshold values thresholding of bandwidth availability ratio the time; When the bandwidth availability ratio that the LSP that receives when node carries is higher than the high threshold values thresholding of bandwidth availability ratio, immediately described LSP is flooded, make that other nodes receive this LSP after, can carry out recomputating of SPF route immediately.Wherein, described predetermined period also can arrange as required.
In step 202, described second metric according to described bandwidth availability ratio calculating link specifically comprises: described bandwidth availability ratio be multiply by predetermined weights, obtain described second metric.Described weights can arrange flexibly according to different network types, for example, are set to 4 or 5.
In step 203, describedly calculate the shortest path that arrives destination node from this node according to described first metric and described second metric, specifically comprise:
According to described first metric calculate arrive destination node from this node the first via in each path by cost, the described first via is the first metric sum that constitutes all links in path by cost;
Calculate the secondary route cost that arrives each path of destination node from this node according to described second metric, described secondary route cost is the second metric sum of all links in formation path;
Choose the first via by the path of cost and secondary route cost sum minimum as described shortest path.
After obtaining described shortest path, can also judge whether described shortest path is identical with first shortest path from this node arrival destination node that calculates according to described first metric, if abandon this path, otherwise, this shortest path is added in the routing table of node.Like this, just may form 2 or many equal-cost routes in the routing table, make that router can be according to network load condition, the route of selecting from many equal-cost routes of intelligence is carried out forwarding of flow.
Below provide a kind of specific implementation of above-mentioned LSP.
The LSP that the ISIS route is calculated based on whole intra-zone gathers, and LSP is based on the packaged type of type-length-value TLV, LSP can use LSP ID to come unique identification, and LSP ID is made up of Source ID, Pseudonode ID, three signs of LSP number.The embodiment of the invention proposes a kind of new LSP, and this LSP expands at the existing TLV 22 of ISIS, and tentative is TLV 136, and the data structure of the TLV22 after the expansion is as follows:
7 byte System Id and Pseudonode number
3 bytes acquiescence Metric
22bit gives tacit consent to metric
2bit TLV 136 sign positions (for example, with 01 sign TLV136)
1 byte sub-TLV length
0-244 byte sub-TLVs (1) definition structure is as follows:
1 byte sub-type (namely identifying this LSP)
The content-length that the sub-TLV of 1 byte comprises
0-242 byte Sub-TLVs (2) definition structure is as follows
1 byte sub-type (namely identifying this LSP)
The content-length that the sub-TLV of 1 byte comprises
The content that the 0-236 byte comprises
From above-mentioned data structure as can be seen, the LSP of the new expansion of the present invention and existing ISIS LSP main difference have been to expand the minimum 2bit among the original acquiescence metric, it is TLV 136 routes that its main purpose is to identify the route that SPF goes out by this calculation of parameter, this route is the stack on original existing route just, form 2 or many equal-cost routes, thereby the realization load balancing, the bandwidth availability ratio of reduction active link.
Carried out the definition of sub-TLV (sub-TLV) in the above-mentioned data structure simultaneously, this has expanded two-layer sub-TLV, and newly-increased one-level sub-TLV comprises: the sub-type of 1 byte (that is, subtype), and value is 136; The content-length that the sub-TLV of 1 byte comprises; The remaining concrete content of 0-242 byte-identifier, the i.e. bandwidth availability ratio of this link reality and be used for some anti-shake parameters.The data structure definition that secondary sub-TLV specifically comprises is as follows:
4 byte metric information
1 byte 1bit agent position (set when being used for bandwidth availability ratio and being higher than high threshold values thresholding, 7bit position)
1bit uncal position (set when being lower than the low valve valve thresholding for bandwidth availability ratio, 6bit position)
The consistent position of 1bit opposite end coupling (because bandwidth availability ratio is on the link, the band at two ends
Wide concordance rate error should be less than 5%)
5bit is undefined
The sub-TLV type definition of its definition is as follows:
For each metric, all calculate respectively in the ISIS agreement.In the network area, its bandwidth availability ratio metric floods by the LSP TLV 136 of expansion, and puts into LSDB and carry out SPF calculating.With reference to Fig. 3, SPF calculates the detailed process following (route of supposing the current network router is R1) of shortest path by bandwidth availability ratio:
(1) LSDB obtains the LSP information (variation has taken place network condition) after the renewal;
(2) check TLV136 sign position bit, judge whether this route calculates by bandwidth availability ratio metric value;
If TLV 136 sign position bit are non-0, entered for the 3rd step;
If TLV 136 sign position bit put 0, return host process.
(3) read the type field of LSP, if its value is 22, then further resolve the sub-TLV field; If its value is not 22, then ignore the calculating of this part, directly withdraw from;
(4) read sub-TLV type field, if its value is 136, then further resolve secondary sub-TLV field; If its value is not 136, then directly withdraw from, return the sub-TLV mistake that do not match;
(5) read secondary sub-TLV type field, operate accordingly according to the value of type field, its detailed operation is as follows:
Type=6, minute book link IPv4 address, and return the higher level and continue to check secondary sub-TLV;
Type=8, IPv4 address, minute book link opposite end, and return the higher level and continue to check secondary sub-TLV;
Type=9, minute book link current bandwidth utilance, and return the higher level and continue to check secondary sub-TLV;
Type=10, minute book link bandwidth utilization rate low valve valve threshold value, and return the higher level and continue to check secondary sub-TLV;
Type=11, the high threshold values threshold value of minute book link bandwidth utilization rate, and return the higher level and continue to check secondary sub-TLV;
Type other, directly return the higher level, do not reexamine secondary sub-TLV;
(6) enter anti-shake process, the set of the line correlation of going forward side by side, detailed process sees also hereinafter;
(7) SPF calculates shortest path by R2 according to the parameter of returning above, checks whether R2 is identical with R1, as identical this route of then ignoring; If R2 different with R1 (its main be next is jumped different) adds this route in the ISIS routing table, i.e. this moment, there are 2 or many equal-cost routes (R1, R2...) on the router
Because bandwidth availability ratio is a dynamic real-time process, if it is that 136 LSP carries out SPF and calculates that router receives each bar type, then the ISIS of whole network calculates frequent, the shake that also causes network easily is serious, in order better to avoid this problem, the following mode of special proposition solves:
In the data structure definition process, defined the uncal position; In the dtd process, defined type 11 low valve valve thresholdings, if current bandwidth availability ratio is lower than the low valve valve thresholding, ignore this LSP when then set uncal is 1, SPF calculating route;
In the data structure definition process, defined the agent position; In the dtd process, defined type 10 high threshold values thresholdings, if current bandwidth availability ratio is higher than high threshold values thresholding, then set agent is 1, and the LSP that floods at once, informing network recomputates route.
Fig. 4 is the flow chart of anti-route flapping in the embodiment of the invention, mainly comprises the steps:
ISIS receives the LSP flow process;
Entering anti-shake process handles;
Judge whether the current bandwidth utilance is higher than high threshold values threshold value, if this LSP that floods at once if not, enters next step;
Judge whether the current bandwidth utilance is lower than the low valve valve threshold value, if, abandon this LSP, if not, then ISIS upgrades LSDB, carries out SPF and calculates best route.
Corresponding to above-mentioned route computing method, the embodiment of the invention also provides a kind of router, and with reference to Fig. 5, described router can comprise:
Acquiring unit 10, the LSP for obtaining each node of network carries first metric of link and the bandwidth availability ratio of link among the described LSP;
Described first computing unit 20 can multiply by described bandwidth availability ratio one predetermined weights, obtains described second metric.
Described second computing unit 30 can calculate shortest path in the following manner: calculate from this node according to described first metric and arrive the first via in each path of destination node by cost; Calculate the secondary route cost that arrives each path of destination node from this node according to described second metric; Choose the first via by the path of cost and secondary route cost sum minimum as described shortest path.
Can also comprise route adding device (not shown) in the described router, be used for when described shortest path and first shortest path that arrives destination node from this node that calculates according to described first metric not simultaneously, this shortest path is added in the routing table.
In order to prevent route flapping, go back portability first thresholding and second thresholding among the described LSP, described router also can comprise the unit (not shown) that floods, and is used for: when described bandwidth availability ratio is lower than described first thresholding, abandon described LSP; When described bandwidth availability ratio is between described first thresholding and described second thresholding, according to predetermined period described LSP is flooded; When described bandwidth availability ratio is higher than described second thresholding, immediately described LSP is flooded.
The a plurality of processing of above-mentioned each unit described in can manner of execution embodiment, the course of work that it is concrete and operation principle are described in detail in the method part, do not repeat them here, and the description of appropriate section gets final product in the reference method.
In sum, the present invention is at the load that carries out having considered when route is calculated link, i.e. the bandwidth availability ratio of link carries out SPF with described bandwidth availability ratio as a metric of link and calculates, and the route that calculates can accurately reflect the actual routing condition of network.In addition, the route that calculates according to bandwidth availability ratio can superpose in existing route, thereby form 2 or many equal-cost routes, make that router can be according to network load condition, the route of selecting from many equal-cost routes of intelligence is carried out forwarding of flow.The present invention also compares by bandwidth availability ratio and bandwidth availability ratio low valve valve thresholding and high threshold values thresholding, carries out the anti-shake processing of route, can improve stability of network.
Should be noted that at last, above embodiment is only unrestricted in order to technical scheme of the present invention to be described, those of ordinary skill in the art is to be understood that, can make amendment or be equal to replacement technical scheme of the present invention, and not breaking away from the spiritual scope of technical solution of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.
Claims (16)
1. a route computing method is characterized in that, comprises the steps:
Obtain the Link State Protocol Data Unit LSP of each node in the network, carry first metric of link and the bandwidth availability ratio of link among the described LSP;
Calculate second metric of link according to described bandwidth availability ratio; And
Calculate the shortest path that arrives destination node from this node according to described first metric and described second metric.
2. route computing method as claimed in claim 1 is characterized in that, described second metric according to described bandwidth availability ratio calculating link specifically comprises:
Described bandwidth availability ratio be multiply by predetermined weights, obtain described second metric.
3. route computing method as claimed in claim 1 is characterized in that, describedly calculates the shortest path that arrives destination node from this node according to described first metric and described second metric, specifically comprises:
Calculate from this node according to described first metric and to arrive the first via in each path of destination node by cost;
Calculate the secondary route cost that arrives each path of destination node from this node according to described second metric;
Choose the first via by the path of cost and secondary route cost sum minimum as described shortest path.
4. route computing method as claimed in claim 3 is characterized in that, also comprises:
When described shortest path and first shortest path that arrives destination node from this node that calculates according to described first metric not simultaneously, this shortest path is added in the routing table.
5. route computing method as claimed in claim 1 is characterized in that, the described Link State Protocol Data Unit LSP that obtains each node in the network specifically comprises:
Obtain the LSP of this node generation and the LSP that other nodes are flooded to this node.
6. route computing method as claimed in claim 5 is characterized in that, also carries first thresholding and second thresholding among the described LSP, and described route computing method also comprises:
When described bandwidth availability ratio is lower than described first thresholding, abandon described LSP;
When described bandwidth availability ratio is between described first thresholding and described second thresholding, according to predetermined period described LSP is flooded;
When described bandwidth availability ratio is higher than described second thresholding, immediately described LSP is flooded.
7. route computing method as claimed in claim 6 is characterized in that:
Described LSP encapsulates based on the TLV22 data structure, be provided with sign in the described TLV22 data structure and carry out field and the sub-TLV data structure that route is calculated according to bandwidth availability ratio, described bandwidth availability ratio, described first thresholding and described second thresholding are arranged in the described sub-TLV data structure.
8. route computing method as claimed in claim 7 is characterized in that:
Also comprise in the described sub-TLV data structure for the sign bandwidth availability ratio whether less than the field of described first thresholding, and, be used for the sign bandwidth availability ratio whether greater than the field of described second thresholding.
9. a router is characterized in that, comprising:
Acquiring unit, the Link State Protocol Data Unit LSP for obtaining each node of network carries first metric of link and the bandwidth availability ratio of link among the described LSP;
First computing unit is used for second metric according to described bandwidth availability ratio calculating link; And
Second computing unit is used for calculating the shortest path that arrives destination node from this node according to described first metric and described second metric.
10. router as claimed in claim 9 is characterized in that, described first computing unit specifically is used for:
Described bandwidth availability ratio be multiply by predetermined weights, obtain described second metric.
11. router as claimed in claim 9 is characterized in that, described second computing unit specifically is used for:
Calculate from this node according to described first metric and to arrive the first via in each path of destination node by cost;
Calculate the secondary route cost that arrives each path of destination node from this node according to described second metric;
Choose the first via by the path of cost and secondary route cost sum minimum as described shortest path.
12. router as claimed in claim 11 is characterized in that, also comprises:
The route adding device, be used for when described shortest path and first shortest path that arrives destination node from this node that calculates according to described first metric not simultaneously, this shortest path is added in the routing table.
13. router as claimed in claim 9 is characterized in that, described acquiring unit specifically is used for:
Obtain the LSP of this node generation and the LSP that other nodes are flooded to this node.
14. router as claimed in claim 13 is characterized in that, also carries first thresholding and second thresholding among the described LSP, described router also comprises the unit that floods, and is used for:
When described bandwidth availability ratio is lower than described first thresholding, abandon described LSP;
When described bandwidth availability ratio is between described first thresholding and described second thresholding, according to predetermined period described LSP is flooded;
When described bandwidth availability ratio is higher than described second thresholding, immediately described LSP is flooded.
15. router as claimed in claim 14 is characterized in that:
Described LSP encapsulates based on the TLV22 data structure, be provided with sign in the described TLV22 data structure and carry out field and the sub-TLV data structure that route is calculated according to bandwidth availability ratio, described bandwidth availability ratio, described first thresholding and described second thresholding are arranged in the described sub-TLV data structure.
16. router as claimed in claim 15 is characterized in that:
Also comprise in the described sub-TLV data structure for the sign bandwidth availability ratio whether less than the field of described first thresholding, and, be used for the sign bandwidth availability ratio whether greater than the field of described second thresholding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110450915.9A CN103188149B (en) | 2011-12-28 | 2011-12-28 | A kind of route computing method and router |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110450915.9A CN103188149B (en) | 2011-12-28 | 2011-12-28 | A kind of route computing method and router |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103188149A true CN103188149A (en) | 2013-07-03 |
| CN103188149B CN103188149B (en) | 2016-05-25 |
Family
ID=48679120
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110450915.9A Active CN103188149B (en) | 2011-12-28 | 2011-12-28 | A kind of route computing method and router |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103188149B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104283807A (en) * | 2014-09-17 | 2015-01-14 | 杭州华三通信技术有限公司 | TE tunnel building method and device |
| CN104506374A (en) * | 2015-01-15 | 2015-04-08 | 安徽皖通邮电股份有限公司 | Method of specifying routing administrative distance through ISIS protocol |
| CN104917677A (en) * | 2014-03-10 | 2015-09-16 | 中兴通讯股份有限公司 | Data stream forwarding control method and system |
| WO2015154420A1 (en) * | 2014-07-01 | 2015-10-15 | 中兴通讯股份有限公司 | Isis-based routing calculation method and device |
| CN105227458A (en) * | 2014-07-01 | 2016-01-06 | 中兴通讯股份有限公司 | The route computing method of TRILL ISIS and device |
| WO2016078461A1 (en) * | 2014-11-18 | 2016-05-26 | 中兴通讯股份有限公司 | Path calculation method and path calculation server |
| CN105871745A (en) * | 2016-05-31 | 2016-08-17 | 浪潮集团有限公司 | Mixed-service-based dispatching method in SDN network |
| CN107786451A (en) * | 2016-08-30 | 2018-03-09 | 中兴通讯股份有限公司 | The transmission method and device of a kind of metadata |
| CN110113263A (en) * | 2019-05-16 | 2019-08-09 | 北京邮电大学 | A kind of communication path determines method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020172157A1 (en) * | 2001-03-12 | 2002-11-21 | Rhodes David L. | Method and system for fast computation of routes under multiple network states with communication continuation |
| CN101043444A (en) * | 2007-04-26 | 2007-09-26 | 浙江大学 | Distributed quality of service multicast routing process based on ant group optimization |
| CN101478705A (en) * | 2009-01-21 | 2009-07-08 | 电子科技大学 | Survivable service flow conducting method based on interlayer message routing |
| CN101895422A (en) * | 2010-07-12 | 2010-11-24 | 西安电子科技大学 | Method for optimizing resources of static-dynamic mixed service in three-layer network |
| CN102075444A (en) * | 2011-02-28 | 2011-05-25 | 北京邮电大学 | Network system and method for guaranteeing multi-type service quality |
-
2011
- 2011-12-28 CN CN201110450915.9A patent/CN103188149B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020172157A1 (en) * | 2001-03-12 | 2002-11-21 | Rhodes David L. | Method and system for fast computation of routes under multiple network states with communication continuation |
| CN101043444A (en) * | 2007-04-26 | 2007-09-26 | 浙江大学 | Distributed quality of service multicast routing process based on ant group optimization |
| CN101478705A (en) * | 2009-01-21 | 2009-07-08 | 电子科技大学 | Survivable service flow conducting method based on interlayer message routing |
| CN101895422A (en) * | 2010-07-12 | 2010-11-24 | 西安电子科技大学 | Method for optimizing resources of static-dynamic mixed service in three-layer network |
| CN102075444A (en) * | 2011-02-28 | 2011-05-25 | 北京邮电大学 | Network system and method for guaranteeing multi-type service quality |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104917677A (en) * | 2014-03-10 | 2015-09-16 | 中兴通讯股份有限公司 | Data stream forwarding control method and system |
| WO2015154420A1 (en) * | 2014-07-01 | 2015-10-15 | 中兴通讯股份有限公司 | Isis-based routing calculation method and device |
| CN105227458A (en) * | 2014-07-01 | 2016-01-06 | 中兴通讯股份有限公司 | The route computing method of TRILL ISIS and device |
| CN105227458B (en) * | 2014-07-01 | 2019-11-29 | 南京中兴新软件有限责任公司 | The route computing method and device of TRILL ISIS |
| CN104283807A (en) * | 2014-09-17 | 2015-01-14 | 杭州华三通信技术有限公司 | TE tunnel building method and device |
| CN104283807B (en) * | 2014-09-17 | 2018-07-24 | 新华三技术有限公司 | A kind of traffic engineering tunnel method for building up and device |
| WO2016078461A1 (en) * | 2014-11-18 | 2016-05-26 | 中兴通讯股份有限公司 | Path calculation method and path calculation server |
| CN104506374A (en) * | 2015-01-15 | 2015-04-08 | 安徽皖通邮电股份有限公司 | Method of specifying routing administrative distance through ISIS protocol |
| CN105871745A (en) * | 2016-05-31 | 2016-08-17 | 浪潮集团有限公司 | Mixed-service-based dispatching method in SDN network |
| CN107786451A (en) * | 2016-08-30 | 2018-03-09 | 中兴通讯股份有限公司 | The transmission method and device of a kind of metadata |
| CN110113263A (en) * | 2019-05-16 | 2019-08-09 | 北京邮电大学 | A kind of communication path determines method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103188149B (en) | 2016-05-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103188149A (en) | Routing computation method and router | |
| EP2614618B1 (en) | Automated traffic engineering for multi-protocol label switching (mpls) with link utilization as feedback into the tie-breaking mechanism | |
| CN101741709B (en) | Method and system for establishing label switched path and network node | |
| US8897141B2 (en) | Network system and routing method | |
| US8040906B2 (en) | Utilizing betweenness to determine forwarding state in a routed network | |
| EP2764728B1 (en) | Route prefix aggregation using reachable and non-reachable addresses in a computer network | |
| US8456982B2 (en) | System and method for fast network restoration | |
| US9282031B2 (en) | Network system and routing method | |
| US8619785B2 (en) | Pre-computing alternate forwarding state in a routed ethernet mesh network | |
| US9300569B2 (en) | Compressing data packet routing information using bloom filters | |
| CN105376162B (en) | A kind of link-state information notifying method and equipment | |
| CN108632146A (en) | The method and router of Message processing | |
| CN106973018A (en) | A kind of system and method for realizing topological clear area in network communications | |
| CN101355487B (en) | Method and apparatus for distributing label | |
| CN108476170A (en) | Two-way constrained path search | |
| CN106034071B (en) | Data message transmission method and edge route-bridge equipment | |
| CN103236990A (en) | Routing information synchronization method and equipment | |
| CN107979848B (en) | Detection method and device for standby path | |
| WO2016040210A1 (en) | Method for scalable computer network partitioning | |
| CN102316029B (en) | Fast rerouting method and routing equipment | |
| WO2017011278A1 (en) | Forwarding table management in computer networks | |
| Shan et al. | Partial spatial protection for provisioning differentiated reliability in FSTR-based Metro Ethernet networks | |
| CN102710499B (en) | Many issue sources external routes is for down hop system of selection and equipment thereof | |
| EP3198807A1 (en) | Method for end point identification in computer networks | |
| US11811611B2 (en) | System and method for backup flooding topology split |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |