CN104270313B - Method for adjusting utilization rate of network link - Google Patents
Method for adjusting utilization rate of network link Download PDFInfo
- Publication number
- CN104270313B CN104270313B CN201410514407.6A CN201410514407A CN104270313B CN 104270313 B CN104270313 B CN 104270313B CN 201410514407 A CN201410514407 A CN 201410514407A CN 104270313 B CN104270313 B CN 104270313B
- Authority
- CN
- China
- Prior art keywords
- network
- configuration
- link utilization
- network link
- weight
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for adjusting the utilization rate of a network link. The method comprises the following steps that a network architecture is obtained, and a basic network architecture of a network is obtained, wherein the basic network architecture contains the number of nodes in the network and node connecting modes; the optimal weight configuration is obtained, and the optimal weight configuration is obtained based on the open shortest path first protocol and software-defined network technology; the network is configured based on the optimal weight configuration, and therefore the expected network link utilization rate adjustment result is obtained. Compared with the prior art, by means of the method for adjusting the utilization rate of the network link, a lower and maximum network link utilization rate can be obtained, and network performance is improved.
Description
Technical field
The present invention relates to the communications field, in particulars relate to a kind of network link utilization rate control method.
Background technology
Internet is made up of the autonomous system (Autonomous System, abbreviation AS) of individual O＆Ms alone up to ten thousand.With base
The network of the agreement (Internet Protocol, abbreviation IP) interconnected between network constantly develops, and gets over to meet construction
Carry out the needs of bigger IP network, link-state routing protocol in various domains is constructed in prior art.
Ospf (Open Shortest Path First, abbreviation OSPF) agreement is that one kind is used
Link-state routing protocol in widest domain, during large-scale, isomery I P networks have been widely used in.In the ospf protocol,
Each link is all endowed a link weight.Can be selected between source node and destination node based on link weight system
Most short network link carrys out transmission data.If there are multiple most short network links between source node and destination node, then flow
Evenly distribute on multiple most short network links.
Because the data under ospf protocol always select away most short network link, therefore nets different in network can be caused
The excessive situation of the utilization rate difference of network link.I.e. data traffic is concentrated in specific network link, so as to cause network to be gathered around
Plug.Arranged come the utilization rate of network link different in Configuration network by changing link weight in prior art, so as to reduce
Maximum link utilization in whole network.But existing link weight arranges algorithm and can not be optimal solution, it is impossible to very well
Ground reduces maximum link utilization.
Therefore, unsatisfactory problem is configured for the network link utilization rate in prior art lower network, is needed a kind of new
Network link utilization rate control method with obtain more preferably network link utilization rate configuration.
The content of the invention
Unsatisfactory problem is configured for the network link utilization rate in prior art lower network, the invention provides a kind of
The method of regulating networks link utilization, methods described is comprised the steps of：
Network architecture step is obtained, the basic network framework of network is obtained, the basic network framework includes the network
In nodes and node connected mode；
Optimal weights configuration step is obtained, based on open type shortest path priority protocol and software defined network technology root
Optimal weights configuration is obtained according to the basic network framework；
Configuration network step, based on the optimal weights configuration configuration network, so as to obtain expected network link
Utilization rate adjusts result.
In one embodiment, the acquisition optimal weights configuration step is comprised the steps of：
Setting iteration total degree step, setting obtains the iteration total degree needed for the optimal weights configuration；
The first weight configuration step is obtained, the initial weight of the acquisition network is configured and matches somebody with somebody the initial weight and installs
It is set to the configuration of the first weight；
The first maximum network link utilization step is obtained, corresponding initial maximum is obtained based on initial weight configuration
Network link utilization rate, and the initial maximum network link utilization rate is set as into the first maximum network link utilization；
Iterative step, is obtained currently most based on first weight configuration and the first maximum network link utilization
Excellent weight configuration and current optimum maximum network link utilization；
Iterations judges step, contrast after the iterative step is finished the execution number of times of the iterative step with
Whether the iteration total degree is consistent, wherein：
When the execution number of times of the iterative step is consistent with the iteration total degree, the current optimal weights are configured to
The optimal weights configuration；
When the execution number of times of the iterative step is less than the iteration total degree, the current optimal weights is matched somebody with somebody and is installed
It is set to the first weight configuration, the current optimum maximum network link utilization is set as into the first maximum network link profit
With rate, then the iterative step is sequentially performed again and the iterations judges step.
In one embodiment, the iterative step is comprised the steps of：
Calculation procedure, obtains the configuration of the second weight and configures right with second weight based on first weight configuration
The the second maximum network link utilization answered；
Obtain current optimum maximum network link utilization step, contrast the first maximum network link utilization and
The second maximum network link utilization, by the first maximum network link utilization and the second maximum network chain
Numerical value is less in the utilization rate of road is set as the current optimum maximum network link utilization；
Current optimal weights configuration step is obtained, described in corresponding to the current optimum maximum network link utilization
The configuration of first or second weight is set as the current optimal weights configuration.
In one embodiment, in the calculation procedure, second weight is configured to the first weight configuration correspondence
Neighborhood weight configuration.
In one embodiment, the calculation procedure is comprised the steps of：
Corresponding neighborhood weight configuration is obtained based on first weight configuration；
Optimum shunting is carried out according to field weight configuration based on the software defined network technology, it is described so as to obtain
Flow in network on each link；
The second maximum network link utilization is obtained according to the flow on each link in the network.
In one embodiment, in the Configuration network step, all of router node operation in the network is opened
Put formula OSPF.
In one embodiment, methods described also includes Optimization deployment rate step, obtains the software defined network technology and exists
Optimum deployment rate in the network.
In one embodiment, in the Configuration network step, according to road of the optimum deployment rate in the network
By disposing the software defined network technology on device node.
In one embodiment, in the acquisition deployment rate step, the network is configured based on different deployment rates, so as to
Obtain multiple network link utilization rates and adjust result, the multiple described network link utilization rate to getting adjusts result and enters
Row analysis is so that it is determined that the optimum deployment rate.
In one embodiment, in the Configuration network step, using 30% as the optimum deployment rate.
Compared with prior art, network link utilization rate regulation is carried out using the method for the present invention, can be obtained lower
Maximum network link utilization, so as to improve the performance of network.
The further feature or advantage of the present invention will be illustrated in the following description.Also, the Partial Feature of the present invention or
Advantage will be become apparent by specification, or be appreciated that by implementing the present invention.The purpose of the present invention and part
Advantage can be realized or obtained by specifically noted step in specification, claims and accompanying drawing.
Description of the drawings
Accompanying drawing is used for providing a further understanding of the present invention, and constitutes a part for specification, the reality with the present invention
Apply example to be provided commonly for explaining the present invention, be not construed as limiting the invention.In the accompanying drawings：
Fig. 1 is execution flow chart according to an embodiment of the invention.
Specific embodiment
Describe embodiments of the present invention in detail below with reference to drawings and Examples, whereby enforcement personnel of the invention
Can fully understand the present invention how application technology means solving technical problem, and reach technique effect realize process and according to
Realize that process is embodied as the present invention according to above-mentioned.As long as each embodiment it should be noted that do not constitute conflict, in the present invention
And each feature in each embodiment can be combined with each other, the technical scheme for being formed protection scope of the present invention it
It is interior.
Undesirable problem is configured for the network link utilization rate that ospf protocol lower network is present, the present invention proposes one
Plant network link utilization rate control method.Due to software defined network (Software Defined Network, abbreviation SDN) skill
Art can realize the flexible control of network traffics by separated network equipment chain of command and data surface.Therefore it is directed to ospf protocol
Lower data traffic easily concentrates on the situation in specific network link, and the present invention combines ospf protocol and SDN technologies to match somebody with somebody
Put network.
The specific implementation process of one embodiment of the invention is described in detail with reference to the flow chart of Fig. 1.The flow process of accompanying drawing
The step of illustrating in figure can perform in comprising the such as computer system of one group of computer executable instructions.Although in flow process
The logical order of each step is shown in figure, but in some cases, can be performed with the order being different from herein shown
Or the step of description.
It can be appreciated that regulating networks link utilization first has to obtain the architecture situation of network.As shown in figure 1, first
Execution step S101 is first wanted, network architecture step is obtained, the basic network framework of network is obtained, basic network framework includes network
In node and node connected mode.In the present embodiment, the non-directed graph G of network is obtained, (V is summit to wherein G=(V, A)
Collection, A is side collection), the shortest path and path values between each node is calculated using Freud's algorithm.
In the present embodiment, network configuration is all run into ospf protocol for all of router node.Thus can be with base
Link weight in ospf protocol controlling network.One of purpose of control method of the present embodiment is to obtain optimal weights to match somebody with somebody
Put, so as to configuring Configuration network according to optimal weights, and then obtaining optimum network link utilization rate result is adjusted.In order to obtain
Optimal weights are configured, and present invention employs the preferred embodiment based on iterative calculation, it is proposed that a kind of SDN/OSPF hybrid networks scene
Under traffic engineering algorithm (SDN/OSPF Traffic Engineering, abbreviation SOTE).
In the SOTE algorithms of the present embodiment, based on ospf protocol and SDN technologies according to the net obtained in step S101
Network framework situation obtains optimal weights configuration.Specifically, the maximum network link utilization under different weight configurations is obtained first,
Then reconfigured come preference by contrasting the different maximum network link utilization for getting.
In the present embodiment, SOTE algorithms are performed and first has to execution step S100, obtain the first weight configuration step, obtained
Initial weight configuration is simultaneously set as that the first weight is configured by the initial weight configuration of network.In the present embodiment, can be random
Using any one weight configuration as initial weight configuration, it would however also be possible to employ the weight configuration that art methods are obtained is made
For initial weight configuration.
Then execution step S110, obtains the first maximum network link utilization step, is obtained based on initial weight configuration
Corresponding initial maximum network link utilization rate, and initial maximum network link utilization rate is set as into the first maximum network link
Utilization rate.In step s 110, for any one node a in network, by the flow of each other node-to-node a point
With the next-hop for being added to shortest path, until all assignment of traffic to the node are finished.By being calculated each of the links
On link utilization, so as to obtain the link utilization rate matrix and initial maximum link utilization of network.
Then execution step S120, obtains the second weight configuration step.In the present embodiment, the second weight is configured to first
Weight configures corresponding neighborhood weight configuration.In the step s 120, the network vertex set V for getting from step S101 first
It is middle to select to determine a source node s and destination node t.Then current power is found by balancing the path between s and t
The neighborhood of weight.The concrete implementation procedure of step S120 is as follows:
Step S120.1：The adjacent node x of search node si(i=1,2 ...), difference calculate node xi(i=1,
2 ...) reach node t shortest path weight and ω (pi)。
Step S120.2：The weight and ω of the shortest path between s and t*It is set to：
ω*={ 1+max [ω (pi)]|1≤i≤p} (1)
Thus occurs weight between s and t and for ω*P bar shortest paths so that flow between s and t can be more than enough
Paths are evenly distributed, wherein, p represents source node s to the number of the shortest path of destination node t, piRepresent source node s to mesh
Node t i-th shortest path.
Step S120.3：Then the weights omega of the link from s is reset, makes new weights omega**For：
ω**=ω*-ω(pi), i=1,2 ... p (2)
So we just complete the weight setting of the adjacent edge to node s, have found a neighborhood of present weight
ω**。
Get neighborhood weight with postpone can with execution step S130, obtain the second maximum network link utilization step
Suddenly.In step s 130, be primarily based on SDN technologies carries out optimum shunting according to the configuration of neighborhood weight, each in network so as to obtain
Flow on link.The concrete implementation procedure of step S130 is as follows：
Step S130.1:It is first according to number and position that certain deployment rule determines SDN nodes.The present embodiment is base
In greedy algorithm, the maximum node of link utilization is selected according to link utilization rate matrix and is disposed.Deployment rate changes 0
In the range of~100%.
Step S130.2:Each node a in traverses network, constructs with node a as the maximum oriented of purpose node
Acyclic figure (Directed Acyclic Graph, abbreviation DAG).Construct from node a first by Dijkstra's algorithm
To the shortest path tree of other each nodes.Then the shortest path tree transposition from node a to other each nodes is obtained
To the shortest path tree with node a as purpose node.Then on the shortest path tree for getting, each SDN section is sequentially added
The adjacent side of point, and using topological sorting inspection check whether that loop can be constituted.If adding certain side not constitute loop, then
Just the side is added；Otherwise remove the side.A maximum DAG figure based on hybrid network topology is so finally given, also
It is path that flow can be flowed through.
Step S130.3:Topological sorting is carried out to all of network node based on maximum DAG figures, simulation road by process,
So as to calculate the flow in each of the links.
Take out the node b in network successively according to topological sorting result.If the node is regular node, by the stream of b to a
The number of outgoing link of the amount according to b in DAG figures is evenly distributed on adjacent side, and by the transmission accumulation of corresponding flow to shortest path
The next-hop in footpath；If the node is SDN nodes, represent that b is assigned to flows of all b on adjacent side in DAG figures with unknown number,
And according to the equation listed with regard to unknown quantity of SDN node flow conservations, while corresponding flow is added in abutment points.
Node in traverses network, it is possible to all distribute the flow of other nodes in topological sorting to destination node a
Finish.And obtain flow and the equation with regard to SDN nodes on a as all sides in the DAG figures of purpose node.To travel through each
Individual network node obtains the link flow of DAG figures and adds up, and obtains the total link flow of every a line.
Step S130.2:Next the second maximum network link utilization is obtained according to the flow on each link.According to every
Principle of the flow of bar link no more than capacity row inequality.The flow conservation with regard to SDN nodes enumerated before addition
Equation equation, so as to optimize network link utilization rate, and then obtains the second maximum network link utilization.In the present embodiment,
The optimization of network link utilization rate and obtaining for maximum network link utilization are carried out using linear programming for solution instrument (CPLEX)
Take.
Get and just current optimal weights configuration can be obtained with execution step S140 after the second maximum network link utilization
Step.The first maximum network link utilization and the second maximum network link utilization are contrasted, by the first maximum network link
Numerical value is less in utilization rate and the second maximum network link utilization is set as current optimum maximum network link utilization；
Accordingly, weight configuration (configuration of the first or second weight) corresponding to current optimum maximum network link utilization is set as
Current optimal weights configuration.
In the present embodiment, what is got in the step s 120 is the field weight configuration for point s, due to holding initially
It is the optional conduct point s from all nodes of network during row step S120.Therefore in the present embodiment, when step S140 is held
After row is finished, other nodes are reselected as point s and execution step S120, S130 and S140 again.Repeat to change node
As point s execution steps S120, S130 and S140 until traveling through all nodes.
In the present invention, definition obtains current optimum power based on the configuration of the first weight and the first maximum network link utilization
Reconfigure and all steps of current optimum maximum network link utilization are collectively referred to as iterative step.In the present embodiment, will
All steps of all node execution steps S120, S130 and S140 in traverses network are collectively referred to as iterative step.This enforcement
Example continues to optimize current optimal weights configuration by repeatedly performing iterative step.
Because the present embodiment repeatedly performs iterative step, therefore step is also included in the method for the present embodiment
S102, sets iteration total degree step.Iteration total degree is set according to specific actual demand, that is, performs total time of iterative step
Number.In the present embodiment, iteration total degree takes 5000.
Step S150 is also included in the method for the present embodiment, iterations judges step, and (traversal is all when iterative step
Node execution step S120, S130 and S140) be finished after contrast iterative step execution number of times and iteration total degree be
It is no consistent, wherein：
When the execution number of times of iterative step is less than iteration total degree (inconsistent), execution step S151 updates first and weighs
Reconfigure, the configuration of current optimal weights is set as into that the first weight is configured；Simultaneously execution step S152, updates the first maximum network
Link utilization, by current optimum maximum network link utilization the first maximum network link utilization is set as.Next again
Secondary order performs iterative step and iterations judges step (step S150).
When the execution number of times of iterative step is consistent with iteration total degree, execution step S160 determines that optimal weights are configured,
Now current optimal weights are configured to optimal weights configuration.
Next just Configuration network can be configured, so as to obtain based on optimal weights with execution step S180, Configuration network step
Obtain expected network link utilization rate and adjust result.In step S180, network is configured to all of router node and all transports
Row ospf protocol, and dispose SDN technologies on a part of node wherein.Compared to prior art, using the method for the present invention
Network link utilization rate regulation is carried out, lower maximum network link utilization can be obtained, generally can be by network maximum chain
Road utilization rate reduces by 5% or so, so as to improve the performance of network.
In order to the network link utilization rate being optimal is adjusted as a result, it is desirable to determine SDN sections according to certain deployment rule
The number of point and position.The deployment of SDN is typically based on and is determined based on greedy algorithm, is selected according to link utilization rate matrix every time
The maximum node of link utilization is disposed.Its deployment rate changes in the range of 0~100%.But due to consolidating for SDN technologies
There is characteristic, cause the deployment completely of SDN relatively difficult.In order to reduce the structure difficulty of network, the portion of reduction SDN is needed as far as possible
Administration's rate.
Difficult problem is disposed for SDN, the method for the present invention also constructed Optimization deployment before execution step S180
Rate step S170, obtains SDN technologies optimum deployment rate in a network.So as in step S180, exist according to optimum deployment rate
SDN is disposed on router node in network.
The step of the present embodiment in S170, based on different deployment rate Configuration networks, so as to obtain multiple network links
Utilization rate adjusts result, and then the analysis for adjusting result based on the multiple network link utilization rates to getting determines optimum deployment
Rate.
Can be obtained by the analysis to a large amount of different networks, when the deployment rate of SDN is 30% one can be obtained
It is close to optimum network state.Therefore in the present embodiment, using 30% as the optimum deployment rate.
While it is disclosed that embodiment as above, but described content only to facilitate understand the present invention and adopt
Embodiment, is not limited to the present invention.Method of the present invention can also have other various embodiments.Without departing substantially from
In the case of essence of the present invention, those of ordinary skill in the art work as can make various corresponding changes or change according to the present invention
Shape, but these corresponding changes or deformation should all belong to the scope of the claims of the present invention.
Claims (10)
1. a kind of method of regulating networks link utilization, methods described is comprised the steps of：
Network architecture step is obtained, the basic network framework of network is obtained, the basic network framework is comprising in the network
Nodes and node connected mode；
Optimal weights configuration step is obtained, optimal weights configuration is obtained according to the basic network framework based on SOTE algorithms；
Configuration network step, based on the optimal weights configuration configuration network, utilizes so as to obtain expected network link
Rate adjusts result.
2. the method for claim 1, it is characterised in that the acquisition optimal weights configuration step is comprised the steps of：
Setting iteration total degree step, setting obtains the iteration total degree needed for the optimal weights configuration；
The first weight configuration step is obtained, the initial weight configuration of the network is obtained and is set as initial weight configuration
First weight is configured；
The first maximum network link utilization step is obtained, corresponding initial maximum network is obtained based on initial weight configuration
Link utilization, and the initial maximum network link utilization rate is set as into the first maximum network link utilization；
Iterative step, based on first weight configuration and the first maximum network link utilization current optimum power is obtained
Reconfigure and current optimum maximum network link utilization；
Iterations judges step, contrast after the iterative step is finished the execution number of times of the iterative step with it is described
Whether iteration total degree is consistent, wherein：
When the execution number of times of the iterative step is consistent with the iteration total degree, the current optimal weights are configured to described
Optimal weights are configured；
When the execution number of times of the iterative step is less than the iteration total degree, the current optimal weights configuration is set as
The first weight configuration, by the current optimum maximum network link utilization the first maximum network link utilization is set as
Rate, then sequentially performs again the iterative step and the iterations judges step.
3. method as claimed in claim 2, it is characterised in that the iterative step is comprised the steps of：
Calculation procedure, obtains the second weight and configures and corresponding with the second weight configuration based on first weight configuration
Second maximum network link utilization；
Current optimum maximum network link utilization step is obtained, the first maximum network link utilization and described is contrasted
Second maximum network link utilization, by the first maximum network link utilization and the second maximum network link profit
It is set as the current optimum maximum network link utilization with numerical value in rate is less；
Current optimal weights configuration step is obtained, by described first corresponding to the current optimum maximum network link utilization
Or second weight configuration be set as the current optimal weights configuration.
4. method as claimed in claim 3, it is characterised in that in the calculation procedure, second weight is configured to institute
State the first weight and configure corresponding neighborhood weight configuration.
5. method as claimed in claim 4, it is characterised in that the calculation procedure is comprised the steps of：
Corresponding neighborhood weight configuration is obtained based on first weight configuration；
Optimum shunting is carried out according to neighborhood weight configuration based on software defined network technology, it is each in the network so as to obtain
Flow on link；
The second maximum network link utilization is obtained according to the flow on each link in the network.
6. the method for claim 1, it is characterised in that in the Configuration network step, it is all in the network
Router node operation open type shortest path priority protocol.
7. the method for claim 1, it is characterised in that methods described also includes Optimization deployment rate step, obtains software
Define optimum deployment rate of the network technology in the network.
8. method as claimed in claim 7, it is characterised in that in the Configuration network step, optimum disposes according to described
Rate disposes the software defined network technology on the router node in the network.
9. method as claimed in claim 7, it is characterised in that in the Optimization deployment rate step, based on different deployment
Rate configures the network, result is adjusted so as to obtain multiple network link utilization rates, to the multiple described network for getting
Link utilization adjusts result and is analyzed so that it is determined that the optimum deployment rate.
10. method as claimed in claim 7, it is characterised in that in the Configuration network step, using 30% as described
Optimum deployment rate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410514407.6A CN104270313B (en) | 2014-09-29 | 2014-09-29 | Method for adjusting utilization rate of network link |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410514407.6A CN104270313B (en) | 2014-09-29 | 2014-09-29 | Method for adjusting utilization rate of network link |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104270313A CN104270313A (en) | 2015-01-07 |
| CN104270313B true CN104270313B (en) | 2017-05-17 |
Family
ID=52161806
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410514407.6A Active CN104270313B (en) | 2014-09-29 | 2014-09-29 | Method for adjusting utilization rate of network link |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104270313B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106407399A (en) * | 2016-09-21 | 2017-02-15 | 郑州云海信息技术有限公司 | An XML_RPC service-based cloud resource retrieval method and system |
| CN108347377B (en) * | 2017-01-25 | 2020-09-11 | 华为技术有限公司 | Data forwarding method and device |
| CN107317697B (en) * | 2017-05-25 | 2020-01-07 | 清华大学 | Route configuration method of OSPF (open shortest Path first) and SDN (software defined network) hybrid network |
| CN107995126B (en) * | 2017-12-12 | 2021-08-03 | 中国联合网络通信集团有限公司 | Load balancing route analysis method and load balancing route analyzer |
| CN109194577B (en) * | 2018-10-23 | 2020-04-10 | 清华大学 | Traffic engineering method and device of segmented routing network based on partial deployment |
| CN111786834A (en) * | 2020-07-02 | 2020-10-16 | 福州大学 | SDN switch node increment deployment method based on genetic algorithm |
| CN114553772A (en) * | 2022-04-26 | 2022-05-27 | 南京邮电大学 | Inter-domain traffic engineering method based on ISP (internet service provider) and SDN (software defined network) hybrid network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859298A (en) * | 2005-10-26 | 2006-11-08 | 华为技术有限公司 | Path selecting method |
| CN101155131A (en) * | 2006-09-29 | 2008-04-02 | 中国电信股份有限公司 | Method for establishing label switched path of minimized path preemption cost |
| EP1264451B1 (en) * | 2000-03-15 | 2009-04-22 | Nauru Ventures LLC | Method and system for controlling data traffic in a network |
| CN101447929A (en) * | 2008-12-26 | 2009-06-03 | 华为技术有限公司 | Traffic routing method, router and communication system |
| CN102932268A (en) * | 2012-11-05 | 2013-02-13 | 杭州迪普科技有限公司 | Data packet transmitting method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8243586B2 (en) * | 2009-11-24 | 2012-08-14 | At&T Intellectual Property I, L.P. | Cross-layer reconfiguration method for surviving multiple-link network failures |
-
2014
- 2014-09-29 CN CN201410514407.6A patent/CN104270313B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1264451B1 (en) * | 2000-03-15 | 2009-04-22 | Nauru Ventures LLC | Method and system for controlling data traffic in a network |
| CN1859298A (en) * | 2005-10-26 | 2006-11-08 | 华为技术有限公司 | Path selecting method |
| CN101155131A (en) * | 2006-09-29 | 2008-04-02 | 中国电信股份有限公司 | Method for establishing label switched path of minimized path preemption cost |
| CN101447929A (en) * | 2008-12-26 | 2009-06-03 | 华为技术有限公司 | Traffic routing method, router and communication system |
| CN102932268A (en) * | 2012-11-05 | 2013-02-13 | 杭州迪普科技有限公司 | Data packet transmitting method and device |
Non-Patent Citations (2)
| Title |
|---|
| Effect of Degree- Preserving，Assortative Rewiring on OSPF Router Configuration;Rogier Noldus;《Teletraffic Congress（ITC）》;20130930;全文 * |
| Multi-Commodity Flow Traffic Engineering with Hybrid MPLS/OSPF Routing;Mingui Zhang;《Global Telecommunications Conference》;20091231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104270313A (en) | 2015-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104270313B (en) | Method for adjusting utilization rate of network link | |
| CN107317697B (en) | Route configuration method of OSPF (open shortest Path first) and SDN (software defined network) hybrid network | |
| CN109194577A (en) | A kind of traffic engineering method and device of the Segment routing network based on partial deployment | |
| CN109039942A (en) | A kind of Network Load Balance system and equalization methods based on deeply study | |
| CN103747530B (en) | Wireless Mesh network channel allocation system and wireless Mesh network channel allocation method under partially overlapped channels | |
| CN105871724B (en) | Power telecom network line optimization method and system | |
| CN108307435A (en) | A kind of multitask route selection method based on SDSIN | |
| CN108965141A (en) | A kind of calculation method and device of Multi-path route tree | |
| CN109639575A (en) | Route planning method based on link congestion coefficient | |
| CN108183856A (en) | A kind of method for routing foundation and device | |
| Viet et al. | Traffic engineering for multiple spanning tree protocol in large data centers | |
| CN108075980A (en) | A kind of control method of forward-path, device and control device | |
| CN110414094A (en) | A kind of business different degree configuration method between power communication network node | |
| CN106817306A (en) | A kind of method and device for determining target route | |
| CN105357132B (en) | A kind of multiple domain ASON damages based on hypergraph model perceive multicast route method | |
| CN104202262B (en) | Frequency spectrum distributing method and device in the flexible optical-fiber network of frequency spectrum | |
| Nguyen et al. | Efficient virtual network embedding with node ranking and intelligent link mapping | |
| Saradhi et al. | A framework for regenerator site selection based on multiple paths | |
| CN103179035A (en) | Optical transmission network and method and device for selecting fixed routes thereof | |
| CN108093496B (en) | ISA100.11a standard-based consistency networking method | |
| CN111800339B (en) | Route optimization method with path number constraint in hybrid SDN scene | |
| CN104506427B (en) | More new control method and update control apparatus | |
| Wu et al. | Cost-effective placement of mesh nodes in wireless mesh networks | |
| KR20120023850A (en) | Evolving algorithms for telecommunications network nodes by genetic programming | |
| JP5898112B2 (en) | Network design apparatus and network design program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |