CN106230722A - SDN congestion link method of adjustment based on transfer value - Google Patents
SDN congestion link method of adjustment based on transfer value Download PDFInfo
- Publication number
- CN106230722A CN106230722A CN201610640026.1A CN201610640026A CN106230722A CN 106230722 A CN106230722 A CN 106230722A CN 201610640026 A CN201610640026 A CN 201610640026A CN 106230722 A CN106230722 A CN 106230722A
- Authority
- CN
- China
- Prior art keywords
- link
- route
- congestion
- stream
- heavy
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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
The SDN congestion link method of adjustment based on transfer value of the present invention, including: a). obtain link topology；B). obtain traffic flow information；C). judge congestion state；D). select stream to be transferred；E). the adjustment of heavy-route, e 1). from network topology structure, find the new route that link change amount is minimum；E 2). if many congestion links, first it is broken down into multiple single congestion link of equal value, then according to e 1) heavy-route；F). the adjustment of stream table route.The SDN congestion link method of adjustment of the present invention, congested on path is divided into single congestion link of equal value and the differentiation of many congestion links process, it it is the combination of multiple single congestion link of equal value to the transfer of many congestion links, both link congestion had been solved, make again transfer value minimum, reduce computation complexity, improve stream compression and move efficiency.
Description
Technical field
The present invention relates to a kind of network link method of adjustment, in particular, particularly relate to a kind of based on transfer value
SDN congestion link method of adjustment.
Background technology
((Software Defined Network, SDN), is a kind of new network innovation framework to software defined network, purport
By being separated with data surface by network equipment chain of command, it is achieved the flexible control of network traffic data, make network conduct
Data transmission pipe becomes more intelligent.Key-course uses centerized fusion device to carry out the network equipment that keyholed back plate is different, consequently, it is possible to
Network is easier to be controlled and management, and allows bit transmit smoothly in forwarding.Controller by escape way with
OpenFlow switch communicates, and issues stream table with Controlling principle to determine the flow direction of flow.SDN can be for different uses
Demand, sets up service level agreement, allow user access service time, it is thus achieved that due guarantee.
In recent years, along with the high speed development of information technology, disparate networks intersect fusion and quantity of information be magnanimity formula
Increasing, just there is deep change at aspects such as composition, structure, function, scale and application models in network.Due to physical condition
Restriction, network size can not unrestrictedly expand.Defect or the restriction of network components performance, network due to routing algorithm
In data transmission likely can not get responding timely, cause mass data bag to cache in a network, at this moment network just produce
Give birth to congested.
In order to realize the scheduling of congestion data stream gravity, need to solve two big main bugbears: to any data during (1) congested generation
Stream reschedules；(2) these data streams how are dispatched.In view of there is multiple data stream on congestion link, it is carried out
The cost of heavy-route is bigger.
First, selecting the data stream of heavy-route, the core concept having document is, when network will occur congested, to gather around
Find out the maximum data stream of an occupied bandwidth (or stream greatly) on plug link, carried out heavy-route.The shortcoming of this method is
Only consider the bandwidth parameter of data stream, do not account for the service attribute of data stream, if the data stream of occupied bandwidth maximum is
Article one, the Streaming Media class Business Stream of real-time class, and the newly selected path delay is bigger, then in this case, can have a strong impact on
Application to user is experienced, and the most this heavy-route strategy is not an optimum selection.It addition, balancing link load is main
Being to consider uninterrupted and link utilization on link, do so is unfavorable for ensureing link utilization, especially increases also when load
And link is when becoming saturated, finding open ended link for big stream can be highly difficult.
Secondly, the new route after heavy-route to consider the length of comprised link, namely jumping figure；It addition, controller is wanted
It is responsible in new route flow table to corresponding switch.Congestion link heavy-route is taked more to the side of SPF
Method, being that every data stream selects K bar shortest path in advance, when occurring congested when, traveling through this K paths in order until looking for
To a path the most congested, but this method calculation cost is bigger.The new route that this method produces can ensure that jumping figure is
Little, but in view of when issuing new stream table, forward rule be encapsulated in Packet_out message and be handed down to switch by controller,
Switch stream table needs Real-time and Dynamic to update, and the most expired stream list item can be deleted.Thus, when obtaining shortest path, its chain
The knots modification (including the link increasing and deleting) on road often becomes very big, causes transfer value quantitative change big.
Summary of the invention
The present invention is for the shortcoming overcoming above-mentioned technical problem, it is provided that a kind of SDN based on transfer value is congested
Link method of adjustment.
The SDN congestion link method of adjustment based on transfer value of the present invention, it is particular in that, by following
Step realizes:
A). obtaining link topology, under SDN, controller, according to OpenFlow v1.0 standard agreement, uses link
Layer finds that agreement LLDP obtains overall network topology；B). obtain traffic flow information, controller timing in SDN each
OpenFlow switch sends query messages, to obtain the traffic flow information of each port on OpenFlow switch, data stream
Information includes head mark and the flow velocity size of data stream；C). judge congestion state, it is judged that the transmission queue length in link
Whether exceed the threshold value that link capacity sets, if it does, then show that this link is in congestion state, perform step d)；
Without exceeding, then perform step b), reacquire traffic flow information；D). select stream to be transferred, from flowing through congestion link
Data stream select suitably stream as stream to be transferred, in order to treat turn of tidal stream and carry out heavy-route；E). the adjustment of heavy-route, then press
According to step e-1) and step e-2) it is carried out heavy-route adjustment；E-1) if. the route of stream to be transferred is congested chain of equal value single
Road, then find the new route that link change amount is minimum from existing network topological structure, as the new route of stream to be transferred, and really
Protect the delay of new route, bandwidth meets the business demand that transfer is flowed；E-2) if. the route of stream to be transferred is many congestion links,
The most congestion links are decomposed into the combination of multiple congestion link of equal value single, then according still further to step e-1) method be every
Individual single congestion link of equal value selects the new route that transfer value is minimum, ultimately forms the new route avoiding many congestion links；F). stream
The adjustment of table route, the controller of SDN issues the new stream table after route adjusts, to adjust the transmission path of stream to be transferred,
Avoid congested appearance.
The SDN congestion link method of adjustment based on transfer value of the present invention, step e-1) described in heavy-route lead to
Cross following steps to realize: e-1-1). set south orientation, north orientation route, if the source node of stream to be transferred, destination node are respectively S
And D, its congestion link is AB section, and definition south orientation heavy-route is with the start node A of congestion link as starting point, along to destination node
The direction calculating heavy-route of D；Definition north orientation heavy-route is with the terminal note B of congestion link as terminal, along the downward side of source node S
To calculating heavy-route；E-1-2). calculate link change number, for need delete m bar old link and increase nodes be n from X
To the route Adjusted Option of Y, be designated as XY (m, n), by formula (1) calculate link change number △ P:
△ P=m+n+1 (1)
M is old link number to be deleted, due to congestion link to be deleted, therefore m >=1；N for newly increasing nodes, n
≥0；E-1-3). finding the route that transfer value is minimum, controller is according to step e-1-2) link changes the computing formula of number,
Ask for the minima of link change number；When link change takes minima, it may be judged whether exist and avoid single congestion link of equal value
South orientation or north orientation route, if it is present choose south orientation or the new route of north orientation route conduct meeting condition, heavy-route terminates；
If it does not exist, then perform step e-1-4)；E-1-4). it is incremented by link change number, if old chain to be deleted in network topology
When way or new node number can continue to increase, then newly increase nodes by increase old chain way to be deleted or increase, be incremented by
Link change number △ P, performs step e-1-5)；Otherwise, then step e-1-6 is performed)；E-1-5). the judgement after link is incremental, pass
After increasing link change number, controller judges whether to get around south orientation or the north orientation route of single congestion link of equal value, if it does,
Then choosing this route to route for new, heavy-route terminates；If it does not exist, then perform step e-1-4)；E-1-6). use traditional
Dijkstra's algorithm calculates shortest route as new route.
The SDN congestion link method of adjustment based on transfer value of the present invention, step b) obtains traffic flow information
Method is: controller timing each OpenFlow switch in network sends port status information request message PSQ, each
After OpenFlow switch receives PSQ message, all feeding back a port status return information PSR to controller, this PSR information is remembered
Record the information of the data stream flowed through on each port of switch, it head mark including data stream and flow velocity size information.
The SDN congestion link method of adjustment based on transfer value of the present invention, if the utilization of link in step c)
Rate reaches 90%, then judge that current ink is in congestion state.
The SDN congestion link method of adjustment based on transfer value of the present invention, from flowing through congestion link in step d)
Data stream in, select to flow through the minimum stream of congestion link as stream to be transferred, to reduce transfer value.
The invention has the beneficial effects as follows: the SDN congestion link method of adjustment of the present invention, SDN controller obtains link
Topology and find congested after, select on congestion link that suitably data stream is as stream to be transferred, using its path as heavy-route
Pending path, congested on path is divided into single congestion link of equal value and the differentiation of many congestion links process, to how congested chain
Road transfer is the combination of multiple single congestion link of equal value, had both solved link congestion, and had made again transfer value minimum, reduce meter
Calculate complexity, improve stream compression and move efficiency.
The present invention relates to based on congestion link method of adjustment in transfer value SDN, the south orientation network control in SDN
Technology processed needs the mechanical floor in whole network is carried out management and control and scheduling, including link discovery, Topology Management, policy development,
Stream list item issues.Lead to the route method of adjustment that the transfer value of this patent proposition is relatively low, reduce computational complexity, improve weight road
By efficiency.
Accompanying drawing explanation
Fig. 1: south orientation heavy-route node increments scheme schematic diagram；
Fig. 2: north orientation heavy-route node increments scheme schematic diagram；
Fig. 3: many congestion links schematic diagram；
Fig. 4: SDN congestion link method of adjustment flow chart；
Fig. 5: single congestion link heavy-route adjusts flow chart.
Detailed description of the invention
The invention will be further described with embodiment below in conjunction with the accompanying drawings.
The SDN congestion link method of adjustment based on transfer value of the present invention, is realized by following steps:
A). obtaining link topology, under SDN, controller, according to OpenFlow v1.0 standard agreement, uses link
Layer finds that agreement LLDP obtains overall network topology；
Wherein, LLDP is the abbreviation of Link Layer Discovery Protocol, means Link Layer Discovery Protocol.
B). obtaining traffic flow information, controller timing each OpenFlow switch in SDN sends inquiry and disappears
Breath, to obtain the traffic flow information of each port on OpenFlow switch, traffic flow information includes the head mark of data stream
Know and flow velocity size；
In this step, the method obtaining traffic flow information is: controller timing each OpenFlow exchange in network
Machine sends port status information request message PSQ, after each OpenFlow switch receives PSQ message, all feeds back to controller
One port status return information PSR, this PSR information have recorded the information of the data stream flowed through on each port of switch, its
Head including data stream identifies and flow velocity size information.
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). judge congestion state, it is judged that whether the transmission queue length in link has exceeded the thresholding that link capacity sets
Value, if it does, then show that this link is in congestion state, performs step d)；Without exceeding, then perform step b), weight
Newly obtain traffic flow information；
In this step, if the utilization rate of link reaches 90% in step c), then judge that current ink is in congestion state.
D). select stream to be transferred, select suitably stream as stream to be transferred from the data stream flowing through congestion link, in order to
Treat turn of tidal stream and carry out heavy-route；
In this step, in step d) from the data stream flowing through congestion link, select to flow through the minimum stream of congestion link and make
For stream to be transferred, to reduce transfer value.
E). the adjustment of heavy-route, then according to step e-1) and step e-2) it is carried out heavy-route adjustment；
E-1) if. the route of stream to be transferred is congestion link of equal value single, then find chain from existing network topological structure
The new route that road knots modification is minimum, as the new route of stream to be transferred, and guarantees that the delay newly routeing, bandwidth meet transfer stream
Business demand；
This step realizes by the following method:
E-1-1). setting south orientation, north orientation route, if the source node of stream to be transferred, destination node are respectively S and D, it is congested
Link is AB section, and definition south orientation heavy-route is with the start node A of congestion link as starting point, along to the telegoniometer of destination node D
Calculate heavy-route；Definition north orientation heavy-route is heavy as terminal, along the calculating of source node S downwardly direction with the terminal note B of congestion link
Route；
E-1-2). calculate link change number, for need delete m bar old link and increase nodes be n from X to Y
Route Adjusted Option, be designated as XY (m, n), by formula (1) calculate link change number △ P:
△ P=m+n+1 (1)
M is old link number to be deleted, due to congestion link to be deleted, therefore m >=1；N for newly increasing nodes, n
≥0；
E-1-3). finding the route that transfer value is minimum, controller is according to step e-1-2) link changes the calculating of number
Formula, asks for the minima of link change number；When link change takes minima, it may be judged whether exist and avoid single congested chain of equal value
The south orientation on road or north orientation route, if it is present choose south orientation or the new route of north orientation route conduct meeting condition, heavy-route is tied
Bundle；If it does not exist, then perform step e-1-4)；
E-1-4). it is incremented by link change number, if old chain way to be deleted in network topology or new node number can continue
During increase, then newly increase nodes by increase old chain way to be deleted or increase, be incremented by link change number △ P, perform step
Rapid e-1-5)；Otherwise, then step e-1-6 is performed)；
E-1-5). the judgement after link is incremental, after being incremented by link change number, controller judges whether to get around list of equal value
The south orientation of congestion link or north orientation route, route if it is present choose this route for new, and heavy-route terminates；If it does not,
Then perform step e-1-4)；
E-1-6). use traditional dijkstra's algorithm to calculate shortest route as new route.
E-2) if. the route of stream to be transferred is many congestion links, the most congestion links is decomposed into multiple equivalence
The combination of single congestion link, then according still further to step e-1) method be that each single congestion link of equal value selects transfer value minimum
New route, ultimately form the new route avoiding many congestion links；
F). the adjustment of stream table route, the controller of SDN issues the new stream table after route adjusts, to be transferred to adjust
The transmission path of stream, it is to avoid congested appearance.
In route, the path between adjacent two nodes is referred to as link, if in the route of stream to be transferred only one congested
Link, is referred to as single congestion link；If two or more congestion links occurring continuously, the most now from the node of congested beginning
Multiple links between terminal node can be equivalent to a single congestion link.
Setting S as sending node, node for the purpose of D, it is assumed that congestion link is AB section, emphasis considers the heavy road of Least-cost
By scheme, reduce the quantity of link change the most as far as possible.Thus, definition south orientation heavy-route is to be with the node A that rises of congestion link
The starting point of heavy-route, along to the direction calculating heavy-route of destination node D, as it is shown in figure 1, give south orientation heavy-route node increments
Scheme schematic diagram.North orientation heavy-route defines, and is the terminal with the terminal note B of congestion link as heavy-route, downward along source node S
Direction calculating heavy-route, as in figure 2 it is shown, give north orientation heavy-route node increments scheme schematic diagram.
Heavy-route transfer value: data stream f is 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, including the former number of links deleted and the new number of links of increase, then and transfer value definition
For: T (f)=Δ P/P.Thus to a certain transfer stream, its number of links P is fixed value, if making transfer value minimum, then should make Δ P
Minimum.
The purpose re-routed is to avoid congestion link, and select transfer value minimum newly route continuation.As former
Then, south orientation calculating rerouting scheme is as shown in table 1 below.Wherein, m bar old link is deleted for needs and new routing node number is n
The heavy-route Adjusted Option from X to Y, be designated as XY (m, n).From following table, now link change number is:
Δ P=m+n+1
Table 1
In table 1, m connects number for deleting old chain, 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, as m ＞ 1, there is north and south bi-directional solution；Meanwhile, n is for increasing nodes, if depositing
Direct link between two nodes, then n=0, so n >=0.
Thus, with link change number as independent variable, then route adjustable strategies is as shown in table 2.
Table 2
Can be obtained by table 2, when link change amount is x, the north-south heavy-route global schema number existed is up to 2*x-3, its
Middle x >=3.To a congestion link specified, feasible heavy-route side can be found one by one according to the order that link change amount is incremented by
Case.That is: from link change amount equal to 3 beginning, search successively from upper table now correspondence AB (1,1)/AB1 (2,0)/A1B (2,
0) whether new route exists, if existing, then judges whether to meet the demands such as business time delay, bandwidth, if meeting demand, then record is worked as
Front link change amount；Otherwise being incremented by link change amount is 4, searching corresponding new route, repeating said process, until finding heavy-route
Scheme.If being incremented by link change amount to can not find feasible rerouting scheme, then traditional dijkstra's algorithm is used to calculate the shortest
Route, as new route, terminates heavy-route process.
If the route of current stream to be transferred is many congestion links, the most congestion links are decomposed into single congested chain of equal value
The combination on road, this strategy is applicable to exist in the middle of two nodes the situation of multiple discontinuous congestion link, now, it is impossible to simply will
Between this two node, route is equivalent to a single congestion link, and needs to treat as multiple discontinuous congestion links.
Assume that certain stream F terminal to be transferred is respectively S and D, the end points of equal value of its congestion link be A and B (i.e. S-> A, B->
D part without congested), this stream by have t congestion link, be labeled as C (C1, C2 ..., Ct), with black thick line labelling；To a certain
Congestion link Ci (i ∈ [1, t]), its corresponding terminal is Pis and Pid, as it is shown on figure 3, give the signal of many congestion links
Figure.These many congestion links carry out single congestion link rerouting scheme decompose, as shown in table 3, give many congestion links and decompose
Process:
Table 3
Thus, the link change amount of these many congestion links is:
Δ P=Δ P1…α+ΔP(α+1)…β+ΔP(β+1)…γ+…+ΔPδ…t
Wherein, 1≤α≤β≤...≤γ≤δ≤t；
So far, many congestion links have changed into the combination of multiple single congestion link of equal value, then according still further to above single
Congestion link method of adjustment is adjusted respectively.I.e., it is assumed that in the route containing t=9 congestion link, its network topology
In, if of equal value single congested route of C123, C45 and C6789 can be found, then its link change amount is:
Δ P=Δ P123+ΔP45+ΔP6789
Can show that by table 3 relation of congestion link quantity routing plan congested with equivalence list is as shown in table 4:
Table 4
As can be seen here, when congestion link number is continuously increased, its single congestion link routing plan quantity of equal value presents index
Functional form increases severely.Therefore, when adjusting congestion link, it should in the data stream in flowing through this congestion link, prioritizing selection
The stream flowing through congestion link section minimum shifts, it is to avoid adjust the route flowing through the more data stream of congestion link, multiple to reduce
Miscellaneous degree, improves operation efficiency.
Claims (5)
1. a SDN congestion link method of adjustment based on transfer value, it is characterised in that come real by following steps
Existing:
A). obtaining link topology, under SDN, controller, according to OpenFlow v1.0 standard agreement, uses link layer to send out
Existing agreement LLDP obtains overall network topology；
B). obtaining traffic flow information, controller timing each OpenFlow switch in SDN sends query messages,
To obtain the traffic flow information of each port on OpenFlow switch, traffic flow information include data stream head mark and
Flow velocity size；
C). judge congestion state, it is judged that whether the transmission queue length in link has exceeded the threshold value that link capacity sets, as
Fruit exceedes, then show that this link is in congestion state, perform step d)；Without exceeding, then perform step b), reacquire
Traffic flow information；
D). select stream to be transferred, select suitably stream as stream to be transferred from the data stream flowing through congestion link, in order to treat
Turn of tidal stream carries out heavy-route；
E). the adjustment of heavy-route, then according to step e-1) and step e-2) it is carried out heavy-route adjustment；
E-1) if. the route of stream to be transferred is congestion link of equal value single, then find link from existing network topological structure and change
The new route that variable is minimum, as the new route of stream to be transferred, and guarantees that the delay newly routeing, bandwidth meet the business of transfer stream
Demand；
E-2) if. the route of stream to be transferred is many congestion links, the most congestion links is decomposed into multiple equivalence and singly gathers around
The combination of plug link, then according still further to step e-1) method be that each congestion link of equal value single selects minimum new of transfer value
Route, ultimately forms the new route avoiding many congestion links；
F). the adjustment of stream table route, the controller of SDN issues the new stream table after route adjusts, to adjust stream to be transferred
Transmission path, it is to avoid congested appearance.
SDN congestion link method of adjustment based on transfer value the most according to claim 1, it is characterised in that step
Rapid e-1) described in heavy-route realized by following steps:
E-1-1). set south orientation, north orientation route, if the source node of stream to be transferred, destination node are respectively S and D, its congestion link
For AB section, definition south orientation heavy-route is as starting point, along to the direction calculating weight of destination node D with the start node A of congestion link
Route；Definition north orientation heavy-route is with the terminal note B of congestion link as terminal, calculates heavy-route along source node S downwardly direction；
E-1-2). calculate link change number, for needing delete m bar old link and increase the route from X to Y that nodes is n
Adjusted Option, be designated as XY (m, n), by formula (1) calculate link change number △ P:
△ P=m+n+1 (1)
M is old link number to be deleted, due to congestion link to be deleted, therefore m >=1；N for newly increasing nodes, n >=0；
E-1-3). finding the route that transfer value is minimum, controller is according to step e-1-2) link changes the computing formula of number,
Ask for the minima of link change number；When link change takes minima, it may be judged whether exist and avoid single congestion link of equal value
South orientation or north orientation route, if it is present choose south orientation or the new route of north orientation route conduct meeting condition, heavy-route terminates；
If it does not exist, then perform step e-1-4)；
E-1-4). it is incremented by link change number, if old chain way to be deleted in network topology or new node number can continue to increase
Time, then newly increase nodes by increase old chain way to be deleted or increase, be incremented by link change number △ P, perform step e-
1-5)；Otherwise, then step e-1-6 is performed)；
E-1-5). the judgement after link is incremental, after being incremented by link change number, it is congested that controller judges whether to get around list of equal value
The south orientation of link or north orientation route, route if it is present choose this route for new, and heavy-route terminates；If it does not exist, then hold
Row step e-1-4)；
E-1-6). use traditional dijkstra's algorithm to calculate shortest route as new route.
SDN congestion link method of adjustment based on transfer value the most according to claim 1 and 2, it is characterised in that:
Step b) obtains the method for traffic flow information: controller timing each OpenFlow switch in network sends port shape
State information request message PSQ, after each OpenFlow switch receives PSQ message, feeds back a port status to controller
Return information PSR, this PSR information have recorded the information of the data stream flowed through on each port of switch, and it includes data stream
Head mark and flow velocity size information.
SDN congestion link method of adjustment based on transfer value the most according to claim 1 and 2, it is characterised in that:
If the utilization rate of link reaches 90% in step c), then judge that current ink is in congestion state.
SDN congestion link method of adjustment based on transfer value the most according to claim 1 and 2, it is characterised in that:
In step d) from the data stream flowing through congestion link, select to flow through the minimum 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 true CN106230722A (en) | 2016-12-14 |
| CN106230722B 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) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107294810A (en) * | 2017-07-14 | 2017-10-24 | 山东省计算中心（国家超级计算济南中心） | A kind of 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 |
| CN108243111A (en) * | 2016-12-27 | 2018-07-03 | 华为技术有限公司 | The method and apparatus for determining transmission path |
| CN109768924A (en) * | 2019-02-14 | 2019-05-17 | 山东省计算中心（国家超级计算济南中心） | A kind of SDN network multilink fault restoration methods and system coexisted towards multithread |
| CN111010330A (en) * | 2019-12-06 | 2020-04-14 | 苏州浪潮智能科技有限公司 | Method, device and medium for detecting and recovering congested link |
| CN112509557A (en) * | 2020-11-24 | 2021-03-16 | 杭州一知智能科技有限公司 | Speech recognition method and system based on non-deterministic word graph generation |
| CN113141315A (en) * | 2021-04-20 | 2021-07-20 | 上海卓易科技股份有限公司 | Congestion control method and equipment |
| CN114389991A (en) * | 2021-12-20 | 2022-04-22 | 中盈优创资讯科技有限公司 | Intelligent network traffic 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的拥塞控制算法研究》", 《信息通信》 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10924413B2 (en) | 2016-12-27 | 2021-02-16 | Huawei Technologies Co., Ltd. | Transmission path determining method and apparatus |
| CN108243111A (en) * | 2016-12-27 | 2018-07-03 | 华为技术有限公司 | The method and apparatus for determining transmission path |
| WO2018121068A1 (en) * | 2016-12-27 | 2018-07-05 | 华为技术有限公司 | Method and device for determining transmission path |
| 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 |
| CN107294810A (en) * | 2017-07-14 | 2017-10-24 | 山东省计算中心（国家超级计算济南中心） | A kind of 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 |
| CN109768924A (en) * | 2019-02-14 | 2019-05-17 | 山东省计算中心（国家超级计算济南中心） | A kind of SDN network multilink fault restoration methods and system coexisted towards multithread |
| CN111010330A (en) * | 2019-12-06 | 2020-04-14 | 苏州浪潮智能科技有限公司 | Method, device and medium for detecting and recovering congested link |
| CN112509557A (en) * | 2020-11-24 | 2021-03-16 | 杭州一知智能科技有限公司 | Speech recognition method and system based on non-deterministic word graph generation |
| CN113141315A (en) * | 2021-04-20 | 2021-07-20 | 上海卓易科技股份有限公司 | Congestion control method and equipment |
| CN113141315B (en) * | 2021-04-20 | 2022-12-27 | 上海卓易科技股份有限公司 | Congestion control method and equipment |
| CN114389991A (en) * | 2021-12-20 | 2022-04-22 | 中盈优创资讯科技有限公司 | Intelligent network traffic scheduling management method and device |
| CN114389991B (en) * | 2021-12-20 | 2023-09-29 | 中盈优创资讯科技有限公司 | Intelligent network flow scheduling management method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106230722B (en) | 2019-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106230722A (en) | SDN congestion link method of adjustment based on transfer value | |
| CN106789648B (en) | Software defined network route decision method based on content storage and Network status | |
| CN103346922B (en) | The controller of determination network state based on SDN and determine method | |
| CN105471764B (en) | A kind of method of end-to-end QoS guarantee in SDN network | |
| CN104158753B (en) | Dynamic stream scheduling method and system based on software defined network | |
| CN108521375A (en) | The transmission of the network multi-service flow QoS based on SDN a kind of and dispatching method | |
| CN106533960A (en) | Data center network routing method based on Fat-Tree structure | |
| CN102710489B (en) | Dynamic shunt dispatching patcher and method | |
| CN103190126B (en) | Communication system, control device, packet forwarding path control method and program | |
| CN105960783A (en) | Inter-domain SDN traffic engineering | |
| CN106559330A (en) | A kind of dynamic path planning method based on SDN | |
| CN101729430B (en) | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty | |
| CN103414650A (en) | Routing method and device for congestion avoidance | |
| CN106209669A (en) | Towards SDN data center network maximum of probability path stream scheduling method and device | |
| CN105553845A (en) | Software defined network route selection method | |
| CN106533939B (en) | A kind of wide dynamic adjusting method of software definition soft exchange convergence mesh belt and device | |
| CN101159695A (en) | Link selecting method and apparatus | |
| 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 | |
| CN103746915A (en) | Routing selection method based on differentiated service | |
| CN105337899A (en) | Optical network energy-saving routing method capable of flexibly adjusting reserved-type service transmission bandwidth | |
| CN115314355A (en) | Electric power communication network architecture system and method based on deterministic network | |
| CN110535770B (en) | QoS-aware-based intelligent routing method for video stream in SDN environment | |
| CN101163100B (en) | Tunnel mapping method | |
| CN103795606A (en) | Service transfer control method based on sdn in optical network |
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 |