CN112822268A - IP layer packet scheduling algorithm for multi-service coexistence and deterministic network requirements in industrial Internet of things - Google Patents
IP layer packet scheduling algorithm for multi-service coexistence and deterministic network requirements in industrial Internet of things Download PDFInfo
- Publication number
- CN112822268A CN112822268A CN202110010472.5A CN202110010472A CN112822268A CN 112822268 A CN112822268 A CN 112822268A CN 202110010472 A CN202110010472 A CN 202110010472A CN 112822268 A CN112822268 A CN 112822268A
- Authority
- CN
- China
- Prior art keywords
- priority
- data packet
- queue
- time
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 claims abstract description 95
- 238000000034 method Methods 0.000 claims abstract description 21
- 238000004364 calculation method Methods 0.000 claims abstract description 9
- NUHSROFQTUXZQQ-UHFFFAOYSA-N isopentenyl diphosphate Chemical compound CC(=C)CCO[P@](O)(=O)OP(O)(O)=O NUHSROFQTUXZQQ-UHFFFAOYSA-N 0.000 claims description 29
- 238000005070 sampling Methods 0.000 claims description 22
- 239000000126 substance Substances 0.000 claims description 6
- 230000004927 fusion Effects 0.000 abstract description 4
- 238000004458 analytical method Methods 0.000 abstract description 2
- 230000000737 periodic effect Effects 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 description 4
- 238000009776 industrial production Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Images
Classifications
-
- 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
-
- 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
Abstract
An IP layer data packet scheduling algorithm for multi-service coexistence and deterministic network requirements in an industrial Internet of things belongs to the technical field of real-time data transmission and multi-network fusion of the industrial Internet of things. The current data packet scheduling algorithm lacks analysis on the problem of coexistence of continuous periodic data and discrete control data in the industrial Internet of things. The algorithm considers the priority and the transmission delay of the data packet at the same time, obtains partial switching conditions of the hybrid switching system through a calculation formula of the maximum transmission delay of the data packet of each priority, and analyzes the scheduling process of the data packet by using a hybrid switching system model, thereby designing the data packet scheduling algorithm of an IP layer. The algorithm can be used for scheduling the data packets from different types of networks, so that multi-network fusion is realized, the real-time requirement of the data packets in the industrial Internet of things can be met, and the packet loss rate is reduced.
Description
Technical Field
The invention belongs to the technical field of real-time data transmission and multi-network fusion of industrial Internet of things, and relates to a scheduling algorithm for scheduling data packets on an IP layer according to priority and transmission time of the data packets and based on a hybrid switching system model.
Background
With the development of wireless networks and 5G technologies, multi-network convergence and multi-service coexistence have become problems which must be overcome in the field of industrial Internet of things research at present. Meanwhile, with the requirement of deterministic network application, how to ensure that each data packet can be timely sent out in the hybrid network application scene becomes a key. In order to meet the end-to-end low-delay requirement of the data packet of the industrial internet of things, a series of time-sensitive network (TSN) related standards are issued by the IEEE802.1 working group, and the real-time property of data packet transmission is ensured at a data link layer through technical standards such as clock synchronization, data stream scheduling strategies and the like. However, the relevant standards for time-sensitive networks apply only to the data link layer, and in order to extend the technology developed in TSNs to routers, the Internet Engineering Task Force (IETF) proposed deterministic networks (DetNet). Deterministic networks are a technology that helps to achieve IP networks from providing "best effort" network services to providing "on-time, accurate, fast" network services, controlling and reducing end-to-end delay, implementing deterministic transmission paths at the data link layer and IP layer that can provide worst-case bounds for delay, packet loss, and jitter, thereby providing deterministic delay. At present, how to design a data packet scheduling algorithm according to requirements is not mature between an IP layer and a data link layer, and particularly, data packet scheduling is carried out according to the priority and the transmission time of a data packet, and no relevant report is found.
Disclosure of Invention
The invention aims to overcome the defects of the existing technology and provide a scheduling algorithm for forwarding data packets from multiple different types or multiple same types of networks and data packets from multiple application services in an IP layer in an industrial Internet of things. The method simultaneously considers the priority and the transmission time of the data packet, obtains partial switching conditions of the hybrid switching system through a calculation formula of the maximum transmission time delay of the data packet of each priority, and analyzes the scheduling process of the data packet by using a hybrid switching system model, thereby designing a data packet scheduling algorithm of an IP layer, overcoming the problem that the real-time performance of the data packet with high requirements on time delay in the current industrial Internet of things, such as control class, can not be ensured, and simultaneously reducing the packet loss rate of the network.
In order to achieve the above object, the present invention provides a data packet scheduling algorithm based on data priority, transmission time and maximum transmission delay for industrial internet of things, which is an extension of the existing TCP/IP protocol architecture on the basis of the IP protocol layer. This method needs to be added to the IP layer at installation time. Meanwhile, the three parameter information of the data priority, the transmission time and the maximum transmission delay required by the method can be directly obtained through a network or obtained through simple calculation. The data priority can be obtained according to fixed field information in the data packet, which is specified in the protocol. On the premise of clock synchronization, the transmission time can be obtained by simply calculating the synchronized clock time and the time of the option record of the selectable field timestamp of the IP message specified by the protocol. The maximum transmission delay can be obtained by calculating a preset sampling period value required by industrial production and a delay specified by a protocol.
The technical scheme of the invention is as follows:
firstly, the data packet scheduling process is designed to be a hybrid switching model comprising two subsystems, namely a priority subsystem and a time priority subsystem. The data packets in the to-be-sent queue in the priority subsystem are sorted in a priority-first sorting mode, namely, the priority of the data packets is gradually reduced from the head of the queue to the tail of the queue, the data packets with the same priority are sorted in a descending order of transmission time, the data packets in the to-be-sent queue in the time priority subsystem are sorted in a time-first sorting mode, namely, the residual transmission time (the difference between the maximum transmission delay and the transmission time) of the data packets from the head of the queue to the tail of the queue is gradually increased, and the data packets with the same residual transmission time are sorted in a descending order of priority; secondly, calculating the most value of the average transmitted time of the queue data packet to be transmitted in the switching condition through related parameters; finally, the switching between subsystems is determined according to whether the state parameter (average transmitted time) of the subsystems meets the switching condition and whether a discrete event occurs, wherein the discrete event comprises the reception of a control data packet and the existence of a data packet to be overtime in a queue to be sent.
The specific steps of the data packet scheduling algorithm are as follows:
step 1, initialization: setting a current subsystem as a priority subsystem, and calculating the maximum transmission delay of each priority data packet according to the preset sampling period of each priority data packet in the industrial network and the maximum transmission delay of the data packet with the priority IPP specified in the network protocol;
maximum transmission delay
The maximum transmission delay of the data packet with the priority of IPP in the current industrial network is represented; the expression is as follows:
wherein, IPP belongs to {0,1,2,3,4,5,6,7}, which represents the sending priority of the IP message;
the method comprises the steps that a preset sampling period of a data packet with the priority of IPP in the current industrial network is set, and the theoretical maximum transmission delay of the data packet with the priority in the industrial network is equal to a preset sampling period value;
the maximum transmission delay of a data packet with the priority of IPP specified in the network protocol is represented; taking the smaller value of the preset sampling period of the data packet with the priority of IPP in the current industrial network and the maximum transmission delay of the data packet with the priority of IPP specified in the network protocol as the maximum transmission delay of network resource scheduling;
if the preset sampling period values of the data packets of different application programs with the same priority in the current industrial network are different, the maximum transmission delay is determined
The expression of (a) is as follows:
wherein i is less than or equal to Anum，AnumGenerating the same priority level data packet in the current industrial network but presetting the number of application programs with different sampling periods;
step 2, acquiring data types: when a data packet reaches an IP layer, extracting the priority of the data packet and the sending time recorded by the timestamp option; obtaining the round trip time RTT of a link between a forwarding node and a receiving end;
the data priority β is used to represent the priority of the current data packet in the scheduling process, and the expression is as follows:
wherein, IPP belongs to {0,1,2,3,4,5,6,7}, which represents the sending priority of the IP message, and the larger the numerical value is, the higher the priority is; IPPumFor the priority class, in the RFC standard, there are 8 priorities, i.e., IPPum8; so IPP<IPPumData priority β ∈ [0, 1); judging the data priority through beta, wherein the larger beta is, the higher the data priority is;
RFC 1323 introduces a timestamp option in an optional field of an IP message; when the flag field FL of the timestamp option is 3, recording the IP address of the sending end and the time for generating the data packet; when a data packet reaches an IP layer, extracting the priority of the data packet and a timestamp corresponding to an IP address with the same source address in the timestamp options of the data packet; on the premise of clock synchronization, the transmitting end or the forwarding node obtains the transmission time of the data packet through the difference between the current clock time and the data packet transmitting time recorded by the timestamp option, and T is usedtransRepresents; a sending end or a forwarding node obtains the round-trip delay of a link between the node and a receiving end through communication with the receiving end, and the round-trip delay is represented by RTT;
step 3, calculating state parameters: calculating the maximum value of the average transmitted time of the queue data packets to be transmitted in the switching condition by using the round-trip delay and the maximum transmission delay of the priority data packets; calculating the average transmitted time of the data packet of the current queue to be transmitted, wherein the expression is as follows:
wherein the content of the first and second substances,
maximum transmission delay of priority data packet corresponding to the data packet, RTT is round trip delay between the node and the receiving end, m is number of data packets in queue to be sentIPPThe number R of the data packets of the priority corresponding to the data packet in the queue to be sentmax、RminIs a coefficient; wherein: m is less than or equal to M, and M is the total length of the queue to be sent;
then, calculating the average transmitted time of the data packet in the current queue to be transmitted, wherein the average transmitted time T is used for representing the delay condition of the data packet in the current queue to be transmitted, and the expression is as follows:
the average transmitted time T of the IP message of the current queue to be transmitted is determined by the data priority beta and the transmission time TtransThe number m of the data packets in the queue to be sent is jointly determined, and the proportion of the transmission time of the data packets with high priority in the calculation is larger than that of the data packets with low priority; the larger the T is, the more the number of data packets close to the maximum transmission delay in the current queue to be sent is, and the more urgent the degree to be sent is;
and 4, subsystem switching judgment: judging whether a switching condition is met according to a current subsystem, wherein the switching condition of switching the priority subsystem to the time priority subsystem is that a discrete event of an overtime data packet to be sent exists in a queue to be sent, or the average transmitted time of a state parameter of the system to be sent in the queue is higher than the maximum value; the switching condition of switching the time-priority subsystem to the priority-priority subsystem is that the average transmitted time is lower than the minimum value, or the current queue to be sent contains a control data packet under the condition that the average transmitted time is lower than the maximum value;
when the transmission time T of the data packettransIt is considered to be about to time out when the following expression is satisfied:
wherein the content of the first and second substances,
the maximum transmission delay of the priority data packet corresponding to the data packet is obtained, and RTT is the round trip delay between the node and a receiving end;
if the switching condition is met, switching the subsystems, and inserting the newly received data packets into the proper position of the queue to be sent according to the ordering rule of the data packets in the queue to be sent of the switched subsystem; and if the switching condition is not met, directly inserting the newly received data packet into the proper position of the queue to be sent according to the sorting rule of the data packet in the queue to be sent of the current subsystem.
The data packet scheduling process needs to be designed as a hybrid switching model including a priority subsystem and a time priority subsystem, and the data packets in the to-be-sent columns in the two subsystems are sorted in the following manner: the data packets in the to-be-sent queue in the priority subsystem are sorted in a priority mode, namely, the priority of the data packets from the head of the queue to the tail of the queue is gradually reduced, the data packets with the same priority are sorted according to the sequence of transmission time from large to small, the data packets in the to-be-sent queue in the time priority subsystem are sorted in a time priority mode, namely, the residual transmission time of the data packets from the head of the queue to the tail of the queue is gradually increased, and the data packets with the same residual transmission time are sorted according to the sequence of the priority from high to low; the remaining transmission time is the difference between the maximum transmission delay and the transmission time.
The invention has the advantages that: the current data packet scheduling algorithm lacks analysis on the problem of coexistence of continuous periodic data and discrete control data in the industrial Internet of things. The algorithm considers the priority and the transmission delay of the data packet at the same time, obtains partial switching conditions of the hybrid switching system through a calculation formula of the maximum transmission delay of the data packet of each priority, and analyzes the scheduling process of the data packet by using a hybrid switching system model, thereby designing the data packet scheduling algorithm of an IP layer. The method is a method for determining the maximum transmission delay of each priority data packet by comprehensively considering the industrial production requirement and the protocol requirement; data packets from different types of networks are uniformly scheduled in an IP layer, so that multi-network fusion is realized; the method analyzes the scheduling process of the data packet by using a hybrid switching system model, solves the problem that the real-time performance of the data packet with high requirement on time delay in the control class and the like in the current industrial Internet of things cannot be ensured, and simultaneously reduces the packet loss rate of the network.
Drawings
Fig. 1 is a flow chart of a scheduling algorithm.
Fig. 2 is a network topology diagram suitable for use, and the scheduling algorithm may be run on any node that needs to send a data packet.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the accompanying drawings.
Referring to fig. 2, a suitable network topology of the present invention is described, which is based on data priority, transmission time and maximum transmission delay, and the algorithm can be run on the network terminal and forwarding node that have the requirement of sending data packet. The invention carries out unified scheduling on the data packets from different types of networks in the IP layer, thereby realizing multi-network integration. Meanwhile, the data packet scheduling process is analyzed by using the hybrid switching system model, so that the service quality of various types of data of the network is ensured, the problem that the real-time performance of the data packets with high requirements on time delay in the control class and the like in the current industrial Internet of things cannot be ensured is solved, and the packet loss rate of the network is reduced.
Referring to fig. 1, the following specific operation steps are combined with a link selection algorithm based on data priority, transmission time and maximum transmission delay of the present invention:
step 1, initialization. The current subsystem is set as a priority subsystem, the data packets in the to-be-transmitted row adopt a priority ordering mode, namely the priority of the data packets is gradually reduced from the head of the queue to the tail of the queue, and the data packets with the same priority are ordered according to the sequence of the transmission time from large to small. And calculating the maximum transmission time delay of each priority data packet according to the preset sampling period of each priority data packet in the industrial network and the maximum transmission delay of the data packet with the IPP as the priority specified in the network protocol.
Define 1 maximum transmission delay
Indicating the maximum transmission delay of data packets with priority IPP in the current industrial network. The expression is as follows:
wherein, IPP belongs to {0,1,2,3,4,5,6,7}, which represents the sending priority of the IP message.
And the preset sampling period of the data packet with the priority of IPP in the current industrial network is set. Because the normal operation of the industrial production can be ensured only when the transmission delay of the data packet with the priority of IPP in the network in the industrial production is less than or equal to the preset sampling period value, the theoretical maximum transmission delay of the data packet with the priority in the industrial network is equal to the preset sampling period value.
Indicating the maximum transmission delay of a data packet with IPP priority specified in the network protocol. And taking the smaller value of the preset sampling period of the data packet with the priority of IPP in the current industrial network and the maximum transmission delay of the data packet with the priority of IPP specified in the network protocol as the maximum transmission delay of network resource scheduling.
Expanding the maximum transmission delay if the preset sampling period values of the data packets of different application programs with the same priority in the current industrial network are different
The expression of (a) is as follows:
wherein i is less than or equal to Anum，AnumAnd generating the same priority data packet in the current industrial network but presetting the number of application programs with different sampling periods.
For example: assuming that the preset sampling periods of the packets with the priority of 4 in a certain industrial network are all the same and are 120ms, the sampling periods are the same
It is pointed out in the data link layer protocol ieee802.1q that the delay and jitter of the video data with priority 4 are less than 100ms, then
Then, substituting into expression (1), the maximum transmission delay of the data packet with priority 4 in the scheduling process
The calculation is as follows:
in summary, the expression (1) or (2) can calculate the theoretical maximum value of the transmission delay in the data packet scheduling process for a certain industrial network, and provide a basis for the calculation of the switching condition of the subsequent hybrid switching system model and the data packet scheduling.
And 2, acquiring the data type. When a data packet arrives at the IP layer, the priority of the data packet is extracted.
Defining 2 a data priority (β) to represent the priority of the current data packet in the scheduling process, wherein the expression is as follows:
wherein, IPP belongs to {0,1,2,3,4,5,6,7}, which represents the sending priority of the IP message, and the larger the value, the higher the priority. IPPumFor the priority class, in the RFC standard, there are 8 priorities, so IPPum8. By definition, the range of IPP is 0-7, and IPPumValue 8, therefore IPP<IPPumData priority β ∈ [0, 1). The data priority can be judged by beta, and the larger beta, the higher the data priority.
RFC 1323 introduced a TimeStamp (TimeStamp) option in an optional field of an IP message. When the flag Field (FL) of the time stamp option is 3, the IP address of the transmitting end and the time when the packet is generated can be recorded. When a data packet arrives at the IP layer, in addition to extracting the priority of the data packet, a timestamp corresponding to an IP address having the same source address in the timestamp options of the data packet needs to be extracted. On the premise of clock synchronization, the transmitting end or the forwarding node obtains the transmission time of the data packet through the difference between the current clock time and the data packet transmitting time recorded by the timestamp option, and T is usedtransAnd (4) showing. The sending end or the forwarding node obtains a Round-Trip Time (RTT) of a link between the node and the receiving end through communication with the receiving end.
And 3, calculating the state parameters. Calculating the maximum value of the average transmitted time of the data packets in the queue to be transmitted in the switching condition according to the round-trip delay obtained in the step 2 and the maximum transmission delay of the priority data packets obtained in the step 1, wherein the expression is as follows:
wherein the content of the first and second substances,
the maximum transmission delay of the priority data packet corresponding to the data packet is determined, RTT is the round-trip delay between the node and the receiving end, M is the number of data packets in the queue to be sent (M is less than or equal to M, M is the total length of the queue to be sent), M is the number of data packets in the queue to be sentIPPThe number R of the data packets of the priority corresponding to the data packet in the queue to be sentmax、RminThe coefficient is determined by experiments, and the value range is more than or equal to 80 percent Rmax≤90％，40％≤RminThe performance is better when the content is less than or equal to 60 percent.
Then, the average transmitted time of the data packet of the current queue to be transmitted is calculated.
An average transmitted time (T) is defined 3 to represent the delay of the data packet currently in the queue to be sent. The expression is as follows:
the average transmitted time T of the IP message of the current queue to be transmitted is determined by the data priority beta and the transmission time TtransAnd the number M of data packets in the queue to be sent (M is less than or equal to M, M is the total length of the queue to be sent) are determined together, and the proportion of the transmitted time of the high-priority data packets in the calculation is larger than that of the low-priority data packets. The larger the T is, the more the number of the data packets close to the maximum transmission delay in the current queue to be sent is, and the more urgent the degree to be sent is.
And 4, judging subsystem switching. Judging whether a switching condition is met according to a current subsystem, wherein the switching condition of switching the priority subsystem to the time priority subsystem is that a discrete event of an overtime data packet to be sent exists in a queue to be sent, or the average transmitted time of a state parameter of the system to be sent in the queue is higher than the maximum value; the switching condition of switching the time priority subsystem to the priority subsystem is that the average transmitted time is lower than the minimum value, or the current queue to be sent contains the control data packet under the condition that the average transmitted time is lower than the maximum value.
When the transmission time (T) of the data packettrans) It is considered to be about to time out when the following expression is satisfied:
wherein the content of the first and second substances,
and the maximum transmission delay of the priority data packet corresponding to the data packet is obtained, and the RTT is the round trip delay between the node and the receiving end.
If the switching condition is met, switching the subsystems, and inserting the newly received data packets into the proper position of the queue to be sent according to the ordering rule of the data packets in the queue to be sent of the switched subsystem; and if the switching condition is not met, directly inserting the newly received data packet into the proper position of the queue to be sent according to the sorting rule of the data packet in the queue to be sent of the current subsystem.
Claims (2)
1. An IP layer data packet scheduling algorithm facing multi-service coexistence and deterministic network requirements in an industrial Internet of things is characterized in that: firstly, designing a data packet scheduling process into a hybrid switching model comprising two subsystems, wherein the two subsystems are a priority subsystem and a time priority subsystem respectively; secondly, calculating the most value of the average transmitted time of the queue data packet to be transmitted in the switching condition through related parameters; finally, the switching between the subsystems is determined according to whether the state parameters of the subsystems meet the switching conditions and whether discrete events occur together, wherein the discrete events comprise received control data packets and data packets to be overtime in a queue to be sent;
the specific steps of the data packet scheduling algorithm are as follows:
step 1, initialization: setting a current subsystem as a priority subsystem, and calculating the maximum transmission delay of each priority data packet according to the preset sampling period of each priority data packet in the industrial network and the maximum transmission delay of the data packet with the priority IPP specified in the network protocol;
maximum transmission delay
The maximum transmission delay of the data packet with the priority of IPP in the current industrial network is represented; the expression is as follows:
wherein, IPP belongs to {0,1,2,3,4,5,6,7}, which represents the sending priority of the IP message;
the method comprises the steps that a preset sampling period of a data packet with the priority of IPP in the current industrial network is set, and the theoretical maximum transmission delay of the data packet with the priority in the industrial network is equal to a preset sampling period value;
the maximum transmission delay of a data packet with the priority of IPP specified in the network protocol is represented; taking the smaller value of the preset sampling period of the data packet with the priority of IPP in the current industrial network and the maximum transmission delay of the data packet with the priority of IPP specified in the network protocol as the maximum transmission delay of network resource scheduling;
if the preset sampling period values of the data packets of different application programs with the same priority in the current industrial network are different, the maximum transmission delay is determined
The expression of (a) is as follows:
wherein i is less than or equal to Anum，AnumGenerating the same priority level data packet in the current industrial network but presetting the number of application programs with different sampling periods;
step 2, acquiring data types: when a data packet reaches an IP layer, extracting the priority of the data packet and the sending time recorded by the timestamp option; obtaining the round trip time RTT of a link between a forwarding node and a receiving end;
the data priority β is used to represent the priority of the current data packet in the scheduling process, and the expression is as follows:
wherein, IPP belongs to {0,1,2,3,4,5,6,7}, which represents the sending priority of the IP message, and the larger the numerical value is, the higher the priority is; IPPumFor the priority class, in the RFC standard, there are 8 priorities, i.e., IPPum8; so IPP<IPPumData priority β ∈ [0, 1); judging the data priority through beta, wherein the larger beta is, the higher the data priority is;
RFC 1323 introduces a timestamp option in an optional field of an IP message; when the flag field FL of the timestamp option is 3, recording the IP address of the sending end and the time for generating the data packet; when a data packet reaches an IP layer, extracting the priority of the data packet and a timestamp corresponding to an IP address with the same source address in the timestamp options of the data packet; on the premise of clock synchronization, the transmitting end or the forwarding node obtains the transmission time of the data packet through the difference between the current clock time and the data packet transmitting time recorded by the timestamp option, and T is usedtransRepresents; the transmitting end or forwarding node communicates with the receiving endObtaining the round trip delay of a link between the node and a receiving end, and expressing the round trip delay by using RTT;
step 3, calculating state parameters: calculating the maximum value of the average transmitted time of the queue data packets to be transmitted in the switching condition by using the round-trip delay and the maximum transmission delay of the priority data packets; calculating the average transmitted time of the data packet of the current queue to be transmitted, wherein the expression is as follows:
wherein the content of the first and second substances,
maximum transmission delay of priority data packet corresponding to the data packet, RTT is round trip delay between the node and the receiving end, m is number of data packets in queue to be sentIPPThe number R of the data packets of the priority corresponding to the data packet in the queue to be sentmax、RminIs a coefficient; wherein: m is less than or equal to M, and M is the total length of the queue to be sent;
then, calculating the average transmitted time of the data packet in the current queue to be transmitted, wherein the average transmitted time T is used for representing the delay condition of the data packet in the current queue to be transmitted, and the expression is as follows:
the average transmitted time T of the IP message of the current queue to be transmitted is determined by the data priority beta and the transmission time TtransThe number m of the data packets in the queue to be sent is jointly determined, and the proportion of the transmission time of the data packets with high priority in the calculation is larger than that of the data packets with low priority; the larger T is, the more the current queue to be sent is close to the maximumThe more the number of data packets of the transmission delay is, the more urgent the degree of transmission is;
and 4, subsystem switching judgment: judging whether a switching condition is met according to a current subsystem, wherein the switching condition of switching the priority subsystem to the time priority subsystem is that a discrete event of an overtime data packet to be sent exists in a queue to be sent, or the average transmitted time of a state parameter of the system to be sent in the queue is higher than the maximum value; the switching condition of switching the time-priority subsystem to the priority-priority subsystem is that the average transmitted time is lower than the minimum value, or the current queue to be sent contains a control data packet under the condition that the average transmitted time is lower than the maximum value;
when the transmission time T of the data packettransIt is considered to be about to time out when the following expression is satisfied:
wherein the content of the first and second substances,
the maximum transmission delay of the priority data packet corresponding to the data packet is obtained, and RTT is the round trip delay between the node and a receiving end;
if the switching condition is met, switching the subsystems, and inserting the newly received data packets into the proper position of the queue to be sent according to the ordering rule of the data packets in the queue to be sent of the switched subsystem; and if the switching condition is not met, directly inserting the newly received data packet into the proper position of the queue to be sent according to the sorting rule of the data packet in the queue to be sent of the current subsystem.
2. The IP layer packet scheduling algorithm facing multi-service coexistence and deterministic network requirements in the industrial Internet of things according to claim 1, characterized in that: the data packets in the to-be-sent column in the priority subsystem are ordered in the following manner: the data packets in the to-be-sent column in the priority subsystem are sorted in a priority mode, namely, the priority of the data packets is gradually reduced from the head of the queue to the tail of the queue, and the data packets with the same priority are sorted according to the sequence of transmission time from large to small; the data packets in the queue to be sent in the time-first subsystem are sorted in a time-first sorting mode, that is, the remaining transmission time of the data packets from the head of the queue to the tail of the queue is gradually increased, and the data packets with the same remaining transmission time are sorted according to the priority from high to low; the remaining transmission time is the difference between the maximum transmission delay and the transmission time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110010472.5A CN112822268B (en) | 2021-01-06 | 2021-01-06 | Multi-service coexistence and IP layer packet scheduling method in industrial Internet of things |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110010472.5A CN112822268B (en) | 2021-01-06 | 2021-01-06 | Multi-service coexistence and IP layer packet scheduling method in industrial Internet of things |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112822268A true CN112822268A (en) | 2021-05-18 |
| CN112822268B CN112822268B (en) | 2021-11-16 |
Family
ID=75857505
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110010472.5A Expired - Fee Related CN112822268B (en) | 2021-01-06 | 2021-01-06 | Multi-service coexistence and IP layer packet scheduling method in industrial Internet of things |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112822268B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113904994A (en) * | 2021-09-30 | 2022-01-07 | 天翼数字生活科技有限公司 | Method for uniformly reporting big data of home gateway to platform |
| CN114500511A (en) * | 2022-01-29 | 2022-05-13 | 联想(北京)有限公司 | Data transmission method and device and electronic equipment |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6188698B1 (en) * | 1997-12-31 | 2001-02-13 | Cisco Technology, Inc. | Multiple-criteria queueing and transmission scheduling system for multimedia networks |
| EP1089500A2 (en) * | 1999-09-30 | 2001-04-04 | Nortel Networks Limited | Fair packet scheduler and scheduling method for packet data radio |
| CN101442778A (en) * | 2008-12-23 | 2009-05-27 | 上海无线通信研究中心 | Scheduling method of high speed wireless personal network protocol based on channel |
| CN102970763A (en) * | 2012-11-01 | 2013-03-13 | 大唐移动通信设备有限公司 | Resource scheduling method and device based on service qualities |
| CN103514037A (en) * | 2012-06-21 | 2014-01-15 | 中兴通讯股份有限公司 | Task scheduling processing method and device |
| CN103973593A (en) * | 2014-05-09 | 2014-08-06 | 中国电子科技集团公司第三十研究所 | IP voice dispatching method |
| CN104038966A (en) * | 2013-03-05 | 2014-09-10 | 华为技术有限公司 | Data flow scheduling method and apparatus under long term evolution network |
| CN104734991A (en) * | 2013-12-19 | 2015-06-24 | 中国科学院沈阳自动化研究所 | End-to-end time delay guarantee transmission scheduling method oriented to industrial backhaul network |
| CN107431667A (en) * | 2015-03-20 | 2017-12-01 | 阿尔卡特朗讯公司 | Packet is dispatched in the network device |
| CN108200601A (en) * | 2017-11-30 | 2018-06-22 | 大连理工大学 | A kind of multilink selection method based on data priority, link state and traffic current density |
-
2021
- 2021-01-06 CN CN202110010472.5A patent/CN112822268B/en not_active Expired - Fee Related
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6188698B1 (en) * | 1997-12-31 | 2001-02-13 | Cisco Technology, Inc. | Multiple-criteria queueing and transmission scheduling system for multimedia networks |
| EP1089500A2 (en) * | 1999-09-30 | 2001-04-04 | Nortel Networks Limited | Fair packet scheduler and scheduling method for packet data radio |
| CN101442778A (en) * | 2008-12-23 | 2009-05-27 | 上海无线通信研究中心 | Scheduling method of high speed wireless personal network protocol based on channel |
| CN103514037A (en) * | 2012-06-21 | 2014-01-15 | 中兴通讯股份有限公司 | Task scheduling processing method and device |
| CN102970763A (en) * | 2012-11-01 | 2013-03-13 | 大唐移动通信设备有限公司 | Resource scheduling method and device based on service qualities |
| CN104038966A (en) * | 2013-03-05 | 2014-09-10 | 华为技术有限公司 | Data flow scheduling method and apparatus under long term evolution network |
| CN104734991A (en) * | 2013-12-19 | 2015-06-24 | 中国科学院沈阳自动化研究所 | End-to-end time delay guarantee transmission scheduling method oriented to industrial backhaul network |
| CN103973593A (en) * | 2014-05-09 | 2014-08-06 | 中国电子科技集团公司第三十研究所 | IP voice dispatching method |
| CN107431667A (en) * | 2015-03-20 | 2017-12-01 | 阿尔卡特朗讯公司 | Packet is dispatched in the network device |
| CN108200601A (en) * | 2017-11-30 | 2018-06-22 | 大连理工大学 | A kind of multilink selection method based on data priority, link state and traffic current density |
Non-Patent Citations (2)
| Title |
|---|
| N. DING等: "QoE-driven and traffic-flow-density-based link scheduling algorithm in LLC protocol for HetVNETs", 《2018 IEEE INTERNATIONAL CONFERENCE ON SMART INTERNET OF THINGS (SMARTIOT)》 * |
| 郭舒婷: "802.16 Qos调度和越区切换优化研究", 《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113904994A (en) * | 2021-09-30 | 2022-01-07 | 天翼数字生活科技有限公司 | Method for uniformly reporting big data of home gateway to platform |
| CN113904994B (en) * | 2021-09-30 | 2024-03-19 | 天翼数字生活科技有限公司 | Method for uniformly reporting big data of home gateway to platform |
| CN114500511A (en) * | 2022-01-29 | 2022-05-13 | 联想(北京)有限公司 | Data transmission method and device and electronic equipment |
| CN114500511B (en) * | 2022-01-29 | 2023-12-26 | 联想(北京)有限公司 | Data transmission method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112822268B (en) | 2021-11-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10044593B2 (en) | Smart ethernet edge networking system | |
| CN111684776B (en) | Method, control method and communication system for data communication in network | |
| CN112087804B (en) | Time-sensitive network gating time slot adjusting method and system | |
| CN112822268B (en) | Multi-service coexistence and IP layer packet scheduling method in industrial Internet of things | |
| CN101827027B (en) | Interlayer coordination-based home network QoS guarantee method | |
| CN102170663B (en) | 3G (The Third Generation Telecommunication)-based method and equipment for guaranteeing service quality in real-time transmission service | |
| JP2010500837A (en) | A method for optimizing information transfer in telecommunications networks. | |
| US8862768B2 (en) | Method and system for packetizing data for servicing traffic end-to-end | |
| CN113949665B (en) | Method, device, chip and computer storage medium for determining flow control threshold | |
| CN112671495A (en) | Method and system for adjusting deterministic time delay | |
| CN114666280B (en) | Industrial Internet time delay optimization method based on time-sensitive software defined network | |
| CN113630893A (en) | 5G and TSN joint scheduling method based on wireless channel information | |
| Imtiaz et al. | Approaches to reduce the latency for high priority traffic in IEEE 802.1 AVB networks | |
| JP2009246630A (en) | Home gateway device and communication quality control method of home gateway device | |
| CN115176427A (en) | Method for synchronizing control applications via a communication network transmitting time-critical data, network infrastructure device and communication terminal | |
| CN102469510A (en) | Content-aware active queue management (AQM) method for 3rd generation (3G) network video transmission | |
| CN114884811B (en) | Method for realizing centralized user configuration of time sensitive network | |
| CN114221912B (en) | Time-sensitive network access method for non-periodic time-triggered service flow | |
| EP2071777B1 (en) | Method of transmitting packets | |
| CN115622948A (en) | Data transmission method, device, equipment and storage medium based on service quality | |
| Fu et al. | A survey of traffic shaping technology in internet of things | |
| Min et al. | Traffic scheduling strategy of power communication network based on SDN | |
| CN115766613B (en) | Data transmission management method and system | |
| Welzl | PTP: better feedback for adaptive distributed multimedia applications on the Internet | |
| CN113784390A (en) | Wireless communication system for realizing network load dynamic distribution |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20211116 |