CN115604193B - Deterministic resource scheduling method and system in hot rolling control system - Google Patents
Deterministic resource scheduling method and system in hot rolling control system Download PDFInfo
- Publication number
- CN115604193B CN115604193B CN202211615989.8A CN202211615989A CN115604193B CN 115604193 B CN115604193 B CN 115604193B CN 202211615989 A CN202211615989 A CN 202211615989A CN 115604193 B CN115604193 B CN 115604193B
- Authority
- CN
- China
- Prior art keywords
- flow
- time
- constraint
- sensitive
- queue
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a deterministic resource scheduling method and a system in a hot rolling control system, which relate to the field of industrial Internet of things resource scheduling, and comprise the following steps: the periodic time sensitive flow is arranged in a descending order according to the size of the resource occupied by the flow; shifting the time slots of the periodic time sensitive flow in the descending flow sequence by taking the maximum throughput as a target and a time slot shift constraint as a constraint condition according to a greedy strategy of gradually decreasing the offset, and mapping the descending flow sequence after the time slot shift to a circulating flow queue to realize the transmission of the periodic time sensitive flow; and mapping the time sensitive flow of the synchronous flow type to a synchronous flow queue by taking the maximum throughput as a target and taking the specific constraint of the wait-free shaper as a constraint condition to realize the transmission of the time sensitive flow of the synchronous flow type. The invention can improve the transmission efficiency and the transmission stability of time sensitive flow in the process of realizing deterministic resource scheduling in the hot rolling control system.
Description
Technical Field
The invention relates to the field of industrial Internet of things resource scheduling, in particular to a deterministic resource scheduling method and system in a hot rolling control system.
Background
In recent years, with the rapid development of the industrial internet of things technology, a large number of intelligent terminal devices based on the internet of things technology are widely popularized in industrial fields, such as various automatic systems and informatization systems applied to a hot rolling process flow line, and the systems play a key role in the integration and innovation development of the steel industry and the industrial internet of things. But the informatization system faces the flow impact of a large amount of industrial field data and the problem of ensuring the real-time performance and stability of key data transmission.
At present, time-Sensitive Networking (TSN) related research work mainly focuses on Time-Sensitive (TT) traffic, and TT traffic is used as a network resource in a hot rolling control system, and it is particularly important to provide network services for determining a delay range for TT traffic. In order to determine the time delay range in the TT flow transmission process, a circulating queuing mechanism based on a double-queue model is provided, and network service for determining the time delay range can be provided for the TT flow, so that deterministic resource scheduling in a hot rolling control system is achieved. However, this mechanism has the following disadvantages:
(1) The cyclic queuing mechanism has a large amount of idle queue resources in the utilization of the double-queue model, and the transmission efficiency is influenced.
(2) The transmission stability of TT traffic of synchronous stream type having strict jitter requirements cannot be guaranteed.
Disclosure of Invention
Based on this, embodiments of the present invention provide a method and a system for scheduling deterministic resources in a hot rolling control system, so as to improve transmission efficiency and transmission stability of time-sensitive traffic in a process of implementing deterministic resource scheduling in a hot rolling control system.
In order to achieve the purpose, the invention provides the following scheme:
a deterministic resource scheduling method in a hot rolling control system comprises the following steps:
acquiring a flow set of a target hot rolling control system; the flow set comprises: periodic time sensitive traffic and synchronous flow type time sensitive traffic;
performing descending order arrangement on the periodic time sensitive traffic according to the size of the resource occupied by the traffic to obtain a descending order traffic sequence;
shifting the time slots of the periodic time sensitive flow in the descending flow sequence according to a greedy strategy of gradually decreasing offset by taking the maximum throughput as a target and taking time slot shift constraint as a constraint condition, and mapping the descending flow sequence after time slot shift to a circulating flow queue to realize the transmission of the periodic time sensitive flow; the slot offset constraints include: frame sending offset constraint, end-to-end delay constraint, acceptance window constraint and queue resource constraint;
mapping the time-sensitive traffic of the synchronous stream type to a synchronous stream queue by taking the maximum throughput as a target and taking the specific constraint of a no-waiting shaper as a constraint condition so as to realize the transmission of the time-sensitive traffic of the synchronous stream type; specific constraints of the wait-free shaper include: an output port time constraint, a zero jitter constraint, and a transmission start time constraint.
Optionally, the flow set further includes: non-time sensitive best effort traffic; the non-time-sensitive best-effort flow is a flow of a target hot rolling control system except the periodic time-sensitive flow and the time-sensitive flow of the synchronous flow type;
after the periodic time-sensitive traffic and the synchronous flow type time-sensitive traffic complete transmission, further comprising: and transmitting the non-time-sensitive best-effort traffic by adopting a transmission rule of a set protocol of a best-effort flow queue.
Optionally, the obtaining of the flow set of the target hot rolling control system specifically includes:
acquiring the initial flow of a target hot rolling control system;
and screening and queue distribution are carried out on the initial flow according to the transmission rule and the flow type of the set protocol, so as to obtain a flow set of the target hot rolling control system.
Optionally, the priority of the synchronous flow queue is greater than the priority of the circular flow queue, and the priority of the circular flow queue is greater than the priority of the best effort flow queue.
Optionally, the frame transmission offset constraint is:
f i ·offset＜f i ·period/LenOfSlot；
wherein, the first and the second end of the pipe are connected with each other,f i is the first of periodic time-sensitive trafficiA data stream;f i ·offsetis the first of periodic time-sensitive trafficiAn offset of each data stream;f i ·periodis the first of periodic time-sensitive trafficiA period of data streams;LenOfSlotis the time slot length;
the end-to-end delay constraint is:
f i ·offset×LenOfSlot+（f i ·hop+1）×LenOfSlot＜f i ·deadline；
wherein the content of the first and second substances,f i ·hopis the first of periodic time-sensitive trafficiThe number of hops traversed by the data stream;f i ·deadlineis the first of periodic time-sensitive trafficiA time limit for each data stream to reach the destination node;
the acceptance window constraint is:
LenOfSlot＞LenOfCQF/B；
wherein the content of the first and second substances,LenOfCQFis the queue length of the circular flow queue; b is the sending rate of the data packet of the periodic time sensitive flow on the link;
the queue resource constraints are:
wherein the content of the first and second substances,f i ·sizeis the first of periodic time-sensitive trafficiThe size of each data stream;
is composed oftAll data passing through circulating flow queue in 1 time slotThe length of the stream;nis composed oftThe total number of data streams passing through the periodic time-sensitive traffic of the circulating flow queue in 1 time slot;O（f i , m1, e1, l1, t1) Indicating a periodic time-sensitive flow of traffic,m1 is the first of periodic time-sensitive trafficiThe message of each of the data streams,e1 is the first of the periodic time-sensitive trafficiThe switches through which a number of data streams pass,l1 is the first of the periodic time-sensitive trafficiThe ports of the switch through which the data streams pass,t1 is the first of periodic time-sensitive trafficiThe messages of each data stream pass through the time slots of the switch.
Optionally, the egress port time constraint is:
t j - t r ≥ D r k , -( D j k,-1 + d prop + d proc )；
wherein, the first and the second end of the pipe are connected with each other,t j time sensitive traffic of the synchronous flow typejThe transmission start time of each data stream at the source host;t r time sensitive traffic of the type synchronous streamrThe transmission start time of each data stream at the source host; first, therThe transmission time of the data stream is earlier than that of the first data streamjThe transmission time of each data stream;d prop is a transmission delay;d proc is a processing delay;D r k, is a firstrData stream is transmitted tokCumulative network delays for each switch;D j k,-1 is as followsjData stream is transmitted tok-cumulative network delay of 1 switch;k≥2；
the zero jitter constraint is:
wherein, the first and the second end of the pipe are connected with each other,t r k, time sensitive traffic of the type synchronous streamrA data stream is inkA transmission start time on each switch;t r k,-1 time sensitive traffic of the synchronous flow typerA data stream is ink-transmission start time on 1 switch;athe total number of data streams of time-sensitive traffic of a synchronous stream type passing through a synchronous stream queue in a certain time slot;
time sensitive traffic of the synchronous flow typerA data stream is ink-transmission time on 1 switch;
the transmission start time constraints are:
t r = min；
wherein the content of the first and second substances,t r time sensitive traffic of the type synchronous streamrA transmission start time of each data stream;minto set a minimum transmission start time.
Optionally, the setting protocol is an ieee802.1qci protocol.
The invention also provides a deterministic resource scheduling system in a hot rolling control system, which comprises:
the flow acquisition module is used for acquiring a flow set of a target hot rolling control system; the flow set comprises: periodic time sensitive traffic and synchronous stream type time sensitive traffic;
the descending order arrangement module is used for carrying out descending order arrangement on the periodic time sensitive flow according to the size of the resource occupied by the flow to obtain a descending order flow sequence;
the periodic flow scheduling module is used for shifting the time slots of the periodic time-sensitive flows in the descending flow sequence according to a greedy strategy that the offset is gradually decreased by taking the maximum throughput as a target and taking the time slot offset constraint as a constraint condition, and mapping the descending flow sequence after the time slot offset to a circulating flow queue to realize the transmission of the periodic time-sensitive flows; the slot offset constraints include: frame sending offset constraint, end-to-end delay constraint, acceptance window constraint and queue resource constraint;
the synchronous flow type traffic scheduling module is used for mapping the time sensitive traffic of the synchronous flow type to a synchronous flow queue by taking the maximum throughput as a target and taking the specific constraint of a non-waiting shaper as a constraint condition so as to realize the transmission of the time sensitive traffic of the synchronous flow type; specific constraints of the wait-free shaper include: an output port time constraint, a zero jitter constraint, and a transmission start time constraint.
Compared with the prior art, the invention has the beneficial effects that:
the embodiment of the invention provides a deterministic resource scheduling method and a deterministic resource scheduling system in a hot rolling control system, wherein periodic time-sensitive traffic is subjected to descending order arrangement according to the size of the resource occupied by the traffic to obtain a descending order traffic sequence; the maximum throughput is taken as a target, a time slot offset constraint is taken as a constraint condition, a greedy strategy of gradually decreasing offset is adopted, the time slot of the periodic time sensitive flow in the descending flow sequence is offset, the descending flow sequence after the time slot offset is mapped to a circulating flow queue, so that the transmission of the periodic time sensitive flow is realized, different offsets are applied to different flows, idle queue resources in the circulating flow queue of a double-queue model are fully utilized, and the transmission efficiency of the time sensitive flow can be improved; the maximum throughput is taken as a target, the specific constraint of the non-waiting shaper is taken as a constraint condition, the time-sensitive traffic of the synchronous stream type is mapped to the synchronous stream queue to realize the transmission of the time-sensitive traffic of the synchronous stream type, so that the problem of jitter increase caused by time slot offset is faced, a transmission channel is separately opened up for the time-sensitive traffic of the synchronous stream type, and meanwhile, zero-jitter transmission is realized through the non-waiting shaper, so that the transmission stability of the time-sensitive traffic is improved. The invention provides deterministic network service for the hot rolling control system, improves the data transmission efficiency and the transmission stability of the deterministic resource scheduling process in the hot rolling control system, and meets the real-time requirement of key flow.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a flow chart of a deterministic resource scheduling method in a hot rolling control system according to an embodiment of the present invention;
fig. 2 is a diagram of a transmission link provided by an embodiment of the present invention;
FIG. 3 is a diagram of slot offsets before scheduling according to an embodiment of the present invention;
fig. 4 is a diagram of a scheduled time slot offset according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a circular queuing model for tunneling synchronous stream type time-sensitive traffic alone according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In order to make the aforementioned objects, features and advantages of the present invention more comprehensible, the present invention is described in detail with reference to the accompanying drawings and the detailed description thereof.
The invention aims at the real-time transmission requirement of a hot rolling control system on time-sensitive data, designs a deterministic resource scheduling method in the hot rolling control system in order to solve the problem of insufficient utilization of communication link resources and comprehensively consider key parameters in a 'sensing control' process, provides deterministic network service for the hot rolling control system, improves the data transmission efficiency and the transmission stability of the deterministic resource scheduling process in the hot rolling control system, and meets the real-time requirement of key flow.
Referring to fig. 1, a deterministic resource scheduling method in a hot rolling control system provided by an embodiment of the present invention includes:
step 101: acquiring a flow set of a target hot rolling control system; the flow set comprises: periodic time sensitive traffic and synchronous stream type time sensitive traffic.
Step 102: and performing descending order arrangement on the periodic time sensitive traffic according to the size of the resource occupied by the traffic to obtain a descending order traffic sequence. Time sensitive traffic is TT traffic.
Specifically, the method comprises the following steps: when the periodic TT flow is sequenced, the sequencing principle is that the periodic TT flow occupying less resources is mapped preferentially, so that four different sequencing strategies are provided, namely a periodic TT flow period long and short descending sequence, a periodic TT flow path long and short ascending sequence, a periodic TT flow message long and short descending sequence and a periodic TT flow allowed maximum end-to-end delay size ascending sequence, and the sequence of different periodic TT flows is adjusted according to any one of the sequencing strategies.
Step 103: shifting the time slots of the periodic time sensitive flow in the descending flow sequence according to a greedy strategy of gradually decreasing offset by taking the maximum throughput as a target and taking time slot shift constraint as a constraint condition, and mapping the descending flow sequence after time slot shift to a circulating flow queue to realize the transmission of the periodic time sensitive flow. The circular flow queue realizes traffic transmission based on a Circular Queuing and Forwarding (CQF) mechanism.
A greedy strategy for gradually decreasing the offset is specifically: for the initial time slot offset of the periodic TT flow, preferably applying an offset to the periodic TT flow occupying less resources, wherein the applied offset is sequentially reduced, and applying a larger offset to the periodic TT flow sequenced in the front, reserving a larger offsetable time slot for the subsequent periodic TT flow, and sequentially reducing, thereby effectively utilizing the idle queue resources of the circular flow queue.
The objective function of throughput is:
wherein, the first and the second end of the pipe are connected with each other,
for throughput, N is the total size of the successfully scheduled data streams, and delay is the total delay of the successfully scheduled data streams;N syn to schedule the total size of successful periodic TT traffic,delay syn the total delay of the scheduled periodic TT flow is obtained;N cly to schedule the total size of the TT traffic of the successful isochronous stream type,delay cly the total delay of TT flow of the synchronous flow type which is successfully scheduled;N nor to schedule the total size of successful non-TT traffic,delay nor the total time delay of the successfully scheduled non-TT traffic;Kis a weighting coefficient of TT flow.
And:
whereinn cly To schedule the number of successful periodic TT traffic,n syn the number of TT flow of the synchronization flow type which is successfully scheduled.f i Is the first in periodic TT flowiA data stream;f r TT flow of type synchronous flowrA data stream.f i ·offsetIs the first in periodic TT flowiAn offset of each data stream;LenOfSlotin order to be the length of the time slot,f i ·hopis the first in the periodic TT flowiThe number of hops traversed by the data stream.f r ·hopTT traffic being of synchronous flow typerThe number of hops traversed by a data stream,d prop in order to delay the transmission of the data,d proc in order to handle the delay of the processing,
TT traffic being of synchronous flow typerA data stream is inkTransmission time on each switch.
The slot offset constraints include: frame transmit offset constraints, end-to-end delay constraints, acceptance window constraints, and queue resource constraints. Specifically, the method comprises the following steps:
the frame transmit offset constraint is:
f i ·offset＜f i ·period/LenOfSlot；
wherein the content of the first and second substances,f i ·periodis the first of periodic time-sensitive trafficiThe period of the data stream. The frame transmit offset constraint is that the offset imposed on the data stream starting slot cannot be greater than its period.
The end-to-end delay constraint is:
f i ·offset×LenOfSlot+（f i ·hop+1）×LenOfSlot＜f i ·deadline；
wherein the content of the first and second substances,f i ·deadlineis the first of periodic time-sensitive trafficiThe time limit for the arrival of each data stream at the destination node. The end-to-end delay constraint, i.e. the offset applied to the starting slot, must meet the maximum end-to-end delay of the data stream.
The acceptance window constraint is:
LenOfSlot＞LenOfCQF/B；
wherein, the first and the second end of the pipe are connected with each other,LenOfCQFis the queue length of the circulating flow queue; and B is the sending rate of the data packets of the periodic time-sensitive traffic on the link. The acceptance window constraint, i.e. the time slot for the switches upstream and downstream to send and accept messages, should be the same.
The queue resource constraints are:
wherein, the first and the second end of the pipe are connected with each other,f i ·sizeis the first of periodic time-sensitive trafficiThe size of each data stream;
is composed oft1, the length of all data streams passing through a circulating stream queue in a time slot;nis composed oftThe total number of data streams passing through the periodic time-sensitive traffic of the circulating flow queue in 1 time slot;O（f i , m1, e1, l1, t1) Indicating a periodic time-sensitive flow of the fluid,m1 is the first of periodic time-sensitive trafficiThe message of each of the data streams,e1 is the first of the periodic time-sensitive trafficiThe switches through which a number of data streams pass,l1 is the first of the periodic time-sensitive trafficiThe ports of the switch through which the data streams pass,t1 is the first of periodic time-sensitive trafficiThe messages of each data stream pass through the time slots of the switch. The queue resource constraint is that the length of a data frame of TT flow passing through a link in a certain time slot cannot be larger than the length of a buffer queue.
Step 104: and mapping the time-sensitive traffic of the synchronous flow type to a synchronous flow queue by taking the maximum throughput as a target and taking the specific constraint of the no-waiting shaper as a constraint condition so as to realize the transmission of the time-sensitive traffic of the synchronous flow type. Specific constraints of the wait-free shaper include: an egress port time constraint, a zero jitter constraint, and a transmission start time constraint.
The egress port time constraint is:
t j - t r ≥ D r k , -( D j k,-1 + d prop + d proc )；
wherein, the first and the second end of the pipe are connected with each other,t j time sensitive traffic of the synchronous flow typejThe transmission start time of each data stream at the source host;t r time sensitive traffic of the synchronous flow typerThe transmission start time of each data stream at the source host; first, therThe transmission time of the data stream is earlier than that of the first data streamjA transmission time of the data stream;D r k, is as followsrData stream is transmitted tokCumulative network delay of individual switches;D j k,-1 is as followsjData stream is transmitted tok-cumulative network delay of 1 switch;knot less than 2. Specifically, the method comprises the following steps:
wherein
Time sensitive traffic of the synchronous flow typerA data stream is incThe time of transmission on the individual switches is,
time sensitive traffic of the type synchronous streamjA data stream is incTransmission time on each switch. The egress port time constraints, i.e., the egress port times of any two data flows, cannot overlap.
The zero jitter constraint is:
wherein the content of the first and second substances,t r k, time sensitive traffic of the type synchronous streamrA data stream is inkTransmission start time on a switch；t r k,-1 Time sensitive traffic of the type synchronous streamrA data stream is ink-transmission start time on 1 switch;athe total number of data streams of time-sensitive traffic of the type of synchronous stream passing through the synchronous stream queue in a certain time slot;
time sensitive traffic of the synchronous flow typerA data stream is inkTransmission time over 1 switch. Time sensitive traffic of zero jitter constraint, synchronous stream typerA data streamf r Between the transmission start times of the adjacent switches, there cannot be any delay time other than the processing delay, the transmission time.
The transmission start time constraint is:
t r = min；
wherein, the first and the second end of the pipe are connected with each other,t r time sensitive traffic of the synchronous flow typerA transmission start time of each data stream;minto set a minimum transmission start time. The transmission start time constraint, i.e. the transmission start time of the data stream, is as small as possible, minimizing the impact on periodic time sensitive traffic.
Wherein the priority of the synchronous flow queue is greater than the priority of the circular flow queue.
Wherein, step 101 specifically includes:
acquiring the initial flow of a target hot rolling control system; and screening and queue distribution are carried out on the initial flow according to the transmission rule and the flow type of the set protocol, so as to obtain a flow set of the target hot rolling control system. The setting protocol may be an ieee802.1qci protocol.
In one example, the set of traffic further includes: non-time sensitive best effort traffic; the non-time-sensitive best effort flow is a flow of a target hot rolling control system except the periodic time-sensitive flow and the time-sensitive flow of the synchronous flow type.
After the periodic time-sensitive traffic and the synchronous flow type time-sensitive traffic complete transmission, further comprising: and transmitting the non-time-sensitive best-effort traffic by adopting a transmission rule of a set protocol of a best-effort flow queue. The setting protocol may be an ieee802.1qci protocol.
Wherein the priority of the synchronous flow queue is greater than the priority of the circulating flow queue, and the priority of the circulating flow queue is greater than the priority of the best effort flow queue.
In practical application, a specific implementation process of the deterministic resource scheduling method in the hot rolling control system is as follows:
step S1, the flow in the flow set is composed of a quintuple<f,m, e, l, t>The characteristics of the raw materials are represented,fthe flow of data is represented by a stream of data,ma message representing a data flow is sent to the data processing system,eindicating the switches through which the data streams pass,lthe ports of the switch are represented as being,tindicating the time slot in which the message passes through the switch.
And step S2, defining the management and Filtering functions of the Stream by utilizing a Per-Stream Filtering and supervising mechanism (PSFP) according to the IEEE802.1Qci standard.
And S3, scheduling the periodic TT flow by using a resource scheduling algorithm based on flow offset time slot descending, adjusting the flow sequence according to a mode of descending the resource occupied by different flows, and establishing a target function of throughput, wherein the specific function expression is not described again.
Step S4, after the sequencing, shifting the time slot at the source end of the cyclic flow queue transmitting the periodic TT traffic, where a physical transmission link of the data stream is shown in fig. 2, and a specific shifting manner is shown in fig. 3 and fig. 4; and mapping the data stream with the maximum allowable offset by adopting a greedy strategy of gradually decreasing the offset, and reserving time slots with sequentially reduced offsets for the data stream to be mapped later. The slot offset constraint is not described in detail herein.
In fig. 2, solid arrows indicate physical links, dashed arrows indicate data flow transmission paths, f1 indicates a 1 st data flow from host 1 to switch 2, f2 indicates a 2 nd data flow from host 1 to switch 2, and f3 indicates a data flow from host 2 to switch 2. The parameters of f1, f2 and f3 are shown in Table 1.
Table 1 data flow parameter table
In fig. 3 and 4, f1.1 is the first data frame of data flow f1, f1.2 is the second data frame of data flow f1, f2.1 is the first data frame of data flow f2, f2.2 is the second data frame of data flow f2, f3.1 is the first data frame of data flow f3, and f3.2 is the second data frame of data flow f3.
Referring to fig. 3, data frame f1.1 of data flow f1 of host 1 and data frame f2.1 of data flow f2 arrive at switch 1 at the same time as data frame f3.1 of data flow f3 of host 2, but the length of the buffer queue of switch 1 is limited, and the lengths of three data frames f1.1, f2.1 and f3.1 exceed the length of the buffer queue, at this time f3.1 has to be discarded to be retransmitted in the next cycle, and the subsequent transmission distribution of f1.2 and f2.2 is irregular because the periods of the two data flows are different.
Referring to fig. 4, the transmission start time of the first data frame f3.1 of data flow f3 is shifted back by one slot, when the buffer queue of the switch arrives at slot 0 only at f1.1 and f 2.1. At this time, the length of the data frame does not exceed the upper limit of the buffer queue, and the data frame is not lost, but the first data frame f3.1 of the data stream f3 arrives at the switch at the time slot 1, and the length of the data frame does not exceed the upper limit of the buffer queue, so that the data frame can be normally transmitted after an offset, the transmission delay is reduced, and the purpose of reducing the transmission delay of the data stream can be achieved by performing the same operation on the subsequent data frames of the data stream f3.
Step S5, for TT traffic of the synchronous flow type, the queue with priority 7 enters, a queue model of which is shown in fig. 5, and is scheduled by the no-wait shaper, and specific constraints of the no-wait shaper are not described herein again.
In fig. 5, eight queues Q7-Q0 are provided, the priority is 7-0, and the priority of the transmission queue decreases from left to right, wherein the isochronous stream queue composed of TT traffic of the isochronous stream type is transmitted via the Q7 queue with priority 7.
A circulating flow queue consisting of periodic TT flow is transmitted through Q6 and Q5 queues with the priority levels of 6 and 5, the periodic TT flow transmitted by two queues is transmitted by using a ping-pong queue, the deterministic delay in the IEEE802.1Qci protocol is realized, and compared with other queues, the queue has two more input gates, and the method for realizing the mechanism is also disclosed.
And queues of best effort traffic consisting of non-TT traffic are transmitted via queues of Q4-Q0 of priority 4-0.
The gating list corresponding to the output gate is a key for realizing the priority of the queue, for example, at a queue time T0, that is, at the beginning of transmission, the TT traffic of the synchronous stream type is transmitted at this time, the output gate of the Q7 queue is opened (o), the output gates of other queues are closed (c), after the transmission is completed, the output gates of Q6 and Q5 are opened again, and the circular stream queue is transmitted again, where Q6 and Q5 are alternately opened due to a ping-pong queue transmission mechanism depending on the gating list, and after the transmission is completed, the output gates of the Q4-Q0 queues are opened again. Therefore, the queue with high priority is transmitted first, and the queue with low priority is transmitted later.
The embodiment firstly defines the characteristic parameters of different data streams in the hot rolling control system, then filters and allocates queues to the data streams by utilizing a stream-by-stream filtering and supervision mechanism (PSFP), then applies different offsets to different time-sensitive streams by utilizing a resource scheduling algorithm based on flow offset time slot descending order, and finally transmits the time-sensitive flows by utilizing a cyclic queuing forwarding mechanism (CQF) and a non-waiting shaper. The invention provides a deterministic time delay range for TT flow with the highest priority in an industrial field, fully utilizes idle resources of a CQF queue model, and can provide zero-jitter deterministic network service for TT flow of a synchronous flow type.
The invention also provides a deterministic resource scheduling system in a hot rolling control system, which comprises:
the flow acquisition module is used for acquiring a flow set of a target hot rolling control system; the flow set comprises: periodic time sensitive traffic and synchronous stream type time sensitive traffic.
And the descending order arrangement module is used for carrying out descending order arrangement on the periodic time sensitive flow according to the size of the resource occupied by the flow to obtain a descending order flow sequence.
The periodic flow scheduling module is used for shifting the time slots of the periodic time-sensitive flows in the descending flow sequence according to a greedy strategy that the offset is gradually decreased by taking the maximum throughput as a target and taking the time slot offset constraint as a constraint condition, and mapping the descending flow sequence after the time slot offset to a circulating flow queue to realize the transmission of the periodic time-sensitive flows; the slot offset constraints include: frame transmit offset constraints, end-to-end delay constraints, acceptance window constraints, and queue resource constraints.
The synchronous flow type traffic scheduling module is used for mapping the time sensitive traffic of the synchronous flow type to a synchronous flow queue by taking the maximum throughput as a target and taking the specific constraint of a non-waiting shaper as a constraint condition so as to realize the transmission of the time sensitive traffic of the synchronous flow type; specific constraints of the wait-free shaper include: an egress port time constraint, a zero jitter constraint, and a transmission start time constraint.
In the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. For the system disclosed by the embodiment, the description is relatively simple because the system corresponds to the method disclosed by the embodiment, and the relevant points can be referred to the description of the method part.
The principles and embodiments of the present invention have been described herein using specific examples, which are provided only to help understand the method and the core concept of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, the specific embodiments and the application range may be changed. In view of the foregoing, the description is not to be taken in a limiting sense.
Claims (9)
1. A deterministic resource scheduling method in a hot rolling control system is characterized by comprising the following steps:
acquiring a flow set of a target hot rolling control system; the flow set comprises: periodic time sensitive traffic and synchronous flow type time sensitive traffic;
performing descending order on the periodic time sensitive flow according to the size of the resource occupied by the flow to obtain a descending order flow sequence;
shifting the time slots of the periodic time sensitive flow in the descending flow sequence according to a greedy strategy of gradually decreasing offset by taking the maximum throughput as a target and taking time slot shift constraint as a constraint condition, and mapping the descending flow sequence after time slot shift to a circulating flow queue to realize the transmission of the periodic time sensitive flow; the slot offset constraints include: frame sending offset constraint, end-to-end delay constraint, acceptance window constraint and queue resource constraint;
mapping the time-sensitive traffic of the synchronous stream type to a synchronous stream queue by taking the maximum throughput as a target and taking the specific constraint of the wait-free shaper as a constraint condition so as to realize the transmission of the time-sensitive traffic of the synchronous stream type; specific constraints of the wait-free shaper include: an output port time constraint, a zero jitter constraint, and a transmission start time constraint.
2. The method of claim 1, wherein the traffic set further comprises: non-time sensitive best effort traffic; the non-time-sensitive best-effort flow is the flow of the target hot rolling control system except the periodic time-sensitive flow and the time-sensitive flow of the synchronous flow type;
after the periodic time-sensitive traffic and the synchronous flow type time-sensitive traffic complete transmission, further comprising: and transmitting the non-time-sensitive best-effort traffic by adopting a transmission rule of a set protocol of a best-effort flow queue.
3. A method according to claim 1, characterized in that said obtaining a flow set of a target hot rolling control system comprises:
acquiring the initial flow of a target hot rolling control system;
and screening and queue distribution are carried out on the initial flow according to the transmission rule and the flow type of the set protocol, and the flow set of the target hot rolling control system is obtained.
4. The method of claim 1, wherein the priority of the isochronous stream queue is greater than the priority of the circulating stream queue.
5. The method of claim 2, wherein the priority of the isochronous flow queue is greater than the priority of the recirculating flow queue, and the priority of the recirculating flow queue is greater than the priority of the best effort flow queue.
6. A method for deterministic resource scheduling in a hot rolling control system according to claim 1, characterized in that said frame transmission offset constraint is:
f i ·offset＜f i ·period/LenOfSlot；
wherein, the first and the second end of the pipe are connected with each other,f i is the first of periodic time-sensitive trafficiA data stream;f i ·offsetis the first of periodic time-sensitive trafficiAn offset of each data stream;f i ·periodis periodicIn intermittent sensitive trafficiA period of data streams;LenOfSlotis the time slot length;
the end-to-end delay constraint is:
f i ·offset×LenOfSlot+（f i ·hop+1）×LenOfSlot＜f i ·deadline；
wherein the content of the first and second substances,f i ·hopis the first of periodic time-sensitive trafficiThe number of hops a data stream passes through;f i ·deadlineis the first of periodic time-sensitive trafficiA time limit for each data stream to reach the destination node;
the acceptance window constraint is:
LenOfSlot＞LenOfCQF/B；
wherein the content of the first and second substances,LenOfCQFis the queue length of the circular flow queue; b is the sending rate of the data packet of the periodic time sensitive flow on the link;
the queue resource constraints are:
wherein the content of the first and second substances,f i ·sizeis the first of periodic time-sensitive trafficiThe size of each data stream;
is composed oft1, the length of all data streams passing through the circulating flow queue in a time slot;nis composed oft1 total number of data streams of periodic time-sensitive traffic passing through a circular flow queue in a time slot;O（f i , m1, e1, l1, t1) Indicating a periodic time-sensitive flow of the fluid,m1 is the first of the periodic time-sensitive trafficiThe message of each data stream is sent to the server,e1 is the first of the periodic time-sensitive trafficiThe switch through which the data stream passes,l1 is the first of the periodic time-sensitive trafficiThe ports of the switch through which the data streams pass,t1 is the first of the periodic time-sensitive trafficiThe messages of each data stream pass through the time slots of the switch.
7. The method of claim 1, wherein the exit port time constraint is:
t j - t r ≥ D r k , -( D j k,-1 + d prop + d proc )；
wherein the content of the first and second substances,t j time sensitive traffic of the type synchronous streamjThe transmission start time of each data stream at the source host;t r time sensitive traffic of the type synchronous streamrThe transmission start time of each data stream at the source host; first, therThe transmission time of the data stream is earlier than that of the first data streamjA transmission time of the data stream;d prop is a transmission delay;d proc is a processing delay;D r k, is as followsrData stream is transmitted tokCumulative network delay of individual switches;D j k,-1 is as followsjData stream is transmitted tok-cumulative network delay of 1 switch;k≥2；
the zero jitter constraint is:
wherein the content of the first and second substances,t r k, time sensitive traffic of the type synchronous streamrA data stream is inkA transmission start time on each switch;t r k,-1 time sensitive traffic of the synchronous flow typerA data stream is ink-start of transmission on 1 switchA (c) is added;athe total number of data streams of time-sensitive traffic of a synchronous stream type passing through a synchronous stream queue in a certain time slot;
time sensitive traffic of the synchronous flow typerA data stream is ink-transmission time on 1 switch;
the transmission start time constraint is:
t r = min；
wherein the content of the first and second substances,t r time sensitive traffic of the synchronous flow typerA transmission start time of each data stream;minto set a minimum transmission start time.
8. A method according to claim 3, wherein said setting protocol is ieee802.1qci protocol.
9. A deterministic resource scheduling system in a hot rolling control system, comprising:
the flow acquisition module is used for acquiring a flow set of a target hot rolling control system; the flow set comprises: periodic time sensitive traffic and synchronous stream type time sensitive traffic;
the descending order arrangement module is used for carrying out descending order arrangement on the periodic time sensitive flow according to the size of the resource occupied by the flow to obtain a descending order flow sequence;
the periodic flow scheduling module is used for shifting the time slots of the periodic time-sensitive flows in the descending flow sequence according to a greedy strategy that the offset is gradually decreased by taking the maximum throughput as a target and a time slot offset constraint as a constraint condition, and mapping the descending flow sequence after the time slot offset to a circulating flow queue to realize the transmission of the periodic time-sensitive flows; the slot offset constraints include: frame sending offset constraint, end-to-end delay constraint, acceptance window constraint and queue resource constraint;
the synchronous flow type traffic scheduling module is used for mapping the time sensitive traffic of the synchronous flow type to a synchronous flow queue by taking the maximum throughput as a target and taking the specific constraint of a non-waiting shaper as a constraint condition so as to realize the transmission of the time sensitive traffic of the synchronous flow type; specific constraints of the wait-free shaper include: an output port time constraint, a zero jitter constraint, and a transmission start time constraint.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211615989.8A CN115604193B (en) | 2022-12-16 | 2022-12-16 | Deterministic resource scheduling method and system in hot rolling control system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211615989.8A CN115604193B (en) | 2022-12-16 | 2022-12-16 | Deterministic resource scheduling method and system in hot rolling control system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115604193A CN115604193A (en) | 2023-01-13 |
| CN115604193B true CN115604193B (en) | 2023-03-07 |
Family
ID=84854273
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211615989.8A Active CN115604193B (en) | 2022-12-16 | 2022-12-16 | Deterministic resource scheduling method and system in hot rolling control system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115604193B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116319598B (en) * | 2023-05-19 | 2023-11-07 | 工业富联(佛山)产业示范基地有限公司 | Time-sensitive mechanical arm control method, switch and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020200405A1 (en) * | 2019-03-29 | 2020-10-08 | Huawei Technologies Co., Ltd. | Switch device, control device and corresponding methods for enhanced schedulability and throughput on a tsn network |
| CN113612700A (en) * | 2021-08-12 | 2021-11-05 | 北京邮电大学 | Low-delay zero-jitter mixed time-sensitive traffic scheduling method and device |
| CN114301851A (en) * | 2022-01-20 | 2022-04-08 | 燕山大学 | Time-sensitive network flow hierarchical scheduling method for industrial site |
| CN114422448A (en) * | 2022-01-18 | 2022-04-29 | 重庆大学 | Time-sensitive network traffic shaping method |
| CN115208751A (en) * | 2021-04-09 | 2022-10-18 | 英特尔公司 | Path selection and scheduling for mobile wireless devices in time sensitive networks |
-
2022
- 2022-12-16 CN CN202211615989.8A patent/CN115604193B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020200405A1 (en) * | 2019-03-29 | 2020-10-08 | Huawei Technologies Co., Ltd. | Switch device, control device and corresponding methods for enhanced schedulability and throughput on a tsn network |
| CN115208751A (en) * | 2021-04-09 | 2022-10-18 | 英特尔公司 | Path selection and scheduling for mobile wireless devices in time sensitive networks |
| CN113612700A (en) * | 2021-08-12 | 2021-11-05 | 北京邮电大学 | Low-delay zero-jitter mixed time-sensitive traffic scheduling method and device |
| CN114422448A (en) * | 2022-01-18 | 2022-04-29 | 重庆大学 | Time-sensitive network traffic shaping method |
| CN114301851A (en) * | 2022-01-20 | 2022-04-08 | 燕山大学 | Time-sensitive network flow hierarchical scheduling method for industrial site |
Non-Patent Citations (1)
| Title |
|---|
| Adaptive Priority Adjustment Scheduling Approach With Response-Time in Time-Sensitive Networks;YUAN,YAZHOU等;《IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115604193A (en) | 2023-01-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhao et al. | Worst-case latency analysis for IEEE 802.1 Qbv time sensitive networks using network calculus | |
| Laursen et al. | Routing optimization of AVB streams in TSN networks | |
| JP6395170B2 (en) | Data frame traffic shaping method in network, device and computer program product | |
| Craciunas et al. | An overview of scheduling mechanisms for time-sensitive networks | |
| US11018791B2 (en) | Method and device for time-controlled data transmission in a time-sensitive network | |
| CN114422448B (en) | Time-sensitive network traffic shaping method | |
| Cao et al. | Tight worst-case response-time analysis for ethernet AVB using eligible intervals | |
| CN114301851B (en) | Industrial field-oriented time-sensitive network flow hierarchical scheduling method | |
| CN104272680A (en) | Signalling congestion | |
| WO2022022224A1 (en) | Data packet scheduling method and related apparatus | |
| CN115604193B (en) | Deterministic resource scheduling method and system in hot rolling control system | |
| CN112565068A (en) | Redundant flow scheduling method applied to TSN (traffic service network) | |
| Mohammadpour et al. | Improved delay bound for a service curve element with known transmission rate | |
| Deng et al. | A low-delay AVB flow scheduling method occupying the guard band in Time-Sensitive Networking | |
| Walrand | A concise tutorial on traffic shaping and scheduling in time-sensitive networks | |
| Benammar et al. | Timing analysis of AVB Ethernet network using the forward end-to-end delay analysis | |
| WO2022134978A1 (en) | Data sending method and apparatus | |
| Liu et al. | Network calculus-based modeling of time sensitive networking shapers for industrial automation networks | |
| Zhao et al. | Improving worst-case end-to-end delay analysis of multiple classes of AVB traffic in TSN networks using network calculus | |
| Hassani et al. | Work-in-progress: Layering concerns for the analysis of credit-based shaping in IEEE 802.1 TSN | |
| CN113271262A (en) | Cross type deterministic data transmission method and device | |
| JP5592317B2 (en) | Disposal circuit | |
| Walrand | A Quick Tutorial on Time-Sensitive Networks | |
| Maxim et al. | Delay Analysis of AVB traffic in Time-Sensitive Networks (TSN) with application to multi-packet Video Frames | |
| Chen et al. | Study of Fixed Point Message Scheduling Algorithm for In-Vehicle Ethernet |
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 |