CN101572674A - Routing computation method and device thereof - Google Patents
Routing computation method and device thereof Download PDFInfo
- Publication number
- CN101572674A CN101572674A CNA2009101478113A CN200910147811A CN101572674A CN 101572674 A CN101572674 A CN 101572674A CN A2009101478113 A CNA2009101478113 A CN A2009101478113A CN 200910147811 A CN200910147811 A CN 200910147811A CN 101572674 A CN101572674 A CN 101572674A
- Authority
- CN
- China
- Prior art keywords
- link
- value
- network equipment
- router
- overhead value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
The invention discloses a routing computation method. The method comprises the following steps: network equipment adjusts and acquires an overhead value of each link corresponding to the network equipment according to stable state of the links; the network equipment generates a link state notice information according to the overhead value, and generates a link state database according to the link state notice information and the link state notice information from other network equipment; and the network equipment generates a shortest path tree according to the link state database, and computes optimal routing according to the shortest path tree. The routing computation method helps save CPU resources and reduce traffic loss. The invention also provides a device corresponding to the routing computation method.
Description
Technical field
The present invention relates to communication technical field, particularly relate to a kind of route computing method and device.
Background technology
Flourish along with the applications of computer network, new networking products and network technology have obtained further development, OSPF (Open Shortest Path First, ospf) is a kind of widely used Routing Protocol, adopt the autonomous system of ospf protocol, can expand the scale of computer network through rational planning effectively.Wherein, OSPF is the dynamic routing protocol of an IGP based on Link State (InteriorGateway Protocol, Interior Gateway Protocol), is used for decision-making route in single AS (Autonomous System, autonomous system).The characteristics of this ospf protocol comprise: accommodation (support the network of various scales, can support hundreds of platform router at most); Convergence fast (after topology of networks changes, send immediately and upgrade message, this variation is upgraded in autonomous system synchronously); Loop free (since OSPF according to the Link State collected with shortest path tree algorithm computation route, from algorithm itself guaranteed can not generate self loop by); Area dividing (network of permission autonomous system is divided into the zone and manages, and the routing iinformation quilt of interregional transmission is further abstract, thereby has reduced the network bandwidth that takies) etc.
OSPF is the agreement that is used for finding route on computer network, calculates route, the basic ideas of this ospf protocol are: in autonomous system, each the operation OSPF router can collect separately interface and the information (being called Link State) of adjacency, and the Link State of broadcasting oneself in whole zone, make whole intra-zone safeguard a synchronous LSD; According to this synchronous LSD, router can calculate oneself to be root, is a path tree the shortest of leaf with other network node, thereby calculates the shortest path that oneself arrives each node of intra-zone.Wherein, link is the another kind of saying of router interface, and OSPF sets up LSD by the state of advertised network interface between the router, generates shortest path tree, and each ospf router uses these shortest path structure routing tables.The OSPF Routing Protocol is used in the same routed domain, and this routed domain is an autonomous system (i.e. one group of network of intercoursing routing iinformation by unified route policy or Routing Protocol); In this autonomous system, all ospf routers are all safeguarded the database of this AS structure of identical description, what deposit in this database is the state information of respective link in the routed domain, and ospf router calculates its ospf routing table by this database just.As shown in Figure 1, whole autonomous system can be divided into several zones, and each is interregional, and the routing iinformation in zone calculates route by exchanging separately each other with backbone area.Wherein, this calculating route is specially by shortest-path first algorithm and obtains, and the basic step of this shortest-path first algorithm comprises between the router in (1) autonomous system the link-state information of exchange needs mutually; (2) router in the autonomous system calculates shortest path tree according to shortest path first; (3) route in the autonomous system calculates optimum route according to shortest path tree.Concrete, in present network application, often there be dozens or even hundreds of router in the ospf area, tens even LSD of up to a hundred routers maintenances are promptly arranged simultaneously, when a link change, all links all can move shortest-path first algorithm and recomputate route.
In the prior art, all can move the problem that shortest-path first algorithm recomputates route, a kind of method that does not need to recomputate shortest path tree of having deducted a percentage in order to solve an all link of link change.In the ospf area, the Metric value (overhead value) that the interpolation of link is equivalent to this link (needs add link) has been varied to effective value from infinity and (has added before not this link, be that the Metric value is for infinitely great, there has been afterwards this link and add, be that the Metric value has been varied to effective value), corresponding, the Metric that the deletion of link just is equivalent to this link has been increased to infinity from effective value, i.e. the interpolation of link changes and deletion changes the variation that can be regarded as the Metric value.In present application, often not only link connection promptly needs to exist a backup link from the source end to destination, when guaranteeing that a link is unavailable, there is remaining backup link still to keep being communicated with, as shown in Figure 2, when reserve link disconnects, do not need to calculate shortest path tree, whether the amount of calculation of CPU is very little, and when link-recovery, no matter be reserve link then, need to calculate shortest path tree equally, upgrade relevant route again.For example, data traffic arrives Router D from Router B 2 links, and wherein this link of B-C-D is that backup as this link of B-D exists.Wherein, by OSPF route learning and calculating (selecting) according to the Metric value, the route that obtains optimal path B-D link can arrive Router D, at this moment data traffic just can when reserve link (this link of B-C-D) disconnects, not need to calculate shortest path tree from process on the B-D link, state and instability when active link, for example the UP/DOWN that do not stop of port causes the concussion that the B-D link is frequent, need recomputate shortest path tree.
Based on top analysis, when calculating route, there is following shortcoming at present:
State and instability when active link (B-D link), the UP/DOWN that do not stop of port for example, thereby when causing the frequent concussion of B-D link, will cause all continuous repeated calculation shortest path trees of ospf routers all in region-wide, upgrade routing table, consume the cpu resource of whole network equipment, need the time owing to need switch to backup path simultaneously, cause data traffic on this link, constantly to have and lose.Under present realization, when B-D link UP, pass through the SPF algorithm among the OSPF at every turn after, the result is the same, the B-D link can be constantly selected, a path that passes through as flow (because Metric value is constant, B-D link when UP still as the optimal path existence).This has just caused, and all continuous calculating of equipment is an identical shortest path tree in fact in the autonomous system, seriously taken the cpu resource of whole autonomous system, and because link of this frequent concussion is by choosing repeatedly, link switches repeatedly, flow losing on link in this concussion repeatedly.Long more along with time of link concussion, the meeting of traffic loss is serious more.
Summary of the invention
The invention provides a kind of route computing method and device,, reduce losing of flow to save cpu resource.
In order to achieve the above object, the present invention proposes a kind of route computing method, be applied in the autonomous system, comprise in the described autonomous system and use the ospf ospf protocol to carry out at least one network equipment that route is calculated, said method comprising the steps of:
The described network equipment is according to the stability state adjustment of link and obtain the overhead value of every the link corresponding with the described network equipment;
The described network equipment generates link state notification information according to described overhead value, and according to described link state notification information with from the link state notification information of other network equipments, generates LSD;
The described network equipment generates shortest path tree according to described LSD, and calculates optimum route according to described shortest path tree.
Preferably, the described network equipment specifically comprises according to the stability state adjustment of link and the overhead value of obtaining every link corresponding with the described network equipment:
When the stability state of described link was unstable link, the described network equipment was according to the concussion number of times adjustment of described unstable link and obtain the every paths overhead value corresponding with the described network equipment; When the concussion number of times of described unstable link surpasses the minimum threshold that increases penalty value, the every concussion of link once, the described network equipment upgrades the overhead value of every the link corresponding with the described network equipment according to the concussion number of times.
Preferably, the described network equipment upgrades before the overhead value of every link corresponding with the described network equipment according to the concussion number of times, also comprises:
The described network equipment calculates the concussion number of times of unstable link by the counter that sets in advance;
The described network equipment specifically comprises according to the overhead value that the concussion number of times upgrades every link corresponding with the described network equipment:
The corresponding relation of the described network equipment default concussion number of times and grade, the different penalty value of the corresponding increase of different brackets;
When if described concussion number of times surpasses corresponding threshold value,, progressively increase described overhead value according to the penalty value of described grade correspondence along with increasing progressively of concussion number of times;
If described concussion number of times surpasses the threshold value of highest ranking, described overhead value is increased to maximum.
Preferably, the described network equipment also comprises according to the overhead value that the concussion number of times upgrades every link corresponding with the described network equipment:
When the described network equipment determines that by the timer that sets in advance described unstable link-recovery is consistent link in Preset Time, the described default time of every process, reduce the overhead value of described unstable link correspondence, return to the overhead value of initial link circuit when stablizing always.
Preferably, describedly calculate optimum route according to shortest path tree and specifically comprise:
It is optimum route that the described network equipment is selected the link of overhead value minimum in the shortest path tree.
The invention allows for a kind of route calculation element, be applied in the autonomous system, comprise in the described autonomous system and use the ospf ospf protocol to carry out at least one network equipment that route is calculated, described device comprises:
Processing module is used for according to the stability state adjustment of link and obtains the overhead value of every the link corresponding with the described network equipment;
Generation module, electrically connect with described processing module, be used for generating link state notification information, and, generate LSD according to described link state notification information with from the link state notification information of other network equipments according to described processing module adjustment and the overhead value obtained;
Computing module electrically connects with described generation module, and the LSD that is used for generating according to described generation module generates shortest path tree, and calculates optimum route according to described shortest path tree.
Preferably, described processing module specifically is used for:
When the stability state of described link is unstable link, according to the concussion number of times adjustment of described unstable link and obtain the every paths overhead value corresponding with the described network equipment; When the concussion number of times of described unstable link surpasses the minimum threshold that increases penalty value, the every concussion of link once, the described network equipment upgrades the overhead value of every the link corresponding with the described network equipment according to the concussion number of times.
Preferably, described processing module also is used for:
Calculate the concussion number of times of unstable link by the counter that sets in advance; And the corresponding relation of default concussion number of times and grade, the different penalty value of the corresponding increase of different brackets;
When if described concussion number of times surpasses corresponding threshold value,, progressively increase described overhead value according to the penalty value of described grade correspondence along with increasing progressively of concussion number of times;
If described concussion number of times surpasses the threshold value of highest ranking, described overhead value is increased to maximum.
Preferably, described processing module also is used for:
When determining that by the timer that sets in advance described unstable link-recovery is consistent link in Preset Time, the described default time of every process, reduce the overhead value of described unstable link correspondence, return to the overhead value of initial link circuit when stablizing always.
Preferably, described computing module specifically is used for:
Selecting the link of overhead value minimum in the shortest path tree is optimum route.
Compared with prior art, the present invention has the following advantages: by configuration counter and timer on router, use this counter and timer to obtain the overhead value in concussion path, and the path of selecting the overhead value minimum is the optimal path of transmission data, in the time of can in the networking of various scales, calculating route, avoid unreliable link to greatest extent, the effective waste that reduces the cpu resource of the whole autonomous system that causes because of the optimum link concussion, minimizing is greatly shaken the traffic loss that causes for a long time repeatedly because of link.
Description of drawings
Fig. 1 is the schematic diagram of autonomous system in the prior art;
Fig. 2 is the schematic diagram of active link and backup link in the prior art;
A kind of route computing method flow chart that Fig. 3 proposes for the present invention;
The networking model figure that Fig. 4 proposes down for a kind of concrete application scenarios of the present invention;
Fig. 5 is for using the route computing method flow chart of networking model figure shown in Figure 4;
The structure drawing of device that Fig. 6 calculates for a kind of route that the present invention proposes.
Embodiment
Core concept of the present invention is in the autonomous system based on ospf protocol, router is according to self link information generation link corresponding state advertisement LSA, when concussion takes place in link, the concussion number of times that obtains according to counter obtains LSA again, carried the overhead value of link in the above-mentioned LSA, the all-router of router in autonomous system transmitted this LSA, make the all-router in the autonomous system all safeguard identical connection status database, when data flow need be transmitted in autonomous system, by using the overhead value between each link that carries in the connection status database, selecting the link of overhead value minimum is optimum link, and by using this optimum link to carry out transfer of data, avoid unreliable link to greatest extent, the effective waste that reduces the cpu resource of the whole autonomous system that causes because of the optimum link concussion, minimizing is greatly shaken the traffic loss that causes for a long time repeatedly because of link.
A kind of route computing method that the present invention proposes is applied in the autonomous system, comprises in the described autonomous system using the ospf ospf protocol to carry out at least one network equipment that route is calculated, and as shown in Figure 3, said method comprising the steps of:
Step S301, the described network equipment is according to the stability state adjustment of link and obtain the overhead value of every the link corresponding with the described network equipment.
Wherein, when the stability state of described link was consistent link, the described network equipment obtained every link overhead value according to preset strategy; Or the stability state of described link is when being unstable link, and the described network equipment is according to the concussion information adjustment of described unstable link and obtain the every paths overhead value corresponding with the described network equipment.
Further, when the concussion number of times of described unstable link surpasses the minimum threshold that increases penalty value, the every concussion of link once, the described network equipment upgrades the overhead value of every the link corresponding with the described network equipment according to the concussion number of times.
Concrete, the described network equipment calculates the concussion number of times of unstable link by the counter that sets in advance, and adjusts the overhead value of described unstable link according to the concussion number of times of described unstable link.The overhead value that described concussion number of times according to unstable link is adjusted described unstable link specifically comprises: the corresponding relation of the described network equipment default concussion number of times and grade, the different penalty value of the corresponding increase of different brackets; When if described concussion number of times surpasses corresponding threshold value,, progressively increase described overhead value according to the penalty value of described grade correspondence along with increasing progressively of concussion number of times; If described concussion number of times surpasses the threshold value of highest ranking, described overhead value is increased to maximum.
Below the overhead value of adjusting described unstable link according to the concussion number of times of described unstable link is described in detail, wherein, the described network equipment can calculate the concussion number of times of unstable link by the counter that sets in advance, when described concussion number of times does not surpass preset first threshold, every concussion once, the overhead value of described unstable link increases by the first default numerical value; Or when described concussion number of times surpasses preset first threshold, every concussion once, the overhead value of described unstable link increases default second value.For example, this first threshold value is set to 5, when concussion number of times when being not more than 5, every concussion once, the overhead value of unstable link increases by 1 (first numerical value); When swinging number of times greater than 5 the time, every concussion once, the overhead value of unstable link increases default second value 5 (or the overhead value of unstable link increases current overhead value, and promptly current overhead value is, the overhead value of unstable link is increased by 10) at 10 o'clock.
Further, counter can also set in advance 2 threshold values, the described network equipment calculates the concussion number of times of unstable link by the counter that sets in advance, when described concussion number of times surpasses the preset second threshold value, every concussion once, the overhead value of described unstable link increases default third value; Or when described concussion number of times surpasses the 3rd default threshold value, every concussion once, the overhead value of described unstable link increases the 4th default numerical value.For example, this second threshold value is set to 3, the three threshold values and is set to 7, when the concussion number of times greater than 3 the time, every concussion once, the overhead value of unstable link increases by 1 (third value); When swinging number of times greater than 7 the time, every concussion once, the overhead value of unstable link increases the 4th default numerical value 5 (or the overhead value of unstable link increases current overhead value, and promptly current overhead value is, the overhead value of unstable link is increased by 10) at 10 o'clock.Among the present invention, when shaking number of times less than 3 (preset second threshold), can not increase the numerical value of overhead value according to actual needs or increase corresponding numerical value, when the concussion number of times is a lot of, (surpass the 4th default threshold value), can also be according to actual needs directly overhead value be set to maximum (for example, 65535).
Further, when the described network equipment determines that by the timer that sets in advance described unstable link-recovery is consistent link in Preset Time, the described default time of every process (for example, 30 minutes), reduce the overhead value of described unstable link correspondence, return to the overhead value of initial link circuit when stablizing always.Be specifically as follows the overhead value of described unstable link correspondence is reduced the 5th default numerical value, return to the overhead value of initial link circuit when stablizing always.To be the described network equipment determine by the timer that sets in advance that Link State is in the default time stablely (situation of once shaking promptly do not occur, if the concussion situation occurred in 30 minutes, then restart timing) time, the described default time of every process (promptly 30 minutes), described overhead value (is for example reduced the 5th default numerical value, the 5th numerical value is set to 1), until described overhead value returns to initial overhead value.
Step S302, the described network equipment generates link state notification information according to described overhead value, and other network equipments in described autonomous system send described link state notification information.
Step S303, the described network equipment generates LSD according to described link state notification information with from the link state notification information of other network equipments.
Step S304, the described network equipment generates shortest path tree according to described LSD, and calculates optimum route according to described shortest path tree.
Wherein, the link of overhead value minimum is optimum route in the described network equipment selection shortest path tree.
The network equipment described in the present invention as alternative path, when described optimum route breaks down, is reselected optimum route according to the minimum principle of priority of overhead value with qualified mulitpath in the described shortest path tree in all alternative paths; Or
The described network equipment with qualified mulitpath in the described shortest path tree as alternative path, when described optimum route breaks down, under the identical situation of part alternative path cost value, in all alternative paths, reselect optimum route according to minimum principle of priority of overhead value and polling principle.
As seen, among the present invention, by configuration counter and timer on router, use this counter and timer to obtain the overhead value in concussion path, and the path of selecting the overhead value minimum is the optimal path of transmission data, in the time of can in the networking of various scales, calculating route, avoid unreliable link to greatest extent, the effective waste that reduces the cpu resource of the whole autonomous system that causes because of the optimum link concussion, minimizing is greatly shaken the traffic loss that causes for a long time repeatedly because of link.
The route computing method that a kind of application scenarios of the present invention proposes down, this route computing method are applied in the AS system that ospf protocol forms, and this autonomous system is to have same routing policy, the set of router that moves under same technical management department.Wherein, in this autonomous system, Router ID is a 32 bit unsigned integer, can identify a router in an autonomous system uniquely; The zone is one group of ospf router and link in logic, can reduce internet scale and increases the adverse effect of bringing to router performance by an ospf domain being divided into the zone; Backbone area is that regional number is 0 special area, is responsible at non-key interval propagation routing iinformation; Area Border Router is to connect the router of one or more zone to backbone area, is responsible for transmitting the routing iinformation between zones of different, and this Area Border Router must belong to plural zone simultaneously; Autonomous System Boundary Router, AS Boundary Router is and the router of other AS exchanging routing informations, introduces the route that other routing protocol is learnt.Concrete, by using LSA (Link State Advertisement, LSA) all link information and the Link States of router are described, this link can be to other ospf router link, to the link of other Local Area Network, or to the link of external network; And LSDB (Link State DataBase, LSD) is the LSD that all LSA form, OSPF utilizes LSDB (connection status database) and uses SPF (Shortest Path First, SPF) algorithm to carry out route and calculate.With networking model figure shown in Figure 4 is that example is described the route computing method that proposes among the present invention, among Fig. 4, not to the autonomous system zoning, also just do not have Area Border Router and Autonomous System Boundary Router, AS Boundary Router, Router ID unique identification respectively is router S, router B, router-A and router D.As shown in Figure 5, be the route computing method that application scenarios shown in Figure 4 proposes down, this method may further comprise the steps:
Step S501 is provided with counter and timer on the router in autonomous system.
Wherein, the router in this autonomous system is router S, router B, router-A and router D, and this counter is used to calculate the concussion number of times of link in the autonomous system, and this timer is used to the timing of concussion time.Step S505 is below described in the concrete application of this counter and timer in detail, does not repeat them here.
Step S502, the router in the autonomous system are all according to self link information generation link corresponding state advertisement LSA.For example, router S generates corresponding LSA according to the link information of self, is used for describing router S link information (for example, describe the link information between router S and the router B, and describe the link information between router S and the router-A) on every side; Wherein, LSA describes the network segment information (network segment information between the network segment information between router S and the router B, router S and the router-A) of link, mask information (mask information between the mask information between router S and the router B, router S and the router-A) etc.; In addition, LSA also needs to describe metric (expense) value information (for example, the overhead value of the link between router S and the router B is set to 2, and the overhead value of the link between router S and the router-A is set to 3) of link; Wherein, the metric value obtains according to predetermined strategy, for example, calculates metric value by interface bandwidth, or to pass through manual configuration metric value be fixed value.
Among the present invention, by this overhead value of use metric value representation, and by using this metric value representation path, wherein, allow webmaster manually to compose with the metric value to each link in the ospf protocol, at this moment, route length is the metric value summation of each link of passing through.
Same, router B generates corresponding LSA according to the link information of self, is used for describing router B link information (describe the link information between router B and the router S, and describe the link information between router B and the router D) on every side; Router-A generates corresponding LSA according to the link information of self, is used for describing router-A link information (describe the link information between router-A and the router S, and describe the link information between router-A and the router D) on every side; Router D generates corresponding LSA according to the link information of self, is used for describing router D link information (for example, describe the link information between router D and the router-A, and describe the link information between router D and the router B) on every side; Wherein, the content of carrying among the LSA is identical according to the content of carrying among the corresponding LSA of the link information generation of self with router S, does not repeat them here.
Step S503, the all-router in the autonomous system all carry out the mutual of OSPF message, and promptly the every other router of the router in the autonomous system in this autonomous system sends OSPF message, the LSA information of having carried this router in this OSPF message.
Wherein, router S sends the LSA information of this router S to router B, router-A and router D, same, router B, router-A and router D also all can send LSA information to other 3 routers, be the mutual LSA that has separately of exchange between each router, the all-router in autonomous system all has (router S, router B, router-A and router D have identical LSA) till all identical LSA.At this moment, all routers all will be safeguarded an identical LSDB, carry the LSA information among above-mentioned all-router S, router B, router-A and the router D among this LSDB.Conspicuous, LSA is the description to router ambient network topological structure, and LSDB then is the description to the network topology structure of whole autonomous system.
Need to prove, carried the overhead value information between all links in this LSDB, for example, the overhead value between link router S and the router B is 2, and the overhead value between link router S and the router-A is 3 etc.
Step S504, the router in the autonomous system generate oneself to be the shortest path tree of root according to identical LSDB.Wherein, all can to generate with oneself be the shortest path tree of root to the all-router in the autonomous system.
Router converts LSDB the directed graph of a cum rights to after generating LSDB, this directed graph is the true reflection to whole network topology structure, and the directed graph that each router obtains is identical.Every router uses the SPF algorithm computation to go out one with oneself shortest path tree as root according to this directed graph, and this tree has provided the route of each node in the autonomous system.Wherein, router compares clauses and subclauses among the LSDB and LSA oneself to be root node, and through the recurrence of several times with recall, the network segment that comprises in all LSA until router all finds path (this route is inserted in the routing table).
Among the present invention, the router in autonomous system carries out the reciprocal process of information by following message, and hello packet is by periodically sending discovery and maintaining adjacent relation; DD (LSD description) message is described the LSDB that local router is preserved; LSR (LS Request, Link State request) message, the LSA that does not have to neighbor request this locality; LSU (LS Update, Link State upgrade) message sends the LSA of its request or renewal to neighbours; LS ACK (link state acknowledgment) message is received the affirmation message that sends behind the LSA that neighbours send.
Step S505, when concussion took place the link in the autonomous system, router regenerated the link corresponding state advertisement according to concussion information, carries overhead value information in this LSA.
Among the present invention, with networking model shown in Figure 4 is that example describes, overhead value information between all links that carry in LSDB is specially: the overhead value between link router S and the router B is 5, overhead value between link router S and the router-A is 1, overhead value between link router B and the router D is 1, and the overhead value between link router-A and the router D is 1.
When the Link State of the path tree between the all-router in the autonomous system is stablized, the pin value information that carries among this LSDB can not change, it is optimum route that router can be selected the link of overhead value minimum in the shortest path tree, and by using these optimum route transmission data.For example, when having data flow and to arrive router D by router S, have two links to select, promptly by the link between router S and the router B, the link between router B and the router D is transferred to router D with data flow from router S; Or by the link between router S and the router-A, the link between router-A and the router D is transferred to router D with data flow from router S; Need to prove, owing to be consistent link, the overhead value of every link can not change, when by router B with data flow when router S is transferred to router D, overhead value is 6 (overhead value of the link between router S and the router B is 5, and the overhead value of the link between router B and the router D is 1); When by router-A with data flow when router S is transferred to router D, overhead value is 2 (overhead value of the link between router S and the router-A is 1, and the overhead value of the link between router-A and the router D is 1); In summary it can be seen that the overhead value in path that data flow is transferred to router D from router S by router-A is little, promptly this path is for to select optimum route for data flow from shortest path tree.
Further, when the Link State of the path tree between the all-router in the autonomous system state of part of links (or have) is unstable, be link when being unstable link, this router need regain overhead value according to concussion information, and regains LSA according to this overhead value.
Wherein, regaining overhead value according to concussion information is to realize by the counter and the timer that are provided with among the step S501, for this counter is provided with 2 default threshold values, with two default numerical value, wherein, these 2 default threshold values are respectively first threshold value and second threshold value, these two default numerical value are respectively first numerical value and second value, for example, this first threshold value is set to 5, this second threshold value is set to 20, and this first numerical value is set to 1, and this second value is set to current overhead value; Certainly, among the present invention, the threshold value of above-mentioned setting and numerical value can be chosen arbitrarily, are not limited to above-mentioned mode, do not repeat them here.
Correspond among the present invention, being equivalent to counter, first threshold value is set is 5, when the concussion number of times surpasses threshold value 5 times, on original Metric base value that the LSA link is described, increase penalty value (this penalty value is the first default numerical value 1), wherein, original Metric base value that this LSA link is described is the overhead value information in the connection status database, for example, link Metric base value is 10, after this link begins concussion, when shaking at every turn, the Metric value of this link should increase by 1, when shaking for the first time, link Metric value is 10+1=11, and the overhead value that promptly regains is 11; When the concussion number of times surpasses preset first threshold 5, every many concussions once, penalty value just increases and is twice (be about to the Metric base value and take advantage of 2).For example, the current Metric value of link is 10 (5 Metric values afterwards of this link concussion), and when shaking once more, the Metric value of this link should be 20, and the overhead value that promptly regains is 20; When the concussion number of times surpasses the preset second threshold value (20 times), when shaking once more, directly the Metric value is set to maximum (65535).
Among the present invention, 3 default threshold values can also be set, for example, first threshold value is set to 3, second threshold value is set to 7, the 3rd threshold value is set to 20, when the concussion number of times surpasses first threshold value 3 times, can select to increase on no longer original Metric base value penalty value (or selecting penalty value according to actual needs), when concussion number of times during greater than default first threshold value 3, when shaking at every turn, the Metric value of this link should increase by 1, when the 4th concussion, link Metric value is 10+1=11 (initial Metric value is 10), and the overhead value that promptly regains is 11; When the concussion number of times surpasses preset second threshold and is worth 7, every many concussions once, penalty value just increases and is twice (be about to the Metric base value and take advantage of 2).For example, the current Metric value of link is 10 (7 Metric values afterwards of this link concussion), and when shaking once more, the Metric value of this link should be 20, and the overhead value that promptly regains is 20; When the concussion number of times surpasses the 3rd default threshold value (20 times), when shaking once more, directly the Metric value is set to maximum (65535).
Further, by using the timer that is provided with among the above-mentioned steps S501, every process after default time (for example, 0.5 hour), counter is deducted default third value, this third value is what choose arbitrarily according to the situation of reality, for example, can choose suitable numerical value for this third value and increase the inverse operation of numerical value to make above-mentioned counter, when concussion number of times when being 12 times, counter takes advantage of 2 with the Metric base value as can be known, when in 0.5 hour (default time) all not when taking place to shake, Metric value that can be current is divided by 2 (being that third value is set to half of current Metric value), to do the inverse operation of above-mentioned counter.Same, when the concussion number of times is 8 times (is that example describes so that 3 threshold values to be set), counter is Metric base value+1 as can be known, when in 0.5 hour (default time) all not when taking place to shake, Metric value that can be current deducts 1 (being that third value is set to 1).After Counter Value was not more than preset first threshold (3), with the penalty value zero clearing, the Metric value reverted to base value, the original Metric numerical value of promptly storing in the connection status database.
In summary it can be seen that router calculates the concussion number of times of unstable link by the counter that sets in advance, when described concussion number of times (does not for example surpass preset first threshold, 5) time, every concussion once, the overhead value of described unstable link increases default first numerical value (for example, 1); Or when described concussion number of times surpasses preset first threshold, every concussion once, the overhead value of described unstable link increases default second value (for example, 5).
Further, router calculates the concussion number of times of unstable link by the counter that sets in advance, when described concussion number of times (for example surpasses preset first threshold, 3) time, every concussion once, the overhead value of described unstable link increases default first numerical value (for example, 1); Or when described concussion number of times surpasses preset second threshold value (for example, 7), every concussion once, the overhead value of described unstable link increases default second value (for example, 5).
Further, router determines that by the timer that sets in advance Link State is when stablizing in the default time, the time that every process is default, overhead value information in the connection status database of consistent link state correspondence is reduced default numerical value, until overhead value returns to initial overhead value.
Figure 4 shows that example describes, and be example counter is provided with two threshold values, the original overhead value of storing in the connection status database is that the overhead value between link router S and the router B is 5, overhead value between link router S and the router-A is 1, overhead value between link router B and the router D is 1, and the overhead value between link router-A and the router D is 1; Calculate through the SPF route, router S arrives the optimal path of router D for to transmit by router-A, and overhead value Metric is 2, (and be 6 by the expense Metric that router B transmits).If this moment, router-A began to go wrong, link begins to shake repeatedly between router-A and the router D, the every concussion of link once, router-A all with port that router D links to each other on the Metric value is added 1 (for exceeding default first thresholding), until (for example reaching first threshold value, thresholding is 5), the Metric value of router-A arrival this moment router D is 6 (1+5), promptly the overhead value Metric that carries out the link of transfer of data by router-A has become 7, and still be 6 by the expense Metric that router B transmits, in subsequent step, calculate through the SPF route, router S arrives the optimum route of router D for to transmit by router B.If link is still in concussion repeatedly between router-A and the router D, the every concussion of link once, router-A will with Metric on duty 2 on the port that router D links to each other, and the like, until the concussion number of times reaches the preset second threshold value, the Metric value directly is set to maximum (for example, being set to 65535).
Among the present invention, if router-A stops concussion, each (for example arrival after the default time, 0.5 hour), the Metric value all can be successively decreased, for example, current Metric value is 65535, after router-A stopped to shake 0.5 hour, router-A will directly become 20 pairing Metric values of concussion with Metric value on the port that router D links to each other, after stopping again shaking 0.5 hour, the Metric value is directly become concussion 19 pairing Metric values (shaking 20 pairing Metric values divided by 2), and the like, after the Metric value becomes 5 pairing Metric values of concussion, after having spent 0.5 hour again, the Metric value is directly become concussion 4 pairing Metric values (shake 5 pairing Metric values and deduct 1), and the like, the Metric value was less than 6 o'clock, promptly the Metric value of transmitting by router-A is less than the Metric value of transmitting by router B, link can switch to get back to by router-A and transmits, the optimal path that is router S arrival router D is communicated with thereby guarantee to have stable link to make router S arrive router D always for to transmit by router-A, has guaranteed the stability of data traffic.
After having regained overhead value, router generates the link corresponding state advertisement according to this overhead value, and this LSA of transmission in other autonomous systems in autonomous system, make the router in the autonomous system generate LSDB according to this new LSA, and generate oneself to be the shortest path tree of root according to this LSDB, promptly repeat above-mentioned step S502 and step S504.
After shaking once more, regain overhead value, and repeat above-mentioned step S502 and step S504, do not repeat them here.
Among the present invention, router is selected optimum route to be specially for data flow from path tree and is selected the optimum route of the transmission path of path cost value minimum for this data flow according to every paths overhead value in the path tree.
Further, router with qualified mulitpath in the path tree as alternative path (for example, shown in Figure 4 when passing through router-A the path of transfer of data to router D of router S being active link, when transmitting then for reserve link) by router B, when the transmission path of optimum breaks down (being broken down in the path of transfer of data to router D of router S by router-A), in all alternative paths, reselect optimum route according to the minimum principle of priority of overhead value; Or router with qualified mulitpath in the path tree as alternative path, when the transmission path of optimum breaks down, under the identical situation of part alternative path cost value, in all alternative paths, reselect optimum route according to minimum principle of priority of overhead value and polling principle.
The method that the application of the invention provides, configuration counter and timer on router, by using this counter and timer to obtain the overhead value in concussion path, and the path of selecting the overhead value minimum is the optimum route of transmission data, in the time of can in the networking of various scales, calculating route, avoid unreliable link to greatest extent, the effective waste that reduces the cpu resource of the whole autonomous system that causes because of the optimum link concussion, minimizing is greatly shaken the traffic loss that causes for a long time repeatedly because of link.
The inventive method can be adjusted each sequence of steps according to actual needs.
The invention allows for the device that a kind of route is calculated, be applied in the autonomous system, comprise in the described autonomous system and use the ospf ospf protocol to carry out at least one network equipment that route is calculated, the device that this route is calculated is a router, as shown in Figure 6, described device comprises:
Processing module 61 is used for according to the stability state adjustment of link and obtains the overhead value of every the link corresponding with the described network equipment.
Wherein, when the stability state of described link was consistent link, described processing module 61 obtained every paths overhead value according to preset strategy; Or the stability state of described link is when being unstable link, and described processing module 61 is according to the concussion number of times adjustment of described unstable link and obtain the every paths overhead value corresponding with the described network equipment.
Further, when the concussion number of times of described unstable link surpasses the minimum threshold that increases penalty value, when the every concussion of link once, processing module 61 is upgraded the overhead value of every the link corresponding with the described network equipment according to the concussion number of times.
Concrete, described processing module 61 is calculated the concussion number of times of unstable link by the counter that sets in advance, and adjusts the overhead value of described unstable link according to the concussion number of times of described unstable link;
Be specially corresponding relation, the different penalty value of the corresponding increase of different brackets by default concussion number of times and grade; When if described concussion number of times surpasses corresponding threshold value,, progressively increase described overhead value according to the penalty value of described grade correspondence along with increasing progressively of concussion number of times; If described concussion number of times surpasses the threshold value of highest ranking, described overhead value is increased to maximum.
Below the overhead value of adjusting described unstable link according to the concussion number of times of described unstable link is described in detail, wherein, the described network equipment can calculate the concussion number of times of unstable link by the counter that sets in advance, when described concussion number of times does not surpass preset first threshold, every concussion once, the overhead value of described unstable link increases by the first default numerical value; Or when described concussion number of times surpasses preset first threshold, every concussion once, the overhead value of described unstable link increases default second value.For example, this first threshold value is set to 5, when concussion number of times when being not more than 5, every concussion once, the overhead value of unstable link increases by 1 (first numerical value); When swinging number of times greater than 5 the time, every concussion once, the overhead value of unstable link increases default second value 5 (or the overhead value of unstable link increases current overhead value, and promptly current overhead value is, the overhead value of unstable link is increased by 10) at 10 o'clock.
Further, counter can also set in advance 2 threshold values, described acquisition module 61 calculates the concussion number of times of unstable link by the counter that sets in advance, when described concussion number of times surpasses the preset second threshold value, every concussion once, the overhead value of described unstable link increases default third value; Or when described concussion number of times surpasses the 3rd default threshold value, every concussion once, the overhead value of described unstable link increases the 4th default numerical value.For example, this second threshold value is set to 3, the three threshold values and is set to 7, when the concussion number of times greater than 3 the time, every concussion once, the overhead value of unstable link increases by 1 (third value); When swinging number of times greater than 7 the time, every concussion once, the overhead value of unstable link increases the 4th default numerical value 5 (or the overhead value of unstable link increases current overhead value, and promptly current overhead value is, the overhead value of unstable link is increased by 10) at 10 o'clock.Among the present invention, when shaking number of times less than 3 (preset second threshold), can not increase the numerical value of overhead value according to actual needs or increase corresponding numerical value, when the concussion number of times a lot (surpasses the 4th default threshold value), can also be according to actual needs directly overhead value be set to maximum (for example, 65535).Be that described acquisition module 61 also is used for when described concussion number of times surpasses the 4th default threshold value, the overhead value of described unstable link is set to maximum.
Further, when described processing module 61 determines that by the timer that sets in advance described unstable link-recovery is consistent link in Preset Time, the described default time of every process, reduce the overhead value of described unstable link correspondence, return to the overhead value of initial link circuit when stablizing always.Be specifically as follows the overhead value of described unstable link correspondence is reduced the 5th default numerical value, return to the overhead value of initial link circuit when stablizing always.To be the described network equipment determine by the timer that sets in advance that Link State is in the default time stablely (situation of once shaking promptly do not occur, if the concussion situation occurred in 30 minutes, then restart timing) time, the described default time of every process (promptly 30 minutes), described overhead value (is for example reduced the 5th default numerical value, the 5th numerical value is set to 1), until described overhead value returns to initial overhead value.
Generation module 62, electrically connect with described processing module 61, be used for generating link state notification information according to the overhead value that described processing module 61 is adjusted and obtained, and, generate LSD according to described link state notification information with from the link state notification information of other network equipments.
Computing module 63 electrically connects with described generation module 62, is used for generating shortest path tree according to the LSD that described generation module 62 generates, and calculates optimum route according to described shortest path tree.
Wherein, the link of overhead value minimum is optimum route in the described computing module 63 selection shortest path trees; Qualified mulitpath in the described shortest path tree as alternative path, when described optimum route breaks down, is reselected optimum route according to the minimum principle of priority of overhead value in all alternative paths; Or with qualified mulitpath in the described shortest path tree as alternative path, when described optimum route breaks down, under the identical situation of part alternative path cost value, in all alternative paths, reselect optimum route according to minimum principle of priority of overhead value and polling principle.
The device that the application of the invention provides, configuration counter and timer on router, by using this counter and timer to obtain the overhead value in concussion path, and the path of selecting the overhead value minimum is the optimal path of transmission data, in the time of can in the networking of various scales, calculating route, avoid unreliable link to greatest extent, the effective waste that reduces the cpu resource of the whole autonomous system that causes because of the optimum link concussion, minimizing is greatly shaken the traffic loss that causes for a long time repeatedly because of link.
Wherein, each module of apparatus of the present invention can be integrated in one, and also can separate deployment.Above-mentioned module can be merged into a module, also can further split into a plurality of submodules.
Through the above description of the embodiments, those skilled in the art can be well understood to the present invention and can realize by hardware, also can realize by the mode that software adds necessary general hardware platform.Based on such understanding, technical scheme of the present invention can embody with the form of software product, it (can be CD-ROM that this software product can be stored in a non-volatile memory medium, USB flash disk, portable hard drive etc.) in, comprise some instructions with so that computer equipment (can be personal computer, server, the perhaps network equipment etc.) carry out the described method of each embodiment of the present invention.
It will be appreciated by those skilled in the art that accompanying drawing is the schematic diagram of a preferred embodiment, module in the accompanying drawing or flow process might not be that enforcement the present invention is necessary.
It will be appreciated by those skilled in the art that the module in the device among the embodiment can be distributed in the device of embodiment according to the embodiment description, also can carry out respective change and be arranged in the one or more devices that are different from present embodiment.The module of the foregoing description can be merged into a module, also can further split into a plurality of submodules.
The invention described above sequence number is not represented the quality of embodiment just to description.
More than disclosed only be several specific embodiment of the present invention, still, the present invention is not limited thereto, any those skilled in the art can think variation all should fall into protection scope of the present invention.
Claims (10)
1, a kind of route computing method is applied in the autonomous system, comprises in the described autonomous system using the ospf ospf protocol to carry out at least one network equipment that route is calculated, and it is characterized in that, said method comprising the steps of:
The described network equipment is according to the stability state adjustment of link and obtain the overhead value of every the link corresponding with the described network equipment;
The described network equipment generates link state notification information according to described overhead value, and according to described link state notification information with from the link state notification information of other network equipments, generates LSD;
The described network equipment generates shortest path tree according to described LSD, and calculates optimum route according to described shortest path tree.
2, the method for claim 1 is characterized in that, the described network equipment specifically comprises according to the stability state adjustment of link and the overhead value of obtaining every link corresponding with the described network equipment:
When the stability state of described link was unstable link, the described network equipment was according to the concussion number of times adjustment of described unstable link and obtain the every paths overhead value corresponding with the described network equipment; When the concussion number of times of described unstable link surpasses the minimum threshold that increases penalty value, the every concussion of link once, the described network equipment upgrades the overhead value of every the link corresponding with the described network equipment according to the concussion number of times.
3, method as claimed in claim 2 is characterized in that, the described network equipment upgrades before the overhead value of every link corresponding with the described network equipment according to the concussion number of times, also comprises:
The described network equipment calculates the concussion number of times of unstable link by the counter that sets in advance;
The described network equipment specifically comprises according to the overhead value that the concussion number of times upgrades every link corresponding with the described network equipment:
The corresponding relation of the described network equipment default concussion number of times and grade, the different penalty value of the corresponding increase of different brackets;
When if described concussion number of times surpasses corresponding threshold value,, progressively increase described overhead value according to the penalty value of described grade correspondence along with increasing progressively of concussion number of times;
If described concussion number of times surpasses the threshold value of highest ranking, described overhead value is increased to maximum.
4, method as claimed in claim 3 is characterized in that, the described network equipment also comprises according to the overhead value that the concussion number of times upgrades every link corresponding with the described network equipment:
When the described network equipment determines that by the timer that sets in advance described unstable link-recovery is consistent link in Preset Time, the described default time of every process, reduce the overhead value of described unstable link correspondence, return to the overhead value of initial link circuit when stablizing always.
5, the method for claim 1 is characterized in that, describedly calculates optimum route according to shortest path tree and specifically comprises:
It is optimum route that the described network equipment is selected the link of overhead value minimum in the shortest path tree.
6, a kind of route calculation element is applied in the autonomous system, comprises in the described autonomous system using the ospf ospf protocol to carry out at least one network equipment that route is calculated, and it is characterized in that described device comprises:
Processing module is used for according to the stability state adjustment of link and obtains the overhead value of every the link corresponding with the described network equipment;
Generation module, electrically connect with described processing module, be used for generating link state notification information, and, generate LSD according to described link state notification information with from the link state notification information of other network equipments according to described processing module adjustment and the overhead value obtained;
Computing module electrically connects with described generation module, and the LSD that is used for generating according to described generation module generates shortest path tree, and calculates optimum route according to described shortest path tree.
7, device as claimed in claim 6 is characterized in that, described processing module specifically is used for:
When the stability state of described link is unstable link, according to the concussion number of times adjustment of described unstable link and obtain the every paths overhead value corresponding with the described network equipment; When the concussion number of times of described unstable link surpasses the minimum threshold that increases penalty value, the every concussion of link once, the described network equipment upgrades the overhead value of every the link corresponding with the described network equipment according to the concussion number of times.
8, device as claimed in claim 7 is characterized in that, described processing module also is used for:
Calculate the concussion number of times of unstable link by the counter that sets in advance; And the corresponding relation of default concussion number of times and grade, the different penalty value of the corresponding increase of different brackets;
When if described concussion number of times surpasses corresponding threshold value,, progressively increase described overhead value according to the penalty value of described grade correspondence along with increasing progressively of concussion number of times;
If described concussion number of times surpasses the threshold value of highest ranking, described overhead value is increased to maximum.
9, device as claimed in claim 8 is characterized in that, described processing module also is used for:
When determining that by the timer that sets in advance described unstable link-recovery is consistent link in Preset Time, the described default time of every process, reduce the overhead value of described unstable link correspondence, return to the overhead value of initial link circuit when stablizing always.
10, device as claimed in claim 6 is characterized in that, described computing module specifically is used for:
Selecting the link of overhead value minimum in the shortest path tree is optimum route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009101478113A CN101572674A (en) | 2009-06-12 | 2009-06-12 | Routing computation method and device thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009101478113A CN101572674A (en) | 2009-06-12 | 2009-06-12 | Routing computation method and device thereof |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101572674A true CN101572674A (en) | 2009-11-04 |
Family
ID=41231912
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2009101478113A Pending CN101572674A (en) | 2009-06-12 | 2009-06-12 | Routing computation method and device thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101572674A (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011144079A2 (en) * | 2011-05-25 | 2011-11-24 | 华为技术有限公司 | Method and apparatus for generating distribution trees, and routing bridge |
| CN102318288A (en) * | 2011-07-29 | 2012-01-11 | 华为技术有限公司 | Node sequencing and choosing method, Apparatus and system |
| CN102420739A (en) * | 2010-09-28 | 2012-04-18 | 杭州华三通信技术有限公司 | ISIS (Intermediate System to Intermediate System) neighbor maintaining method and ISIS device |
| CN103023775A (en) * | 2012-12-26 | 2013-04-03 | 杭州华三通信技术有限公司 | Router in OSPF (open shortest path first) network and processing method thereof |
| CN103475578A (en) * | 2013-09-09 | 2013-12-25 | 华为技术有限公司 | Method and device for path selection |
| CN104243320A (en) * | 2014-09-10 | 2014-12-24 | 珠海市君天电子科技有限公司 | Method and device for optimizing network access paths |
| CN105024934A (en) * | 2014-04-25 | 2015-11-04 | 中国电信股份有限公司 | Method and system for scheduling flow in real time |
| CN105577535A (en) * | 2015-12-17 | 2016-05-11 | 清华大学 | Hybrid link protection method based on multi-next hops and backup paths |
| CN105830403A (en) * | 2013-10-11 | 2016-08-03 | 瑞典爱立信有限公司 | High performance LFA path algorithms |
| WO2017084448A1 (en) * | 2015-11-17 | 2017-05-26 | 上海斐讯数据通信技术有限公司 | Network system and network operating method |
| CN107147576A (en) * | 2016-03-01 | 2017-09-08 | 华为技术有限公司 | A kind of route computing method and device |
| CN108430086A (en) * | 2017-02-13 | 2018-08-21 | 中国移动通信集团贵州有限公司 | A kind of method and apparatus of handover network link |
| CN108600108A (en) * | 2018-03-08 | 2018-09-28 | 杭州达乎科技有限公司 | A kind of port shake management method and system |
| CN109698789A (en) * | 2017-10-20 | 2019-04-30 | 中兴通讯股份有限公司 | A kind of method and device adjusting Routing Protocol link metric value |
| CN110380960A (en) * | 2019-07-31 | 2019-10-25 | 迈普通信技术股份有限公司 | A kind of backup path determines method, apparatus, the network equipment and storage medium |
| CN110896377A (en) * | 2019-11-19 | 2020-03-20 | 迈普通信技术股份有限公司 | OSPF routing control method and device |
| CN113037629A (en) * | 2019-12-24 | 2021-06-25 | 中国电信股份有限公司 | Traffic scheduling method and system between non-direct connection autonomous systems |
-
2009
- 2009-06-12 CN CNA2009101478113A patent/CN101572674A/en active Pending
Cited By (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102420739A (en) * | 2010-09-28 | 2012-04-18 | 杭州华三通信技术有限公司 | ISIS (Intermediate System to Intermediate System) neighbor maintaining method and ISIS device |
| WO2011144079A3 (en) * | 2011-05-25 | 2012-04-26 | 华为技术有限公司 | Method and apparatus for generating distribution trees, and routing bridge |
| CN102959909A (en) * | 2011-05-25 | 2013-03-06 | 华为技术有限公司 | Method and apparatus for generating distribution trees, and routing bridge |
| CN102959909B (en) * | 2011-05-25 | 2015-06-03 | 华为技术有限公司 | Method and apparatus for generating distribution trees, and routing bridge |
| WO2011144079A2 (en) * | 2011-05-25 | 2011-11-24 | 华为技术有限公司 | Method and apparatus for generating distribution trees, and routing bridge |
| CN102318288A (en) * | 2011-07-29 | 2012-01-11 | 华为技术有限公司 | Node sequencing and choosing method, Apparatus and system |
| WO2012109852A1 (en) * | 2011-07-29 | 2012-08-23 | 华为技术有限公司 | Node ranking and selection method, device and system |
| CN102318288B (en) * | 2011-07-29 | 2014-11-05 | 华为技术有限公司 | Method, equipment and system of node sorting and selection |
| CN103023775B (en) * | 2012-12-26 | 2015-11-25 | 杭州华三通信技术有限公司 | Router in ospf network and processing method thereof |
| CN103023775A (en) * | 2012-12-26 | 2013-04-03 | 杭州华三通信技术有限公司 | Router in OSPF (open shortest path first) network and processing method thereof |
| CN103475578A (en) * | 2013-09-09 | 2013-12-25 | 华为技术有限公司 | Method and device for path selection |
| CN103475578B (en) * | 2013-09-09 | 2017-03-15 | 华为技术有限公司 | A kind of routing resource and device |
| CN105830403A (en) * | 2013-10-11 | 2016-08-03 | 瑞典爱立信有限公司 | High performance LFA path algorithms |
| CN105830403B (en) * | 2013-10-11 | 2019-06-14 | 瑞典爱立信有限公司 | Method and apparatus for high-performance LFA routing algorithm |
| CN105024934A (en) * | 2014-04-25 | 2015-11-04 | 中国电信股份有限公司 | Method and system for scheduling flow in real time |
| CN105024934B (en) * | 2014-04-25 | 2019-04-12 | 中国电信股份有限公司 | A kind of real-time traffic dispatching method and system |
| CN104243320A (en) * | 2014-09-10 | 2014-12-24 | 珠海市君天电子科技有限公司 | Method and device for optimizing network access paths |
| WO2017084448A1 (en) * | 2015-11-17 | 2017-05-26 | 上海斐讯数据通信技术有限公司 | Network system and network operating method |
| CN105577535B (en) * | 2015-12-17 | 2018-11-20 | 清华大学 | Compounded link guard method based on multi-next-hop and backup path |
| CN105577535A (en) * | 2015-12-17 | 2016-05-11 | 清华大学 | Hybrid link protection method based on multi-next hops and backup paths |
| CN107147576A (en) * | 2016-03-01 | 2017-09-08 | 华为技术有限公司 | A kind of route computing method and device |
| CN108430086A (en) * | 2017-02-13 | 2018-08-21 | 中国移动通信集团贵州有限公司 | A kind of method and apparatus of handover network link |
| CN109698789A (en) * | 2017-10-20 | 2019-04-30 | 中兴通讯股份有限公司 | A kind of method and device adjusting Routing Protocol link metric value |
| CN108600108A (en) * | 2018-03-08 | 2018-09-28 | 杭州达乎科技有限公司 | A kind of port shake management method and system |
| CN110380960A (en) * | 2019-07-31 | 2019-10-25 | 迈普通信技术股份有限公司 | A kind of backup path determines method, apparatus, the network equipment and storage medium |
| CN110380960B (en) * | 2019-07-31 | 2021-05-18 | 迈普通信技术股份有限公司 | Backup path determining method, device, network equipment and storage medium |
| CN110896377A (en) * | 2019-11-19 | 2020-03-20 | 迈普通信技术股份有限公司 | OSPF routing control method and device |
| CN113037629A (en) * | 2019-12-24 | 2021-06-25 | 中国电信股份有限公司 | Traffic scheduling method and system between non-direct connection autonomous systems |
| CN113037629B (en) * | 2019-12-24 | 2022-07-12 | 中国电信股份有限公司 | Traffic scheduling method and system between non-direct connection autonomous systems |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101572674A (en) | Routing computation method and device thereof | |
| US10673741B2 (en) | Control device discovery in networks having separate control and forwarding devices | |
| US8447849B2 (en) | Negotiated parent joining in directed acyclic graphs (DAGS) | |
| EP2732590B1 (en) | Selective topology routing for distributed data collection | |
| EP2548341B1 (en) | Alternate down paths for directed acyclic graph (dag) routing | |
| US7697454B2 (en) | Method and apparatus for controlling the dissemination of routing information on a communication network | |
| CN102123088B (en) | Set up the method and apparatus of traffic engineering tunnel | |
| WO2002006918A2 (en) | A method, system, and product for preventing data loss and forwarding loops when conducting a scheduled change to the topology of a link-state routing protocol network | |
| CN105282041A (en) | Method and device of flooding on the basis of ISIS (intermediate system to intermediate system) | |
| US10972310B2 (en) | Link state packet transmission method and routing node | |
| Zhang et al. | Survivable path computation in PCE-based multi-domain networks | |
| Philip et al. | Cross-control: A scalable multi-topology fault restoration mechanism using logically centralized controllers | |
| Cheung et al. | A new optimization algorithm for power saving in backbone networks | |
| Garg et al. | Restoration Technique to Optimize Recovery Time for Efficient OSPF Network | |
| Prasad et al. | Study & Analysis of Dynamic Routing Protocols in real time for Optimal Resource Utilization | |
| Charkari | Data Plane Resource Optimization for Multipath Flows | |
| Deeka et al. | Dynamically Packet Routing for QoS Assurances on Internet Networks | |
| Lu et al. | A Vector Routing Protocol for Computing and Network Convergence in Digital Grid Scenario | |
| CN116232970A (en) | Link state information flooding optimization method, device, equipment and medium | |
| Poprzen et al. | Scaling and convergence speed of EIGRPv4 and OSPFv2 dynamic routing protocols in hub and spoke network | |
| Karami et al. | Improving OSPF Protocol based Latency: A new algorithm based on Dijkstra by using OSPF existing Metrics in SDN networks | |
| Csernai et al. | Congestion control and network management in Future Internet | |
| Yakubu | Comparative assessment Analysis of RIP, OSPF, and EIGRP Routing Protocols using OPNET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20091104 |