CN106341346B - A kind of routing algorithm ensureing QoS in data center network based on SDN - Google Patents
A kind of routing algorithm ensureing QoS in data center network based on SDN Download PDFInfo
- Publication number
- CN106341346B CN106341346B CN201610810708.2A CN201610810708A CN106341346B CN 106341346 B CN106341346 B CN 106341346B CN 201610810708 A CN201610810708 A CN 201610810708A CN 106341346 B CN106341346 B CN 106341346B
- Authority
- CN
- China
- Prior art keywords
- bandwidth
- priority
- delay
- allocated
- path
- 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/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
-
- 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/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- 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/12—Shortest path evaluation
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
-
- 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/302—Route determination based on requested QoS
Abstract
The routing algorithm in a kind of data center network based on SDN to ensure QoS (Quality of Service, service quality) is claimed in the present invention.This method is for user terminal propagation delay time height and link congestion problem in data center network, it is proposed the routing algorithm in a kind of data center network to ensure Qos, the data flow for reaching interchanger is carried out priority classification by the algorithm, so that the high-priority traffic to delay sensitive uses delay guarantee algorithm: being found out the smallest path of data plane time delay and is carried out flow table issuance；And then use bandwidth safeguard algorithm to the higher low-priority data stream of bandwidth requirement: the demand according to data flow to bandwidth carries out dynamic Bandwidth adjustment；To effectively ensure the QoS of user, and improve the resource utilization in data center network.
Description
Technical field
The present invention relates to technical field of communication network, it is related to the routing in the data center network based on SDN to ensure QOS
Algorithm.
Background technique
Demand with all kinds of business to internet increases increasingly, and internet is to guarantee user QoS (Quality of
Service, service quality) ability there are apparent defects.In traditional data center network due to complicated integral structure and
Equipment performance saturation has been difficult to meet requirement of the current different new business to QoS, and the network flow ratio under emerging service
Conventional data centers network flow is increasingly complex, while the frequent communication inside data center between multiple spot may be such that network sends out
The problems such as life congestion, network bandwidth are not fully utilized, and the time delay between terminal user is elongated equal, causes under overall performance
Drop.Therefore how to ensure that the QoS demand of different data streams has become data center network using current Internet resources
One key problem.
For the efficiency for improving data exchange, the calculating to data center network resource, storage and flexible allotment are realized, simultaneously
The controllability for enhancing data center network, by OpenFlow technology combination SDN (Software Defined Networking, it is soft
Part defines network) it is applied in data center network, it, can be from global angle spirit because of its ability with global view
Living makes resource allocation, also can realize that network flow is balanced by the Optimized Operation of stream and the rational deployment of server, then
SDN can promote the utilization rate of Internet resources while ensureing user QoS.
In recent years, ensure that the Research of Routing Algorithm of Qos is just receiving more and more attention in SDN data center network.
Existing literature is retrieved and is found, pertinent literature is as follows:
Document [Ishimori A, Farias F, Cerqueira E, et al.Control of multiple packet
schedulers for improving QoS on OpenFlow/SDN networking[C]//Proc of the 2nd
European workshop on Software Defined Networks.Berlin:IEEE Press,2013:81-86.]
QoS scheduling strategy based on queue on middle proposition SDN framework, but there is no the data flows for different priorities to carry out QoS
Routing；Document [Bueno I, Aznar J I, Escalona E, et al.An opennaas based SDN framework
for dynamic QoS control[C]//Proc of IEEE SDN for Future Networks and
Services. the qos policy proposed on SDN framework in [S.l.]: IEEE Press, 2013:1-7.] automatically configures frame,
But this frame only adjust automatically forward-path to the delay requirement of different data streams, has ignored data flow to the need of bandwidth
It asks；Tomovic S et al. is in document [SDN control framework for QoS provisioning [C] //Proc of
The 22nd Telecommunications Forum [S.l.]: IEEE Press, 2014:111-114.] in propose algorithm
Convection current lacks fine division, can not achieve the fine granularity guarantee of data flow；And document [Egilmez H E, Dane S T,
Gorkemli B,et al.OpenQoS:an OpenFlow controller design for multimedia
delivery with end-to-end quality of service over software-defined networks
[C]//Proc of Asia-Pacific Signal&Information Processing Association Annual
Summit and Conference. [S.l.]: IEEE Press, 2012:22-27.] in for specific stream devise ensure QoS
Routing algorithm and other ensure GFF (matching preferential) algorithm of qos policies, but the scalability of the algorithm is too poor.Song Jianwei
Base is proposed document [Chengdu QoS queue algorithm research [D] based on differentiated services network: University of Electronic Science and Technology, 2014.] is inner
It in the algorithm of queue to ensure QoS, but is only verified on theoretical model, there is no its property is tested in real network
Energy.
By correlative study it is found that in order to solve terminal user's time delay height and network in the data center network under SDN framework
Bandwidth is unable to fully the problem of utilizing, and the data flow for entering interchanger is carried out priority classification by the present invention, is directed to different excellent
The data flow of first grade uses different routing algorithms, and the utilization of Internet resources is improved while ensureing the QoS of user terminal
Rate.
Summary of the invention
Present invention seek to address that the above problem of the prior art.It proposes one in a kind of data center network based on SDN
Kind ensures the routing algorithm of QoS.Technical scheme is as follows:
A kind of routing algorithm ensureing QoS in data center network based on SDN comprising following steps:
101, each openflow interchanger receives data flow, and carries out flow table matching to the data flow received, if energy
Match with the flow table in openflow interchanger, then triggers forwarding behavior；102 are entered step if it cannot match；
102, the data flow that height according to priority cannot match to step 101 with flow table is classified, if it is category
In the high-priority traffic to delay sensitive, 103 are gone to step, if it is for controlled load, streamed multimedia etc.
104 are then gone to step to the low-priority data stream of bandwidth sensitive；
103, it is directed to the high-priority traffic of delay sensitive, delay guarantee algorithm is enabled, when selecting on the whole
Prolong minimal path, and the flow table of generation is written in interchanger；
104, it is directed to the high low-priority data stream of bandwidth requirement, enables bandwidth safeguard algorithm, dynamic is carried out to bandwidth
Adjustment, to meet the required amount of bandwidth of low-priority data stream, and then prevents network congestion.
Further, the high-priority traffic of the delay sensitive is low-volume traffic stream, and bandwidth demand is higher low preferential
Grade grade data flow is high amount of traffic.
Further, step 101 if there is data flow enter interchanger then determine this data flow VLAN priority whether
Less than 5, i.e. VLAN < 5, wherein the value of the VLAN priority of data flow is 0~7, and priority 7 is the relevant information of network management
Including routing information RIP agreement and open shortest path ospf protocol；Priority 6 and 5 is mainly delay-sensitive；Priority
4 to 1 is mainly used for controlled load, streamed multimedia, key service traffics, and priority 0 is default value, other being not provided with
It is enabled automatically in the case where priority value, setting VLAN priority herein is low-priority data stream less than 5, otherwise is Gao Youxian
Grade data flow.
Further, when interchanger receive be high-priority traffic when, using delay guarantee algorithm, SDN controller
The latency path progress flow table issuance for meeting high priority is selected, specifically includes: to constructing network topology cost function, establishing
Meet delay constraint and the smallest mathematical model of cost, the link cost function of building are as follows:
Cij=(1- β) gij+βpij, 0 < β < 1, in formula, gijIndicate node i, the delay variation between j, pijIndicate node i,
Packet loss between j, β indicate proportionality coefficient；
Meet delay constraint and the smallest mathematical model of cost indicates are as follows: r*=argrmin{fc(r)|r∈rst,fd(r)≤
dmax, in formula, rstIndicate route set all between node s and t, r ∈ rstIn one routing, fc(r) indicate that path r's is total
Cost, dijIndicate the chain-circuit time delay between node i and j, fd(r) overall delay of path r, d are indicatedmaxIndicate the maximum of data flow
Time delay.
Further, the solution procedure for meeting delay constraint and the smallest mathematical model of cost are as follows: C firstijAs
Link metric solves the smallest path of cost by D-algorithm；Judge path time delay whether meet demand, satisfaction then issue phase
Flow table is answered, otherwise, with dijAs the weight of link, solve the smallest path of time delay, judge the path delay of time whether meet demand, such as
Fruit, which meets, then issues corresponding flow table, and otherwise controller will recalculate.
Further, in step 104 when interchanger receive be low-priority data stream when, SDN controller to bandwidth into
Mobile state adjustment selects the optimum bandwidth path progress flow table issuance for meeting data flow requirements, specifically includes step: to all kinds of
The expression of parameter are as follows: (1) bandwidth availability ratio Qu, indicate to use the ratio between bandwidth and total bandwidth, expression formula Qu=Ballocated/
Btotal, B in formulaallocatedIt indicates to use bandwidth, BtotalIndicate link total bandwidth；(2) total bandwidth is represented by remaining bandwidth
BresidualWith use bandwidth BallocatedThe sum of: Btotal=Bresidual+Ballocated；(3) initial bandwidth: Binit=Btotal/φi,
Wherein φiIndicate weighted value；In addition, the overload of link bandwidth may be expressed as: Brequest>Binit；Wherein BrequestIndicate data flow
Demand bandwidth；First consider that data flow distribution uses bandwidth B accordinglyallocatedIf in Brequest≤BinitUnder the conditions of, then it counts
The bandwidth that should be distributed according to stream are as follows: Ballocated=Brequest；Otherwise B is set by bandwidthallocated=Binit；Secondly, heavy duty road
The bandwidth demand of diameter is Black=Brequest-Ballocated-Binit；To the remaining bandwidth B in linkresidual=Binit+
Ballocated-BrequestThe method of salary distribution are as follows: first as the remaining bandwidth B in systemresidualGreater than BlackWhen, then Ballocated=
Brequest；Secondly as the remaining bandwidth B in systemresidualLess than BlackWhen be allocated by a certain percentage, then makeB in formulaaddAttach most importance to newly assigned bandwidth, Bi lackFor the bandwidth of i-th chain road demand；And
Ballocated=Ballocated+Badd, when receiving new data stream, satisfactory path is calculated according to current demand, simultaneously
Controller detects link state, if meeting current QoS demand, path bandwidth distribution, which is not done, to be changed, and link requirement is not
It when being able to satisfy QoS demand, is redistributed by bandwidth safeguard algorithm, to ensure low-priority data stream bandwidth, next
When data flow arrives, to ensure that previous data flow is all sent.
It advantages of the present invention and has the beneficial effect that:
The present invention provides a kind of routing algorithm that QoS is ensured in SDN data center network, which incites somebody to action: entering
Data flow in openflow interchanger is according to priority classified；Secondly it to the high-priority traffic of delay sensitive, uses
Delay guarantee algorithm selects the smallest routing of time delay；And to the low-priority data stream of bandwidth sensitive, using dynamic allocation band
Wide mode ensures the bandwidth demand of low-priority data stream；To reduce the propagation delay time of data flow and improve network money
The utilization rate in source.
Detailed description of the invention
Fig. 1 is the network topological diagram that the present invention provides that preferred embodiment generates；
Fig. 2 is whole design flow chart of the present invention；
Fig. 3 is the time delay simulation result figure that delay guarantee algorithm of the present invention compares matching precedence algorithm
Fig. 4 is bandwidth safeguard algorithm effect analogous diagram of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, detailed
Carefully describe.Described embodiment is only a part of the embodiments of the present invention.
Technical scheme is as follows:
In the present embodiment, Fig. 1 is the network topological diagram that the present invention generates；There are 4 switch inside each pod.?
The port switch of Edge is connect with host, one layer of interchanger connection on remaining 2 port.There are 4 switch at Core layers,
There is Single port to connect with a Pod in core layers of every switch, one 4 yuan of Fat-tree topology supports 16 hosts and 20
A interchanger (4 interchangers of core layer, 8 interchangers of convergence layer and 8 interchanger of access layer) composition.The initial strip of each of the links
Width is set as 11.3Gbps, and setting peak transfer rate is that 2000, TCP default sliding window size is 85.3kbyte, every chain
The delay of road setting is set as 10ms.
In the present embodiment, Fig. 2 is whole design flow chart of the present invention；The data flow of high priority is quicker to time delay
Sense, therefore the algorithm constructs cost function, foundation meets delay constraint and the smallest mathematical model of cost, and using improvement
D-algorithm come select time delay minimal path carry out flow table issuance.
Firstly, being monitored by link discovery module to interchanger, data flow is waited to enter interchanger.If there is data flow
Then determine into interchanger the VLAN priority of this data flow whether less than 5, i.e. VLAN < 5, the wherein VLAN priority of data flow
Value be 0~7, priority 7 be network management relevant information such as RIP (such as routing information) agreement and OSPF it is (open
Shortest path) agreement；Priority 6 and 5 is mainly delay-sensitive；Priority 4 to 1 be mainly used for controlled load, streamed multimedia,
Key service traffics.Priority 0 is default value, is enabled automatically in the case where being not provided with other priority values.It sets herein
Determining VLAN priority less than 5 is low-priority data stream, otherwise is high-priority traffic.
Then, for the data flow of low priority, guarantee the need of the data flow of low priority using bandwidth safeguard algorithm
Ask bandwidth, detailed process are as follows: (1) bandwidth availability ratio Qu, indicate to use the ratio between bandwidth and total bandwidth, expression formula Qu=
Ballocated/Btotal, B in formulaallocatedIt indicates to use bandwidth, BtotalIndicate link total bandwidth；(2) total bandwidth is represented by
Remaining bandwidth BresidualWith use bandwidth BallocatedThe sum of: Btotal=Bresidual+Ballocated；(3) initial bandwidth: Binit=
Btotal/φi, wherein φiIndicate weighted value；In addition, the overload of link bandwidth may be expressed as: Brequest>Binit.Number is considered first
Respective bandwidth B is distributed according to streamallocatedIf in Brequest≤BinitUnder the conditions of, then data flow should distribute bandwidth are as follows:
Ballocated=Brequest；Otherwise B is set by bandwidthallocated=Binit.Secondly, the bandwidth demand B in heavy duty pathlack=
Brequest-Ballocated-Binit.To the remaining bandwidth B in linkresidual=Binit+Ballocated-BrequestThe method of salary distribution are as follows:
First as the remaining bandwidth B in systemresidualGreater than BlackWhen, then Ballocated=Brequest；Secondly when the tape remaining in system
Wide BresidualLess than BlackWhen be allocated by a certain percentage, then makeB in formulaaddFor again
The bandwidth of distribution.Bi lackFor the bandwidth of i-th chain road demand；And Ballocated=Ballocated+Badd.Receiving new data
When stream, satisfactory path is calculated according to current demand, while controller detects link state, worked as if met
Preceding QoS demand, path bandwidth distribution, which is not done, to be changed, and when link requirement is not able to satisfy QoS demand, is carried out by bandwidth safeguard algorithm
It redistributes, to ensure low-priority data stream bandwidth, when next data flow arrives, to ensure that previous data flow is all sent out
It send and finishes.
Finally, for the data flow of high priority, guarantee the time delay of high-priority traffic using delay guarantee algorithm
Demand, detailed process are as follows: to constructing network topology cost function, foundation meets delay constraint and the smallest mathematical model of cost.
The link cost function of building and the model of building are as follows:
Cij=(1- β) gij+βpij, 0 < β < 1, in formula, gijIndicate i, the delay variation between j, pijBetween expression i, j
Packet loss, β indicate proportionality coefficient.Meet delay constraint and the smallest mathematical model of cost indicates are as follows: r*=argrmin{fc(r)|
r∈rst,fd(r)≤dmax, in formula, rstIndicate route set all between node s and t, r ∈ rstIn one routing, fc(r)
Indicate the total cost of path r, dijIndicate the chain-circuit time delay between node i and j, fd(r) overall delay of path r, d are indicatedmaxIt indicates
The maximum delay of data flow.The solution procedure of this model are as follows: C firstijAs link metric, it is minimum that cost is solved by D-algorithm
Path.Judge path time delay whether meet demand, satisfaction then issue corresponding flow table, otherwise, with dijAs the weight of link,
Solve the smallest path of time delay, judge the path delay of time whether meet demand, issue corresponding flow table if meeting, otherwise controller
It will recalculate.
Fig. 3 is the time delay simulation result figure that delay guarantee algorithm of the present invention compares matching precedence algorithm: wherein QDBA this paper
Modified hydrothermal process, GFF are the alignment algorithms chosen.Data flow is sent from the end h1 in Fig. 1 to the end h16, it is constant loading
In the case of, time delay also will increase certain value, next can fluctuate in a certain range.As can be seen from Figure 3 in GFF algorithm
Increase to time delay after 300ms or so and just level off to stabilization, fluctuation range also carries out wave in 300ms or so as time increases
It is dynamic.The maximum value of QDBA time delay is relatively small, and the time delay of QDBA is fluctuated in 150ms or so in experiment, and this fluctuation and experiment are pre-
Phase coincide, and due to GFF itself when link load increases to certain numerical value, link starts congestion phenomenon occur, data
Time delay increase causes network performance to decline.QDBA can select optimal path on the whole for data flow, can be according to data flow
Bandwidth demand carry out routing, therefore can be by timing_delay estimation in lesser range.In identical load, according in data
Heart network characterization is that time delay is required in transmission process to data stream claims, QDBA algorithm proposed in this paper, time delay one
It directly is maintained at 150ms or so, substantially conforms to the demand of data center network flow, demonstrates the algorithm in data center network
Validity.
Fig. 4 is bandwidth safeguard algorithm effect analogous diagram of the present invention: initial bandwidth is set as 11.3Gbps, by result
When the data stream bandwidth demand being currently received is 2.71Mbits, if the algorithm is not to using traditional matching precedence algorithm
It is distinguished with the data flow on path, current h1 to h2 known in Fig. 4 (b) only has a queue, the bandwidth value of the queue
It is always less than 2.71Mbits, if this data flow cannot ensure the QoS of stream to bandwidth sensitive；In Fig. 4 (a), start band
Width ensure algorithm after, have between h1 to h2 two queues according to the demand of data flow be respectively 2.59Mbits and
0.12Kbits is treated it can thus be appreciated that bandwidth safeguard algorithm can distinguish data flow end to end, to ensure different data streams
Bandwidth.Occurring that two different queues come after starting after bandwidth safeguard in end-to-end bandwidth as can be seen from the results can
To meet the bandwidth safeguard of different demands.Since this experiment condition limits only, progress can be in chain end to end on bandwidth safeguard
Road carries out bandwidth safeguard test to the data flow of different bandwidth demand, and bandwidth safeguard strategy proposed in this paper may be implemented one
Chain road carries out bandwidth safeguard according to the demand of data flow.
The above embodiment is interpreted as being merely to illustrate the present invention rather than limit the scope of the invention.?
After the content for having read record of the invention, technical staff can be made various changes or modifications the present invention, these equivalent changes
Change and modification equally falls into the scope of the claims in the present invention.
Claims (5)
1. a kind of routing algorithm for ensureing QoS in the data center network based on SDN, which comprises the following steps:
101, each openflow interchanger receives data flow carries out flow table matching, if can in openflow interchanger
Flow table match, then trigger forwarding behavior；102 are entered step if it cannot match；
102, the data flow that height according to priority cannot match to step 101 with flow table is classified, if it is belonging to pair
The high-priority traffic of delay sensitive, gos to step 103, if it is for controlled load, streamed multimedia is inside to band
The low-priority data stream of wide sensitivity then gos to step 104；
103, it is directed to the high-priority traffic of delay sensitive, delay guarantee algorithm is enabled, selects time delay on the whole most
Small path, and the flow table of generation is written in interchanger；
104, for controlled load is used for, streamed multimedia to the low-priority data stream of bandwidth sensitive, enables bandwidth and protects inside
Hinder algorithm, dynamic adjustment is carried out to bandwidth, to meet the required amount of bandwidth of low-priority data stream, and then prevents network from gathering around
Plug；
When interchanger receive be high-priority traffic when, using delay guarantee algorithm, SDN controller, which is selected, meets Gao You
The latency path of first grade carries out flow table issuance, specifically includes: to constructing network topology cost function, foundation meet delay constraint and
The smallest mathematical model of cost, the link cost function of building are as follows: Cij=(1- β) gij+βpij, 0 < β < 1, in formula, gijIt indicates
Node i, the delay variation between j, pijIndicate node i, the packet loss between j, β indicates proportionality coefficient；
Meet delay constraint and the smallest mathematical model of cost indicate are as follows:
In formula, rstIndicate route set all between node s and t, r ∈ rstIn one routing, fc(r) total cost of path r is indicated,
dijIndicate the chain-circuit time delay between node i and j, fd(r) overall delay of path r, d are indicatedmaxIndicate the maximum delay of data flow.
2. a kind of routing algorithm for ensureing QoS, feature in the data center network according to claim 1 based on SDN
It is, the high-priority traffic of the delay sensitive is information flow relevant to network management, and bandwidth demand is higher low excellent
First grade data flow is the service traffics for controlled load, including streamed multimedia.
3. a kind of routing algorithm for ensureing QoS, feature in the data center network according to claim 1 based on SDN
Be, step 101 if there is data flow enter interchanger then determine the VLAN priority of this data flow whether less than 5, i.e. VLAN <
5, wherein the value of the VLAN priority of data flow is 0~7, and priority 7 is that the relevant information of network management includes Route Selection
Information RIP agreement and open shortest path ospf protocol；Priority 6 and 5 is mainly delay-sensitive；Priority 4 to 1 is mainly used for
Controlled load, streamed multimedia, key service traffics, priority 0 are default values, in the feelings for being not provided with other priority values
It is enabled automatically under condition, setting VLAN priority herein is low-priority data stream less than 5, otherwise is high-priority traffic.
4. a kind of routing algorithm for ensureing QoS, feature in the data center network according to claim 1 based on SDN
It is, meets the solution procedure of delay constraint and the smallest mathematical model of cost are as follows: C firstijAs link metric, calculated by D
Method solves the smallest path of cost；Judge path time delay whether meet demand, satisfaction then issue corresponding flow table, otherwise, with dij
As the weight of link, solve the smallest path of time delay, judge the path delay of time whether meet demand, issued if meeting corresponding
Flow table, otherwise controller will recalculate.
5. a kind of routing algorithm for ensureing QoS, feature in the data center network according to claim 1 based on SDN
Be, in step 104 when interchanger receive be low-priority data stream when, SDN controller to bandwidth carry out dynamic adjustment, choosing
The optimum bandwidth path progress flow table issuance for meeting data flow requirements is selected out, specifically includes step: the expression to all kinds of parameters are as follows:
(1) bandwidth availability ratio Qu, indicate to use the ratio between bandwidth and total bandwidth, expression formula Qu=Ballocated/Btotal, in formula
BallocatedIt indicates to use bandwidth, BtotalIndicate link total bandwidth；(2) total bandwidth is represented by remaining bandwidth BresidualWith make
Use bandwidth BallocatedThe sum of: Btotal=Bresidual+Ballocated；(3) initial bandwidth: Binit=Btotal/φi, wherein φiIt indicates
Weighted value；In addition, the overload of link bandwidth may be expressed as: Brequest> Binit；Wherein BrequestIndicate the demand band of data flow
It is wide；First consider that data flow distribution uses bandwidth B accordinglyallocatedIf in Brequest≤BinitUnder the conditions of, then data flow should divide
The bandwidth matched are as follows: Ballocated=Brequest；Otherwise B is set by bandwidthallocated=Binit；Secondly, the bandwidth in heavy duty path
Demand is Black=Brequest-Ballocated-Binit；To the remaining bandwidth in link's
The method of salary distribution are as follows: first as the remaining bandwidth B in systemresidualGreater than BlackWhen, then Ballocated=Brequest；Secondly work as and be
Remaining bandwidth B in systemresidualLess than BlackWhen be allocated by a certain percentage, then make
B in formulaaddAttach most importance to newly assigned bandwidth, Bi lackFor the bandwidth of i-th chain road demand；And Ballocated=Ballocated+Badd,
When receiving new data stream, satisfactory path is calculated according to current demand, while controller examines link state
It surveys, if meeting current QoS demand, path bandwidth distribution, which is not done, to be changed, and when link requirement is not able to satisfy QoS demand, passes through band
Width ensures that algorithm is redistributed, and to ensure low-priority data stream bandwidth, when next data flow arrives, to ensure previous
A data flow is all sent.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610810708.2A CN106341346B (en) | 2016-09-08 | 2016-09-08 | A kind of routing algorithm ensureing QoS in data center network based on SDN |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610810708.2A CN106341346B (en) | 2016-09-08 | 2016-09-08 | A kind of routing algorithm ensureing QoS in data center network based on SDN |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106341346A CN106341346A (en) | 2017-01-18 |
| CN106341346B true CN106341346B (en) | 2019-07-19 |
Family
ID=57822518
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610810708.2A Active CN106341346B (en) | 2016-09-08 | 2016-09-08 | A kind of routing algorithm ensureing QoS in data center network based on SDN |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106341346B (en) |
Families Citing this family (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106656805B (en) * | 2017-02-17 | 2019-08-23 | 华北电力大学（保定） | A kind of electric power WAN communication network multi-service QoS route selection method |
| CN106656806B (en) * | 2017-02-17 | 2019-08-06 | 华北电力大学（保定） | A kind of electric power WAN communication network multi-service QoS route selection method |
| CN106789660B (en) * | 2017-03-31 | 2020-08-28 | 中国科学技术大学苏州研究院 | QoS sensible flow management method in software defined network |
| CN107241277A (en) * | 2017-05-17 | 2017-10-10 | 天津大学 | Node method for annealing in SDN |
| CN108989210B (en) * | 2017-06-02 | 2021-08-24 | 中兴通讯股份有限公司 | Strategy-based tunnel selection method and software defined network controller |
| CN107454017B (en) * | 2017-06-05 | 2021-05-11 | 上海交通大学 | Mixed data stream cooperative scheduling method in cloud data center network |
| CN107360483B (en) * | 2017-08-21 | 2020-04-24 | 西安邮电大学 | Controller load balancing algorithm for software defined optical network |
| CN108064064A (en) * | 2017-12-20 | 2018-05-22 | 浙江省公众信息产业有限公司 | Wireless sensor network Ad Hoc is by method and apparatus |
| CN108401015B (en) * | 2018-02-02 | 2020-10-02 | 广州大学 | Data center network routing method based on deep reinforcement learning |
| CN108512760B (en) * | 2018-03-09 | 2020-07-28 | 西安电子科技大学 | Routing method based on SDN guarantee service QoS |
| CN108540384B (en) * | 2018-04-13 | 2020-07-28 | 西安交通大学 | Intelligent rerouting method and device based on congestion awareness in software defined network |
| CN108768713A (en) * | 2018-05-09 | 2018-11-06 | 西安工业大学 | A kind of guarantee QoS dynamic routing algorithms in SDN |
| CN108768776A (en) * | 2018-05-30 | 2018-11-06 | 郑州云海信息技术有限公司 | A kind of method for monitoring network and device based on OpenFlow |
| CN108933742A (en) * | 2018-06-21 | 2018-12-04 | 重庆邮电大学 | A kind of business stream scheduling method of SD-DCN link failure |
| CN109600319B (en) * | 2018-12-11 | 2022-07-08 | 浙江工商大学 | Flow scheduling method in real-time transmission mechanism |
| CN109547340B (en) * | 2018-12-28 | 2020-05-19 | 西安电子科技大学 | SDN data center network congestion control method based on rerouting |
| CN109905364B (en) * | 2019-01-08 | 2021-04-20 | 山东省计算中心（国家超级计算济南中心） | Streaming media data packet transmission method and system based on SDN architecture |
| CN110149282B (en) * | 2019-01-30 | 2021-02-12 | 华为技术有限公司 | Traffic scheduling method and device |
| CN112560878A (en) * | 2019-09-10 | 2021-03-26 | 华为技术有限公司 | Service classification method and device and Internet system |
| CN111600754B (en) * | 2020-05-11 | 2022-02-25 | 重庆邮电大学 | Industrial heterogeneous network scheduling method for interconnection of TSN (transmission time network) and non-TSN (non-Transmission time network) |
| CN111817983A (en) * | 2020-06-12 | 2020-10-23 | 浪潮思科网络科技有限公司 | Irrigation equipment network regulation and control method, equipment and system based on SDN |
| CN113923125B (en) * | 2020-06-22 | 2022-12-06 | 北京交通大学 | Tolerance analysis method and device for multi-service flow converged communication in industrial heterogeneous network |
| CN112187657B (en) * | 2020-09-16 | 2022-04-15 | 北京理工大学 | Extensible routing method for realizing load balancing in software defined wide area network |
| CN114513241B (en) * | 2021-04-19 | 2023-03-07 | 南京航空航天大学 | SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method |
| CN113242182B (en) * | 2021-05-08 | 2022-08-16 | 东南大学 | QoS-sensitive route distribution method in mobile self-organizing network based on SDN |
| CN113938955B (en) * | 2021-09-09 | 2023-06-06 | 中国联合网络通信集团有限公司 | Data transmission method, device, equipment and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104994033A (en) * | 2015-05-13 | 2015-10-21 | 南京航空航天大学 | Method for guaranteeing QoS (quality of service) of SDN (software defined network) by means of dynamic resource management |
| CN105357068A (en) * | 2015-11-03 | 2016-02-24 | 华中科技大学 | OpenFlow network flow control method for QoS assurance of application |
| CN105847151A (en) * | 2016-05-25 | 2016-08-10 | 安徽大学 | Multi-constrained QoS (Quality of Service) routing strategy designing method for software defined network |
-
2016
- 2016-09-08 CN CN201610810708.2A patent/CN106341346B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104994033A (en) * | 2015-05-13 | 2015-10-21 | 南京航空航天大学 | Method for guaranteeing QoS (quality of service) of SDN (software defined network) by means of dynamic resource management |
| CN105357068A (en) * | 2015-11-03 | 2016-02-24 | 华中科技大学 | OpenFlow network flow control method for QoS assurance of application |
| CN105847151A (en) * | 2016-05-25 | 2016-08-10 | 安徽大学 | Multi-constrained QoS (Quality of Service) routing strategy designing method for software defined network |
Non-Patent Citations (2)
| Title |
|---|
| OpenQoS: An OpenFlow Controller Design for Multimedia Delivery with End-to-End Quality of Service over Software-Defined Networks;Hilmi E. Egilmez 等;《Proceedings of The 2012 Asia Pacific Signal and Information Processing Association Annual Summit and Conference》;20130117;全文 |
| 面向业务的SDN网络带宽保障研究;曹绍华，张鑫;《计算机工程与应用》;20160810;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106341346A (en) | 2017-01-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106341346B (en) | A kind of routing algorithm ensureing QoS in data center network based on SDN | |
| CN106059821B (en) | A kind of data center traffic QoS guarantee method based on SDN | |
| US20190014053A1 (en) | Network Flow Control Method And Network Device | |
| Liu et al. | Delay-optimized video traffic routing in software-defined interdatacenter networks | |
| WO2019096140A1 (en) | Method, device and system for managing network service | |
| Amani et al. | Programmable policies for data offloading in LTE network | |
| EP4184937A1 (en) | Method, apparatus, and system for communication in data centre | |
| CN112350949B (en) | Rerouting congestion control method and system based on flow scheduling in software defined network | |
| WO2018233580A1 (en) | Method, controller and system for establishing forwarding path in network | |
| TW201238289A (en) | Routing selection method and system of multi-WAN interfaces and network device employing the same | |
| Li et al. | A QoS guaranteed technique for cloud applications based on software defined networking | |
| CN108234309A (en) | A kind of transmission method of network data | |
| Li et al. | Enabling software defined networking with qos guarantee for cloud applications | |
| CN108768713A (en) | A kind of guarantee QoS dynamic routing algorithms in SDN | |
| He et al. | Performance of multipath in fiber-wireless (FiWi) access network with network virtualization | |
| Gao et al. | QoS-driven path selection for MPTCP: A scalable SDN-assisted approach | |
| D’Aronco et al. | Improved utility-based congestion control for delay-constrained communication | |
| Qadeer et al. | Flow-level dynamic bandwidth allocation in SDN-enabled edge cloud using heuristic reinforcement learning | |
| WO2016095142A1 (en) | Data forwarding method, device and system in software-defined networking (sdn) | |
| CN102710812B (en) | A kind of method, subscriber equipment and NNI interface gateway setting up tunnel | |
| WO2021208529A1 (en) | Port resource reservation method, electronic device, and storage medium | |
| Cheng et al. | Application-aware routing scheme for sdn-based cloud datacenters | |
| Xu et al. | An adaptive flow table adjustment algorithm for SDN | |
| WO2023274165A1 (en) | Parameter configuration method and apparatus, controller, communication device, and communication system | |
| TWM312845U (en) | Mesh network and apparatus for transmitting packets |
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 |