CN114520791B - Industrial control network flow scheduling method based on differentiated QoS requirements - Google Patents

Industrial control network flow scheduling method based on differentiated QoS requirements Download PDF

Info

Publication number
CN114520791B
CN114520791B CN202210106033.9A CN202210106033A CN114520791B CN 114520791 B CN114520791 B CN 114520791B CN 202210106033 A CN202210106033 A CN 202210106033A CN 114520791 B CN114520791 B CN 114520791B
Authority
CN
China
Prior art keywords
industrial control
control network
bandwidth
new
reserved
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210106033.9A
Other languages
Chinese (zh)
Other versions
CN114520791A (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.)
Jiangsu University
Original Assignee
Jiangsu University
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 Jiangsu University filed Critical Jiangsu University
Priority to CN202210106033.9A priority Critical patent/CN114520791B/en
Publication of CN114520791A publication Critical patent/CN114520791A/en
Application granted granted Critical
Publication of CN114520791B publication Critical patent/CN114520791B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/83—Admission control; Resource allocation based on usage prediction
    • 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
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/52—Queue scheduling by attributing bandwidth to queues
    • H04L47/522—Dynamic queue service slot or variable bandwidth allocation
    • 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/72—Admission control; Resource allocation using reservation actions during connection setup
    • 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
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]

Landscapes

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

Abstract

The invention provides an industrial control network flow scheduling method based on differential QoS requirements, which uses an optimal differential QoS parameter extraction method to extract optimal differential QoS parameters of industrial control network flow in a QoS requirement fluctuation interval of the industrial control network flow and an interception interval determined by a QoS resource fluctuation interval of the industrial control network, uses a dynamic bandwidth reservation method to calculate a link reserved bandwidth in the industrial control network, and uses a particle swarm algorithm as a basis to construct the optimal differential QoS parameters and a link reserved bandwidth construction fitness function in the industrial control network so as to search an optimal path. The invention has the advantages of real time, high efficiency and accuracy.

Description

Industrial control network flow scheduling method based on differentiated QoS requirements
Technical Field
The invention belongs to the technical field of industrial control network flow scheduling in an industrial control system, and particularly relates to an industrial control network flow scheduling method based on differentiated QoS requirements.
Background
With the growing maturity of internet technology and the proposal of "industry 4.0", the internet and industry production are being tightly fused. Industrial control systems are an important component in industrial production, wherein industrial control network flow is an important factor for feeding back the operation state of the industrial control system. The reasonable dispatching of the industrial control network flow can make full use of the resources of the industrial control system and also can predict abnormal flow to ensure network safety, so the industrial control network flow dispatching is an important research direction in the industrial control system.
At present, as the scale of an industrial control system is continuously increased, the variety of industrial control network traffic becomes complicated, the differential trend is presented to QoS parameters, and the traditional traffic scheduling method is mostly based on the principle of first come first schedule, so that adverse effects of reduced scheduling efficiency, reduced instantaneity, increased cost and the like appear.
With the gradual application of the group intelligent algorithm and the deep learning method in the technical field of flow scheduling, the adverse effects of reduced scheduling efficiency, reduced instantaneity and the like are solved, and the optimal path scheduling can be realized by intelligently searching an optimal solution method, but the problems of reduced throughput, network congestion, increased time delay and reduced scheduling accuracy are caused.
Disclosure of Invention
Aiming at the problems, the invention provides an industrial control network flow scheduling method based on differentiated QoS requirements, and the invention combines the characteristic of the differentiated QoS requirements of the industrial control network flow and the reserved bandwidth condition of the industrial control network, so that the fitness function is constructed more accurately during flow scheduling, the efficiency of searching the optimal path is improved, the efficiency is matched more, and the method has the advantages of real time, high efficiency and accuracy.
In order to achieve the above purpose, the specific technical scheme of the invention is as follows:
an industrial control network flow scheduling method based on differentiated QoS requirements comprises the following steps:
Step S1, collecting industrial control network flow: the industrial control system collects all industrial control network flows and regards the industrial control network flows as a flow set F t_list＝{F1,F2,F3…Fk, wherein F 1 is the 1 st flow, F 2 is the 2 nd flow, F 3 is the 3 rd flow, and F k is the k th flow;
S2, analyzing the mapping relation between the industrial control network flow and the QoS parameter;
step S3, acquiring an interception interval: by comparing intervals Sum interval/>Acquiring a cut-out section, and recording the cut-out section as [ W -,W+ ];
Step S4, extracting optimal differentiated QoS parameters: extracting the optimal differentiated QoS parameters of each flow on the intercepting interval [ W -,W+ ] by using an optimal differentiated QoS parameter extraction method;
Step S5, calculating the reserved bandwidth of a link in the industrial control network: calculating the reserved bandwidth of a link in the industrial control network by using a dynamic bandwidth reservation method;
s6, constructing an adaptability function to obtain an optimal path: taking the industrial control network flow as particles based on a particle swarm algorithm, constructing an adaptability function according to the optimal differentiated QoS parameters of the industrial control network flow and the link reserved bandwidth by taking the industrial control network flow as particles, updating the particle position and the particle speed according to the adaptability function, setting the particle position and the particle speed as ending judgment conditions of iterative updating, outputting an optimal solution, namely an optimal path if the judgment conditions are met, and otherwise, continuously executing the calculation of the adaptability function.
In the above scheme, in the step S3, an intervalSum interval/>Expressed as:
Wherein, QoS requirement fluctuation interval of industrial control network flow and QoS resource fluctuation interval of industrial control network are respectively defined, and Q is is the s-th QoS parameter of the i-th flow,/>Average value of the s-th QoS requirement representing the i-th industrial control network flow,/>Representing the variance of the s-th QoS requirement of the i-th industrial control network flow; q is refers to the ith QoS resource of the ith industrial control network traffic mapping industrial control network,/>Represents the average value of the ith QoS resource of the ith industrial control network flow mapping industrial control network,/>Representing the variance of the ith industrial control network flow mapping industrial control network (IPS) s QoS resource, and n refers to the sum of QoS parameters required by the current flow.
In the above scheme, in the step S3, the process of obtaining the interception section is:
Comparing the inclination degrees of the two sections, if the two sections are separated, the interception section cannot be determined, and the sections need to be put into a waiting queue; if the two sections overlap, the following occurs:
If it is Comprises/>Select/>As an interception section; if/>Comprises/>Select/>As an interception section; if/>Left inclusion/>Use/>As an interception section; if it isRight inclusion/>Use/>As the interception section, the interception section is recorded as [ W -,W+ ].
In the above scheme, in the step S4, the process of extracting the optimal differentiated QoS parameter for the industrial control network traffic based on the interception interval [ W -,W+ ] is as follows:
s4.1, selecting a forward solution X in an interception interval [ W -,W+ ] and comparing the forward solution X with an initial optimal solution S of an industrial control network;
step S4.2, if X is equal to S, X is the optimal QoS solution;
Step S4.3, if X is not equal to S, calculating the midpoint of the interception section [ W -,W+ ] and the reverse number of the forward solution Comparison/>Selecting a section with the shortest distance from X to S as a new interception section, and iterating the process until X,/>, wherein new end points of the section are the midpoints M and W ′- or W ′+ Coinciding with S, X is the optimal QoS solution;
Further, the calculation formulas of the reverse number of the forward solution and the new endpoint are respectively as follows:
M＝(W-+W+)/2
in the above scheme, in step S5, the calculating the link reserved bandwidth in the industrial control network by using the dynamic bandwidth reservation method specifically includes:
if the sum h= Σs h (l) of the reserved maximum bandwidth s h (l) of the existing links in the industrial control network is not smaller than the reserved bandwidth T of the whole industrial control network when the new industrial control network traffic is scheduled, the reserved maximum link bandwidth demand d=s h (l).
In the above scheme, if the sum h= Σs h (l) of the reserved maximum bandwidth s h (l) of the existing link in the industrial control network is greater than the reserved bandwidth T of the whole industrial control network when the new industrial control network traffic is scheduled, the following two cases are divided:
If the total bandwidth D ext＝∑dmin (l) calculated by the reserved bandwidth links according to the minimum bandwidth value D min (l) of the links is not greater than the reserved bandwidth T of the whole industrial control network, reserving bandwidth resources for the new links according to the bandwidth reservation mode under the condition that the minimum bandwidth value D min (l) of all reserved bandwidth links is met, wherein the reservation mode is as follows:
Bfree＝T-Dext
Dext＝∑dmin(l)
H＝∑sh(l)
Wherein, B free represents the reserved bandwidth of the whole industrial control network minus the residual bandwidth obtained by subtracting the sum of the reserved bandwidth links according to the minimum bandwidth value of the links; d new (l) is the number of reserved bandwidths for the new link;
if the total bandwidth D ext＝∑dmin (L) calculated by the reserved bandwidth link according to the minimum bandwidth value D min (L) of the link is greater than the reserved bandwidth T of the whole industrial control network, and the sum l= Σs F (L) of the bandwidths s F (L) required by the industrial control network traffic on the current reserved bandwidth link is not greater than the reserved bandwidth T of the whole industrial control network, taking the sum l= Σs F (L) of the bandwidths required by the industrial control network traffic on the reserved bandwidth link as the sum of the minimum bandwidths of the link, reserving bandwidth resources for the new link according to the bandwidth reservation mode, wherein the reservation mode is as follows:
Bfree＝T-L
Dext＝∑dmin(l)
H＝∑sh(l)
Wherein B free represents the residual bandwidth obtained by subtracting the sum of the bandwidths required by the industrial control network traffic on the reserved bandwidth link from the reserved bandwidth of the whole industrial control network, and d new (l) is the reserved bandwidth number of the new link.
In the above scheme, in the step S6, the velocity, position and fitness functions of the particles are respectively expressed as follows:
new_v＝wv+c1r1(pbest-x)+c2r2(gbest-x)
New_v represents the latest speed of the particle, v represents the current speed of the particle, r 1 and r 2 represent random numbers (0-1), pbest represents the historically best position of the particle, gbest represents the current best position of all particles in the population, x represents the current position of the particle
Setting, wherein c 1 and c 2 represent learning factors, and respectively learning the historic best position of the particle and the current best position in the population;
new_x＝x+new_v
Wherein new_x represents the latest position of the particle, x represents the current position of the particle, new_v represents the latest speed of the particle
fi＝FnCis+lnd
Wherein C is represents an optimal differentiated QoS parameter of the industrial control network traffic, d represents a reserved bandwidth of the link, and f i represents an fitness value of the ith particle.
Compared with the prior art, the invention has the beneficial effects that: the invention combines the characteristic of the differential QoS requirement of the industrial control network flow and the condition of the reserved bandwidth of the industrial control network, so that the construction of the fitness function is more accurate during flow scheduling, the efficiency of searching the optimal path is improved, the matching is more improved, and the invention has the advantages of real time, high efficiency and accuracy.
Drawings
Fig. 1 is a flowchart of an industrial control network traffic scheduling method based on differentiated QoS requirements according to an embodiment of the present invention.
Detailed Description
Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are illustrative and intended to explain the present invention and should not be construed as limiting the invention.
The industrial control network flow scheduling method based on differentiated QoS requirements shown in fig. 1 comprises the following steps:
Step S1, collecting industrial control network flow: the industrial control system collects all industrial control network flows and regards the industrial control network flows as a flow set F t_list＝{F1,F2,F3…Fk, wherein F 1 is the 1 st flow, F 2 is the 2 nd flow, F 3 is the 3 rd flow, and F k is the k th flow;
s2, analyzing the mapping relation between the industrial control network flow and the QoS parameter through a C4.5 algorithm;
step S3, acquiring an interception interval: by comparing intervals Sum interval/>Acquiring a cut-out section, and recording the cut-out section as [ W -,W+ ];
Step S4, extracting optimal differentiated QoS parameters for industrial control network flow based on the interception interval: extracting the optimal differentiated QoS parameters of each flow on the intercepting interval [ W -,W+ ] by using an optimal differentiated QoS parameter extraction method;
Step S5, calculating the reserved bandwidth of a link in the industrial control network: calculating the reserved bandwidth of a link in the industrial control network by using a dynamic bandwidth reservation method;
s6, constructing an adaptability function to obtain an optimal path: taking the industrial control network flow as particles based on a particle swarm algorithm, constructing an adaptability function according to the optimal differentiated QoS parameters of the industrial control network flow and the link reserved bandwidth by taking the industrial control network flow as particles, updating the particle position and the particle speed according to the adaptability function, setting the particle position and the particle speed as ending judgment conditions of iterative updating, outputting an optimal solution, namely an optimal path if the judgment conditions are met, and otherwise, continuously executing the calculation of the adaptability function.
In the step S3, an intervalSum interval/>Expressed as:
Wherein, QoS requirement fluctuation interval of industrial control network flow and QoS resource fluctuation interval of industrial control network are respectively defined, and Q is is the s-th QoS parameter of the i-th flow,/>Average value of the s-th QoS requirement representing the i-th industrial control network flow,/>Representing the variance of the s-th QoS requirement of the i-th industrial control network flow; q is refers to the ith QoS resource of the ith industrial control network traffic mapping industrial control network,/>Represents the average value of the ith QoS resource of the ith industrial control network flow mapping industrial control network,/>Representing the variance of the ith industrial control network flow mapping industrial control network (IPS) s QoS resource, and n refers to the sum of QoS parameters required by the current flow.
In the step S3, the process of obtaining the interception section is as follows:
comparing the inclination degrees of the two sections, if the two sections are separated, the interception section cannot be determined, and the sections need to be put into a waiting queue; if the two sections overlap, the following four cases occur:
If it is Comprises/>Select/>As an interception section; if/>Comprises/>Select/>As an interception section; if/>Left inclusion/>Use/>As an interception section; if it isRight inclusion/>Use/>As the interception section, the interception section is recorded as [ W -,W+ ].
In the step S4, the process of extracting the optimal differentiated QoS parameter for the industrial control network traffic based on the interception interval [ W -,W+ ] is as follows:
s4.1, selecting a forward solution X in an interception interval [ W -,W+ ] and comparing the forward solution X with an initial optimal solution S of an industrial control network;
step S4.2, if X is equal to S, X is the optimal QoS solution;
Step S4.3, if X is not equal to S, calculating the midpoint of the interception section [ W -,W+ ] and the reverse number of the forward solution Comparison/>Selecting a section with the shortest distance from X to S as a new interception section, and iterating the process until X,/>, wherein new end points of the section are the midpoints M and W ′- or W ′+ Coinciding with S, X is the optimal QoS solution;
the calculation formulas of the reverse number of the forward solution and the new endpoint are respectively as follows:
M＝(W-+W+)/2
in the step S5, the calculating the bandwidth capable of being reserved by the link in the industrial control network by using the dynamic bandwidth reservation method specifically includes:
if the sum h= Σs h (l) of the reserved maximum bandwidth s h (l) of the existing links in the industrial control network is not smaller than the reserved bandwidth T of the whole industrial control network when the new industrial control network traffic is scheduled, the reserved maximum link bandwidth demand d=s h (l).
If the sum h= Σs h (l) of the reserved maximum bandwidth s h (l) of the existing link in the industrial control network is larger than the reserved bandwidth T of the whole industrial control network when the new industrial control network traffic is scheduled, the following two cases are classified:
If the total bandwidth D ext＝∑dmin (l) calculated by the reserved bandwidth link according to the minimum bandwidth value D min (l) of the link is not greater than the reserved bandwidth T of the whole industrial control network, the bandwidth resource reservation state of the whole industrial control network is not affected when the new industrial control network traffic is scheduled, and the bandwidth resource is reserved for the new link according to the bandwidth reservation mode under the condition that the minimum bandwidth value D min (l) of all reserved bandwidth links is met, wherein the reservation mode is as follows:
Bfree＝T-Dext
Dext＝∑dmin(l)
H＝∑sh(l)
Wherein, B free represents the reserved bandwidth of the whole industrial control network minus the residual bandwidth obtained by subtracting the sum of the reserved bandwidth links according to the minimum bandwidth value of the links; d new (l) is the number of reserved bandwidths for the new link;
If the total bandwidth D ext＝∑dmin (l) calculated by the reserved bandwidth link according to the minimum bandwidth value D min (l) of the link is larger than the reserved bandwidth T of the whole industrial control network, the reserved bandwidth D ext＝∑dmin (l) can cause the reserved bandwidth link to change according to the minimum bandwidth value of the link when the new industrial control network flow is scheduled. And the sum l= Σs F (L) of the bandwidths s F (L) required by the industrial control network traffic on the current reserved bandwidth links is not greater than the reserved bandwidth T of the whole industrial control network, the sum l= Σs F (L) of the bandwidths required by the industrial control network traffic on the reserved bandwidth links is taken as the sum of the minimum bandwidths of the links, bandwidth resources are reserved for the new links according to the bandwidth reservation mode, otherwise, any bandwidth cannot be reserved, scheduling cannot be performed, and the reservation mode is as follows:
Bfree＝T-L
Dext＝∑dmin(l)
H＝∑sh(l)
Wherein B free represents the residual bandwidth obtained by subtracting the sum of the bandwidths required by the industrial control network traffic on the reserved bandwidth link from the reserved bandwidth of the whole industrial control network, and d new (l) is the reserved bandwidth number of the new link.
In the step S6, the speed, position and fitness value of the particle are calculated, the optimal solution is updated according to the fitness value, when the maximum iteration number is reached, the algorithm is ended, the optimal particle position is obtained, and the optimal scheduling scheme is obtained, otherwise, the fitness value of the particle is recalculated, and the speed, position and fitness function of the particle are respectively represented as follows:
new_v＝wv+c1r1(pbest-x)+c2r2(gbest-x)
new_v denotes the latest speed of the particle, v denotes the current speed of the particle, r 1 and r 2 denote random numbers (0-1), pbest denotes the historic best position of the particle, gbest denotes the current best position of all particles in the population, x denotes the current position of the particle, c 1 and c 2 denote learning factors, respectively, to learn the historic best position of the particle and the current best position in the population; new_x=x+new_v
New_x represents the latest position of the particle, x represents the current position of the particle, new_v represents the latest speed of the particle
fi＝FnCis+lnd
Wherein C is represents an optimal differentiated QoS parameter of the industrial control network traffic, d represents a reserved bandwidth of the link, and f i represents an fitness value of the ith particle.
The invention uses the optimal differential QoS parameter extraction method to extract the optimal differential QoS parameter of the industrial control network flow in the QoS demand fluctuation interval of the industrial control network flow and the interception interval determined by the QoS resource fluctuation interval of the industrial control network, uses the dynamic bandwidth reservation method to calculate the reserved bandwidth of the link in the industrial control network, and combines the optimal differential QoS parameter and the reserved bandwidth of the link in the industrial control network to construct the adaptability function, thereby searching the optimal path. The method has the advantages of real time, high efficiency and accuracy, and simultaneously avoids the defects of no real time, high labor cost and the like of the traditional scheduling method.
Specific examples:
An industrial control network flow scheduling method based on differentiated QoS requirements comprises the following steps:
Step S1, acquiring industrial control network flow F 1,F2,F3 through an industrial control system and regarding the industrial control network flow as a flow set F t_list＝{F1,F2,F3;
S2, analyzing the mapping relation between the industrial control network flow and QoS parameters through a C4.5 algorithm, such as F 1～Q1、Q2、F2～Q1、Q2、Q3、F3～Q1, wherein Q 1 represents bandwidth requirement, Q 2 represents time delay requirement and Q 3 represents packet loss rate requirement;
Step S3, comparing the intervals of F 1,F2,F3 Sum interval/>The inclination of (2) is used for acquiring an interception section, and the calculation mode is as follows:
Wherein, QoS requirement fluctuation interval of industrial control network flow and QoS resource fluctuation interval of industrial control network are respectively defined, and Q is is the s-th QoS parameter of the i-th flow,/>Average value of the s-th QoS requirement representing the i-th industrial control network flow,/>Representing the variance of the s-th QoS requirement of the i-th industrial control network flow; q is refers to the ith QoS resource of the ith industrial control network traffic mapping industrial control network,/>Represents the average value of the ith QoS resource of the ith industrial control network flow mapping industrial control network,/>Representing the variance of the ith industrial control network flow mapping industrial control network (IPS) s QoS resource, and n refers to the sum of QoS parameters required by the current flow.
The process of obtaining the interception interval is as follows:
comparing the inclination degrees of the two sections, if the two sections are separated, the interception section cannot be determined, and the sections need to be put into a waiting queue; if the two sections overlap, four situations occur:
If it is Comprises/>Select/>As an interception section; if/>Comprises/>Select/>As an interception section; if/>Left inclusion/>Use/>As an interception section; if it isRight inclusion/>Use/>As the interception section, the interception section is recorded as [ W -,W+ ].
In the step S4, based on the interception interval [ W -,W+ ], the process of extracting the optimal differentiated QoS parameter from the industrial control network flow F 1,F2,F3 is as follows:
s4.1, selecting a forward solution X in an interception interval [ W -,W+ ] and comparing the forward solution X with an initial optimal solution S of an industrial control network;
step S4.2, if X is equal to S, X is the optimal QoS solution;
Step S4.3, if X is not equal to S, calculating the midpoint of the interception section [ W -,W+ ] and the reverse number of the forward solution Comparison/>Selecting a section with the shortest distance from X to S as a new interception section, and iterating the process until X,/>, wherein new end points of the section are the midpoints M and W ′- or W ′+ Coinciding with S, X is the optimal QoS solution;
The calculation formulas for calculating the reverse number of the forward solution and obtaining the new endpoint are respectively as follows:
M＝(W-+W+)/2
finally, an optimal differentiated QoS parameter matrix C is formed
Wherein the rows represent the optimal QoS parameters for each flow, and the columns represent the number of flows.
Step S5 calculates the reserved bandwidth of the link in the industrial control network according to the bandwidth requirement of the industrial control network flow F 1,F2,F3, and the dynamic bandwidth reservation method comprises the following steps:
Step S5.1, if F 1,F2,F3 is scheduled, the reserved bandwidth T of the whole industrial control network is 20M, 10M is reserved for the l 1、l2 link, the highest bandwidth requirement h= Σs h (l) of the traffic on l 1、l2 is 10M, when F 1,F2,F3 traffic needs to be scheduled, bandwidth needs to be reserved for the corresponding link, and 8M needs to be reserved, and then direct reservation is performed;
In step S5.2, if F 1,F2,F3 is scheduled, the reserved bandwidth T of the whole industrial control network is 20M, 30M is reserved for the l 1、l2 link, the highest bandwidth requirement h= Σs h (l) of the traffic on l 1、l2 is 30M, when F 1,F2,F3 traffic needs to be scheduled, bandwidth needs to be reserved for the corresponding link, 8M needs to be reserved, and bandwidth is not enough to be allocated, and the following two cases are treated:
Step S5.2.1, the reserved bandwidths of the links with reserved bandwidths can be floated, the bandwidths D min (l) of the links are compressed to the minimum, the sum D ext＝∑dmin (l) obtained by adding up the reserved bandwidths is not more than the reserved bandwidth of the whole industrial control network, the reserved bandwidth of the whole industrial control network subtracts the obtained sum, and then the reserved bandwidth is reserved for a new link, for example, the sum D min (l) of the minimum bandwidth of l 1、l2 is 10M, the reserved bandwidth T of the whole industrial control network is 20M, and the reserved bandwidth of the new link is 8M, and the reserved mode is as follows:
Bfree＝T-Dext
Dext＝∑dmin(l)
H＝∑sh(l)
Wherein, B free represents the reserved bandwidth of the whole industrial control network minus the residual bandwidth obtained by subtracting the sum of the reserved bandwidth links according to the minimum bandwidth value of the links; d new (l) is the number of reserved bandwidths for the new link;
Step S5.2.2, compressing the bandwidth D min (l) of the links to the minimum, and adding up the sum D ext＝∑dmin (l) of the bandwidths D min (l) to be greater than the reserved bandwidth T of the whole industrial control network, for example, the sum of the minimum bandwidths l 1、l2 is 25M, and the reserved bandwidth of the whole industrial control network is 20M, which indicates that when the new industrial control network traffic is scheduled, the reserved bandwidth link changes according to the minimum bandwidth value of the links. If the sum of bandwidths required by the industrial control network traffic on the current reserved bandwidth links, l= Σs F (L), is not greater than the reserved bandwidth T of the whole industrial control network, the sum of bandwidths required by the industrial control network traffic on the reserved bandwidth links, l= Σs F (L), is taken as the sum of minimum bandwidths of the links, and bandwidth resources are reserved for the new links according to a bandwidth reservation mode. Otherwise, any bandwidth cannot be reserved, scheduling cannot be performed, and the bandwidth reservation mode is as follows:
Bfree＝T-L
Dext＝∑dmin(l)
H＝∑sh(l)
Wherein B free represents the residual bandwidth obtained by subtracting the sum of the bandwidths required by the industrial control network traffic on the reserved bandwidth link from the reserved bandwidth of the whole industrial control network, and d new (l) is the reserved bandwidth number of the new link.
In the step S6, the speed, position and fitness value of the particle are calculated, the optimal solution is updated according to the fitness value, when the maximum iteration number is reached, the algorithm is ended, the optimal particle position is obtained, and the optimal scheduling scheme is obtained, otherwise, the fitness value of the particle is recalculated, and the speed, position and fitness function of the particle are respectively represented as follows:
new_v＝wv+c1r1(pbest-x)+c2r2(gbest-x)
new_v denotes the latest speed of the particle, v denotes the current speed of the particle, r 1 and r 2 denote random numbers (0-1), pbest denotes the historic best position of the particle, gbest denotes the current best position of all particles in the population, x denotes the current position of the particle, c 1 and c 2 denote learning factors, respectively, to learn the historic best position of the particle and the current best position in the population;
new_x＝x+new_v
Wherein new_x represents the latest position of the particle, x represents the current position of the particle, new_v represents the latest speed of the particle
fi＝FnCis+lnd
Wherein C is represents an optimal differentiated QoS parameter of the industrial control network traffic, d represents a reserved bandwidth of the link, and f i represents an fitness value of the ith particle.
The above list of detailed descriptions is only specific to practical embodiments of the present invention, and they are not intended to limit the scope of the present invention, and all equivalent embodiments or modifications that do not depart from the spirit of the present invention should be included in the scope of the present invention.

Claims (1)

1. An industrial control network flow scheduling method based on differentiated QoS requirements is characterized by comprising the following steps:
Step S1, collecting industrial control network flow: the industrial control system collects all industrial control network flows and regards the industrial control network flows as a flow set F t_list＝{F1,F2,F3…Fk, wherein F 1 is the 1 st flow, F 2 is the 2 nd flow, F 3 is the 3 rd flow, and F k is the k th flow;
S2, analyzing the mapping relation between the industrial control network flow and the QoS parameter;
step S3, acquiring an interception interval: by comparing intervals Sum interval/>Acquiring a cut-out section, and recording the cut-out section as [ W -,W+ ];
Step S4, extracting optimal differentiated QoS parameters: extracting the optimal differentiated QoS parameters of each flow on the intercepting interval [ W -,W+ ] by using an optimal differentiated QoS parameter extraction method;
Step S5, calculating the reserved bandwidth of a link in the industrial control network: calculating the reserved bandwidth of a link in the industrial control network by using a dynamic bandwidth reservation method;
s6, constructing an adaptability function to obtain an optimal path: taking the industrial control network flow as particles based on a particle swarm algorithm, constructing an adaptability function according to the optimal differentiated QoS parameters of the industrial control network flow and the link reserved bandwidth, updating the particle position and the speed according to the adaptability function, setting the particle position and the speed as ending judgment conditions of iterative updating, outputting an optimal solution, namely an optimal path if the judgment conditions are met, and otherwise, continuously executing the adaptability function calculation;
In the step S3, an interval Sum interval/>Expressed as:
Wherein, QoS requirement fluctuation interval of industrial control network flow and QoS resource fluctuation interval of industrial control network are respectively defined, and Q is is the s-th QoS parameter of the i-th flow,/>Average value of the s-th QoS requirement representing the i-th industrial control network flow,/>Representing the variance of the s-th QoS requirement of the i-th industrial control network flow; q is refers to the ith QoS resource of the ith industrial control network traffic mapping industrial control network,/>Represents the average value of the ith QoS resource of the ith industrial control network flow mapping industrial control network,/>Representing the variance of the ith QoS resource of the ith industrial control network flow mapping industrial control network, wherein n refers to the sum of QoS parameters required by the current flow;
in the step S3, the process of obtaining the interception section is as follows:
Comparing the inclination degrees of the two sections, if the two sections are separated, the interception section cannot be determined, and the sections need to be put into a waiting queue; if the two sections overlap, the following occurs:
If it is Comprises/>Select/>As an interception section; if/>Comprises/>SelectingAs an interception section; if/>Left inclusion/>Use/>As an interception section; if it isRight inclusion/>Use/>As an interception section, recording the interception section as [ W -,W+ ];
In the step S4, the process of extracting the optimal differentiated QoS parameter for the industrial control network traffic based on the interception interval [ W -,W+ ] is as follows:
s4.1, selecting a forward solution X in an interception interval [ W -,W+ ] and comparing the forward solution X with an initial optimal solution S of an industrial control network;
step S4.2, if X is equal to S, X is the optimal QoS solution;
Step S4.3, if X is not equal to S, calculating the midpoint of the interception section [ W -,W+ ] and the reverse number of the forward solution Comparison/>Selecting a section with the shortest distance from X to S as a new interception section, and iterating the process until X and/or > are reached, wherein new end points of the section are the midpoints M and W '- or W' + Coinciding with S, X is the optimal QoS solution;
the calculation formulas of the reverse number of the forward solution and the new endpoint are respectively as follows:
M＝(W-+W+)/2
step S5 is to use a dynamic bandwidth reservation method to calculate the reserved bandwidth of the link in the industrial control network:
If the sum H of the reserved maximum bandwidth s h (l) of the existing links in the industrial control network is not less than the reserved bandwidth T of the whole industrial control network when the flow of the new industrial control network is scheduled, the reserved maximum link bandwidth requirement d=s h (l);
if the sum h= Σs h (l) of the reserved maximum bandwidth s h (l) of the existing link in the industrial control network is larger than the reserved bandwidth T of the whole industrial control network when the new industrial control network traffic is scheduled, the following two cases are classified:
If the total bandwidth D ext＝∑dmin (l) calculated by the reserved bandwidth links according to the minimum bandwidth value D min (l) of the links is not greater than the reserved bandwidth T of the whole industrial control network, reserving bandwidth resources for the new links according to the bandwidth reservation mode under the condition that the minimum bandwidth value D min (l) of all reserved bandwidth links is met, wherein the reservation mode is as follows:
Bfree＝T-Dext
Dext＝∑dmin(l)
H＝∑sh(l)
Wherein, B free represents the reserved bandwidth of the whole industrial control network minus the residual bandwidth obtained by subtracting the sum of the reserved bandwidth links according to the minimum bandwidth value of the links; d new (l) is the number of reserved bandwidths for the new link;
If the total bandwidth D ext＝Σdmin (L) calculated by the reserved bandwidth link according to the minimum bandwidth value D min (L) of the link is greater than the reserved bandwidth T of the whole industrial control network, and the sum l=Σs F (L) of the bandwidths s F (L) required by the industrial control network traffic on the current reserved bandwidth link is not greater than the reserved bandwidth T of the whole industrial control network, taking the sum l=Σs F (L) of the bandwidths required by the industrial control network traffic on the reserved bandwidth link as the sum of the minimum bandwidths of the link, reserving bandwidth resources for the new link according to the bandwidth reservation mode, wherein the reservation mode is as follows:
Bfree＝T-L
Dext＝∑dmin(l)
H＝∑sh(l)
wherein, B free represents the residual bandwidth obtained by subtracting the sum of the bandwidths required by the industrial control network flow on the reserved bandwidth link from the reserved bandwidth of the whole industrial control network, and d new (l) is the reserved bandwidth number of the new link;
in the step S6, the speed, position and fitness functions of the particles are respectively expressed as follows:
new_v＝wv+c1r1(pbest-x)+c2r2(gbest-x)
new_v denotes the latest speed of the particle, v denotes the current speed of the particle, r 1 and r 2 denote random numbers (0-1), pbest denotes the historic best position of the particle, gbest denotes the current best position of all particles in the population, x denotes the current position of the particle, c 1 and c 2 denote learning factors, respectively, to learn the historic best position of the particle and the current best position in the population;
new_x＝x+new_v
Wherein new_x represents the latest position of the particle, x represents the current position of the particle, new_v represents the latest speed of the particle
fi＝FnCis+lnd
Wherein C is represents an optimal differentiated QoS parameter of the industrial control network traffic, d represents a reserved bandwidth of the link, and f i represents an fitness value of the ith particle.
CN202210106033.9A 2022-01-28 2022-01-28 Industrial control network flow scheduling method based on differentiated QoS requirements Active CN114520791B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210106033.9A CN114520791B (en) 2022-01-28 2022-01-28 Industrial control network flow scheduling method based on differentiated QoS requirements

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210106033.9A CN114520791B (en) 2022-01-28 2022-01-28 Industrial control network flow scheduling method based on differentiated QoS requirements

Publications (2)

Publication Number Publication Date
CN114520791A CN114520791A (en) 2022-05-20
CN114520791B true CN114520791B (en) 2024-05-10

Family

ID=81595950

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210106033.9A Active CN114520791B (en) 2022-01-28 2022-01-28 Industrial control network flow scheduling method based on differentiated QoS requirements

Country Status (1)

Country Link
CN (1) CN114520791B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107959633A (en) * 2017-11-18 2018-04-24 浙江工商大学 A kind of load balance method based on price mechanism in industry real-time network
CN108521375A (en) * 2018-04-17 2018-09-11 中国矿业大学 The transmission of the network multi-service flow QoS based on SDN a kind of and dispatching method
CN110891019A (en) * 2019-12-10 2020-03-17 重庆邮电大学 Data center flow scheduling method based on load balancing

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11044208B2 (en) * 2017-11-27 2021-06-22 Hughes Network Systems, Llc System and method for maximizing throughput using prioritized efficient bandwidth sharing

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107959633A (en) * 2017-11-18 2018-04-24 浙江工商大学 A kind of load balance method based on price mechanism in industry real-time network
CN108521375A (en) * 2018-04-17 2018-09-11 中国矿业大学 The transmission of the network multi-service flow QoS based on SDN a kind of and dispatching method
CN110891019A (en) * 2019-12-10 2020-03-17 重庆邮电大学 Data center flow scheduling method based on load balancing

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于北斗RDSS的核辐射监测应急通讯方法;王廷银;林明贵;陈达;吴允平;;计算机系统应用;20191215(第12期);全文 *

Also Published As

Publication number Publication date
CN114520791A (en) 2022-05-20

Similar Documents

Publication Publication Date Title
CN109657844B (en) Electric power short-term load prediction method and device
CN109754597B (en) Urban road regional congestion regulation and control strategy recommendation system and method
CN109657891B (en) Load characteristic analysis method based on self-adaptive k-means + + algorithm
CN106408960A (en) Signal control time period dividing method based on ordered clustering
CN110809275B (en) Micro cloud node placement method based on wireless metropolitan area network
CN112613720B (en) Reservoir irrigation optimal scheduling method considering multiple uncertainties
CN112037539A (en) Method and system for recommending signal control scheme for saturated urban traffic network
CN117236565A (en) Intelligent management method for watershed water environment
CN111476449B (en) Subway station operation time interval division method based on improved k-means clustering algorithm
CN114520791B (en) Industrial control network flow scheduling method based on differentiated QoS requirements
CN115269758A (en) Passenger-guidance-oriented road network passenger flow state deduction method and system
CN116307682A (en) Airport route network instability state comprehensive evaluation method considering multiple indexes
CN108900804B (en) Self-adaptive video stream processing method based on video entropy
CN111145548B (en) Important intersection identification and subregion division method based on data field and node compression
CN115310366A (en) Method for evaluating airport publishing capacity based on random optimization model
CN108830432A (en) Unmanned aerial vehicle group action scheme searching method based on a small amount of priori knowledge
CN109559028A (en) Distribution network planning year reliability estimation method based on gray theory and Distance evaluation
CN111985526B (en) Similar scene clustering-based trailing interval management strategy generation method and system
CN115166866A (en) Citrus disease and insect pest occurrence forecasting method and system based on lattice point meteorological data
CN114897097A (en) Power consumer portrait method, device, equipment and medium
CN111933226B (en) Artificial intelligence material screening method based on hierarchical classification model
CN109214459A (en) A kind of clustering method of geography suitability
CN117762577B (en) Digital product area scheduling method and system based on gridding realization
CN115601663B (en) Information classification method for highway pavement maintenance
CN116774747B (en) Cloud side end cooperation-based intelligent control system and method for controllable agricultural greenhouse environment

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