CN106230722B - SDN network congestion link method of adjustment based on transfer value - Google Patents
SDN network congestion link method of adjustment based on transfer value Download PDFInfo
- Publication number
- CN106230722B CN106230722B CN201610640026.1A CN201610640026A CN106230722B CN 106230722 B CN106230722 B CN 106230722B CN 201610640026 A CN201610640026 A CN 201610640026A CN 106230722 B CN106230722 B CN 106230722B
- Authority
- CN
- China
- Prior art keywords
- link
- congestion
- routing
- route
- stream
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/11—Identifying congestion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/38—Flow based routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/11—Identifying congestion
- H04L47/115—Identifying congestion using a dedicated packet
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
Abstract
SDN network congestion link method of adjustment based on transfer value of the invention, comprising: a) obtains link topology；B) obtains traffic flow information；C) judges congestion state；D) selects stream to be transferred；E) adjustment of heavy-route, e-1) finds the least new routing of link change amount from network topology structure；E-2) is broken down into multiple single congestion links of equal value, then according to e-1 if it is more congestion links first) heavy-route；F) adjustment of flow table routing.SDN network congestion link method of adjustment of the invention, congestion on path is divided into single congestion link of equal value and more congestion link differentiations processing, it is the combination of multiple single congestion links of equal value to the transfer of more congestion links, both link congestion is solved, make transfer value minimum again, computation complexity is reduced, data flow transfer efficiency is improved.
Description
Technical field
The present invention relates to a kind of network link method of adjustment, more specifically, more particularly to a kind of based on transfer value
SDN network congestion link method of adjustment.
Background technique
((Software Defined Network, SDN), is a kind of new network of Emulex network innovation framework, purport to software defined network
By separating network equipment control plane with data surface, realizes the flexible control of network traffic data, make network conduct
Data transmission pipe becomes more intelligent.The control layer network equipment different come keyholed back plate using centralized controller, in this way,
Network is easier to be controlled and managed, and bit is allowed smoothly to transmit in forwarding.Controller by exit passageway with
OpenFlow interchanger is communicated, and issues flow table and Controlling principle to determine the flow direction of flow.SDN can be directed to different uses
Demand establishes service level agreement, allow user's access service when, obtain due guarantee.
In recent years, with the rapid development of information technology, disparate networks intersect, fusion and information content are in magnanimity formula
Increase, network composition, structure, function, scale and in terms of deep change is just occurring.Due to physical condition
Limitation, network size can not unlimitedly expand.Due to the limitation of the defect or network components performance of routing algorithm, network
In data transmission may not be obtained and timely respond, cause mass data packet caching in a network, at this moment just produced in network
Congestion is given birth to.
In order to realize congestion data stream readjustment degree, need to solve two big main bugbears: (1) to any data when congestion occurs
Stream is rescheduled；(2) these data flows how to be dispatched.In view of there are multiple data flows on congestion link, it is carried out
The cost of heavy-route is larger.
Firstly, the data flow of selection heavy-route, the core concept of document is, when congestion will occur for network, to gather around
The maximum data flow of occupied bandwidth (or big stream) is found out in plug chain road, is carried out heavy-route.The shortcomings that this method is
The bandwidth parameter for only considering data flow, does not account for the service attribute of data flow, if the maximum data flow of occupied bandwidth is
The Streaming Media class Business Stream of one real-time class, and the path delay newly selected is larger, then in this case, can seriously affect
To the application experience of user, therefore this heavy-route strategy is not an optimal selection.In addition, balancing link load is main
It is to consider uninterrupted and link utilization on link, does so and be unfavorable for guaranteeing link utilization, especially when load increases simultaneously
And link, when becoming saturation, finding open ended link for big stream can be highly difficult.
Secondly, the new route after heavy-route will consider the length of included link, that is, hop count；In addition, controller is wanted
It is responsible for new routing flow table into corresponding interchanger.The side of shortest path first is taken for congestion link heavy-route more
Method selects K shortest path to traverse this K paths in order until looking for when congestion occurs for every data stream in advance
To the path of a not congestion, but to calculate cost larger for this method.The new routing that this method generates can guarantee hop count most
It is small, but in view of when issuing new flow table, forward rule is encapsulated into Packet_out message and is handed down to interchanger by controller,
Interchanger flow table needs dynamic real-time update, while expired flow entry can be deleted.As a result, when obtaining shortest path, chain
The knots modification (including the link for increasing and deleting) on road often becomes very big, and transfer value amount is caused to become larger.
Summary of the invention
The present invention in order to overcome the shortcomings of the above technical problems, provides a kind of SDN network congestion based on transfer value
Link method of adjustment.
SDN network congestion link method of adjustment based on transfer value of the invention, its special feature is that, by following
Step is realized:
A) obtains link topology, and under SDN network, controller uses link according to OpenFlow v1.0 standard agreement
Layer discovery agreement LLDP obtains overall network topology；B) obtain traffic flow information, controller timing into SDN network each
OpenFlow interchanger sends query messages, to obtain the traffic flow information of each port on OpenFlow interchanger, data flow
Information includes the head mark and flow velocity size of data flow；C) judges congestion state, judges the transmission queue length in link
Whether it has been more than the threshold value of link capacity setting, if it does, then showing that the link is in congestion state, has executed step d)；
If be not above, thens follow the steps b), reacquire traffic flow information；D) selects stream to be transferred, from flowing through congestion link
It selects suitably to flow in data flow as stream to be transferred, carries out heavy-route to treat turn of tidal stream；E) adjustment of heavy-route, then press
According to step e-1) and step e-2) heavy-route adjustment is carried out to it；E-1) if the routing of stream to be transferred is single congestion chain of equal value
The least new routing of link change amount is then found on road from existing network topological structure, as the new routing of stream to be transferred, and really
Protect the delay newly routed, bandwidth meets the business demand of transfer stream；E-2) if the routing of stream to be transferred is more congestion links,
More congestion links are then decomposed into the combination of multiple single congestion links of equal value first, are then every according still further to the method for step e-1)
A single congestion link of equal value selects the smallest new routing of transfer value, ultimately forms the new routing for avoiding more congestion links；F) flows
The adjustment of table routing, the controller of SDN network issues routing new flow table adjusted, to adjust the transmission path of stream to be transferred,
Avoid the appearance of congestion.
SDN network congestion link method of adjustment based on transfer value of the invention, step e-1) described in heavy-route it is logical
Following steps are crossed to realize: e-1-1) sets south orientation, north orientation routing, if the source node of stream to be transferred, destination node are respectively S
And D, congestion link are AB section, it is starting point, edge to destination node that define south orientation heavy-route, which be using the start node A of congestion link,
The direction calculating heavy-route of D；Defining north orientation heavy-route is using the terminal note B of congestion link as terminal, the side downward along source node S
To calculating heavy-route；E-1-2) calculates link change number, for needing to delete m old link and increasing the slave X that number of nodes is n
To the routing Adjusted Option of Y, it is denoted as XY (m, n), link change number △ P is calculated by formula (1):
△ P=m+n+1 (1)
M is the old link number to be deleted, due at least to delete congestion link, therefore m >=1；N is to newly increase number of nodes, n
≥0；E-1-3) finds the smallest routing of transfer value, controller according to the calculation formula of link change number in step e-1-2),
Seek the minimum value of link change number；When link change is minimized, judges whether there is and avoid single congestion link of equal value
South orientation or north orientation routing, if it is present the south orientation for choosing the condition that meets or north orientation routing are as new routing, heavy-route terminates；
If it does not exist, then executing step e-1-4)；E-1-4) is incremented by link change number, if the old chain to be deleted in network topology
When number or new node number can continue growing, then number of nodes is newly increased by increasing the old chain number to be deleted or increasing, be incremented by
Link change number △ P executes step e-1-5)；Conversely, thening follow the steps e-1-6)；E-1-5 the judgement after) link is incremented by, is passed
After increasing link change number, controller judges whether there is the south orientation for getting around single congestion link of equal value or north orientation routing, if it does,
Then choosing the routing is new routing, and heavy-route terminates；If it does not exist, then executing step e-1-4)；E-1-6) is using traditional
Dijkstra's algorithm calculates shortest route as new routing.
SDN network congestion link method of adjustment based on transfer value of the invention, step b) obtain traffic flow information
Method are as follows: controller timing each OpenFlow interchanger sending port status information request message PSQ into network, each
After OpenFlow interchanger receives PSQ message, a port replying state information PSR, PSR information note all are fed back to controller
The information of the data flow flowed through on each port of interchanger is recorded comprising the head mark and flow velocity size information of data flow.
SDN network congestion link method of adjustment based on transfer value of the invention, if the utilization of link in step c)
Rate reaches 90%, then determines that current ink is in congestion state.
SDN network congestion link method of adjustment based on transfer value of the invention, from flowing through congestion link in step d)
Data flow in, select to flow through the least stream of congestion link as stream to be transferred, to reduce transfer value.
The beneficial effects of the present invention are: SDN network congestion link method of adjustment of the invention, SDN controller obtains link
After topology and discovery congestion, select on congestion link that suitable data flow is as stream to be transferred, using its path as heavy-route
Path to be processed, the congestion on path is divided into congestion link of equal value single and more congestion link differentiations are handled, to more congestion chains
Road transfer is the combination of multiple single congestion links of equal value, not only solves link congestion, but also make transfer value minimum, reduces meter
Complexity is calculated, data flow transfer efficiency is improved.
The present invention relates to the south orientation network controls based on congestion link method of adjustment in transfer value SDN network, in SDN network
Technology processed needs that the mechanical floor in whole network is managed and dispatched, including link discovery, Topology Management, policy development,
Flow entry issues.The lower routing method of adjustment of transfer value that logical this patent proposes, reduces computational complexity, improves weight road
By efficiency.
Detailed description of the invention
Fig. 1: south orientation heavy-route node increments scheme schematic diagram；
Fig. 2: north orientation heavy-route node increments scheme schematic diagram；
Fig. 3: more congestion link schematic diagrames；
Fig. 4: SDN network congestion link method of adjustment flow chart；
Fig. 5: single congestion link heavy-route adjusts flow chart.
Specific embodiment
The invention will be further described with embodiment with reference to the accompanying drawing.
SDN network congestion link method of adjustment based on transfer value of the invention, is realized by following steps:
A) obtains link topology, and under SDN network, controller uses link according to OpenFlow v1.0 standard agreement
Layer discovery agreement LLDP obtains overall network topology；
Wherein, LLDP is the abbreviation of Link Layer Discovery Protocol, means Link Layer Discovery Protocol.
B) obtains traffic flow information, and controller timing each OpenFlow interchanger into SDN network sends inquiry and disappears
Breath, to obtain the traffic flow information of each port on OpenFlow interchanger, traffic flow information includes the head mark of data flow
Know and flow velocity size；
In the step, the method that obtains traffic flow information are as follows: controller timing each OpenFlow into network is exchanged
Machine sending port status information request message PSQ after each OpenFlow interchanger receives PSQ message, is fed back to controller
A port replying state information PSR, the PSR information have recorded the information of the data flow flowed through on each port of interchanger,
Head mark and flow velocity size information including data flow.
PSQ is the abbreviation of Port State reQuest Message, means port status information request message；PSR is
The abbreviation of Port State Reply Message, means port status return information.
C) judges congestion state, judge the transmission queue length in link whether be more than link capacity setting thresholding
Value executes step d) if it does, then showing that the link is in congestion state；If be not above, then follow the steps b), weight
It is new to obtain traffic flow information；
In the step, if the utilization rate of link reaches 90% in step c), determine that current ink is in congestion state.
D) selects stream to be transferred, select suitable stream as stream to be transferred from the data flow for flow through congestion link, so as to
It treats turn of tidal stream and carries out heavy-route；
In the step, in step d) from the data flow for flowing through congestion link, selection flows through the least stream of congestion link and makees
For stream to be transferred, to reduce transfer value.
E) adjustment of heavy-route, then according to step e-1) and step e-2) heavy-route adjustment is carried out to it；
E-1) if the routing of stream to be transferred is single congestion link of equal value, chain is found from existing network topological structure
The least new routing of road knots modification, as the new routing of stream to be transferred, and the delay, the bandwidth satisfaction transfer that ensure newly to route are flowed
Business demand；
The step is realized by the following method:
E-1-1) sets south orientation, north orientation routing, if the source node of stream to be transferred, destination node are respectively S and D, congestion
Link is AB sections, and defining south orientation heavy-route is using the start node A of congestion link as starting point, along the telegoniometer to destination node D
Calculate heavy-route；Defining north orientation heavy-route is to calculate weight as terminal, along source node S downwardly direction using the terminal note B of congestion link
Routing；
E-1-2) calculates link change number, for needing to delete m old link and increasing slave X to the Y's that number of nodes is n
Adjusted Option is routed, XY (m, n) is denoted as, link change number △ P is calculated by formula (1):
△ P=m+n+1 (1)
M is the old link number to be deleted, due at least to delete congestion link, therefore m >=1；N is to newly increase number of nodes, n
≥0；
E-1-3) finds the smallest routing of transfer value, and controller is according to the calculating of link change number in step e-1-2)
Formula seeks the minimum value of link change number；When link change is minimized, judges whether there is and avoid single congestion chain of equal value
The south orientation or north orientation on road route, if it is present the south orientation for choosing the condition that meets or north orientation routing are as new routing, heavy-route knot
Beam；If it does not exist, then executing step e-1-4)；
E-1-4) is incremented by link change number, if the old chain number or new node number to be deleted in network topology can continue
When increase, then number of nodes is newly increased by increasing the old chain number to be deleted or increasing, be incremented by link change number △ P, execute step
Rapid e-1-5)；Conversely, thening follow the steps e-1-6)；
E-1-5 the judgement after) link is incremented by, after being incremented by link change number, it is of equal value single that controller judges whether there is bypass
The south orientation or north orientation of congestion link route, if it is present choosing the routing is new routing, heavy-route terminates；If it does not,
Then follow the steps e-1-4)；
E-1-6) calculates shortest route as new routing using traditional dijkstra's algorithm.
E-2) if the routing of stream to be transferred is more congestion links, more congestion links are decomposed into multiple equivalences first
Then the combination of single congestion link is that each single congestion link of equal value selects transfer value minimum according still further to the method for step e-1)
New routing, ultimately form the new routing for avoiding more congestion links；
F) adjustment of flow table routing, the controller of SDN network issues routing new flow table adjusted, to be transferred to adjust
The transmission path of stream avoids the appearance of congestion.
Access in routing between two neighboring node is known as link, if there was only a congestion in the routing of stream to be transferred
Link, referred to as single congestion link；If continuously there are two or more congestion links, the node since congestion at this time
A single congestion link can be equivalent to multiple links between terminal node.
S is set as sending node, D is purpose node, it is assumed that congestion link is AB sections, and emphasis considers the smallest heavy road of cost
By scheme, i.e., the quantity of link change is reduced as far as possible.Defining south orientation heavy-route as a result, is to be with the node A that rises of congestion link
The starting point of heavy-route, along the direction calculating heavy-route to destination node D, as shown in Figure 1, giving south orientation heavy-route node increments
Scheme schematic diagram.The definition of north orientation heavy-route, be using the terminal note B of congestion link as the terminal of heavy-route, it is downward along source node S
Direction calculating heavy-route, as shown in Fig. 2, giving north orientation heavy-route node increments scheme schematic diagram.
Heavy-route transfer value: data flow f passes through an oriented topological diagram, and former routing link number is P, new after heavy-route
The knots modification of non-congested link is Δ P, and former number of links and increased new number of links including deletion, then transfer value defines
Are as follows: T (f)=Δ P/P.Thus a certain transfer is flowed, number of links P is fixed value, if keeping transfer value minimum, should make Δ P
It is minimum.
The purpose of rerouting is to avoid congestion link, and the smallest new routing of transfer value is selected to continue.As original
Then, it is as shown in table 1 below to calculate rerouting scheme for south orientation.Wherein, for needing to delete m old link and new routing node number for n
Slave X to Y heavy-route Adjusted Option, be denoted as XY (m, n).By following table it is found that link change number at this time are as follows:
Δ P=m+n+1
Table 1
In table 1, m is to delete old chain to connect number, and rerouting scheme at least needs to delete current congestion link, then m >=1, works as m=
When 1, rerouting scheme is included into south orientation scheme, and as m > 1, there are north and south bi-directional solutions；Meanwhile n is to increase number of nodes, if depositing
Direct link between two nodes, then n=0, so n >=0.
As a result, using link change number as independent variable, then it is as shown in table 2 to route adjustable strategies.
Table 2
It can be obtained by table 2, when link change amount is x, existing north-south heavy-route global schema number is up to 2*x-3,
Middle x >=3.To a specified congestion link, feasible heavy-route side can be found one by one according to the sequence that link change amount is incremented by
Case.That is: since link change amount be equal to 3, successively searched from upper table at this time corresponding AB (1,1)/AB1 (2,0)/A1B (2,
0) new routing whether there is, and if it exists, then judge whether to meet the demands such as business delay, bandwidth, if meet demand, record is worked as
Preceding link change amount；Otherwise being incremented by link change amount is 4, searches corresponding new routing, repeats the above process, until finding heavy-route
Scheme.If being incremented by link change amount can not find feasible rerouting scheme, calculated using traditional dijkstra's algorithm most short
Routing terminates heavy-route process as new routing.
If the routing of current stream to be transferred is more congestion links, more congestion links are decomposed into single congestion chain of equal value first
The combination on road, the strategy are suitable for the case where there are multiple discontinuous congestion links among two nodes, at this point, cannot simply by
Routing is equivalent to a single congestion link between two node, and needs to treat as multiple discontinuous congestion links.
Assuming that certain stream F start-stop point to be transferred is respectively S and D, the endpoint of equal value of congestion link is A and B (i.e. S- > A, B- >
The part D is without congestion), which has t congestion link in, is labeled as C (C1, C2 ..., Ct), is marked with black thick line；To a certain
Congestion link Ci (i ∈ [1, t]), corresponding start-stop point are Pis and Pid, as shown in figure 3, giving more congestion link signals
Figure.More congestion links are carried out single congestion link rerouting scheme to decompose, as shown in table 3, more congestion links is given and decomposes
Process:
Table 3
The link change amount of more congestion links as a result, are as follows:
Δ P=Δ P1…α+ΔP(α+1)…β+ΔP(β+1)…γ+…+ΔPδ…t
Wherein, 1≤α≤β≤...≤γ≤δ≤t；
So far, more congestion links have also been converted to the combination of multiple single congestion links of equal value, then according still further to front list
Congestion link method of adjustment is adjusted separately.I.e., it is assumed that in the routing containing t=9 congestion link, network topology
In, if the single congestion routing of the equivalence that C123, C45 and C6789 can be found, link change amount are as follows:
Δ P=Δ P123+ΔP45+ΔP6789
By table 3 it can be concluded that congestion link quantity and the relationship of single congestion routing plan of equal value are as shown in table 4:
Table 4
It can be seen that index is presented in list congestion link routing plan quantity of equal value when congestion link number is continuously increased
Functional form increases severely.Therefore, when adjusting congestion link, it should preferential to select in flowing through the data flow in the congestion link
The least stream of congestion link section is flowed through to shift, adjustment is avoided to flow through the routing of the more data flow of congestion link, it is multiple to reduce
Miscellaneous degree improves operation efficiency.
Claims (4)
1. a kind of SDN network congestion link method of adjustment based on transfer value, which is characterized in that by following steps come real
It is existing:
A) obtains link topology, and under SDN network, controller is sent out according to OpenFlow v1.0 standard agreement using link layer
Existing agreement LLDP obtains overall network topology；
B) obtains traffic flow information, and controller timing each OpenFlow interchanger into SDN network sends query messages,
To obtain the traffic flow information of each port on OpenFlow interchanger, traffic flow information include data flow head mark and
Flow velocity size；
C) judges congestion state, judge the transmission queue length in link whether be more than link capacity setting threshold value, such as
Fruit is more than then to show that the link is in congestion state, executes step d)；If be not above, thens follow the steps b), reacquire
Traffic flow information；
D) selects stream to be transferred, is selected from the data flow for flow through congestion link through the least stream of congestion link as to be transferred
Stream carries out heavy-route to treat turn of tidal stream；
E) adjustment of heavy-route, then according to step e-1) and step e-2) heavy-route adjustment is carried out to it；
E-1) if the routing of stream to be transferred is single congestion link of equal value, link is found from existing network topological structure and is changed
Parameter △ P changes least routing as newly routing, as the new routing of stream to be transferred, and ensure newly to route delay, bandwidth
Meet the business demand of transfer stream；
E-2) if the routing of stream to be transferred is more congestion links, more congestion links is decomposed into multiple equivalences first and are singly gathered around
The combination of link is filled in, is then that each single congestion link of equal value selects transfer value the smallest new according still further to the method for step e-1)
Routing, ultimately forms the new routing for avoiding more congestion links；
F) adjustment of flow table routing, the controller of SDN network issues routing new flow table adjusted, to adjust stream to be transferred
Transmission path avoids the appearance of congestion；
Step e-1) described in heavy-route realized by following steps:
E-1-1) sets south orientation, north orientation routing, if the source node of stream to be transferred, destination node are respectively S and D, congestion link
It is AB sections, defining south orientation heavy-route is using the start node A of congestion link as starting point, along the direction calculating weight to destination node D
Routing；Defining north orientation heavy-route is to calculate heavy-route as terminal, along source node S downwardly direction using the terminal note B of congestion link；
E-1-2) calculates link change number, for needing to delete m old link and increasing number of nodes as the routing of slave X to the Y of n
Adjusted Option is denoted as XY (m, n), calculates link change number △ P by formula (1):
△ P=m+n+1 (1)
M is the old link number to be deleted, due at least to delete congestion link, therefore m >=1；N is to newly increase number of nodes, n >=0；
E-1-3) finds the smallest routing of transfer value, controller according to the calculation formula of link change number in step e-1-2),
Seek the minimum value of link change number；When link change is minimized, judges whether there is and avoid single congestion link of equal value
South orientation or north orientation routing, if it is present the south orientation for choosing the condition that meets or north orientation routing are as new routing, heavy-route terminates；
If it does not exist, then executing step e-1-4)；
E-1-4) is incremented by link change number, if the old chain number or new node number to be deleted in network topology can continue growing
When, then number of nodes is newly increased by increasing the old chain number to be deleted or increasing, be incremented by link change number △ P, executes step e-
1-5)；Conversely, thening follow the steps e-1-6)；
E-1-5 the judgement after) link is incremented by, after being incremented by link change number, controller judges whether there is bypass single congestion of equal value
The south orientation or north orientation of link route, if it is present choosing the routing is new routing, heavy-route terminates；If it does not exist, then holding
Row step e-1-4)；
E-1-6) calculates shortest route as new routing using traditional dijkstra's algorithm.
2. the SDN network congestion link method of adjustment according to claim 1 based on transfer value, it is characterised in that: step
The rapid method for b) obtaining traffic flow information are as follows: controller timing each OpenFlow interchanger sending port state into network
Information request message PSQ after each OpenFlow interchanger receives PSQ message, is returned to controller feedback a port state
Complex information PSR, the PSR information have recorded the information of the data flow flowed through on each port of interchanger comprising the head of data flow
Portion's mark and flow velocity size information.
3. the SDN network congestion link method of adjustment according to claim 1 or 2 based on transfer value, it is characterised in that:
If the utilization rate of link reaches 90% in step c), determine that current ink is in congestion state.
4. the SDN network congestion link method of adjustment according to claim 1 or 2 based on transfer value, it is characterised in that:
In step d) from the data flow for flowing through congestion link, select to flow through the least stream of congestion link as stream to be transferred, to reduce
Transfer value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610640026.1A CN106230722B (en) | 2016-08-05 | 2016-08-05 | SDN network congestion link method of adjustment based on transfer value |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610640026.1A CN106230722B (en) | 2016-08-05 | 2016-08-05 | SDN network congestion link method of adjustment based on transfer value |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106230722A CN106230722A (en) | 2016-12-14 |
| CN106230722B true CN106230722B (en) | 2019-07-09 |
Family
ID=57546958
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610640026.1A Active CN106230722B (en) | 2016-08-05 | 2016-08-05 | SDN network congestion link method of adjustment based on transfer value |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106230722B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108243111B (en) | 2016-12-27 | 2021-08-27 | 华为技术有限公司 | Method and device for determining transmission path |
| CN107294810B (en) * | 2017-07-14 | 2020-01-17 | 山东省计算中心（国家超级计算济南中心） | Network delay measurement optimization method under software defined network environment |
| CN107483354A (en) * | 2017-08-30 | 2017-12-15 | 郑州云海信息技术有限公司 | Network congestion based on SDN solves method and system |
| CN109768924B (en) * | 2019-02-14 | 2021-06-08 | 山东省计算中心（国家超级计算济南中心） | SDN network multilink fault recovery method and system oriented to multi-stream coexistence |
| CN111010330B (en) * | 2019-12-06 | 2021-11-23 | 苏州浪潮智能科技有限公司 | Method, device and medium for detecting and recovering congested link |
| CN112509557B (en) * | 2020-11-24 | 2023-03-31 | 杭州一知智能科技有限公司 | Speech recognition method and system based on non-deterministic word graph generation |
| CN113141315B (en) * | 2021-04-20 | 2022-12-27 | 上海卓易科技股份有限公司 | Congestion control method and equipment |
| CN114389991B (en) * | 2021-12-20 | 2023-09-29 | 中盈优创资讯科技有限公司 | Intelligent network flow scheduling management method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105227481A (en) * | 2015-09-02 | 2016-01-06 | 重庆邮电大学 | The SDN congestion control method for routing of cost minimization is dispatched based on path cost and stream |
| CN105743804A (en) * | 2016-02-04 | 2016-07-06 | 北京邮电大学 | Data flow control method and system |
-
2016
- 2016-08-05 CN CN201610640026.1A patent/CN106230722B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105227481A (en) * | 2015-09-02 | 2016-01-06 | 重庆邮电大学 | The SDN congestion control method for routing of cost minimization is dispatched based on path cost and stream |
| CN105743804A (en) * | 2016-02-04 | 2016-07-06 | 北京邮电大学 | Data flow control method and system |
Non-Patent Citations (1)
| Title |
|---|
| 《面向SDN的拥塞控制算法研究》;赵安澜，汪帅，陶君;《信息通信》;20160215(第2期);全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106230722A (en) | 2016-12-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106230722B (en) | SDN network congestion link method of adjustment based on transfer value | |
| CN105847151B (en) | A kind of software-oriented defines the Multi-constraint QoS paths strategy design method of network | |
| CN106789648B (en) | Software defined network route decision method based on content storage and Network status | |
| CN105357068B (en) | The OpenFlow method for controlling network flow that a kind of application-oriented QoS is ensured | |
| CN103229468B (en) | Packet-switched resources distribution method and equipment | |
| CN103190126B (en) | Communication system, control device, packet forwarding path control method and program | |
| CN108833279B (en) | Method for multi-constraint QoS routing based on service classification in software defined network | |
| CN106533960A (en) | Data center network routing method based on Fat-Tree structure | |
| Zhang et al. | Toward concurrent video multicast orchestration for caching-assisted mobile networks | |
| CN108234312B (en) | Flow scheduling method, PCE (path computation element) and SDN (software defined network) system | |
| CN105960783A (en) | Inter-domain SDN traffic engineering | |
| CN108092888A (en) | A kind of transmission method based on Overlay networks, gateway and Transmission system | |
| CN105357124B (en) | A kind of MapReduce bandwidth optimization methods | |
| Bi et al. | Intelligent quality of service aware traffic forwarding for software-defined networking/open shortest path first hybrid industrial internet | |
| CN106559330A (en) | A kind of dynamic path planning method based on SDN | |
| CN101155131A (en) | Method for establishing label switched path of minimized path preemption cost | |
| WO2021136430A1 (en) | Path selection method and apparatus, computer device, and computer readable medium | |
| CN105553845A (en) | Software defined network route selection method | |
| CN101841487A (en) | Configuration method for aggregating link service flow and packet switching device | |
| CN105933227A (en) | Methods for routing decision and flow table consistency optimization in software defined satellite network | |
| CN106059941A (en) | Backbone network traffic scheduling method for eliminating link congestion | |
| CN109600319A (en) | A kind of traffic scheduling method in real-time Transmission mechanism | |
| CN106850422A (en) | A kind of route optimal selection method and system based on Router Reflector | |
| CN103327542B (en) | A kind of QoS support method and device that is applied to MANET network | |
| CN106161053A (en) | A kind of SDN controller QoS manages system and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |