CN105357068B - The OpenFlow method for controlling network flow that a kind of application-oriented QoS is ensured - Google Patents
The OpenFlow method for controlling network flow that a kind of application-oriented QoS is ensured Download PDFInfo
- Publication number
- CN105357068B CN105357068B CN201510737123.8A CN201510737123A CN105357068B CN 105357068 B CN105357068 B CN 105357068B CN 201510737123 A CN201510737123 A CN 201510737123A CN 105357068 B CN105357068 B CN 105357068B
- Authority
- CN
- China
- Prior art keywords
- qos
- link
- path
- delay
- flow
- 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.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/04—Processing captured monitoring data, e.g. for logfile generation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/04—Processing captured monitoring data, e.g. for logfile generation
- H04L43/045—Processing captured monitoring data, e.g. for logfile generation for graphical visualisation of monitoring data
-
- 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
-
- 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
-
- 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2491—Mapping quality of service [QoS] requirements between different networks
Abstract
The present invention gives the OpenFlow method for controlling network flow that a kind of application-oriented QoS is ensured, include the following steps：User is to server for services, server sends QoS request message to SDN controllers, after controller receives message, the optimal path of transmission and reserved resource are calculated for it according to Internet usage situation, simultaneously during server transport QoS data stream, monitor its transmission state and network link situation, with the reliable of guaranteed qos stream, stable transmission.The system is provided the Internet resources of demand for application service, is not only effectively guaranteed the QoS of application, while reached the efficient utilization of Internet resources using service for the stringent QoS transmission for ensureing application service to the otherness of network resource requirements.
Description
Technical field
The present invention relates to the method for network guarantee application QoS (Quality of Service, service quality), particularly
Flow control methods in OpenFlow networks to provide safeguard using QoS.
Background technology
The new business such as multimedia, online interaction have higher qos requirement for transmission, usually require that enough transmission
Bandwidth, alap time delay etc., different from the service of " doing one's best " type.The method that QoS is ensured is provided at present to concentrate on
Resource reservation, queue priority scheduling etc., but be built upon in traditional network system, there are many deficiencies, such as resource
It is reserved to require router that there is high-performance, the shortcomings of expense is big, and autgmentability is poor is resulted in, queue management is directed to converge with scheduling
Conflux, there are Control granularity it is thick the shortcomings of, and since big multi-method is all the mechanism using forwarded hop-by-hop, it is difficult to reach to complete
Office's resource efficiently uses.The data Layer and key-course separating thought of SDN network system provide completely new solution, control
Device provide logic control function, data Layer need to only perform corresponding operation this mode substantially increase network autgmentability and
The flexibility of flow control.
OpenFlow agreements are vital agreements in the present invention.OpenFlow is a kind of new network agreement, origin
In the Clean Slate project team of Stanford University, for carrying out transmission via net experiment.Its main thought is by the network equipment
Key-course and data Layer detached, control function all concentrates on key-course, so as to simplify underlying device function,
Enhance the scalability of network.Since the end of the year 2009 issued first official release v1.0, OpenFlow agreements have passed through
The evolution process of the versions such as 1.4 of 1.1,1.2,1.3 and newest publication is gone through.Defined in OpenFlow agreements controller and
How the mode to communicate between interchanger obtains bottom-layer network information including controller, controls data forwarding of interchanger etc. one
Serial relevant operation.Therefore the application layer established on the controller can communicate to obtain bottom-layer network indirectly with controller
Information, and use such information for improving the service quality of application.
Invention content
Herein the technical problem to be solved is that a kind of distribution according to need resource is provided in SDN network, height is provided for application
Quality Q oS transmission strategies, allow QoS transmission requirement of the network according to application stream, and Internet resources, while rationally rule are distributed for it
Transmission path is drawn, reaches the maximization of network resource usage.
In order to solve the above technical problems, the present invention proposes the communication pattern between a kind of application service and controller, base
This technology is conceived：When user asks application service, application server communicates first with controller, by the transmission of service
It is required that issue controller.After controller receives server message, current network link information is collected for the QoS flow, is calculated most
Good routing, bandwidth resource, while server is notified to start steaming transfer, the QoS flow of transmission and link state are carried out later
Monitoring, according to the reliable and stable transmission of the timely adjustable strategies guaranteed qos stream of network resource conditions.
Based on above-mentioned design, the technical solution that feature of the invention uses is as follows：
The OpenFlow method for controlling network flow that a kind of application-oriented QoS is ensured, which is characterized in that including following step
Suddenly：
(1) after server receives user service request, QoS transfer request messages are sent to SDN controllers, the service of transmission passes
Defeated qos requirement parameter, SDN controllers parse QoS transfer request messages, and distribute QoS ID for it；Wherein qos requirement
Parameter includes bandwidth demand, service transmission allows maximum delay, the end-to-end maximum packet loss that maximum delay is allowed to shake, allow
Rate；
(2) SDN controllers send message to interchanger, inquire current network flow information, obtain net where SDN controllers
The flow information of telephone net node and link in network, the remaining bandwidth including each of the links, are handed over the transmission rate per data stream
It changes planes port forwarding rate, average delay；
(3) data stream is calculated by differentiating whether data flow is for non-QoS flow data, is then to use shortest path first
Routing is calculated, is gone to step (4)；Otherwise the router-level topology of QoS flow is carried out according to the following steps：
The telephone net node and link flow that SDN controllers will obtain in the qos requirement parameter in step (1) and step (2)
Parameter of the information as router-level topology is measured, using the minimum cost routing algorithm based on delay constraint, judges whether to calculate
Meet the path of delay requirement, be that then SDN controllers initialize flow table, set QoS ID numbers, specific path and the guarantee band of stream
Wide queue priority information is issued to interchanger, and is replied message to server, and notice server starts transmitting data stream,
It goes to step (4)；Otherwise delay transmitting data stream message is replied, controller resumes waiting for the QoS transfer request messages of server, turns
Step (1)；
(4) controller is monitored the QoS flow and link circuit condition of transmission, when link occurs in congestion and congestion link
When the rate and inconsistent bandwidth demand in step (1) transmitted there are QoS flow or QoS flow, preset adjusting strategy is performed, to protect
Demonstrate,prove the normal transmission of QoS flow and efficiently using for Internet resources；
(5) after QoS flow end of transmission, server sends resource release message to SDN controllers, terminates.
In the method for controlling network flow, the server is the equipment for providing application service to the user, the SDN
Controller is responsible for flow control in software defined network (SDN)；The interchanger refers to support the friendship of OpenFlow agreements
It changes planes；The flow table is one group of rule of OpenFLow network central controls device generation, interchanger execution is issued to, for flow control
System；Server has been sent to the data flow of QoS-Request message, referred to as QoS flow, has not sent the data flow of QoS-Request
For non-QoS flow.Server and controller communication information are http message, and wherein qos requirement parameter is with the form of XML or JSON
Encapsulation is in the message.
Further, in the method for controlling network flow, the message that SDN controllers are sent to interchanger is specifically
OFPT_STATS_REQUEST message defined in OpenFLow agreements, including single stream request message, single stream request message, stream
The multiple types such as table request message, port request message, queue request message, involved in this step is single stream request
OFPFlowStatsRequest and port request OFPPortStatsRequest, wherein major parameter include flow table number, output
Port numbers, stream matching domain.Interchanger reply OFPT_STATS_REPLY message mainly include OFPFlowStatsReply and
OFPPortStatsReply message, it is consistent with request message.It is preferential that OFPFlowStatsReply message major parameter includes stream
Grade, transmission packet quantity packet_count and data flow have transmitted byte number byte_count to data flow, and data flow is
Transmission time duration_sec.Flow velocity rate is represented by the byte number of transmitted per unit timeTime delay can
It is expressed as the transmission single data packet required timeOFPPortStatsReply message major parameters
Including port transmission time duration_sec, port has been received by data packet number rx_packets, the data packet that port is sent
Quantity tx_packets, port have been received by byte number rx_bytes, and port has sent byte number tx_bytes, then port uplink and downlink
Forwarding rate can be expressed as
Further, in the method for controlling network flow, to the router-level topology of non-QoS flow, using link bandwidth as
Link metric is set as by weightsLink metric substitution dijkstra's algorithm is calculated into most short transmission path；
Wherein CeRepresent the bandwidth capacity of link e, UeRepresent the used bandwidth of link e, e represents a wherein link.Wherein
Dijkstra's algorithm is typical shortest-path rout ing algorithms, for calculating a node to the shortest path of other nodes.It is main
Wanting feature is extended layer by layer outward centered on starting point.It is needed during calculating for each of the links arrange parameter, parameter can be chain
The bandwidth on road, time delay, packet loss or other combined values.Here the capacity of link and the ratio of remaining bandwidth are chosen as link
Parameter, primarily to reach the load balancing of network flow,
Further, in the method for controlling network flow, specific feelings can also be directed to by calculating the DCLC algorithms of routing
Condition chooses other QoS routing algorithms, can be calculated in polynomial time and meet delay constraint, and delay variation and packet loss
The path of rate Least-cost, wherein cost parameter setting variable element, can be taken according to the concrete type of application different values come
The QoS flow of different requirements is handled, and the time complexity of algorithm is reduced to O ([m+nlogn]2), wherein n represents number of nodes, m generations
Watch chain way, time complexity is low compared with other QoS routing algorithms, and detailed process is as follows：
(3.1) link cost parameter is constructed：
Cij=(1- β) gij+βpij, 0 ＜ β ＜ 1；
Wherein i, j represent two nodes adjacent in link, gijRepresent i, the delay jitter between j, pijRepresent node i,
Packet loss between j；β is proportionality coefficient, and value is variable, such as requires high QoS flow that should take delay jitter small, will to packet loss
Ask it is higher should take it is larger；
(3.2) mathematical model for the routing r* for meeting delay constraint and Least-cost is established：
R*=argr min{fc(r)|r∈rst,fd(r)≤dmax}；
Wherein rstRepresent all route sets between source node s and destination node t, r ∈ rstRepresent a road therein
By,For total cost of path r, dijThe time delay of link between adjacent node i, j is represented,The overall delay of path r, dmaxAllow maximum delay for QoS flow, value is the service transmission that step (1) determines
Allow maximum delay；
(3.3) above-mentioned QoS route matrixs are solved using Lagrangian Relaxation Algorithm, detailed process is：
(3.3.1) is by CijAs link metric, the path r that dijkstra's algorithm solves Least-cost is substituted intoc；
(3.3.2) judges path rcDelay whether be less than dmax, it is then by rcAs required path, r is returnedcRouting turns
(3.3.8)；Otherwise turn (3.3.3)；
(3.3.3) is by dijAs link metric, the path r that dijkstra's algorithm solves time delay minimum is substituted intod；
(3.3.4) judges path rdTime delay whether be more than dmax, it is to show that satisfactory path can not be calculated,
Delay is replied to server and sends message, is turned (3.3.8)；Otherwise turn (6.3.5)；
(3.3.5) enables relaxation parameterWherein fc(rc) it is path rcCost value, fc(rd) it is road
Diameter rdCost value, fd(rd) it is path rdOverall delay, fd(rc) it is path rcOverall delay；Link metric is set as cost
The combination parameter value of parameter and delay parameter, i.e. Cλ=Cij+λdij, substitute into dijkstra's algorithm and solve link metric as CλWhen
Minimum path rλ；
(3.3.6) judges fλ(rλ) and fλ(rc) whether equal, it is then by rdAs required path, turn (3.3.8)；Otherwise turn
(3.3.7), wherein fλ(rλ), fλ(rc) it is path r respectivelyλAnd rcWith CλIt always combines in path as each of the links weights in path
Parameter value is consistent with link overall delay concept, and only overall delay is the weights using the time delay of link as link；
(3.3.7) judges path rcDelay whether be less than dmax, it is to enable rd=rλ, turn (3.3.5)；Otherwise r is enabledc=rλ,
Turn (3.3.5)；
(3.3.8) terminates.
Further, in the method for controlling network flow, below the adjusting strategy detailed process in step (4)：
(4.1) it data flow is sampled, judge whether traffic transmission rate is more than bandwidth on demand, is held at inflow entrance
Row speed limit strategy, i.e., limit its rate between entrance, makes its bandwidth with request consistent, turns (4.3)；Otherwise turn (4.2)；
(4.2) reduction process (3) bandwidth reserved for its is set to current QoS flow transmission rate size；
(4.3) link is sampled, judge link bandwidth utilization rate whether reach 80% and chain road there are QoS flow transmission,
It is to represent link congestion state, turns (4.4)；Otherwise turn (4.7)；
(4.4) judge with the presence or absence of non-QoS data stream in all data flows of chain road, be to perform (4.5)；Otherwise it holds
Row (4.6)；
(4.5) the non-QoS flow of transmission rate maximum is selected, is recalculated after deleting congestion link using shortest path first
Routing turns (4.3)；
(4.6) QoS flow of transmission rate maximum is selected, routing recalculated using DCLC algorithms after deletion congestion link,
Turn (4.3)；
(4.7) turn (4.1) after postponing T seconds；T determines according to network concrete condition, generally 1-3 seconds.
The present invention is allowed the controller to by establishing a kind of effective message mechanism between controller and application server
The QoS-Request requirements proposed according to application service and QoS-Release message, reasonably to be divided Internet resources
Match, while ensure that the normal table of QoS flow transmits, and in QoS flow using the minimum cost QoS routing algorithms of delay constraint
The method that traffic sampling monitoring is employed in transmission process, enables the controller to timely adjustresources distribution and QoS flow controls plan
Slightly to ensure that user can obtain the QoS service of high quality, while be effectively utilized Internet resources.
Compared with prior art, the present invention has the following advantages：Pass through the message machine between controller and application server
System enables the controller to distribution according to need Internet resources, ensure that the maximization of network resource usage.Simultaneously using based on time delay
Constrained minimum cost routing algorithm and QoS flow and link state monitoring algorithm provide stringent QoS guarantee for QoS flow transmission,
Make interchanger that need not realize complicated agreement, additional function is provided, realize that simply, deployment is easy.
Description of the drawings
Fig. 1 is flow diagram of the present invention；
Fig. 2 is working timing figure of the present invention；
Fig. 3 is the topological diagram of the embodiment of the present invention；
Fig. 4 is that the QoS flow of the embodiment of the present invention transmits topological diagram；
Fig. 5 is that the non-QoS flow of the embodiment of the present invention transmits topological diagram；
Fig. 6 monitors flow chart for link state of the present invention.
Specific embodiment
The invention will be further described below in conjunction with the accompanying drawings.In order to solve cannot have using QoS flow transmission in network
The guarantee of effect and the resource of network cannot get effective Utilizing question, and the present invention proposes what a kind of application-oriented QoS was ensured
OpenFlow method for controlling network flow, this method include following steps, as shown in Figure 1：
(1) after server receives user service request, QoS transfer request messages are sent to SDN controllers, the service of transmission passes
Defeated qos requirement parameter, SDN controllers parse QoS transfer request messages, and distribute QoS ID for it；Wherein qos requirement
Parameter includes bandwidth demand, service transmission allows maximum delay, the end-to-end maximum packet loss that maximum delay is allowed to shake, allow
Rate；
(2) SDN controllers send message to interchanger, inquire current network flow information, obtain net where SDN controllers
The flow information of telephone net node and link in network, the remaining bandwidth including each of the links, are handed over the transmission rate per data stream
It changes planes port forwarding rate, average delay；
(3) data stream is calculated by non-QoS flow data, calculating and routeing using shortest path first, go to step (4)；It is right
The router-level topology of QoS flow, the telephone net node that SDN controllers will obtain in the qos requirement parameter in step (1) and step (2)
With parameter of the link flow information as router-level topology, using the minimum cost routing algorithm based on delay constraint, (DCLC is calculated
Method), judge whether that the path for meeting delay requirement can be calculated, be that then SDN controllers initialize flow table, set the QoS ID of stream
Number, specific path and ensure bandwidth queue priority information, be issued to interchanger, and reply message to server, notice clothes
Business device starts transmitting data stream, goes to step (4)；Otherwise delay transmitting data stream message is replied, is gone to step (1)；
(4) controller is monitored the QoS flow and link circuit condition of transmission, when depositing in congestion and congestion link occurs in link
In the rate and inconsistent bandwidth demand in step (1) that QoS flow or QoS flow are transmitted, preset adjusting strategy is performed, to ensure
The normal transmission of QoS flow and efficiently using for Internet resources；
(5) after QoS flow end of transmission, server sends resource release message to SDN controllers, terminates.
Fig. 2 be present system working timing figure and the present invention in core message mechanism, mainly include pair
QoS request message that http message is extended starts to transmit message, end of transmission message and flow table and deletes success message, point
It is not used for transmission qos parameter, notice server starts to transmit, and notification controller deletes flow table message, and flow table deletes pass signal；
The stream initiated by controller and link flow the status inquiry message defined in OpenFlow agreements is also comprised to be respectively used to look into
It askes QoS flow status information and port links information, controller issues flow table information and due to network link congestion to interchanger
Or the message of the carry out flow table modification during variation of steaming transfer rate.
Concrete methods of realizing in order to further illustrate the present invention is now illustrated with Fig. 3 embodiments.T in the present embodiment
It takes 2 seconds, that controller is chosen is the Open Framework OpenDaylight dominated by community, and application service is that Video service (is not examined
Consider specific coding and decoding video), as the QoS flow of transmission, FTP service is as non-QoS flow, network topology link bandwidth
10Mbps。
Step 1: SDN controllers receive the qos requirement of application server, ordinary video flow qos requirement at least 2M bandwidth,
Permission maximum delay is 50ms, and packet loss is not more than 5%, and delay variation is no more than 10ms, and FTP is as non-in the present embodiment
QoS flow does not have qos requirement parameter.
Step 2: SDN controllers obtain current full mesh topology link and flow information (assuming that there is not yet in topology at this time
QoS flow, only non-QoS are transmitted again), each component of chain road as shown in Figure 4 represents the remaining bandwidth of each of the links successively, prolongs
When, shake and packet drop, now use the minimum cost routing algorithm based on time delay for video stream calculation routing, with chain-circuit time delay
As constraints, delay variation and packet loss calculate video flowing transmission path as cost parameter.It deletes discontented first
Link S3-S4, S4-S0, the S2-S0 of sufficient bandwidth requirement find out cost most followed by dijkstra's algorithm from remaining topology
Small path is S6-S5-S1-S0, and delay is 29ms, and meeting delay requirement, (this is the best-case of the router-level topology, otherwise
Calculating must be constantly iterated), then it is the original transmission path that path is video flowing, and notify video server that can start to pass
It is defeated.
Step 3: user asks FTP service simultaneously, then ftp server also begins to transmit its non-QoS flow, and network is opened up at this time
Bandwidth information is flutterred shown in Fig. 5, to be only concerned the remaining bandwidth of link during routing due to being calculated for non-QoS flow.Controller will at this time
It is that it calculates routing using link bandwidth weights dijkstra's algorithm, the total link weights of path S6-S2-S1-S0 and is at this timeTo be minimum in all paths, as its transmission route.When the transmission rate of non-QoS flow is below 2M
When, if being detected at this time to link S6-S5-S1-S0, link is simultaneously unsatisfactory for congestion judging condition.But it is led when reaching more than 2M
It is more than 8M to cause link S1-S0, causes congestion, needs to carry out heavy-route to the non-QoS flow at this time.Congestion link S0- is deleted first
S1 is route again with link bandwidth weights dijkstra's algorithm for its calculating, and calculating outbound path is S6-S2-S0, is both ensured in this way
The normal transmission of QoS flow, while network flow is made to have reached load balancing again.
It should be noted last that more than specific embodiment is merely illustrative of the technical solution of the present invention, although from each
A angle has partly carried out detailed elaboration to each of the present invention, it will be understood by those of ordinary skill in the art that, it can be right
Technical scheme of the present invention is modified or replaced equivalently, equal without departing from the spirit and scope of technical solution of the present invention
It is intended to be within the scope of the claims of the invention.
Claims (7)
1. the OpenFlow method for controlling network flow that a kind of application-oriented QoS is ensured, which is characterized in that include the following steps：
(1) after server receives user service request, QoS transfer request messages is sent to SDN controllers, transmit service transmission
Qos requirement parameter, SDN controllers parse QoS transfer request messages, and distribute QoS ID for it；Wherein qos requirement is joined
Number includes bandwidth demand, service transmission allows maximum delay, the end-to-end maximum packet loss that maximum delay is allowed to shake, allow；
(2) SDN controllers send message to interchanger, inquire current network flow information, where obtaining SDN controllers in network
The flow information of telephone net node and link, the remaining bandwidth including each of the links, the transmission rate per data stream, interchanger
Port forwarding rate, average delay；
(3) data stream is calculated by differentiating whether data flow is non-QoS flow data, being then to calculate road using shortest path first
By going to step (4)；Otherwise the router-level topology of QoS flow is carried out according to the following steps：
SDN controllers believe the telephone net node and link flow that are obtained in the qos requirement parameter in step (1) and step (2)
The parameter as router-level topology is ceased, using the minimum cost routing algorithm based on delay constraint, judges whether that satisfaction can be calculated
The path of delay requirement is then SDN controllers initialization flow table, sets the QoS ID numbers of stream, specific path and ensure bandwidth
Queue priority information is issued to interchanger, and is replied message to server, and notice server starts transmitting data stream, turns step
Suddenly (4)；Otherwise delay transmitting data stream message is replied, controller resumes waiting for the QoS transfer request messages of server, goes to step
(1)；
(4) controller is monitored the QoS flow and link circuit condition of transmission, when existing in congestion and congestion link occurs in link
When QoS flow or the rate of QoS flow transmission and inconsistent bandwidth demand in step (1), preset adjusting strategy is performed, to ensure
The normal transmission of QoS flow and efficiently using for Internet resources；
(5) after QoS flow end of transmission, server sends resource release message to SDN controllers, terminates.
2. method for controlling network flow according to claim 1, which is characterized in that server and controller communication information are equal
For http message.
3. method for controlling network flow according to claim 1, which is characterized in that SDN controllers in step (2) are to friendship
It changes planes the message of transmission, including but not limited to single traffic flow information, flow table information, port information, queuing message.
4. method for controlling network flow according to claim 1, which is characterized in that step (3) if in data flow be QoS flow
During data, then other QoS routing algorithms can also be chosen in light of the circumstances and calculate routed path, can meet delay constraint
Under conditions of calculate the path for meeting delay variation and packet loss minimum.
5. the method for controlling network flow according to claim 1 or 4, which is characterized in that the router-level topology of non-QoS flow,
Using link bandwidth as weights, link metric is set asLink metric substitution dijkstra's algorithm is calculated
Most short transmission path；Wherein CeRepresent the bandwidth capacity of link e, UeRepresent the used bandwidth of link e, e represents a wherein chain
Road.
6. the flow control methods according to claim 1 or 4, which is characterized in that step (3) calculate routing based on time delay
The minimum cost routing algorithm of constraint, including following sub-step：
(3.1) link cost parameter is constructed：
Cij=(1- β) gij+βpij, 0 ＜ β ＜ 1；
Wherein i, j represent two nodes adjacent in link, gijRepresent i, the delay jitter between j, pijNode i is represented, between j
Packet loss；β is proportionality coefficient, and value is variable, requires high QoS flow that should take delay jitter small, higher is required to packet loss
Should take it is larger；
(3.2) mathematical model for the routing r* for meeting delay constraint and Least-cost is established：
R*=argrmin{fc(r)|r∈rst,fd(r)≤dmax}；
Wherein rstRepresent all route sets between source node s and destination node t, r ∈ rstRepresent a routing therein,For total cost of path r, dijThe time delay of link between adjacent node i, j is represented,For
The overall delay of path r, dmaxAllow maximum delay for QoS flow, value allows maximum delay for the service transmission that step (1) determines；
(3.3) above-mentioned QoS route matrixs are solved using Lagrangian Relaxation Algorithm, detailed process is：
(3.3.1) is by CijAs link metric, the path r that dijkstra's algorithm solves Least-cost is substituted intoc；
(3.3.2) judges path rcDelay whether be less than dmax, it is then by rcAs required path, r is returnedcRouting turns
(3.3.8)；Otherwise turn (3.3.3)；
(3.3.3) is by dijAs link metric, the path r that dijkstra's algorithm solves time delay minimum is substituted intod；
(3.3.4) judges path rdTime delay whether be more than dmax, it is to show that satisfactory path can not be calculated, to service
Device replys delay transmitting data stream message, turns (3.3.8)；Otherwise turn (3.3.5)；
(3.3.5) enables relaxation parameterWherein fc(rc) it is path rcCost value, fc(rd) it is path rd
Cost value, fd(rd) it is path rdOverall delay, fd(rc) it is path rcOverall delay；Link metric is set as cost parameter
With the combination parameter value of delay parameter, i.e.,Substitution dijkstra's algorithm solves link metric and isWhen most
Small path rλ；
(3.3.6) judges fλ(rλ) and fλ(rc) whether equal, it is then by rdAs required path, turn (3.3.8)；Otherwise turn
(3.3.7), wherein fλ(rλ), fλ(rc) it is path r respectivelyλAnd rcWithTotal group of path as each of the links weights in path
Conjunction parameter value is consistent with link overall delay concept, and only overall delay is the weights using the time delay of link as link；
(3.3.7) judges path rcDelay whether be less than dmax, it is to enable rd=rλ, turn (3.3.5)；Otherwise r is enabledc=rλ, turn
(3.3.5)；
(3.3.8) terminates.
7. the method for controlling network flow according to claim 1 or 4, which is characterized in that the adjusting strategy packet in step (4)
Include following sub-step：
(4.1) data flow is sampled, judges whether traffic transmission rate is more than bandwidth demand, be that limit is then performed at inflow entrance
Fast strategy, i.e., limit its rate in inlet, make its bandwidth demand with request consistent, turns (4.3)；Otherwise turn (4.2)；
(4.2) reduction process (3) bandwidth reserved for its is set to current QoS flow transmission rate size；
(4.3) to link sample, judge link bandwidth utilization rate whether reach 80% and chain road there are QoS flow transmission, be then
Link congestion state is represented, is turned (4.4)；Otherwise turn (4.7)；
(4.4) judge with the presence or absence of non-QoS data stream in all data flows of chain road, be to perform (4.5)；Otherwise it performs
(4.6)；
(4.5) the non-QoS flow of transmission rate maximum is selected, road recalculated using shortest path first after deletion congestion link
By turning (4.3)；
(4.6) QoS flow of transmission rate maximum is selected, is route after deleting congestion link using the minimum cost based on delay constraint
Algorithm recalculates routing, turns (4.3)；
(4.7) turn (4.1) after postponing T seconds；T determines according to network concrete condition, generally 1-3 seconds.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510737123.8A CN105357068B (en) | 2015-11-03 | 2015-11-03 | The OpenFlow method for controlling network flow that a kind of application-oriented QoS is ensured |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510737123.8A CN105357068B (en) | 2015-11-03 | 2015-11-03 | The OpenFlow method for controlling network flow that a kind of application-oriented QoS is ensured |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105357068A CN105357068A (en) | 2016-02-24 |
| CN105357068B true CN105357068B (en) | 2018-06-12 |
Family
ID=55332944
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510737123.8A Expired - Fee Related CN105357068B (en) | 2015-11-03 | 2015-11-03 | The OpenFlow method for controlling network flow that a kind of application-oriented QoS is ensured |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105357068B (en) |
Families Citing this family (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105703976B (en) * | 2016-04-11 | 2018-11-09 | 浪潮集团有限公司 | A kind of monitoring method of switch port state |
| CN105897586B (en) * | 2016-05-20 | 2017-03-15 | 电子科技大学 | Energy-conservation traffic scheduling method towards mixing SDN software defined networks |
| CN106209440B (en) * | 2016-06-28 | 2019-11-12 | 新华三技术有限公司 | Service quality QoS implementation method and device in software defined network SDN |
| US10764191B2 (en) | 2016-08-22 | 2020-09-01 | Siemens Aktiengesellschaft | Device and method for managing end-to-end connections |
| CN106341346B (en) * | 2016-09-08 | 2019-07-19 | 重庆邮电大学 | A kind of routing algorithm ensureing QoS in data center network based on SDN |
| CN106411772B (en) * | 2016-09-29 | 2019-04-23 | 四川通信科研规划设计有限责任公司 | Network traffic load equalization methods based on SDN |
| CN106656866B (en) * | 2016-10-13 | 2019-07-05 | 烽火通信科技股份有限公司 | The method and system that bandwidth customizes on time are realized based on software definition Optical Access Network |
| CN106789179B (en) * | 2016-11-30 | 2019-07-09 | 中国人民解放军国防科学技术大学 | A kind of resource allocation methods based on SDN framework |
| CN108449279B (en) * | 2016-12-13 | 2021-10-26 | ***通信有限公司研究院 | Congestion control method and device |
| US9954611B1 (en) * | 2016-12-16 | 2018-04-24 | Futurewei Technologies, Inc. | System and method for abstracting wavelength-switched optical network traffic engineering topology in SDN control hierarchy |
| CN107360473A (en) * | 2017-07-20 | 2017-11-17 | 中国传媒大学 | A kind of DASH systems of the flow scheduling of the congestion aware based on SDN |
| CN109391563B (en) | 2017-08-08 | 2022-04-05 | 华为技术有限公司 | Resource reservation method and related equipment |
| CN107360483B (en) * | 2017-08-21 | 2020-04-24 | 西安邮电大学 | Controller load balancing algorithm for software defined optical network |
| CN107896192B (en) * | 2017-11-20 | 2020-09-25 | 电子科技大学 | QoS control method for differentiating service priority in SDN network |
| CN108494707A (en) * | 2018-04-03 | 2018-09-04 | 郑州云海信息技术有限公司 | A kind of elastic bandwidth management method and device based on SDN network |
| CN108521375B (en) * | 2018-04-17 | 2020-12-15 | 中国矿业大学 | SDN-based network multi-service flow QoS transmission and scheduling method |
| CN108833279B (en) * | 2018-05-08 | 2020-06-12 | 西安交通大学 | Method for multi-constraint QoS routing based on service classification in software defined network |
| CN108366015B (en) * | 2018-05-24 | 2021-04-13 | 湖南师范大学 | Route calculation method for software defined network |
| CN108900413B (en) * | 2018-06-05 | 2020-10-02 | 北京邮电大学 | Routing path selection method, device, electronic equipment and storage medium |
| CN108809765B (en) * | 2018-06-19 | 2022-06-03 | 刘昱 | Network quality testing method and device |
| CN109067648B (en) * | 2018-07-27 | 2020-11-10 | 西安电子科技大学 | Computing method for multi-constraint route optimization based on DAG |
| CN109088795B (en) * | 2018-09-17 | 2021-11-02 | 电子科技大学 | Controller performance analysis method based on equal-interval sampling |
| CN109104592A (en) * | 2018-09-30 | 2018-12-28 | 广东电网有限责任公司 | A kind of method, SDN controller, system and the equipment of mobile video transmission |
| CN109769139A (en) * | 2018-11-23 | 2019-05-17 | 深圳秦云网科技有限公司 | A kind of method and device of transmitting video data |
| CN110098976B (en) * | 2019-04-08 | 2021-01-15 | 京信通信***（中国）有限公司 | Network parameter measuring method and device, computer equipment and storage medium |
| CN110167032A (en) * | 2019-04-30 | 2019-08-23 | 陕西师范大学 | The network-building method and system of the software definition wireless self-organization network of unmanned aerial vehicle (UAV) control |
| CN110311864A (en) * | 2019-06-20 | 2019-10-08 | 山东省计算中心（国家超级计算济南中心） | Method for routing and device based on entropy assessment in a kind of SDN network |
| CN110365582A (en) * | 2019-06-20 | 2019-10-22 | 山东省计算中心（国家超级计算济南中心） | A kind of multiple constraint method for routing based on SDN network, a kind of controller |
| CN111083050B (en) * | 2019-12-26 | 2021-07-23 | 北京邮电大学 | Data stream transmission method and device based on software defined network |
| CN113543206B (en) * | 2020-04-21 | 2023-08-22 | 华为技术有限公司 | Method, system and device for data transmission |
| CN113923125B (en) * | 2020-06-22 | 2022-12-06 | 北京交通大学 | Tolerance analysis method and device for multi-service flow converged communication in industrial heterogeneous network |
| CN112099871B (en) * | 2020-09-03 | 2023-06-02 | 中国联合网络通信集团有限公司 | Service quality configuration method and device |
| CN112565008B (en) * | 2020-11-26 | 2022-11-22 | 深信服科技股份有限公司 | Network monitoring method, device and related equipment |
| CN113114587A (en) * | 2021-03-29 | 2021-07-13 | 华南理工大学 | QoS guarantee system based on SDN and broadband resource reservation method thereof |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103618679A (en) * | 2013-11-25 | 2014-03-05 | 上海华为技术有限公司 | Service quality control method, device and system |
| CN103916302A (en) * | 2013-01-04 | 2014-07-09 | 上海贝尔股份有限公司 | Method and device for providing SDN stream route for virtual WLAN |
| CN104468352A (en) * | 2014-12-26 | 2015-03-25 | 深圳市新格林耐特通信技术有限公司 | SDN based special flow QOS guaranteeing method |
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013113396A1 (en) * | 2012-02-02 | 2013-08-08 | Huawei Technologies Co., Ltd. | Traffic scheduling device |
-
2015
- 2015-11-03 CN CN201510737123.8A patent/CN105357068B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103916302A (en) * | 2013-01-04 | 2014-07-09 | 上海贝尔股份有限公司 | Method and device for providing SDN stream route for virtual WLAN |
| CN103618679A (en) * | 2013-11-25 | 2014-03-05 | 上海华为技术有限公司 | Service quality control method, device and system |
| CN104468352A (en) * | 2014-12-26 | 2015-03-25 | 深圳市新格林耐特通信技术有限公司 | SDN based special flow QOS guaranteeing method |
| 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 |
Non-Patent Citations (1)
| Title |
|---|
| 基于多约束条件的QoS路由算法研究;李文娟;《中国优秀硕士学位论文全文数据库信息科技辑》;20130515(第5期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105357068A (en) | 2016-02-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105357068B (en) | The OpenFlow method for controlling network flow that a kind of application-oriented QoS is ensured | |
| CN106789648B (en) | Software defined network route decision method based on content storage and Network status | |
| CN106165354B (en) | Network path selection using bandwidth prediction | |
| US9621375B2 (en) | Smart Ethernet edge networking system | |
| CN104994033A (en) | Method for guaranteeing QoS (quality of service) of SDN (software defined network) by means of dynamic resource management | |
| EP2008476A2 (en) | Smart ethernet edge networking system | |
| WO2020052306A1 (en) | Method, device and system for determining message forwarding path | |
| CN106209622A (en) | A kind of method of multicasting based on SDN | |
| Haiyan et al. | Towards SDN based queuing delay estimation | |
| CN111327525B (en) | Network routing method and device based on segmented routing | |
| WO2018233580A1 (en) | Method, controller and system for establishing forwarding path in network | |
| CN106454414B (en) | A kind of multipath network method for real-time video transmission | |
| CN109743211A (en) | Path open system and method are cooperateed with optical-fiber network based on the IP network of SDN | |
| Li et al. | Enabling software defined networking with qos guarantee for cloud applications | |
| Zhang et al. | A multipath transport scheme for real-time multimedia services based on software-defined networking and segment routing | |
| Kotani et al. | Packet-in message control for reducing cpu load and control traffic in openflow switches | |
| Morel et al. | Network services management using programmable data planes for visual cloud computing | |
| WO2012068834A1 (en) | Method and system for managing aggregation link | |
| CN100486219C (en) | A method to realize the end-to-end stream transmission | |
| JP5789548B2 (en) | Communication device | |
| Rahouti et al. | Latencysmasher: a software-defined networking-based framework for end-to-end latency optimization | |
| Sllame et al. | Performance comparison of VoIP over wireless ad hoc networks using different routing protocols and queuing techniques | |
| Karbhari et al. | Optimizing end-to-end throughput for data transfers on an overlay-tcp path | |
| Kalan et al. | Implementation of sand architecture using sdn | |
| Nakayama | Rate-based path selection for shortest path bridging in access networks |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180612 Termination date: 20181103 |