CN114390122A - Adaptive control scheduling method under Glink protocol of gravure centralized ink supply control system - Google Patents
Adaptive control scheduling method under Glink protocol of gravure centralized ink supply control system Download PDFInfo
- Publication number
- CN114390122A CN114390122A CN202210067299.7A CN202210067299A CN114390122A CN 114390122 A CN114390122 A CN 114390122A CN 202210067299 A CN202210067299 A CN 202210067299A CN 114390122 A CN114390122 A CN 114390122A
- Authority
- CN
- China
- Prior art keywords
- time
- queue
- data
- transmission
- data packet
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/24—Negotiation of communication capabilities
-
- 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/56—Queue scheduling implementing delay-aware scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6295—Queue scheduling characterised by scheduling criteria using multiple queues, one for each individual QoS, connection, flow or priority
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention provides a self-adaptive control scheduling method under a Glink protocol of a gravure centralized ink supply control system, which comprises the following steps: the operation side of the gravure centralized ink supply control system is subjected to real-time data packet transmission to the transmission side through an Ethernet communication system; changing an Ethernet communication system into multi-queue transmission, and setting the priority of the multi-queue; setting the time slice of each queue as the running time according to the priority, wherein the time slice is shorter when the priority is higher; and determining the completion time and the turnover time of the data packet, and scheduling according to the completion time and the turnover time in the sequence from the priority level of the queue to the low level. The invention solves the problem of real-time performance of the Ethernet network system caused by collision, attenuation, loss and the like of the Ethernet network real-time data in the prior art.
Description
Technical Field
The invention relates to the technical field of printing devices, in particular to a self-adaptive control scheduling method under a Glink protocol of a gravure centralized ink supply control system.
Background
Because the existing Ethernet (Ethernet) can meet the control requirements of rapidness, real time, reliability and the like, the Ethernet (Ethernet) is widely applied to the industrial control field with higher real-time requirements, such as a high-precision industrial control field and the like. However, the ethernet adopts the previous CSMA/CD method in data collision detection, which results in uncertainty of real-time performance of the ordinary ethernet. In order to improve the real-time performance of data transmission of the ethernet network, ensure the reliability thereof, and further achieve the purpose of improving the real-time performance of the ethernet network system, it is necessary to analyze data transmission strategies and theories, and simultaneously analyze influence factors and performance indexes of the real-time performance. The existing key technologies such as redundancy technology, reliability technology, bus power supply, industrial ethernet real-time guarantee mechanism, functional safety and the like are all researched based on the background. Real-time performance has a significant impact on the optimization of its performance throughout a communication network.
The following methods are mainly used for improving the real-time performance of the ethernet: 1) the real-time performance of the Ethernet network is improved based on the topology structure, for example, the real-time performance of the Ethernet network is improved by changing the topology structure of the Ethernet network or increasing the number of nodes and the number of switches; 2) improving real-time performance based on real-time scheduling strategies, such as packet scheduling strategies, hybrid sleep modes and the like; 3) the real-time performance is guaranteed based on pure logic circuits. However, the existing methods have respective limitations, such as inability to support gigabit ethernet, large jitter, and no support for cross communication, which all reduce the real-time performance of data transmission.
Therefore, how to improve the real-time performance of the ethernet network becomes a problem to be solved in the field of ethernet. In the early days, the industrial ethernet network communication system adopted the FCFS algorithm for simple transmission of data packets. Only one queue is arranged in the Ethernet, when a data packet starts to be transmitted, a later data packet is transmitted after the transmission of a previous data packet is finished, however, when a non-real-time data packet arrives before a real-time data packet, the real-time data packet cannot be transmitted in real time with a very high probability, or when a long data packet arrives faster than a short data packet, the short data packet must be transmitted after the transmission of the equal-length data packet is completed, which causes time delay and reduction of channel utilization rate. Therefore, although the ethernet communication network system is widely used in the lan, it cannot be applied to some high-demand high-real-time situations of the industrial ethernet network. Due to the FCFS algorithm, the Ethernet communication system cannot guarantee the requirement of timely transmitting data packets, and the application of the industrial Ethernet communication network to a strong real-time scene is limited.
In order to solve the problems, the invention provides a novel adaptive control scheduling method under a Glink protocol of a gravure centralized ink supply control system.
Disclosure of Invention
In order to solve the problems, the invention provides a self-adaptive control scheduling method under a Glink protocol of a gravure centralized ink supply control system, which solves the problem of real-time performance of an Ethernet network system caused by collision, attenuation, loss and the like of real-time data of the Ethernet network in the prior art.
In order to achieve the above purpose, the present invention provides the following technical solutions.
A self-adaptive control scheduling method under a Glink protocol of a gravure centralized ink supply control system comprises the following steps:
the operation side of the gravure centralized ink supply control system is subjected to real-time data packet transmission to the transmission side through an Ethernet communication system;
changing an Ethernet communication system into multi-queue transmission, and setting the priority of the multi-queue; setting the time slice of each queue as the running time according to the priority, wherein the time slice is shorter when the priority is higher;
determining the completion time and the turnover time of the data packet, and scheduling according to the completion time and the turnover time in the sequence of the priority level of the queue from high to low:
if the data packet is not completely transmitted after the current queue transmits the queue time slice, adding the data packet into the next queue;
if no data packet is waiting for transmission in the high priority queue, starting to transmit the data packet in the secondary priority queue, and scheduling each data packet in the same queue by adopting a time slice rotation method;
adopting a time slice polling scheduling algorithm to perform data packet transmission scheduling on the last queue;
when a data packet is transmitted in the low priority queue, if a newly arrived data packet exists in the high priority queue, the newly arrived data packet in the high priority queue is transmitted immediately after the time slice set by the low priority queue is run.
Preferably, the method further comprises the following steps:
the method for scheduling the transmission of each data packet in the same queue by adopting the FCFS strategy comprises the following steps:
initializing a queue, sequencing data packets in the queue according to the arrival time in sequence, and preparing for transmission, wherein the time T is zero;
transmitting the data packets in the queue in sequence;
calculating data completion time T in queuefiAnd data turnaround time Tci；
When the data transmission is finished, changing the value of the time quantity T:
T＝T+Tti
in the formula, TtiIs the data transmission time, i.e. the transmission time of the queue for data i when data i is transmitted through the queue;
calculating the turn-around time W with the right until the data transmission in the queue is finishedciAnd average weighted turnaround time TacAnd starts transmitting data in the next queue.
Preferably, the turnaround time TciComprises the following steps:
Tci＝Tωi+Tti*(Tfi-Tsi)
in the formula, TwiThe data waiting time is the data waiting time, namely, when the data i arrives at the queue through the stack to wait for transmission, the processing of the data i by the queue is delayed; t issiThe time is submitted for the data.
Preferably, the data completion time TfiComprises the following steps:
Tfi＝Tsti+Tti
in the formula, TstiThe transmission time is started for the data.
Preferably, the weighted turnaround time WciComprises the following steps:
preferably, the average weighted turnaround time WacComprises the following steps:
the invention has the beneficial effects that:
the invention provides a self-adaptive control scheduling method under a Glink protocol of a gravure centralized ink supply control system, solves the problem of real-time performance of an Ethernet network system caused by collision, attenuation, loss and the like of real-time data of the Ethernet network in the prior art, provides a multi-queue transmission scheduling method, greatly improves the transmission effect of real-time data borne by the industrial Ethernet network under the condition of not influencing the original performance of the industrial Ethernet communication system, and improves the real-time performance of the whole Ethernet communication system.
Drawings
FIG. 1 is a scheduling flow diagram of an embodiment of the present invention;
FIG. 2 is a schematic diagram of a centralized ink supply control system according to an embodiment of the present invention;
fig. 3 is a flow chart of single queue scheduling control according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Example 1
The architecture adopted by the centralized ink supply control system is shown in fig. 2, and all control modules of the system are communicated by adopting a Glink field real-time synchronous Ethernet protocol. The relevant indexes of the communication system are as follows:
GLink communication rate: 1 Gbps; network maximum site: 32, a first step of removing the first layer; network clock synchronization performance: <1 us; network communication period: 250 us.
The invention discloses an adaptive control scheduling method under a Glink protocol of a gravure centralized ink supply control system, which comprises the following scheduling strategy principles as shown in figure 1:
1) n queues are provided, wherein the priorities of the queues for the processors are different, i.e. the priorities of the packets in the queues are also different. Where priority (queue 1) > (queue 2) > … > (queue N).
2) For a single queue in the multi-queue, the time slice rotation method is internally followed, that is, when the data packet is in the queue N, the running time is the time slice set by the queue N.
3) In the multi-queue, the time slices set by the queues are different. The higher the priority, the shorter the time slice set for the queue, where queue 1 is the smallest time slice in the multi-queue, i.e., S1 < S1 < … < Sn.
Specifically, the method comprises the following steps:
s1: the operation side of the gravure centralized ink supply control system is subjected to real-time data packet transmission to the transmission side through an Ethernet communication system;
s2: changing an Ethernet communication system into multi-queue transmission, and setting the priority of the multi-queue;
s3: setting the time slice of each queue as the running time according to the priority, wherein the time slice is shorter when the priority is higher;
s4: determining the completion time and the turnover time of the data packet, and scheduling according to the completion time and the turnover time in the sequence of the priority level of the queue from high to low:
1) if the data packet is not completely transmitted after the current queue transmits the queue time slice, adding the data packet into the next queue;
2) if no data packet is waiting for transmission in the high priority queue, starting to transmit the data packet in the secondary priority queue, and scheduling each data packet in the same queue by adopting a time slice rotation method;
3) adopting a time slice polling scheduling algorithm to perform data packet transmission scheduling on the last queue;
4) when a data packet is transmitted in the low priority queue, if a newly arrived data packet exists in the high priority queue, the newly arrived data packet in the high priority queue is transmitted immediately after the time slice set by the low priority queue is run.
The method for scheduling the transmission of each data packet in the same queue by adopting the FCFS strategy comprises the following steps:
s5.1: initializing a queue, sequencing data packets in the queue according to the arrival time in sequence, and preparing for transmission, wherein the time T is zero;
s5.2: transmitting the data packets in the queue in sequence;
s5.3: calculating data completion time T in queuefiAnd data turnaround time Tci；
In the multi-stage feedback scheduling, when the data i completes a complete cycle process from submission, reading, caching, scheduling, execution, output to release, the data turnaround time T of the data i is obtainedciComprises the following steps:
Tci＝Tωi+Tti*(Tfi-Tsi)
in the formula, TwiThe data waiting time is the data waiting time, namely, when the data i arrives at the queue through the stack to wait for transmission, the processing of the data i by the queue is delayed; t issiThe time is submitted for the data.
Data completion time TfiComprises the following steps:
Tfi＝Tsti+Tti
in the formula, TstiThe transmission time is started for the data.
S5.4: when the data transmission is finished, changing the value of the time quantity T:
T＝T+Tti
in the formula, TtiIs the data transmission time, i.e. the transmission time of the queue for data i when data i is transmitted through the queue;
s5.5: calculating the turn-around time W with the right until the data transmission in the queue is finishedciAnd average weighted turnaround time TacAnd starts transmitting data in the next queue.
Specifically, the method comprises the following steps: turn-over time with right WciComprises the following steps:
average turn-around time with weight WacComprises the following steps:
wherein, the average value e (x) of the data arrival in the unit time is calculated as follows:
in the formula, x is the number of data.
The arithmetic mean of the data, e (i), is calculated as follows:
where p is the probability of having data in the queue.
The queue average response time R is calculated as follows:
in the formula, λ is an average arrival rate of data.
The invention provides an adaptive scheduling algorithm, which is realized on an industrial Ethernet communication system. Experiments show that the self-adaptive scheduling algorithm greatly improves the transmission effect of real-time data borne by the industrial Ethernet network and improves the real-time performance of the whole Ethernet communication system under the condition of not influencing the original performance of the industrial Ethernet communication system. Meanwhile, the scheduling algorithms are compared, so that the improved algorithm performance has more elasticity.
The present invention is not limited to the above preferred embodiments, and any modifications, equivalent substitutions and improvements made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (6)
1. A self-adaptive control scheduling method under a Glink protocol of a gravure centralized ink supply control system is characterized by comprising the following steps:
the operation side of the gravure centralized ink supply control system is subjected to real-time data packet transmission to the transmission side through an Ethernet communication system;
changing an Ethernet communication system into multi-queue transmission, and setting the priority of the multi-queue; setting the time slice of each queue as the running time according to the priority, wherein the time slice is shorter when the priority is higher;
determining the completion time and the turnover time of the data packet, and scheduling according to the completion time and the turnover time in the sequence of the priority level of the queue from high to low:
if the data packet is not completely transmitted after the current queue transmits the queue time slice, adding the data packet into the next queue;
if no data packet is waiting for transmission in the high priority queue, starting to transmit the data packet in the secondary priority queue, and scheduling each data packet in the same queue by adopting a time slice rotation method;
adopting a time slice polling scheduling algorithm to perform data packet transmission scheduling on the last queue;
when a data packet is transmitted in the low priority queue, if a newly arrived data packet exists in the high priority queue, the newly arrived data packet in the high priority queue is transmitted immediately after the time slice set by the low priority queue is run.
2. The adaptive control scheduling method under the Glink protocol of the gravure centralized ink supply control system according to claim 1, further comprising:
the method for scheduling the transmission of each data packet in the same queue by adopting the FCFS strategy comprises the following steps:
initializing a queue, sequencing data packets in the queue according to the arrival time in sequence, and preparing for transmission, wherein the time T is zero;
transmitting the data packets in the queue in sequence;
calculating data completion time T in queuefiAnd data turnaround time Tci；
When the data transmission is finished, changing the value of the time quantity T:
T＝T+Tti
in the formula, TtiIs the data transmission time, i.e. the transmission time of the queue for data i when data i is transmitted through the queue;
calculating the turn-around time W with the right until the data transmission in the queue is finishedciAnd average weighted turnaround time TacAnd starts transmitting data in the next queue.
3. The adaptive control scheduling method under the Glink protocol of the gravure centralized ink supply control system according to claim 2, wherein the turnaround time T isciComprises the following steps:
Tci＝Tωi+Tti*(Tfi-Tsi)
in the formula, TwiThe data waiting time is the data waiting time, namely, when the data i arrives at the queue through the stack to wait for transmission, the processing of the data i by the queue is delayed; t issiThe time is submitted for the data.
4. The adaptive control scheduling method under the Glink protocol of the gravure centralized ink supply control system according to claim 3, wherein the data completion time TfiComprises the following steps:
Tfi＝Tsti+Tti
in the formula, TstiThe transmission time is started for the data.
5. The gravure centralized ink supply control system Glink protocol adaptive control scheduling method according to claim 2, wherein the gravure centralized ink supply control system Glink protocol adaptive control scheduling method is characterized in thatTurn-over time with right WciComprises the following steps:
6. the adaptive control scheduling method under the Glink protocol of the gravure centralized ink supply control system according to claim 5, wherein the average weighted turnaround time WacComprises the following steps:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210067299.7A CN114390122A (en) | 2022-01-20 | 2022-01-20 | Adaptive control scheduling method under Glink protocol of gravure centralized ink supply control system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210067299.7A CN114390122A (en) | 2022-01-20 | 2022-01-20 | Adaptive control scheduling method under Glink protocol of gravure centralized ink supply control system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114390122A true CN114390122A (en) | 2022-04-22 |
Family
ID=81203059
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210067299.7A Pending CN114390122A (en) | 2022-01-20 | 2022-01-20 | Adaptive control scheduling method under Glink protocol of gravure centralized ink supply control system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114390122A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116720712A (en) * | 2023-08-07 | 2023-09-08 | 泰能天然气有限公司 | Gas emergency dispatch data management system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104079501A (en) * | 2014-06-05 | 2014-10-01 | 深圳市邦彦信息技术有限公司 | Queue scheduling method based on multiple priorities |
| US20150324230A1 (en) * | 2014-05-09 | 2015-11-12 | Tsinghua University | Multi-resource task scheduling method |
| CN108449285A (en) * | 2018-03-01 | 2018-08-24 | 中国航空无线电电子研究所 | Fraction dispatching method applied to shared Ethernet |
| US20210029052A1 (en) * | 2019-07-22 | 2021-01-28 | Research & Business Foundation Sungkyunkwan University | Methods and apparatuses for packet scheduling for software- defined networking in edge computing environment |
-
2022
- 2022-01-20 CN CN202210067299.7A patent/CN114390122A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150324230A1 (en) * | 2014-05-09 | 2015-11-12 | Tsinghua University | Multi-resource task scheduling method |
| CN104079501A (en) * | 2014-06-05 | 2014-10-01 | 深圳市邦彦信息技术有限公司 | Queue scheduling method based on multiple priorities |
| CN108449285A (en) * | 2018-03-01 | 2018-08-24 | 中国航空无线电电子研究所 | Fraction dispatching method applied to shared Ethernet |
| US20210029052A1 (en) * | 2019-07-22 | 2021-01-28 | Research & Business Foundation Sungkyunkwan University | Methods and apparatuses for packet scheduling for software- defined networking in edge computing environment |
Non-Patent Citations (1)
| Title |
|---|
| 戚小莎;王宏志;胡黄水;: "工业以太网自适应调度算法", 长春工业大学学报 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116720712A (en) * | 2023-08-07 | 2023-09-08 | 泰能天然气有限公司 | Gas emergency dispatch data management system |
| CN116720712B (en) * | 2023-08-07 | 2023-12-29 | 泰能天然气有限公司 | Gas emergency dispatch data management system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112105080B (en) | Time-sensitive network data transmission system and transmission method | |
| CN114422448B (en) | Time-sensitive network traffic shaping method | |
| CN107257311B (en) | Time-triggered communication hybrid data transmission scheduling method based on virtual link | |
| Alves et al. | Real-time communications over hybrid wired/wireless PROFIBUS-based networks | |
| CN106921591B (en) | Method for processing critical service burst in airborne navigation electric network | |
| CN114830611A (en) | Centralized network configuration entity and time-sensitive network control system comprising same | |
| CN112769514A (en) | Time-sensitive based communication device | |
| CN114390122A (en) | Adaptive control scheduling method under Glink protocol of gravure centralized ink supply control system | |
| JP2022537607A (en) | Method for transmitting data packets and apparatus for implementing this method | |
| CN114666280A (en) | Industrial internet time delay optimization method based on time sensitive software defined network | |
| CN112688812B (en) | Reliability perception time-sensitive network routing method applied to power data transmission | |
| CN107645455A (en) | A kind of message transmission dispatching method of CAN | |
| US20230239248A1 (en) | Traffic shaping method and apparatus | |
| CN106549848A (en) | Improved dynamic measurable P-adhere to that CSMA/CD medium access control is designed | |
| Peng et al. | HybridPass: Hybrid scheduling for mixed flows in datacenter networks | |
| CN110138686B (en) | Ethernet design method based on dynamic secondary feedback scheduling | |
| CN114205309A (en) | Frame sending time accurate calculation method facing TSN output interface | |
| Yang et al. | Research on two-level priority polling access control protocol based on continuous time | |
| CN105847181B (en) | A kind of prediction technique applied to Input queue switch distributed scheduling algorithm | |
| Ishak et al. | Performance evaluation using Markov model for a novel approach in Ethernet based embedded networked control communication | |
| CN114205313B (en) | Scheduling optimization method for multicast request transmission under optical circuit switching | |
| Moraes et al. | A probabilistic analysis of traffic separation in shared Ethernet systems using the h-BEB collision resolution algorithm | |
| CN113407319B (en) | Barrelfish-based time-triggered real-time scheduling method | |
| CN117336885B (en) | Access method and system of two-dimensional probability P-CSMA improved protocol | |
| US20240137333A1 (en) | Method for performing switching function and switching device |
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 |