CN114745343A - QoS priority based network load balancing routing method, device and equipment for SDN - Google Patents

QoS priority based network load balancing routing method, device and equipment for SDN Download PDF

Info

Publication number
CN114745343A
CN114745343A CN202210310244.4A CN202210310244A CN114745343A CN 114745343 A CN114745343 A CN 114745343A CN 202210310244 A CN202210310244 A CN 202210310244A CN 114745343 A CN114745343 A CN 114745343A
Authority
CN
China
Prior art keywords
flow
priority
service
sdn
qos priority
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
Application number
CN202210310244.4A
Other languages
Chinese (zh)
Other versions
CN114745343B (en
Inventor
刘旭
孟萍
杨龙祥
朱洪波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN202210310244.4A priority Critical patent/CN114745343B/en
Publication of CN114745343A publication Critical patent/CN114745343A/en
Application granted granted Critical
Publication of CN114745343B publication Critical patent/CN114745343B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/805—QOS or priority aware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/90—Buffering arrangements
    • 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
    • Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The application relates to a QoS priority-based network load balancing routing method, system and device for an SDN. The method comprises the following steps: at least two flow buffer queues are arranged in at least one terminal switch, and at least two flow buffer queues comprise a high-priority flow buffer queue and a low-priority flow buffer queue; determining a first-level QoS priority of a service flow according to the service type of the service flow received by at least one terminal switch, and distributing the service flow to one of at least two corresponding flow buffer queues according to the first-level QoS priority; allocating a second-level QoS priority to the service flow allocated to one of the at least two flow cache queues according to the acquired real-time service flow state of the SDN, wherein the second-level QoS priority is used for indicating the scheduling sequence of the service flow in one of the at least two flow cache queues; and indicating the scheduling sequence of the service flow in at least one terminal switch according to the high and low of the second-level QoS priority of each service flow in at least one flow buffer queue.

Description

QoS priority based network load balancing routing method, device and equipment for SDN
Technical Field
The present application relates to the field of communications technologies, and in particular, to a network load balancing routing method, apparatus, and device for an SDN based on QoS priority.
Background
SDN (Software defined Network) is a new Network architecture proposed by stanford university in the united states, and SDN technology is a brand new Network architecture that breaks through the characteristics of logical centralization, separation of control and forwarding, open interface, programmability and the like of the traditional Network organization application mode.
The control plane and data plane of an SDN network have flexibility and are suitable for solving the problem that static path allocation cannot meet service specific requirements due to rapid dynamic changes of traffic in the network. But SDN networks face the problem of how to balance network load while formulating a personalized QoS (Quality of Service) Service for users.
Disclosure of Invention
Based on this, it is necessary to provide a network load balancing routing method, device and apparatus for SDN based on QoS priority in order to solve the above technical problems.
In one aspect of the present application, a network load balancing routing method for an SDN based on QoS priority is provided, where the SDN includes an SDN network controller and at least one end switch communicatively connected to the SDN network controller, and the method includes:
step S100, the SDN network controller sets at least two flow buffer queues in the at least one terminal switch, where the at least two flow buffer queues at least include a high-priority flow buffer queue and a low-priority flow buffer queue;
step S200, the SDN network controller determines a first-level QoS priority of a service flow according to the service type of the service flow received by the at least one terminal switch, and allocates the service flow to one of the at least two corresponding flow cache queues according to the first-level QoS priority;
step S300, the SDN network controller allocates a second-level QoS priority to the service flows allocated to one of the at least two flow cache queues according to the acquired real-time service flow state of the SDN, and the second-level QoS priorities of the service flows in the high-priority flow cache queue are both higher than the second-level QoS priorities of the service flows in the low-priority flow cache queue, where the second-level QoS priorities are used to indicate a scheduling order of the service flows in one of the at least two flow cache queues; and
step S400, the SDN network controller indicates a scheduling order of the service flows in the at least one terminal switch according to a second-level QoS priority of each service flow in one of the at least two flow buffer queues.
In an embodiment, the step of allocating the traffic flow to a corresponding one of the at least two flow buffer queues according to the first level QoS priority includes:
step S240, when the first-level QoS priority is greater than or equal to a preset threshold, allocating the service flow to the high-priority flow buffer queue; and
step S242, when the first-level QoS priority is smaller than the preset threshold, allocating the service flow to the low-priority flow buffer queue.
In an embodiment, the SDN network controller indicates a scheduling order of the traffic flows in the at least one end switch according to a size of a second-level QoS priority of each traffic flow in one of the at least two flow buffer queues, respectively, and further includes:
step S420, when there is no service flow in the high-priority flow buffer queue, the SDN network controller instructs the at least one terminal switch to schedule and forward the service flow in the low-priority flow buffer queue; and
step S440, when the second QoS priority of the service flow received by the at least one terminal switch is higher than the second QoS priority of the service flow being scheduled and forwarded by the at least one terminal switch, interrupting the current scheduling and forwarding, and scheduling and forwarding the received service flow.
In an embodiment, the real-time traffic state includes factors having an influence on flow scheduling, and the step of assigning the second level QoS priority to the traffic flow assigned to one of the at least two flow buffer queues by the SDN network controller according to the acquired real-time traffic state of the SDN includes:
step S320, establishing a hierarchical structure model in a fuzzy hierarchical analysis algorithm according to the real-time service flow state;
step S340, obtaining corresponding triangular fuzzy numbers according to the importance of each factor in the real-time service flow state of the factor layer of the hierarchical structure model, and establishing a triangular fuzzy comparison matrix according to the triangular fuzzy numbers corresponding to each factor;
step S360, calculating defuzzified normalized sharpness weight vectors corresponding to the factors according to the triangular fuzzy comparison matrix; and
and step S380, calculating the second-level QoS priority according to the normalized clear weight vector of each factor and the normalized weight of the quantization value vector of each factor.
In one embodiment, the triangular fuzzy comparison matrix is:
Figure BDA0003566941390000021
wherein the triangular fuzzy number is
Figure BDA0003566941390000022
lijkA lower limit value, u, representing the triangular blur numberijkAn upper limit value m representing the triangular blur numberijkAnd expressing the value with the maximum possibility of the triangular fuzzy number, i, j belongs to {1,2.., n } and i is not equal to j, k belongs to {1,2.., r }, n represents the number of the factors, and r represents the number of the service flows needing to be subjected to priority ordering in the queue to be subjected to the second-level QoS priority in the at least two flow buffer queues.
In an embodiment, the step of calculating the sharpness weights of the defuzzification corresponding to the factors according to the triangular fuzzy comparison matrix includes:
step S362, calculating the triangular fuzzy comparison matrix according to a log least square method calculation formula, to obtain the vector of the normalized fuzzy weight of each factor, respectively, where the log least square method calculation formula is:
Figure BDA0003566941390000023
s.t.：
Figure BDA0003566941390000024
Figure BDA0003566941390000025
Figure BDA0003566941390000026
Figure BDA0003566941390000027
Figure BDA0003566941390000028
vector of the normalized fuzzy weight
Figure BDA0003566941390000031
wherein ,
Figure BDA0003566941390000032
the vector representing the normalized blur weight for the ith factor,
Figure BDA0003566941390000033
lower of the normalized blur weight representing the ith factorThe value of the limit is,
Figure BDA0003566941390000034
an upper bound value representing the normalized weight of the ith factor, an
Figure BDA0003566941390000035
A most probable value of the normalized fuzzy weight representing the ith factor;
step S364, deblurring the vector of the normalized fuzzy weight according to a centroid deblurring algorithm to obtain the clear weight, wherein the centroid deblurring algorithm is:
Figure BDA0003566941390000036
in one embodiment, the factors of the real-time traffic status include a traffic type, a user level, and a data request frequency of the traffic;
the weight of the quantization value vector normalization of each factor is calculated by the following formula:
Figure BDA0003566941390000037
wherein ,ViA weight normalized for the quantization value vector of the ith factor of the traffic flow, u being a current quantization value of the ith factor, uminIs the minimum quantized value of the ith factor, and umaxIs the maximum quantized value of the ith factor; and
the second level QoS priority is calculated by the following formula:
Figure BDA0003566941390000038
wherein ,ωiThe sharpness weight for the ith factor.
In an embodiment, the method further comprises:
step S520, obtaining a first routing path flow table of the service flow in the high-priority flow cache queue by substituting a first link cost function into Dijkstra algorithm, and sending the first routing path flow table to a corresponding terminal switch, where the first link cost function is:
ηij＝ω1*gij+ω2*hij+ω3*mij，
wherein ,ηijRepresenting said first link cost function, gij、hij、mijRespectively representing the bandwidth, time delay and packet loss rate of the traffic of the link (i, j), omega1、ω2、ω3A scale factor set according to the contribution degree of the bandwidth, the time delay and the packet loss rate of a specific flow to the link cost and the requirement of the service type, wherein, omega1、ω2、ω3The value ranges of (a) are respectively greater than or equal to 0 and less than or equal to 1; and
step S540, substituting a second link cost function into the Dijkstra algorithm to obtain a second routing path flow table of the service flow in the low-priority flow cache queue, and sending the second routing path flow table to a corresponding terminal switch, where the second link cost function is:
Figure BDA0003566941390000039
wherein ,CijRepresents the maximum available bandwidth, U, on the link (i, j)ijIndicating the bandwidth that has been used.
In another aspect of the present application, a network load balancing routing apparatus for an SDN based on QoS priority is further provided, where the SDN includes an SDN network controller and at least one end switch communicatively connected to the SDN network controller, the apparatus includes:
a buffer queue maintenance module, configured to set at least two flow buffer queues in the at least one terminal switch through the SDN network controller, where the at least two flow buffer queues at least include a high-priority flow buffer queue and a low-priority flow buffer queue, and second-level QoS priorities of service flows in the high-priority flow buffer queue are higher than second-level QoS priorities of service flows in the low-priority flow buffer queue;
a first-level priority classification module, configured to determine, by the SDN network controller, a first-level QoS priority of a service flow according to a service type of the service flow received by the at least one terminal switch, and allocate the service flow to one of the at least two corresponding flow cache queues according to the first-level QoS priority;
a fine-grained second-level prioritization module, configured to allocate, by the SDN network controller, a second-level QoS priority to the traffic flow allocated to one of the at least two flow cache queues according to the obtained real-time traffic flow state of the SDN, where the second-level QoS priority is used to indicate a scheduling order of the traffic flow in the one of the at least two flow cache queues; and
a scheduling sequence control module, configured to indicate, by the SDN network controller, a scheduling sequence of the service flows in the at least one terminal switch according to a level of a second-level QoS priority of each service flow in one of the at least two flow cache queues, respectively.
In yet another aspect of the present application, there is also provided a network load balancing routing device for SDN based on QoS priority, comprising a receiver, a transmitter, a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the method in any one of the preceding embodiments when executing the computer program.
The network load balancing routing method, device and equipment for the SDN based on the QoS priority realize the following technical effects:
by adopting a two-level priority classification method, namely, by adopting a first-level QoS priority and a second-level QoS priority, the service flow entering the user switch is subjected to two-time priority sequencing, so that the service flow is orderly and reasonably scheduled according to different service characteristics and network implementation conditions of the service flow, and network congestion is avoided.
The real-time service flow state of the service flow is considered by adopting a fuzzy analytic hierarchy process, for example, factors such as the flow type, the user level, the data request frequency and the like of the service flow are considered to carry out two-layer fine-grained priority sequencing, so that the personalized QoS service is formulated for the service flow, and the user experience and the network service stability are improved.
Under the condition of dynamic change of the network state, in order to guarantee the QoS requirements of different users and optimize the network performance, differentiated routing decision is carried out on the service flows with different requirements according to the service characteristics so as to meet the QoS requirements.
Drawings
Fig. 1 is a topology diagram of an application network architecture of an SDN network load balancing routing method based on QoS priority according to an embodiment of the present application.
Fig. 2 is a flowchart of a QoS priority based SDN network load balancing routing method according to an embodiment of the present application.
Fig. 3 is a flowchart of a QoS priority based SDN network load balancing routing method according to another embodiment of the present application.
Fig. 4 is a flowchart of a QoS priority based SDN network load balancing routing method according to still another embodiment of the present application.
Fig. 5 is a flowchart of a QoS priority based SDN network load balancing routing method according to another embodiment of the present application.
Fig. 6 is a flowchart of a QoS priority based SDN network load balancing routing method according to another embodiment of the present application.
Fig. 7 is a diagram illustrating a first-level priority flow buffer queue according to the embodiment of fig. 2.
Fig. 8 is a diagram illustrating two-level priority classification and ordering of traffic flows according to the embodiment of fig. 2.
FIG. 9 is a schematic diagram illustrating traffic prioritization using fuzzy analytic hierarchy process according to an embodiment of the present application.
Fig. 10 is a graph comparing the average packet loss rate and the network load relationship of the embodiment of fig. 9 of the present application with the embodiment using the conventional routing algorithm.
Fig. 11 is a block diagram illustrating a structure of a QoS priority based SDN network load balancing routing apparatus according to an embodiment of the present application.
Fig. 12 is a schematic internal structure diagram of an SDN network load balancing routing device based on QoS priority in an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of and not restrictive on the broad application.
In this application, use of ordinal terms such as "first," "second," etc., to modify an element does not denote any priority, order, or importance of one element relative to another element or the temporal order in which acts in a method are performed. Unless specifically stated otherwise, such ordinal words are used merely as labels to distinguish one element having a particular name from another element having the same name (except for the ordinal word).
The SDN network load balancing routing method based on the QoS priority can be applied to the application environment shown in FIG. 1. Wherein different types of applications used by end users have different network QoS requirements in the network. At this time, traffic flows with different QoS requirements (which may be referred to as network flows, data packets, and the like corresponding to a specific service or data traffic of a specific user) enter an end switch (for example, a user Open-Flow switch), and the SDN controller intelligently senses network parameters of the SDN and performs secondary priority classification of the traffic flows accordingly. The SDN controller issues a forwarding strategy (for example, a flow table of a routing path) to the switch according to the collected global network parameter information, and the switch performs forwarding operation on the traffic flows with different priorities according to the forwarding strategy. Through the network architecture, the QoS requirements of users can be better met while reasonably distributing network resources to meet network load balance.
As shown in fig. 1, the SDN controller 100 and the end switch 200 constitute an SDN physical network. The end switch may be an Open-flow switch. The terminating switch 200 may be divided by domain, with switches at the edge of a set of switches in a domain that communicate with switches at the edge of other domains being edge switches. The SDN controller is provided with a receiver, a transmitter, a memory, and a processor. The receiver and the transmitter are respectively used for the SDN controller to receive the network aware signal and send a control instruction to each switch 200, for example, send a routing path flow table to the switch to provide a routing path for forwarding the traffic flow.
It is to be understood that an undirected graph G (V, E) may also be used to describe an SDN physical network, where V represents a set of nodes in the network, each node representing a subscriber switch (e.g., an Open-flow switch), and E represents a set of links. (i, j) is used to represent the links between nodes i, j. bij、dij、lijRespectively, the bandwidth capacity, transmission delay and packet loss rate of the link (i, j). Binary variable
Figure BDA0003566941390000051
Indicates whether the traffic flow k passes through the link (i, j) when
Figure BDA0003566941390000052
Indicates that the traffic flow k passes through the link (i, j) when
Figure BDA0003566941390000053
Indicating that traffic flow k does not traverse link (i, j). K represents a set of traffic flows, K ∈ K. The node of the service flow k entering the network is the source node, and s is usedkRepresents; the node where the traffic flow k leaves the network is the destination node, using tkAnd (4) showing. R represents the reachable path from the source node to the destination node, R represents the set of all reachable paths from the source node to the destination node, and R belongs to R.
In the above embodiment, if the network is abstracted into the form of a completely undirected graph, where the switches act as nodes in the undirected graph, the weight between two nodes is determined by the link cost function. And the SDN controller brings different link cost functions into a Dijkstra algorithm according to the priority of the service flow to obtain a corresponding routing path. And selecting the optimal path according to the link weight value, thereby realizing the planning of all the traffic flow paths.
In one embodiment, as shown in fig. 2, a QoS priority based SDN network load balancing routing method is provided, which is described by taking the application of the method to the SDN network in fig. 1 as an example, and includes the following steps:
step S100, the SDN network controller sets at least two flow buffer queues in the at least one terminal switch, where the at least two flow buffer queues at least include a high-priority flow buffer queue and a low-priority flow buffer queue.
In this embodiment, step S100 may be understood as classifying the first level of priority of the traffic flow. Referring to fig. 7, the terminal switch is configured to receive various service flows of a user, and may be, for example, an Open-flow switch. The topology of the terminating switch connections is not particularly limited herein. Each terminal switch is in communication connection with the SDN controller, so that a network state can be sent to the SDN controller, and meanwhile, various control instructions can be received from the SDN controller, for example, an optimized routing path flow table which is obtained by the SDN controller through algorithm calculation, is based on QoS priority and considers SDN network load balancing is received, so that service flows in flow cache queues with different priorities are forwarded according to the routing path flow table.
In this embodiment, a high-priority flow buffer queue and a low-priority flow buffer queue are provided, but it is understood that a plurality of flow buffer queues, for example, 3 or 4 flow buffer queues may be provided according to the priority level, as long as the number of flow buffer queues is greater than or equal to 2, so as to facilitate forming the first-level priority classification, and this is not particularly limited in this application.
Step S200, the SDN network controller determines a first-level QoS priority of a service flow according to a service type of the service flow received by the at least one terminal switch, and allocates the service flow to one of the at least two corresponding flow buffer queues according to the first-level QoS priority.
In this embodiment, the service type of the service flow received by at least one end switch may be determined through a header of the IPV4 message or a source IP address service type field, and persons of ordinary skill in the art should know various ways to obtain the service type of the service flow, and the present invention is not limited thereto.
The service types may have different or the same QoS requirements, the service types may include, for example, VoIP, e-commerce second killer, video conference, live video, and the like, and the SDN network controller sets corresponding first-level QoS priorities in advance according to the service flows of different service types. When a service flow is detected and the service type of the service flow is determined, the SDN network controller allocates a corresponding first-level QoS priority to the service flow, and allocates the service flow to a corresponding flow cache queue according to the first-level QoS priority according to the preset condition.
The terminal switch maintains two traffic buffer queues according to priority, and allocates traffic to different priority queues according to the QoS requirements of users, which facilitates forwarding the traffic flows in the queues in the order of the second priority (second QoS priority) based on the first priority (first QoS priority) later, as will be described in detail later.
Step S300, the SDN network controller allocates a second-level QoS priority to the service flows allocated to one of the at least two flow cache queues according to the acquired real-time service flow state of the SDN, and the second-level QoS priorities of the service flows in the high-priority flow cache queue are all higher than the second-level QoS priorities of the service flows in the low-priority flow cache queue, where the second-level QoS priorities are used to indicate a scheduling order of the service flows in one of the at least two flow cache queues.
Step S400, the SDN network controller indicates a scheduling order of the service flows in the at least one terminal switch according to a second-level QoS priority of each service flow in one of the at least two flow buffer queues.
In this embodiment, in conjunction with fig. 8, the priority classification may be understood as a fine-grained second-level prioritization. The real-time traffic state of the SDN refers to parameters representing traffic characteristics that affect the importance of the traffic, and may include, but is not limited to: stream type, user level, data request frequency. It will be appreciated that, for example, the QoS priority of certain flow types is higher, the QoS priority of traffic flows for users at higher user levels is higher, and the QoS priority of traffic flows at higher data request frequencies is higher.
In the embodiment, the factors influencing the importance of the service flow are considered, so that the comprehensive second-level QoS priority of the service flow is comprehensively obtained, and the service flows in the single queue are subjected to priority sorting according to the second-level QoS priority, so that the scheduling order is determined.
It should be noted that the second-level QoS priorities of the traffic flows in the high-priority flow buffer queues are all higher than the second-level QoS priorities of the traffic flows in the low-priority flow buffer queues.
Therefore, in the SDN network load balancing routing method based on the QoS priority, the service flows entering the user switch are subjected to priority sorting twice by adopting a two-level priority sorting method, namely, the first-level QoS priority and the second-level QoS priority, so that the service flows are orderly and reasonably dispatched according to different service characteristics and network implementation conditions of the service flows, and network congestion is avoided.
It is understood that, in the step S200, the following steps may be further included:
step S240, when the first-level QoS priority is greater than or equal to a preset threshold, allocating the service flow to the high-priority flow buffer queue.
Step S242, when the first-level QoS priority is smaller than the preset threshold, allocating the service flow to the low-priority flow buffer queue.
That is, in order to allocate the traffic flows with different QoS priorities to the two flow buffer queues, each traffic flow is compared with a preset value. The preset value can be set according to the actual application condition, so that different QoS screening requirements are met.
As shown in fig. 3, an example of the present application is shown that the order of terminal switches scheduling and forwarding traffic flows is adjusted in real time, that is, the method further includes:
step S420, when there is no service flow in the high-priority flow buffer queue, the SDN network controller instructs the at least one terminal switch to schedule and forward the service flow in the low-priority flow buffer queue.
In this embodiment, when there is no traffic in the high-priority flow buffer queue (no traffic is allocated to the high-priority flow buffer queue and all traffic in the high-priority flow buffer queue has been forwarded), the scheduling and forwarding task of the traffic in the low-priority flow buffer queue is started.
Step S440, when the second QoS priority of the service flow received by the at least one end switch is higher than the second QoS priority of the service flow being scheduled and forwarded by the at least one end switch, interrupting the current scheduling and forwarding, and scheduling and forwarding the received service flow.
The SDN network controller monitors new service flows received by each terminal switch, and when it is monitored that the new service flows flow into the terminal switch and the second-level QoS priority of the service flows is higher than that of the service flows forwarded by the terminal switch, the SDN network controller instructs the terminal switch to stop forwarding the current service flows and immediately start forwarding the new service flows.
It can be understood that when the second-level QoS priority of the new traffic flow monitored by the SDN network controller is lower than the second-level QoS priority of the traffic flow being forwarded by the terminal switch, the forwarding of the current traffic flow is not affected, and the new incoming traffic flow is classified and ordered according to the first-level QoS priority and the second-level QoS priority thereof.
Referring to fig. 9, as shown in fig. 4, a method for calculating a second level QoS according to a real-time traffic flow status according to an embodiment of the present application is shown. The method may further comprise:
step S320, establishing a hierarchical structure model in a fuzzy hierarchical analysis algorithm according to the real-time service flow state.
With reference to fig. 9, the established hierarchical model includes three layers, i.e., a priority layer, a factor layer, and a target layer. In the present embodiment, a plurality of priorities, for example, priority 1, priority 2, and the like, are set in the priority layer. In the factor layer, there are various factors that affect the importance of the service flow, in this embodiment, the flow type, the user level, and the data request frequency. In the target tier is the resulting composite priority.
Step S340, obtaining corresponding triangular fuzzy numbers according to the importance of each factor in the real-time service flow state of the factor layer of the hierarchical structure model, and establishing a triangular fuzzy comparison matrix according to the triangular fuzzy numbers corresponding to each factor.
In the embodiment, the importance of three factors, namely the stream type, the user level and the data request frequency of the factor layer is analyzed and is represented by triangular fuzzy numbers. For any flow buffer queue, according to the existing service flow condition, each factor evaluation of each service flow is converted into a triangular fuzzy number according to a certain conversion scale. And expressing the preference of the user by utilizing the triangular fuzzy number, and establishing a triangular fuzzy comparison matrix.
For example, the triangular blur number M may be expressed as (l, M, u), where M is the median value of M with a degree of membership of 1, and when x ═ M, x safely belongs to M. l and u are lower and upper bounds, respectively, and do not belong to the fuzzy number M outside l, u.
Specifically, according to the triangular fuzzy data table, the following triangular fuzzy comparison matrix is adopted for calculation:
Figure BDA0003566941390000071
wherein the triangular fuzzy number is
Figure BDA0003566941390000072
lijkA lower limit value, u, representing the triangular blur numberijkAn upper limit value m representing the triangular blur numberijkThe value with the maximum possibility of expressing the triangular fuzzy number, i, j epsilon{1,2.,. n } and i ≠ j, k ∈ {1,2.,. r }, where n denotes the number of the factors, and r denotes the number of traffic flows that need to be prioritized in a queue to be calculated the second-level QoS priority among the at least two flow cache queues.
And step S360, calculating defuzzified normalized sharpness weight vectors corresponding to the factors according to the triangular fuzzy comparison matrix.
According to the triangular fuzzy comparison matrix, defuzzification and normalization operations are sequentially carried out on all factors, so that defuzzification and normalization clear weight vectors corresponding to all factors are obtained, and the clear weight vectors comprise weights corresponding to all factors.
In another embodiment, the triangular fuzzy comparison matrix may be calculated by using a log-least-squares calculation formula, so as to obtain fuzzy weight vectors corresponding to each factor, and perform normalization. The sharpness weight vector may then be derived by deblurring the vector of the normalized blur weights again according to a centroid deblurring algorithm.
Specifically, with reference to fig. 5, the following Log Least Squares Method (LLSM) is used to calculate the fuzzy weight, which is effective:
Figure BDA0003566941390000081
s.t.：
Figure BDA0003566941390000082
Figure BDA0003566941390000083
Figure BDA0003566941390000084
Figure BDA0003566941390000085
Figure BDA0003566941390000086
the models shown in the above formula are all linear constraints, are linear constraint optimization models, and can be directly solved. Thus, the vector of normalized blur weights
Figure BDA0003566941390000087
wherein ,
Figure BDA0003566941390000088
the vector representing the normalized blur weight for the ith factor,
Figure BDA0003566941390000089
a lower limit value of the normalized blur weight representing the ith factor,
Figure BDA00035669413900000810
an upper limit value of the normalized weight representing the ith factor, an
Figure BDA00035669413900000811
A value representing the i-th factor at which the normalized blur weight is most likely.
In this embodiment, the centroid deblurring algorithm is:
Figure BDA00035669413900000812
therefore, in this embodiment, when the factors are stream type, user level and data request frequency, the explicit weight is calculated by normalization, and the explicit weight vector of the three types of influencing factors is:
ω＝(ω1,ω2,ω3)。
step S380, calculating the second-level QoS priority according to the normalized clear weight vector of each factor and the normalized weight of the quantization value vector of each factor.
In this embodiment, the weight of vector normalization of the quantization value of each factor can be calculated by the following formula:
Figure BDA00035669413900000813
wherein ,ViA weight normalized for the quantization value vector of the ith factor of the traffic flow, u being a current quantization value of the ith factor, uminIs the minimum quantized value of the i-th factor, and umaxIs the maximum quantized value of the ith factor; and
the second level QoS priority is calculated by the following formula:
Figure BDA00035669413900000814
wherein ,ωiThe sharpness weight for the ith factor.
After obtaining the second-level QoS priority Q corresponding to the service flow in each queue, the service flow priorities of each queue may be sorted according to the size of the data Q value, each value of Q corresponds to the priority of each service flow, the larger the priority data value is, the higher the priority of the user (i.e., service flow) is, and the SDN controller performs traffic scheduling according to the order of the priorities.
In this embodiment, a fuzzy analytic hierarchy process is used to consider a real-time traffic state of a traffic flow, for example, factors such as a traffic type, a user level, and a data request frequency of the traffic flow are considered to perform two-layer fine-grained priority sorting, so that a personalized QoS service is formulated for the traffic flow, and user experience and network service stability are improved.
As shown in fig. 6, a dynamic path selection method according to an embodiment of the present application is shown.
Specifically, the method comprises the following steps:
step S520, obtaining a first routing path flow table of the service flow in the high-priority flow cache queue by substituting a first link cost function into Dijkstra algorithm, and sending the first routing path flow table to a corresponding terminal switch, where the first link cost function is:
ηij＝ω1*gij+ω2*hij+ω3*mij，
wherein ,ηijRepresenting said first link cost function, gij、hij、mijRespectively representing the bandwidth, time delay and packet loss rate of the traffic of the link (i, j), omega1、ω2、ω3A scale factor set according to the contribution degree of the bandwidth, the time delay and the packet loss rate of a specific flow to the link cost and the requirement of the service type, wherein, omega1、ω2、ω3The value ranges of (a) are respectively greater than or equal to 0 and less than or equal to 1.
Step S540, substituting a second link cost function into the Dijkstra algorithm to obtain a second routing path flow table of the service flow in the low-priority flow cache queue, and sending the second routing path flow table to a corresponding terminal switch, where the second link cost function is:
Figure BDA0003566941390000091
wherein ,CijRepresents the maximum available bandwidth, U, on the link (i, j)ijIndicating the bandwidth that has been used.
For the flow with high QoS requirement, the method selects the path with the minimum cost for transmission. And for the flows with low QoS requirement and without QoS requirement, the load balance of the network is considered, so that the shortest path is selected according to the condition of the residual bandwidth. The method can not only ensure the transmission quality of the high-priority service flow, but also improve the transmission performance of the service flow with general requirements.
When a routing path is selected, the physical network can be abstracted into a form of a completely undirected graph, wherein a switch is used as a node in the undirected graph, and a weight value between two nodes is determined by a corresponding link cost function. And the SDN controller brings different link cost functions into Dijkstra algorithm according to the priority of the service flow to obtain corresponding routing paths and obtain link weights. And selecting the optimal path in the manner for the service flows in the buffer queues of the different priority flows according to the weight of the link, thereby realizing the planning of all the service flow paths.
Under the condition of dynamic change of the network state, in order to guarantee the QoS requirements of different users and optimize the network performance, differentiated routing decision is carried out on the service flows with different requirements according to the service characteristics so as to meet the QoS requirements.
As shown in fig. 10, a graph comparing the average packet loss rate with the network load of the embodiment and the embodiment using the conventional routing algorithm is shown. The figure shows the difference in the network load and the average packet loss rate performance of the conventional routing algorithms such as ECMP, HiQoS and the routing algorithm implemented by the method of the present application. As can be seen from the figure, as the network load increases, the average packet loss rate of the routing method in the embodiment of the present application is lower than that of other methods.
Specifically, an ubuntu16.04 system is installed in the VM Ware, and an Ryu controller and a Mininet are installed on the basis of the ubuntu16.04 system. And (3) building a network topology in Mininet, connecting the Ryu controller and the switch through an OpenFlow1.3 protocol, and configuring the sFlow agent to realize data sampling configuration. The various test streams required for the experiment were generated by the iperf tool.
The bandwidth of the main link was set to 100Mbps in the experiment. Considering the randomness of the link delay, the delay is set to a smooth random process with an expected value greater than 0 and less than 1, and the unit is (ms). The packet loss ratio is a ratio of more than 0 and less than 1, and is generated by the random number generator. In the following experiments, the impact of the proposed algorithm on end-to-end QoS and network load was tested in an SDN environment using iperf to generate different traffic flows.
Fig. 6 simulates packet loss rates of three algorithms, ECMP, HiQoS and herein algorithm. As the network load increases, network congestion occurs, resulting in packet loss to some extent. The results show that higher network packet loss rates can make the Internet more heavily loaded. Compared with the traditional algorithm, the SDN network load balancing routing algorithm based on the QoS priority is provided with the lowest packet loss rate in the three routing algorithms along with the increase of the network load, and the algorithm can effectively avoid congestion and improve the network load balancing characteristic due to the use of a priority mechanism and a classified routing link cost function.
It should be understood that although the various steps in the flow charts of fig. 2-6 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2-6 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternating with other steps or at least some of the sub-steps or stages of other steps.
In one embodiment, as shown in fig. 11, a network load balancing routing apparatus for QoS priority based SDN is provided, where the SDN includes an SDN network controller and at least one end switch communicatively connected to the SDN network controller, and the apparatus includes:
a buffer queue maintenance module, configured to set, by the SDN network controller, at least two flow buffer queues in the at least one terminal switch, where the at least two flow buffer queues at least include a high-priority flow buffer queue and a low-priority flow buffer queue, and a second QoS priority of a service flow in the high-priority flow buffer queue is higher than a second QoS priority of a service flow in the low-priority flow buffer queue;
a first-level priority classification module, configured to determine, by the SDN network controller, a first-level QoS priority of a service flow according to a service type of the service flow received by the at least one terminal switch, and allocate the service flow to one of the at least two corresponding flow cache queues according to the first-level QoS priority;
a fine-grained second-level priority ordering module, configured to allocate, by the SDN network controller, a second-level QoS priority to the traffic flow allocated to one of the at least two flow cache queues according to the obtained real-time traffic flow state of the SDN, where the second-level QoS priority is used to indicate a scheduling order of the traffic flow in the one of the at least two flow cache queues; and
a scheduling sequence control module, configured to indicate, by the SDN network controller, a scheduling sequence of the service flows in the at least one terminal switch according to a level of a second-level QoS priority of each service flow in one of the at least two flow cache queues, respectively.
For specific limitations of the network load balancing routing apparatus for the SDN based on QoS priority, reference may be made to the above limitations of the network load balancing routing method for the SDN based on QoS priority, which is not described herein again. The various modules in the network load balancing routing apparatus for SDN based on QoS priority may be implemented in whole or in part by software, hardware, and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a routing device is provided, which may be an SDN controller, and an internal structure diagram thereof may be as shown in fig. 12. The routing device includes a processor, memory, transmitter and receiver connected by a system bus, and in some embodiments may also include a display screen and/or input means. Wherein the processor of the routing device is configured to provide computational and control capabilities. The memory of the routing device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operating system and the computer program to run on the non-volatile storage medium. The transmitter and receiver of the routing device are used for communicating with external terminals via a network connection. The computer program when executed by a processor implements a network load balancing routing method for a QoS priority based SDN. The display screen of the routing device can be a liquid crystal display screen or an electronic ink display screen, and the input device of the routing device can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the routing device, an external keyboard, a touch pad or a mouse, and the like.
Those skilled in the art will appreciate that the structure shown in fig. 12 is a block diagram of only a portion of the structure associated with the present solution and does not constitute a limitation on the routing device to which the present solution applies, and that a particular routing device may include more or less components than those shown, or combine certain components, or have a different arrangement of components.
In summary, the exemplary embodiments of the present application provide a QoS priority based SDN network load balancing routing method, which is a method for solving the problem of how to formulate a personalized QoS service for a user and balance network load at the same time. In order to guarantee the QoS requirements of different users and optimize the network performance, under the condition of dynamic change of the network state, firstly, the service of each application is classified and given corresponding priority according to the service characteristics, secondly, the information such as the QoS requirements of the service, the real-time state of a link, the priority of the service and the like is comprehensively analyzed, the path is flexibly distributed, the QoS requirements of the network service are met, and the network load pressure is reduced. In the embodiments of the present application, a two-level classification method is combined, a service flow entering a terminal switch is subjected to two-level fine-grained priority ranking, and a link cost function is optimized according to real-time parameters such as bandwidth, delay, load, and the like, so as to perform path selection with the goal of realizing effective resource allocation and network load balancing.
In one embodiment, a network load balancing routing device for SDN based on QoS priority is provided, which includes a receiver, a transmitter, a memory and a processor, where the memory stores computer programs, and the processor implements the steps of the routing method of the embodiments of the present application when executing the computer programs.
For specific definition of the network load balancing routing device of the SDN based on QoS priority, refer to the above definition of the network load balancing routing method of the SDN based on QoS priority, and are not described herein again.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
All possible combinations of the technical features in the above embodiments may not be described for the sake of brevity, but should be considered as being within the scope of the present disclosure as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is specific and detailed, but not to be understood as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims (10)

1. A network load balancing routing method for QoS priority based SDN, the SDN comprising an SDN network controller and at least one end switch in communication connection with the SDN network controller,
characterized in that the method comprises:
step S100, the SDN network controller sets at least two flow buffer queues in the at least one terminal switch, where the at least two flow buffer queues at least include a high-priority flow buffer queue and a low-priority flow buffer queue;
step S200, the SDN network controller determines a first-level QoS priority of a service flow according to the service type of the service flow received by the at least one terminal switch, and allocates the service flow to one of the at least two corresponding flow cache queues according to the first-level QoS priority;
step S300, the SDN network controller allocates a second-level QoS priority to the service flows allocated to one of the at least two flow cache queues according to the acquired real-time service flow state of the SDN, and the second-level QoS priorities of the service flows in the high-priority flow cache queue are all higher than the second-level QoS priorities of the service flows in the low-priority flow cache queue, where the second-level QoS priorities are used to indicate a scheduling order of the service flows in one of the at least two flow cache queues; and
step S400, the SDN network controller indicates a scheduling order of the service flows in the at least one terminal switch according to a second level QoS priority of each service flow in one of the at least two flow buffer queues.
2. The QoS priority based network load balancing routing method of claim 1,
the step of allocating the service flow to one of the at least two corresponding flow buffer queues according to the first QoS priority includes:
step S240, when the first-level QoS priority is greater than or equal to a preset threshold, allocating the service flow to the high-priority flow buffer queue; and
step S242, when the first-level QoS priority is smaller than the preset threshold, allocating the service flow to the low-priority flow buffer queue.
3. The QoS priority based network load balancing routing method of SDN of claim 2,
wherein the step of the SDN network controller indicating the scheduling order of the service flows in the at least one terminal switch according to the size of the second-level QoS priority of each service flow in one of the at least two flow buffer queues, further includes:
step S420, when there is no service flow in the high-priority flow buffer queue, the SDN network controller instructs the at least one terminal switch to schedule and forward the service flow in the low-priority flow buffer queue; and
step S440, when the second QoS priority of the service flow received by the at least one end switch is higher than the second QoS priority of the service flow being scheduled and forwarded by the at least one end switch, interrupting the current scheduling and forwarding, and scheduling and forwarding the received service flow.
4. The QoS priority based network load balancing routing method of SDN of claim 1,
wherein the real-time traffic state includes factors having an effect on flow scheduling, and the step of assigning the second-level QoS priority to the traffic flow assigned to one of the at least two flow cache queues by the SDN network controller according to the acquired real-time traffic state of the SDN includes:
step S320, establishing a hierarchical structure model in a fuzzy hierarchical analysis algorithm according to the real-time service flow state;
step S340, obtaining corresponding triangular fuzzy numbers according to the importance of each factor in the real-time service flow state of the factor layer of the hierarchical structure model, and establishing a triangular fuzzy comparison matrix according to the triangular fuzzy numbers corresponding to each factor;
step S360, calculating defuzzified normalized sharpness weight vectors corresponding to the factors according to the triangular fuzzy comparison matrix; and
and step S380, calculating the second-level QoS priority according to the normalized clear weight vector of each factor and the normalized weight of the quantization value vector of each factor.
5. The QoS priority based network load balancing routing method of claim 4,
the triangular fuzzy comparison matrix is characterized in that:
Figure FDA0003566941380000021
wherein the triangular fuzzy number is
Figure FDA0003566941380000022
lijkA lower limit value, u, representing the triangular blur numberijkAn upper limit value m representing the triangular blur numberijkExpressing the value with the maximum possibility of the triangular fuzzy number, i, j belongs to {1,2.., n } and i is not equal to j, k belongs to {1,2.., r }, n represents the number of the factors, and r represents the number of the service flows needing to be subjected to priority ordering in the queues needing to calculate the second-level QoS priority in the at least two flow buffer queuesAnd (4) counting.
6. The QoS priority based network load balancing routing method of claim 4 or 5,
the step of calculating the defuzzified sharpness weight corresponding to each factor according to the triangular fuzzy comparison matrix comprises the following steps:
step S362, calculating the triangular fuzzy comparison matrix according to a log least square method calculation formula, and obtaining the vector of the normalized fuzzy weight of each factor, respectively, wherein the log least square method calculation formula is:
Figure FDA0003566941380000023
s.t.：
Figure FDA0003566941380000024
Figure FDA0003566941380000025
Figure FDA0003566941380000026
Figure FDA0003566941380000027
Figure FDA0003566941380000028
vector of the normalized fuzzy weight
Figure FDA0003566941380000029
wherein ,
Figure FDA00035669413800000210
the vector representing the normalized blur weight for the ith factor,
Figure FDA00035669413800000211
a lower limit value of the normalized blur weight representing the ith factor,
Figure FDA00035669413800000212
an upper limit value of the normalized weight representing the ith factor, an
Figure FDA00035669413800000213
A most probable value of the normalized fuzzy weight representing the ith factor;
step S364, deblurring the vector of the normalized fuzzy weight according to a centroid deblurring algorithm to obtain the clear weight, wherein the centroid deblurring algorithm is:
Figure FDA0003566941380000031
7. the QoS priority based network load balancing routing method of claim 6,
wherein, each factor of the real-time service flow state comprises the flow type, the user level and the data request frequency of the service flow;
the weight of the quantization value vector normalization of each factor is calculated by the following formula:
Figure FDA0003566941380000032
wherein ,ViA weight normalized for the quantized value vector of the ith factor of the traffic flow, u being the current quantized value of the ith factor, uminIs the minimum quantized value of the ith factor, and umaxIs the maximum quantized value of the ith factor; and
the second level QoS priority is calculated by the following formula:
Figure FDA0003566941380000033
wherein ,ωiThe sharpness weight for the ith factor.
8. The QoS priority based network load balancing routing method of SDN of claim 1,
characterized in that the method further comprises:
step S520, obtaining a first routing path flow table of the service flow in the high-priority flow cache queue by substituting a first link cost function into Dijkstra algorithm, and sending the first routing path flow table to a corresponding terminal switch, where the first link cost function is:
ηij＝ω1*gij+ω2*hij+ω3*mij，
wherein ,ηijRepresenting said first link cost function, gij、hij、mijRespectively represents the used bandwidth, the time delay and the packet loss rate of the flow of the link (i, j), and omega1、ω2、ω3A scale factor set according to the contribution degree of bandwidth, time delay and packet loss rate of a specific flow to the link cost and the requirement of the service type, wherein, omega1、ω2、ω3The value ranges of (a) are respectively greater than or equal to 0 and less than or equal to 1; and
step S540, substituting the second link cost function into the Dijkstra calculationObtaining a second routing path flow table of the service flow in the low-priority flow cache queue, and sending the second routing path flow table to a corresponding terminal switch, wherein the second link cost function is as follows:
Figure FDA0003566941380000034
wherein ,CijRepresents the maximum available bandwidth, U, on the link (i, j)ijIndicating the bandwidth that has been used.
9. A network load balancing routing device for QoS priority based SDN, the SDN comprising an SDN network controller and at least one end switch communicatively connected to the SDN network controller, the device comprising:
a buffer queue maintenance module, configured to set, by the SDN network controller, at least two flow buffer queues in the at least one terminal switch, where the at least two flow buffer queues at least include a high-priority flow buffer queue and a low-priority flow buffer queue, and a second QoS priority of a service flow in the high-priority flow buffer queue is higher than a second QoS priority of a service flow in the low-priority flow buffer queue;
a first-level priority classification module, configured to determine, by the SDN network controller, a first-level QoS priority of a service flow according to a service type of the service flow received by the at least one terminal switch, and allocate the service flow to one of the at least two corresponding flow cache queues according to the first-level QoS priority;
a fine-grained second-level priority ordering module, configured to allocate, by the SDN network controller, a second-level QoS priority to the traffic flow allocated to one of the at least two flow cache queues according to the obtained real-time traffic flow state of the SDN, where the second-level QoS priority is used to indicate a scheduling order of the traffic flow in the one of the at least two flow cache queues; and
a scheduling sequence control module, configured to indicate, by the SDN network controller, a scheduling sequence of the service flows in the at least one terminal switch according to a level of a second-level QoS priority of each service flow in one of the at least two flow cache queues, respectively.
10. A QoS priority based network load balancing routing device of an SDN comprising a receiver, a transmitter, a memory and a processor, the memory storing a computer program, wherein the processor when executing the computer program implements the steps of the method of any of claims 1 to 8.
CN202210310244.4A 2022-03-28 2022-03-28 Network load balancing routing method, device and equipment based on SDN of QoS priority Active CN114745343B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210310244.4A CN114745343B (en) 2022-03-28 2022-03-28 Network load balancing routing method, device and equipment based on SDN of QoS priority

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210310244.4A CN114745343B (en) 2022-03-28 2022-03-28 Network load balancing routing method, device and equipment based on SDN of QoS priority

Publications (2)

Publication Number Publication Date
CN114745343A true CN114745343A (en) 2022-07-12
CN114745343B CN114745343B (en) 2023-08-11

Family

ID=82276982

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210310244.4A Active CN114745343B (en) 2022-03-28 2022-03-28 Network load balancing routing method, device and equipment based on SDN of QoS priority

Country Status (1)

Country Link
CN (1) CN114745343B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150358236A1 (en) * 2014-06-05 2015-12-10 KEMP Technologies Inc. Adaptive load balancer and methods for intelligent data traffic steering
US20160164787A1 (en) * 2014-06-05 2016-06-09 KEMP Technologies Inc. Methods for intelligent data traffic steering
CN107896192A (en) * 2017-11-20 2018-04-10 电子科技大学 The QoS control method of differentiated service priority in a kind of SDN
CN110417656A (en) * 2019-08-07 2019-11-05 广东电网有限责任公司 A kind of QoS guarantee system and method based on SDN network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150358236A1 (en) * 2014-06-05 2015-12-10 KEMP Technologies Inc. Adaptive load balancer and methods for intelligent data traffic steering
US20160164787A1 (en) * 2014-06-05 2016-06-09 KEMP Technologies Inc. Methods for intelligent data traffic steering
CN107896192A (en) * 2017-11-20 2018-04-10 电子科技大学 The QoS control method of differentiated service priority in a kind of SDN
CN110417656A (en) * 2019-08-07 2019-11-05 广东电网有限责任公司 A kind of QoS guarantee system and method based on SDN network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
张莉敏;田小路;杨廷来;: "基于多队列切换的SDN拥塞控制", 软件, no. 03 *

Also Published As

Publication number Publication date
CN114745343B (en) 2023-08-11

Similar Documents

Publication Publication Date Title
Deng et al. An application-aware QoS routing algorithm for SDN-based IoT networking
JP2013168934A (en) Load-balancing device and load-balancing method
JP2002543669A (en) Route setting device
US9806987B2 (en) Method and apparatus for reducing response time in information-centric networks
Buyakar et al. Resource allocation with admission control for GBR and delay QoS in 5G network slices
CN113518039B (en) Deep reinforcement learning-based resource optimization method and system under SDN architecture
Liu Intelligent routing based on deep reinforcement learning in software-defined data-center networks
US20140119177A1 (en) Method and system for selectively metering network traffic
US20150100694A1 (en) Use of iterative learning for resolving scalability issues of bandwidth broker
CN109274589B (en) Service transmission method and device
Abdollahi et al. Flow-aware forwarding in SDN datacenters using a knapsack-PSO-based solution
Cai et al. Optimal cloud network control with strict latency constraints
JP7067170B2 (en) Route control system, route control method, and program
Craveirinha et al. A meta-model for multiobjective routing in MPLS networks
Isravel et al. Centrality based congestion detection using reinforcement learning approach for traffic engineering in hybrid SDN
EP3318011B1 (en) Modifying quality of service treatment for data flows
EP3881494B1 (en) Technique for selecting a transport configuration for a data network
Kamboj et al. A policy based framework for quality of service management in software defined networks
CN114745343B (en) Network load balancing routing method, device and equipment based on SDN of QoS priority
CN112615798B (en) Bandwidth allocation method and device based on elephant flow reservation
Chooprateep et al. Video path selection for traffic engineering in SDN
WO2004093394A1 (en) Data relaying device, data relaying method, data relaying program, service selecting device, service selecting method, and service selecting program
Araujo et al. Qos in forwarding strategies for icn: New algorithm and experimental evaluation
Maity et al. Resq: Reinforcement learning-based queue allocation in software-defined queuing framework
Schmidt et al. Scalable bandwidth optimization in advance reservation networks

Legal Events

Date Code Title Description
PB01 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