CN114650261A - Reordering scheduling method in time-sensitive network queue - Google Patents
Reordering scheduling method in time-sensitive network queue Download PDFInfo
- Publication number
- CN114650261A CN114650261A CN202210172359.1A CN202210172359A CN114650261A CN 114650261 A CN114650261 A CN 114650261A CN 202210172359 A CN202210172359 A CN 202210172359A CN 114650261 A CN114650261 A CN 114650261A
- Authority
- CN
- China
- Prior art keywords
- queue
- traffic
- time
- priority
- service
- 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
- 238000000034 method Methods 0.000 title claims abstract description 20
- 238000013507 mapping Methods 0.000 claims abstract description 4
- 230000005540 biological transmission Effects 0.000 claims description 28
- 238000004422 calculation algorithm Methods 0.000 claims description 23
- 238000004364 calculation method Methods 0.000 claims description 5
- 238000012544 monitoring process Methods 0.000 description 13
- 238000012360 testing method Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 5
- 238000004088 simulation Methods 0.000 description 4
- 230000006854 communication Effects 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 230000000903 blocking effect Effects 0.000 description 2
- 238000009529 body temperature measurement Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000000737 periodic effect Effects 0.000 description 2
- 238000007493 shaping process Methods 0.000 description 2
- 230000011664 signaling Effects 0.000 description 2
- 206010063385 Intellectualisation Diseases 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000009472 formulation Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 238000012913 prioritisation Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000000779 smoke Substances 0.000 description 1
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/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/6285—Provisions for avoiding starvation of low priority queues
-
- 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 relates to a reordering scheduling method in a time-sensitive network queue, which comprises the following steps: s1, receiving the service flow packet and mapping the service flow packet to each queue; s2, calculating the priority of the service traffic packet in the TT queue; s3, reordering the service packets in the TT queue according to the calculated priority; s4, transmitting the sequenced flow packets according to the gating list; s5, returning to S1, and repeating the steps. Compared with the prior art, the invention meets the time delay requirement of the time sensitive stream service and reduces the maximum time delay and the packet loss rate of the time sensitive stream.
Description
Technical Field
The present invention relates to time sensitive networks, and more particularly to traffic scheduling for time sensitive networks.
Background
In recent years, the traditional field production and manufacturing mode is gradually changed by the industrial internet of things (IIoT), data exchange among industrial equipment is allowed, and the field environment is monitored in real time through a high-precision sensor, so that production informatization and intellectualization are realized. To meet the stringent requirements of industrial field applications to determine real-time transmission, the IEEE802.1 working group developed a universal real-time ethernet standard, i.e., the IEEE802.1 time-sensitive network (TSN) standard, seeking to provide deterministic ethernet functionality based on clock synchronization, traffic shaping, data frame preemption, centralized network configuration.
For further clarity of the description of the time-sensitive network structure, fig. 1 shows a network topology structure of the time-sensitive network testing system. The whole test system comprises five parts of a Talker, a Listener, a TSN adapter, a TSN domain and a TSN test instrument: the Talker and the Lister are respectively used as devices for sending and receiving flow; the TSN adapter aims to convert industrial control network data into time sensitive data; the TSN domain integrates CUC (computer for collecting terminal requirements) and CNC (network parameter configuration according to terminal requirements) functions, and is used for realizing scheduling management of various flows in the TSN domain; the TSN test instrument is used for testing performance indexes such as time-sensitive network related mechanisms, network time delay and the like. The TSN switch has a gPTP wide area time synchronization function. Through the cooperative cooperation of all parts, the system meets the requirements of IEEE802.1 AS and IEEE802.1Qbv standards, and the realization conditions of related functions and performances can be verified through indexes such AS time delay in a test instrument test system.
The key of the time-sensitive network technology is a traffic scheduling and shaping algorithm, which is also a hotspot of deep research in academic circles. The TSN is a "bridging network, and is internally connected by switches, there is a data queue in the switches, the data enters the switches to form a queue, how the data in the queue is transmitted is determined by a Shaper (sharp), ieee802.1qbv defines a time-aware Shaper tas (timeaware sharp), as shown in fig. 2, in TAS, a gating list gcl (gatecontrollist) periodically controls the opening/closing of gates, TAS requires time synchronization of all bridges from the sender (Talker) to the receiver (Listener), for each port in the bridge, the TAS performs switch actuation according to a known and agreed-upon schedule, while data scheduling may be defined according to the priority of each node and queue, in an ieee802.1qbv implementation, those data streams that require real-time transmission are typically scheduled for transmission first, this is "scheduletrafficquickene", which needs to be determined in advance when time scheduling configuration; while the other queue, called "reserved traffic", is understood to be a reserved channel, which is not periodic but has a high urgency and requires immediate transmission when it arrives. The transmitted data can be divided into time-sensitive traffic (TT traffic) and non-time-sensitive traffic (non-TT traffic), the time-sensing shaper can distinguish the TT traffic from the non-TT traffic, and the time-sensitive traffic enters a queue with high transmission priority for transmission.
After entering various data flows into the queue, various flows already in the queue can be further prioritized in the queue, and high-priority flow priority transmission in the queue is realized. The existing priority ranking algorithm of the service flow in the transmission queue only passes through a formula according to two parameters, namely time t when the flow reaches a node and flow cut-off time d:
the method has the advantages that simple calculation is carried out, the transmission time of flow is not considered, the accuracy of the calculated service priority is not high, partial service time delay is high easily, and the use experience of customers is influenced. The existing in-queue priority ranking algorithm is low in accuracy, and the calculated priority of a service is still the highest after the service is transmitted due to the fact that the priority of the service is high and the data packet size of the service is large in periodic services, so that the same type of service always occupies a queue transmission channel, other services cannot be transmitted, and the requirement in practical application cannot be met.
There are both centralized and distributed TSN network topologies. The dispatching list (gating list) of the centralized TSN is calculated by the CNC of the central node and is issued to each TSN switch, and the dispatching list of the distributed TSN is calculated and configured by the TSN switches in the network. The in-queue priority algorithm may be configured in both the TSNCNC node and the TSN switch, or in either of them. The specific components of the TSN switch are shown in fig. 3, and the in-queue priority algorithm is built in the memory of the TSN switch, that is, the On-Chip SRAM memory in fig. 3.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a novel method for arranging the priority in the queue, which can more accurately calculate the emergency degree of the service in the queue, thereby reordering the service flow packets in the queue to meet the time delay required by each service, effectively reducing the maximum time delay of the time sensitive flow service, and simultaneously solving the problems brought by the original queue reordering formula, namely, under the condition that each queue in a network always has a packet to be sent, the service with high time delay requirement has higher priority and is always transmitted, the service with low time delay requirement has low priority and cannot be transmitted for a long time. Compared with the existing priority ranking algorithm, the method makes good balance, meets the time delay requirement of the time sensitive stream service, and reduces the maximum time delay and the packet loss rate of the time sensitive stream.
The invention adopts the following technical scheme:
a reordering scheduling method in a time sensitive network queue is characterized by comprising the following steps:
s1, receiving a service flow packet and mapping the service flow packet to each queue;
the service flow comprises TT flow, namely time sensitive flow and non-TT flow, wherein the non-TT flow comprises audio and video flow, namely AVB flow, and best effort flow, namely BE flow; the TSN switch maps TT flow and non-TT flow to different queues respectively according to different service flow time delay requirements; each queue has a door with two states, an open state and a closed state; frames waiting in the queue are eligible for forwarding only when the associated door is open, and frames in the queue are in a wait-for-forwarding state during the closing of the associated door.
S2, calculating the priority of the service flow packets in the TT queue;
after the flow is mapped to each queue, the priority of a TT flow packet in the TT queue is calculated according to a reordering algorithm in the queue, the priority is determined according to the value of W, the smaller the value of W, the higher the priority, and the calculation formula of W is as follows:
wherein, t represents the time when the traffic reaches the node, d represents the deadline of each type of traffic, t0 represents the current time, a is a positive value and represents the weight of the remaining transmittable time, and the value of a can be changed according to the service scene, so as to reduce W by using the a x (d-t0) item and improve the priority of the traffic packet which is not transmitted.
S3, reordering the service flow packets in the TT queue according to the calculated priority;
and according to the W value calculated in the S2, sorting the TT traffic packets according to the sequence of the W value from small to large, and placing the traffic packets with small W value in front of the queue for transmission. TT flow packets with smaller W values are higher in emergency priority and are arranged at the front of the queue for transmission, so that the more emergency service packets are transmitted preferentially.
S4, transmitting the sequenced service flow packets according to the gating list;
the generation of the gating list belongs to the prior art, and the method does not specifically discuss the generation method of the gating list. The gating list comprises the opening and closing states of all the queue gates and the opening and closing time corresponding to all the gates. And the TSN switch transmits non-TT traffic packets and reordered TT traffic packets according to the time slots distributed by each queue in the gating list.
S5, returning to S1, and repeating the steps.
Compared with the prior art, the invention has the beneficial effects that:
1. when calculating the service priority in the queue of the TSN switch, the remaining transmissible time (waiting time) of the blocked service flow is additionally considered as a new input parameter, and the improved formula of the invention can solve the problem of low-priority service blocking in the queue. The existing scheme also has a queue sorting algorithm, but the algorithm only considers the priority of the incoming service, which is likely to happen, the high priority is frequently scheduled (sent), and the low priority is blocked for a long time and finally overtimes, and the transmission fails.
2. The scheduling problem of various time sensitive stream service flows can be better weighted by the improved in-queue reordering algorithm, and the maximum time delay and the packet loss rate of the time sensitive streams are reduced.
Drawings
FIG. 1 is a network topology diagram of a conventional TSN testing system
FIG. 2 is a schematic diagram of a conventional time-sensitive network gating mechanism
FIG. 3 is a network topology diagram of a conventional TSN testing system
FIG. 4 is a flow chart of an in-queue prioritization algorithm of the present invention
FIG. 5 is a schematic diagram of the TSN switch smart grid networking (application example)
FIG. 6 is a diagram of in-queue reordering latency
FIG. 7 is a diagram of improved in-queue reordering latency
Detailed Description
The technical scheme of the invention is explained in detail in the following with the accompanying drawings.
The invention defines a new calculation method for rearranging the services in the queue according to the priority, as shown in fig. 4, the steps are as follows:
s1, receiving a service flow packet and mapping the service flow packet to each queue;
the TSN respectively maps the TT flow and the non-TT flow to different queues according to different requirements of service flow time delay, and each queue is provided with a door with two states, namely an open state and a closed state; frames waiting in the queue are eligible for forwarding only when the associated door is open, and frames in the queue are in a wait-to-forward state during the closing of the associated door. Fig. 2 is an exemplary diagram of a time-sensitive network gating mechanism, with a total of 8 queues, corresponding to 8 gates, with decreasing priority from left to right.
S2, calculating the priority of the service flow packets in the TT queue;
after the flow is mapped to each queue, the priority of the TT flow packet in the TT queue is calculated according to a reordering algorithm in the queue, the priority is determined according to the value of W, and the formula is as follows:
wherein t represents the time when the traffic reaches the node, d represents the deadline of each type of traffic, t0 represents the current time, a is a positive value and represents the weight of the remaining transmissible time, the value of a can be changed according to the service scene, in order to reduce W by using the item a x (d-t0), and improve the priority of the traffic packet which is not transmitted (the value of a is fixed after setting, the values of d and t of a certain service are fixed, when there is a service which has higher priority to transmit but not to be transmitted after the service reaches the switch, the d-t0 of the service becomes smaller as t0 increases, at this time a x (d-t0) decreases,
unchanged so that the W value of the untransmitted traffic packet becomes small and the priority is raised).
S3, reordering the service flow packets in the TT queue according to the calculated priority;
and according to the W value calculated in the S2, sorting the TT traffic packets according to the sequence of the W value from small to large, and placing the traffic packets with small W value in front of the queue for transmission. TT flow packets with smaller W values are higher in emergency priority and are arranged at the front of the queue for transmission, so that the more emergency service packets are transmitted preferentially.
S4, transmitting the sequenced service flow packets according to the gating list;
the generation of the gating list belongs to the prior art, and the method does not specifically discuss the generation method of the gating list. The gating list comprises the opening and closing states of all the queue gates and the opening and closing time corresponding to all the gates. And the TSN switch transmits non-TT traffic packets and reordered TT traffic packets according to the time slots distributed by each queue in the gating list.
S5, returning to S1, and repeating the steps.
The embodiment is as follows: intelligent transformer substation
In the smart grid, with continuous development and evolution of services, higher stable requirements are provided for transmission delay of some control signaling and sensing data, so that the smart grid is required to have the characteristics of low delay and low jitter when transmitting data streams such as time sensitive data packets, key services, real-time signaling and the like. The problem of large transmission delay and large jitter of time-sensitive data streams in the network communication process can be solved by adopting a two-layer technology-TSN characteristic.
The networking schematic diagram of the smart grid of the TSN switch is shown in FIG. 5, and a GPS is responsible for positioning and calibrating functions of position information; the monitoring master station comprises a plurality of subsystems such as an environment monitoring subsystem, a video monitoring subsystem, a security monitoring subsystem, a fire-fighting monitoring subsystem, a linkage control subsystem, a temperature measurement monitoring subsystem, an electric power monitoring subsystem and the like, realizes all-weather state monitoring and intelligent control of indoor environment, and finishes acquisition and monitoring of data such as station-end audio and video, environmental data, safety precaution and the like by taking network communication as a core; the engineer station completes the sending and execution of the control command by an engineer; the motion host ensures the power supply of the intelligent substation; the router is configured with an indoor wireless communication function; the circuit breaker can collect emergency execution commands and data, and guarantee the processing and protection of information under emergency conditions.
And transmitting the collected information traffic to the TSN switch by each part of site and device to realize transmission in the TSN network. Video monitoring flow, voltage and current measurement data, room temperature measurement data, smoke sensor monitoring data and the like collected by a monitoring main station enter a TSN (traffic to network) switch together with an emergency control command sent by a circuit breaker, and various data flows are firstly distinguished by a time perception shaper (TAS), for example, the control command sent by the circuit breaker is divided into time sensitive flow (TT flow), and the room temperature monitoring data and the like are divided into non-time sensitive flow (non-TT flow). And the divided flow enters each queue according to the type to wait for transmission.
The algorithm proposed according to the scheme can be further developed in the queue to reorder the priority in the queue, the existing algorithm only considers the priority of the entering service, which is likely to happen, TT flow service with high time delay requirement in the same queue is frequently sent, TT service flow with low time delay requirement is blocked to cause packet loss, for example, a control command sent by a breaker with high time delay requirement is frequently scheduled (sent), and GPS positioning calibration flow with loose transmission cut-off time requirement is frequently blocked and finally overtime, and transmission fails. The invention additionally considers the residual transmissible time (waiting time) of the blocked traffic flow as a new input parameter at the queue position of the TSN switch, and the improved formula of the invention can solve the problem of blocking timeout of mixed TT traffic flow in the queue.
In-queue priority algorithm formulation according to the invention
When a certain TT flow business occupies the transmission queue for a long time and a plurality of periods in the queue, the waiting time of other TT flow business flow is prolonged during the priority calculation, and t0 is increased, so that W is decreased, the priority of the business is improved, the transmission is realized, and the problem that the same TT flow business occupies the transmission queue for a long time and a plurality of periods can be effectively solved.
And after the priority in the queue is sequenced, the data can be transmitted according to the generated gating list.
Simulation example
matlab simulation test:
1. testing equipment: computer desk
2. And (3) testing software: MATLAB R2019b software
3. Setting a network model: writing MATLAB algorithm codes, wherein the relevant parameters of the network model are set as follows: 200 data packet generating nodes and 1 data packet receiving node are arranged in the network, and a TSN switch connects the 200 flow generating nodes and the data packet receiving nodes. The switch is internally provided with a buffer queue, two traffic types are set, traffic is generated according to a Poisson distribution model, lambda is set to be 600us, service traffic packets which arrive are stored in the buffer queue, and the arrival time t, the current time t0, the cut-off time d, the priority and the traffic packet type of each traffic packet which arrives at the TSN switch are recorded in the queue. The timeout time is set to 200 us. And when the deadline time of a flow packet in the queue is less than the current time, discarding the flow packet when the flow packet is overtime, deleting the flow packet from the queue, and finally counting the packet loss rate and the flow transmission delay.
And respectively testing the flow packet delay and the packet loss rate of the reordering algorithm in the queue and the improved reordering algorithm in the queue by using the network model.
4. And (3) simulation result analysis: as shown in fig. 6 and 7, the abscissa represents the delay of the service traffic packet, the ordinate represents the distribution quantity of the service packets, and the packet loss rate is directly calculated by MATLAB. As shown in fig. 7, the improved reordering algorithm service packet time in the queue is within 113us, and the packet loss rate is 0%; as shown in fig. 6, the maximum time delay of the service packet of the reordering algorithm in the original queue is 200us, and the packet loss rate is about 6.1%. Simulation results show that the improved in-queue reordering algorithm has obviously improved low-priority service packet delay and packet loss rate compared with the in-queue reordering algorithm while meeting the requirement of high-priority delay.
Claims (5)
1. A reordering scheduling method in a time sensitive network queue is characterized by comprising the following steps:
s1, receiving a service flow packet and mapping the service flow packet to each queue; the service traffic comprises TT traffic and non-TT traffic, wherein the TT traffic is time sensitive traffic, and the non-TT traffic comprises audio and video traffic (AVB traffic) and best effort traffic (BE traffic); the TSN switch maps TT flow and non-TT flow to different queues respectively according to different service flow time delay requirements;
s2, calculating the priority of the service flow packets in the TT queue;
s3, reordering the service flow packets in the TT queue according to the calculated priority;
s4, transmitting the sequenced service flow packets according to the gating list;
and S5, returning to S1, and repeating the steps.
2. The method of claim 1, wherein the method further comprises: in step S1, each queue has a door with two states, namely an open state and a closed state; frames waiting in the queue are eligible for forwarding only when the associated door is open, and frames in the queue are in a wait-for-forwarding state during the closing of the associated door.
3. The method of claim 1, wherein the method further comprises: in step S2, the priority of the TT traffic packet in the TT queue is calculated according to the in-queue reordering algorithm, the priority is determined according to the value of W, the smaller the value of W, the higher the priority, and the calculation formula of W is as follows:
wherein t represents the time when the traffic reaches the node, d represents the deadline of each type of traffic, t0 represents the current time, a is a positive value and represents the weight of the remaining transmission time, and the value of a is changed according to the service scene, so as to reduce W by using the item a x (d-t0) and improve the priority of the traffic packet which is not transmitted.
4. The method of claim 1, wherein the method further comprises: in step S3, according to the W value calculated in step S2, the TT traffic packets are sorted in the order of the W value from small to large, and the traffic packets with the small W value are placed in front of the queue for transmission; TT flow packets with smaller W values are higher in emergency priority and are arranged at the front of the queue for transmission, so that the more emergency service packets are transmitted preferentially.
5. The method of claim 1, wherein the method further comprises: in step S4, the gate control list includes the switch states of the queue gates and the switch times corresponding to the gates; and the TSN switch transmits non-TT traffic packets and reordered TT traffic packets according to the time slots distributed by each queue in the gating list.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210172359.1A CN114650261A (en) | 2022-02-24 | 2022-02-24 | Reordering scheduling method in time-sensitive network queue |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210172359.1A CN114650261A (en) | 2022-02-24 | 2022-02-24 | Reordering scheduling method in time-sensitive network queue |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114650261A true CN114650261A (en) | 2022-06-21 |
Family
ID=81992757
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210172359.1A Pending CN114650261A (en) | 2022-02-24 | 2022-02-24 | Reordering scheduling method in time-sensitive network queue |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114650261A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115103450A (en) * | 2022-08-24 | 2022-09-23 | 中国信息通信研究院 | Multi-service time slot distribution method and equipment |
| CN116319598A (en) * | 2023-05-19 | 2023-06-23 | 工业富联(佛山)产业示范基地有限公司 | Mechanical arm control method, time-sensitive switch and storage medium |
| CN116566995A (en) * | 2023-07-10 | 2023-08-08 | 安徽中科晶格技术有限公司 | Block chain data transmission method based on classification and clustering algorithm |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160063655A1 (en) * | 2014-08-29 | 2016-03-03 | Think Through Learning, Inc. | Systems and methods for optimizing queuing web-based live tutoring |
| EP3046298A1 (en) * | 2015-01-15 | 2016-07-20 | Alcatel Lucent | Earliest deadline first scheduling system |
| CN107347201A (en) * | 2017-07-07 | 2017-11-14 | 云南大学 | A kind of wireless sensor network polling system control method based on priority |
| CN111404837A (en) * | 2019-01-02 | 2020-07-10 | 中国移动通信有限公司研究院 | Data transmission control method, network equipment and system |
| WO2020191014A1 (en) * | 2019-03-19 | 2020-09-24 | Futurewei Technologies, Inc. | Latency based forwarding of packets with dynamic priority destination policies |
| CN112291161A (en) * | 2020-10-10 | 2021-01-29 | 燕山大学 | Time-sensitive network mixed flow scheduling method |
| CN112996116A (en) * | 2021-01-28 | 2021-06-18 | 国网冀北电力有限公司 | Resource allocation method and system for guaranteeing quality of power time delay sensitive service |
| CN113572706A (en) * | 2021-06-16 | 2021-10-29 | 燕山大学 | Self-adaptive hierarchical scheduling method for boundary-free cooperative control time-sensitive network |
-
2022
- 2022-02-24 CN CN202210172359.1A patent/CN114650261A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160063655A1 (en) * | 2014-08-29 | 2016-03-03 | Think Through Learning, Inc. | Systems and methods for optimizing queuing web-based live tutoring |
| EP3046298A1 (en) * | 2015-01-15 | 2016-07-20 | Alcatel Lucent | Earliest deadline first scheduling system |
| CN107347201A (en) * | 2017-07-07 | 2017-11-14 | 云南大学 | A kind of wireless sensor network polling system control method based on priority |
| CN111404837A (en) * | 2019-01-02 | 2020-07-10 | 中国移动通信有限公司研究院 | Data transmission control method, network equipment and system |
| WO2020191014A1 (en) * | 2019-03-19 | 2020-09-24 | Futurewei Technologies, Inc. | Latency based forwarding of packets with dynamic priority destination policies |
| CN112291161A (en) * | 2020-10-10 | 2021-01-29 | 燕山大学 | Time-sensitive network mixed flow scheduling method |
| CN112996116A (en) * | 2021-01-28 | 2021-06-18 | 国网冀北电力有限公司 | Resource allocation method and system for guaranteeing quality of power time delay sensitive service |
| CN113572706A (en) * | 2021-06-16 | 2021-10-29 | 燕山大学 | Self-adaptive hierarchical scheduling method for boundary-free cooperative control time-sensitive network |
Non-Patent Citations (2)
| Title |
|---|
| 刘浩林: ""面向智能生产线的TSN安全协议栈研究与应用"", 《硕士电子期刊 2020年第07期》 * |
| 柯鹏;金姗姗;李文翔;: "面向多业务通信调度的优先级排队模型研究", 计算机科学 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115103450A (en) * | 2022-08-24 | 2022-09-23 | 中国信息通信研究院 | Multi-service time slot distribution method and equipment |
| CN115103450B (en) * | 2022-08-24 | 2023-01-13 | 中国信息通信研究院 | Multi-service time slot allocation method and equipment |
| CN116319598A (en) * | 2023-05-19 | 2023-06-23 | 工业富联(佛山)产业示范基地有限公司 | Mechanical arm control method, time-sensitive switch and storage medium |
| CN116319598B (en) * | 2023-05-19 | 2023-11-07 | 工业富联(佛山)产业示范基地有限公司 | Time-sensitive mechanical arm control method, switch and storage medium |
| CN116566995A (en) * | 2023-07-10 | 2023-08-08 | 安徽中科晶格技术有限公司 | Block chain data transmission method based on classification and clustering algorithm |
| CN116566995B (en) * | 2023-07-10 | 2023-09-22 | 安徽中科晶格技术有限公司 | Block chain data transmission method based on classification and clustering algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112105080B (en) | Time-sensitive network data transmission system and transmission method | |
| CN114650261A (en) | Reordering scheduling method in time-sensitive network queue | |
| CN110943899B (en) | EPA industrial bus and time sensitive network adaptation system and method | |
| CN106656851B (en) | Queue scheduling method for sink node of terminal communication access network of power system | |
| WO2023273385A1 (en) | 5g and tsn joint scheduling method based on wireless channel information | |
| Sidhu et al. | Packet scheduling of GOOSE messages in IEC 61850 based substation intelligent electronic devices (IEDs) | |
| León et al. | Simulation models for IEC 61850 communication in electrical substations using GOOSE and SMV time-critical messages | |
| Das et al. | Analysis of end-to-end delay characteristics for various packets in IEC 61850 substation communications system | |
| CN114666280A (en) | Industrial internet time delay optimization method based on time sensitive software defined network | |
| CN112821977A (en) | Asynchronous low-delay time sensitive data processing method | |
| CN106341296A (en) | Method of avoiding data message collision in communication network within transformer substation | |
| CN112311623B (en) | Time-sensitive network test platform and test method applied to train | |
| Das et al. | Comparison study of various factors affecting end-to-end delay in IEC 61850 substation communications using OPNET | |
| Ingalalli et al. | SCD based IEC 61850 traffic estimation for substation automation networks | |
| Kanabar | Investigating performance and reliability of process bus networks for digital protective relaying | |
| CN114785682B (en) | IEC 61850-based TSN network configuration method, device, equipment and medium | |
| Fu et al. | A survey of traffic shaping technology in internet of things | |
| EP4099649A1 (en) | Integrated scheduler for iec/ieee 60802 end-stations | |
| Liang et al. | Intelligent Substation Switch Traffic Scheduling Model Based on Time-Sensitive Network | |
| Huang et al. | Time-sensitive network technology and its application in energy internet | |
| CN115499343B (en) | Time delay analysis method, system, equipment and storage medium based on effective competitive stream | |
| Chai et al. | Research on Multi-priority Real-time Data Transmission Scheduling Method for Intelligent Production Line | |
| Xu et al. | Assessment and Quantify the Impact of Different Data Flow Control Methods on Digital Substation Communication Network | |
| Rahouti et al. | QoSP: A priority-based queueing mechanism in software-defined networking environments | |
| Sun et al. | Real-time signal time delay analysis of WAMS based on MPLS VPN technology |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20220621 |