CN112291161A - Time-sensitive network mixed flow scheduling method - Google Patents

Time-sensitive network mixed flow scheduling method Download PDF

Info

Publication number
CN112291161A
CN112291161A CN202011076958.0A CN202011076958A CN112291161A CN 112291161 A CN112291161 A CN 112291161A CN 202011076958 A CN202011076958 A CN 202011076958A CN 112291161 A CN112291161 A CN 112291161A
Authority
CN
China
Prior art keywords
flow
queue
time
traffic
transmission
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
Application number
CN202011076958.0A
Other languages
Chinese (zh)
Other versions
CN112291161B (en
Inventor
袁亚洲
曹旭
陈彩莲
杨博
关新平
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Yanshan University
Original Assignee
Yanshan University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Yanshan University filed Critical Yanshan University
Priority to CN202011076958.0A priority Critical patent/CN112291161B/en
Publication of CN112291161A publication Critical patent/CN112291161A/en
Application granted granted Critical
Publication of CN112291161B publication Critical patent/CN112291161B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416—Real-time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/245—Traffic characterised by specific attributes, e.g. priority or QoS using preemption
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2483—Traffic characterised by specific attributes, e.g. priority or QoS involving identification of individual flows
    • 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

Landscapes

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

Abstract

The invention discloses a mixed traffic scheduling method of a time-sensitive network, which belongs to the technical field of time-sensitive networks of industrial Internet of things. On the basis of the gate control list, AVB and BE flow adopts a fuzzy control-based restricted preemption scheduling method. The method ensures that TT flow with the highest priority on site completes the determined real-time transmission, reduces AVB flow delay, ensures audio and video transmission quality, reduces bandwidth waste caused by AVB preemption to a certain extent, improves scheduling performance, and solves the scheduling problem of mixed flow common transmission.

Description

Time-sensitive network mixed flow scheduling method
Technical Field
The invention relates to the technical field of time-sensitive networks of industrial Internet of things, in particular to a time-sensitive network mixed flow scheduling method.
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.
At present, TSN-related research work focuses on time-sensitive traffic (TT traffic), excessively sacrifices time delay of non-TT traffic, audio and video traffic (AVB traffic) with the same relatively harsh requirement on time delay cannot arrive within an expiration date, and best effort traffic (BE traffic) in a network has certain interference, so that the transmission effect of mixed traffic cannot reach an expected standard. Because the research field of the TSN is relatively novel, and few workers finish the mixed transmission of 3 different types of flow, a new mixed flow scheduling method is provided to finish high-quality end-to-end transmission in an industrial field with coexisting multi-type flow.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a method for scheduling mixed traffic of a time-sensitive network, which ensures that TT traffic with the highest priority on site completes the determination of real-time transmission, reduces AVB traffic delay, ensures audio and video transmission quality, reduces bandwidth waste caused by AVB preemption to a certain extent, improves scheduling performance, and solves the scheduling problem of mixed traffic co-transmission.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows:
a time-sensitive network mixed flow scheduling method comprises the following steps:
step 1, defining characteristic parameters of each data frame of a network topology, wherein the flow in a flow set is represented by a six-tuple less than S, D, p, D, q and l, S represents a source node, D represents a target node, p represents a transmission period, D represents deadline, q represents a transmission queue ID, and l represents the length of a data frame. Wherein, each flow satisfies p is less than or equal to d;
and 2, according to the IEEE802.1Qbv standard, a time-aware shaper is utilized to design a gate control list to distinguish and process TT traffic and non-TT traffic, wherein the non-TT traffic comprises AVB traffic and BE traffic. The time perception shaper is TAS, the gate control list is GCL, and TT flow is ensured to be determined and transmitted in real time by establishing a completely independent time window;
step 3, flow of each queue in the transmission process is according to a formula
Figure BDA0002718084450000021
Judging the priority degree and reordering the queue flow, and arranging the flow with the lower W value in front of the queue so as to be sent preferentially; t represents the time when the flow reaches the node, and d represents the cut-off time of each type of flow;
step 4, transmitting various flows in a specific time slot window opening period according to a gating mechanism; during the opening period of a non-TT flow time slot window, AVB flow and BE flow adopt a fuzzy control-based occupation limiting scheduling method, wherein the occupation limiting scheduling method is to allow the AVB flow to occupy the BE flow according to a difference value between a residual time proportion and a residual transmission proportion and a fuzzy criterion established by flow priority, reduce the delay of higher priority flow and reduce bandwidth waste caused by frequent occupation to a certain extent;
step 5, formulating fuzzy rule according to step 4
(1) The difference rule of the remaining time proportion and the remaining transmission proportion is as follows:
the remaining time ratio:
Figure BDA0002718084450000022
the remaining transmission ratio:
Figure BDA0002718084450000023
difference value: Δ ═ M-N
TpmRepresenting the current time, d representing the cutoff time, TtcRepresents the completed transmission time, T, corresponding to the position of the flownqRepresenting the transmission time required for traffic without queuing;
determining the emergency degree according to the difference value delta, wherein the smaller the difference value is, the higher the emergency degree is;
(2) and (3) queue rules:
the switch comprises 7 non-TT flow priority queues in total, the queue numbers are from 0 to 6, and the higher the number is, the higher the priority of the stored flow is; the queue 7 is used for transmitting TT flow, the queue 6 and the queue 5 are used for transmitting AVB flow, and the rest queue is used for transmitting BE flow;
step 6, accurately describing the fuzzy object according to the difference value delta and the membership degree corresponding to the priority, and acquiring a final grade corresponding to fuzzy output by using a fuzzy logic control table; if the AVB traffic fuzzy output level is higher than the BE traffic, then preemption events are allowed to occur, otherwise preemption is not allowed.
The technical scheme of the invention is further improved as follows: in step 2, each TAS has 8 queues for storing data frames waiting to be forwarded on the corresponding link, and each queue has a gate 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, the frames in the queue being in a wait-to-forward state during the closing of the associated door; eliminating the worst-case delay overshoot by mandatory full isolation; only considering how GCL is generated during the first super-period, after the first super-period, the subsequent scheduling follows a periodic cyclic rule, the first super-period being the least common multiple of the period of each traffic.
The technical scheme of the invention is further improved as follows: in step 3, the queue traffic reordering mechanism allows the traffic which enters the queue later and has a higher urgency to be sent first, and the queue reordering is limited to the queue, and does not involve cross-queue reordering.
The technical scheme of the invention is further improved as follows: step 4-step 6, during the opening of the associated door of the TT queue, the determined high-quality transmission of the TT flow is completed; during the period that the AVB and BE queue association gate is opened, the AVB traffic allows the BE traffic to BE subjected to limitation preemption based on fuzzy control.
Due to the adoption of the technical scheme, the invention has the technical progress that:
the method ensures that TT flow with the highest priority on site completes the determined real-time transmission, reduces AVB flow delay, ensures audio and video transmission quality, reduces bandwidth waste caused by AVB preemption to a certain extent, improves scheduling performance, and solves the scheduling problem of mixed flow common transmission.
Drawings
Fig. 1 is a flow chart of a hybrid traffic scheduling method in the present invention;
FIG. 2 is a schematic diagram of a channel transmission mode according to the present invention;
FIG. 3 is a schematic diagram of a hybrid traffic scheduling mechanism according to the present invention;
FIG. 4 is a flow priority membership graph in accordance with the present invention;
fig. 5 is a membership graph of flow urgency according to the present invention.
Detailed Description
The present invention will be described in further detail with reference to the following examples:
fig. 1 is a flowchart of a hybrid traffic joint routing and scheduling method of the present invention, which can be applied to a field topology model, wherein a hybrid traffic transmission process follows the channel transmission mode of fig. 2, and a scheduling manner satisfies the hybrid traffic scheduling mechanism of fig. 3. The steps involved in the method are described in detail below.
Step 1, defining characteristic parameters of each data frame of a network topology, representing the flow in a flow set by a six-tuple less than S, D, p, D, q and l, and respectively representing a source node, a target node, a transmission period, a cut-off time, a transmission queue ID and a data frame length. Wherein, each flow satisfies p is less than or equal to d.
And 2, according to the IEEE802.1Qbv standard, a time perception shaper (TAS) design Gate Control List (GCL) is used for distinguishing and processing TT flow and non-TT flow, wherein the non-TT flow comprises AVB and BE flow, and the determined real-time transmission of the TT flow is ensured by establishing a completely independent time window.
Step 3, flow of each queue in the transmission process is according to a formula
Figure BDA0002718084450000041
And judging the priority degree, reordering the queue traffic, arranging the traffic with a lower W value in front of the queue so as to be sent preferentially, wherein the queue reordering is only limited to the queue, and does not relate to cross-queue reordering. t represents the time when the traffic reaches the node, and d represents the deadline of each type of traffic.
And 4, transmitting the various flows during the opening period of the specific time slot window according to the gating mechanism. During the period that a time slot window of non-TT flow is opened, AVB flow and BE flow adopt a fuzzy control-based limited preemption scheduling method, namely, a fuzzy rule established according to the difference value of the residual time proportion and the residual transmission proportion and the flow priority allows the AVB flow to preempt the BE flow, the time delay of the higher priority flow is reduced, and the bandwidth waste caused by frequent preemption is reduced to a certain extent.
Step 5, formulating fuzzy rule according to step 4
(1) The difference rule of the remaining time proportion and the remaining transmission proportion is as follows:
the remaining time ratio:
Figure BDA0002718084450000051
the remaining transmission ratio:
Figure BDA0002718084450000052
difference value: Δ ═ M-N
TpmRepresenting the current time, d representing the cutoff time, TtcRepresents the completed transmission time, T, corresponding to the position of the flownqRepresenting the required transmission time for traffic without queuing.
The degree of urgency is determined from the difference Δ, with smaller differences being more urgent.
(2) And (3) queue rules:
the switch comprises 7 non-TT traffic priority queues in total, the queue numbers are from 0 to 6, and the higher the number is, the higher the priority of the stored traffic is. Queue 7 is used to transmit TT traffic, queue 6 and queue 5 are used to transmit AVB traffic, and the remaining queues are used to transmit BE traffic.
And 6, accurately describing the fuzzy object according to the difference value delta and the membership corresponding to the priority, and acquiring the final grade corresponding to the fuzzy output by utilizing the fuzzy logic control table in the table 1. The traffic table with the importance attribute of general and the urgency attribute of urgent in table 1 is ranked as G7The importance attribute is urgency and the urgency attribute is general traffic lookup table level G8The importance of the flow is more critical than the urgency in the parameter settings embodying table 1. And finally, the decision rule is that if the AVB flow fuzzy output level is higher than the BE flow, the preemption event is allowed to occur, otherwise, the preemption is not allowed.
TABLE 1 fuzzy logic control table
Figure BDA0002718084450000061
The above-mentioned embodiments are merely illustrative of the preferred embodiments of the present invention, and do not limit the scope of the present invention, and various modifications and improvements of the technical solution of the present invention by those skilled in the art should fall within the protection scope defined by the claims of the present invention without departing from the spirit of the present invention.

Claims (4)

1. A time-sensitive network mixed flow scheduling method is characterized by comprising the following steps:
step 1, defining characteristic parameters of each data frame of a network topology, wherein the flow in a flow set is represented by a six-tuple less than S, D, p, D, q and l, S represents a source node, D represents a target node, p represents a transmission period, D represents deadline, q represents a transmission queue ID, and l represents the length of a data frame. Wherein, each flow satisfies p is less than or equal to d;
step 2, according to the IEEE802.1Qbv standard, a time-aware shaper is utilized to design a gate control list to distinguish and process TT flow and non-TT flow, wherein the non-TT flow comprises AVB flow and BE flow, the time-aware shaper is TAS, the gate control list is GCL, and the determined real-time transmission of the TT flow is ensured by establishing a completely independent time window;
step 3, flow of each queue in the transmission process is according to a formula
Figure FDA0002718084440000011
Judging the priority degree and reordering the queue flow, and arranging the flow with the lower W value in front of the queue so as to be sent preferentially; t represents the time when the flow reaches the node, and d represents the cut-off time of each type of flow;
step 4, transmitting various flows in a specific time slot window opening period according to a gating mechanism; during the opening period of a non-TT flow time slot window, AVB flow and BE flow adopt a fuzzy control-based occupation limiting scheduling method, wherein the occupation limiting scheduling method is to allow the AVB flow to occupy the BE flow according to a difference value between a residual time proportion and a residual transmission proportion and a fuzzy criterion established by flow priority, reduce the delay of higher priority flow and reduce bandwidth waste caused by frequent occupation to a certain extent;
step 5, formulating fuzzy rule according to step 4
(1) The difference rule of the remaining time proportion and the remaining transmission proportion is as follows:
the remaining time ratio:
Figure FDA0002718084440000012
the remaining transmission ratio:
Figure FDA0002718084440000013
difference value: Δ ═ M-N
TpmRepresenting the current time, d representing the cutoff time, TtcRepresents the completed transmission time, T, corresponding to the position of the flownqRepresenting the transmission time required for traffic without queuing;
determining the emergency degree according to the difference value delta, wherein the smaller the difference value is, the higher the emergency degree is;
(2) and (3) queue rules:
the switch comprises 7 non-TT flow priority queues in total, the queue numbers are from 0 to 6, and the higher the number is, the higher the priority of the stored flow is; the queue 7 is used for transmitting TT flow, the queue 6 and the queue 5 are used for transmitting AVB flow, and the rest queue is used for transmitting BE flow;
step 6, accurately describing the fuzzy object according to the difference value delta and the membership degree corresponding to the priority, and acquiring a final grade corresponding to fuzzy output by using a fuzzy logic control table; if the AVB traffic fuzzy output level is higher than the BE traffic, then preemption events are allowed to occur, otherwise preemption is not allowed.
2. The method for scheduling the hybrid traffic of the time-sensitive network according to claim 1, wherein: in step 2, each TAS has 8 queues for storing data frames waiting to be forwarded on the corresponding link, and each queue has a gate 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, the frames in the queue being in a wait-to-forward state during the closing of the associated door; eliminating the worst-case delay overshoot by mandatory full isolation; only considering how GCL is generated during the first super-period, after the first super-period, the subsequent scheduling follows a periodic cyclic rule, the first super-period being the least common multiple of the period of each traffic.
3. The method for scheduling the hybrid traffic of the time-sensitive network according to claim 1, wherein: in step 3, the queue traffic reordering mechanism allows the traffic which enters the queue later and has a higher urgency to be sent first, and the queue reordering is limited to the queue, and does not involve cross-queue reordering.
4. The method for scheduling the hybrid traffic of the time-sensitive network according to claim 1, wherein: step 4-step 6, during the opening of the associated door of the TT queue, the determined high-quality transmission of the TT flow is completed; during the period that the AVB and BE queue association gate is opened, the AVB traffic allows the BE traffic to BE subjected to limitation preemption based on fuzzy control.
CN202011076958.0A 2020-10-10 2020-10-10 Time-sensitive network mixed flow scheduling method Active CN112291161B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011076958.0A CN112291161B (en) 2020-10-10 2020-10-10 Time-sensitive network mixed flow scheduling method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011076958.0A CN112291161B (en) 2020-10-10 2020-10-10 Time-sensitive network mixed flow scheduling method

Publications (2)

Publication Number Publication Date
CN112291161A true CN112291161A (en) 2021-01-29
CN112291161B CN112291161B (en) 2022-03-11

Family

ID=74421806

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011076958.0A Active CN112291161B (en) 2020-10-10 2020-10-10 Time-sensitive network mixed flow scheduling method

Country Status (1)

Country Link
CN (1) CN112291161B (en)

Cited By (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113225266A (en) * 2021-03-17 2021-08-06 西安电子科技大学 TAS scheduling method and device on quasi-dynamic platform
CN113572706A (en) * 2021-06-16 2021-10-29 燕山大学 Self-adaptive hierarchical scheduling method for boundary-free cooperative control time-sensitive network
CN113783793A (en) * 2021-07-23 2021-12-10 北京邮电大学 Traffic scheduling method for time-sensitive data frame and related equipment
CN113904991A (en) * 2021-08-26 2022-01-07 北京邮电大学 Traffic shaping method, device and system
CN114172851A (en) * 2021-10-26 2022-03-11 上海丰蕾信息科技有限公司 Transmission resource model construction device based on time sensitive network
CN114301851A (en) * 2022-01-20 2022-04-08 燕山大学 Time-sensitive network flow hierarchical scheduling method for industrial site
CN114390000A (en) * 2022-01-17 2022-04-22 北京邮电大学 TSN traffic scheduling method based on enqueue shaping and related equipment
CN114448894A (en) * 2022-02-10 2022-05-06 上海交通大学 Multi-level service scheduling engine facing time sensitive network and implementation method
CN114615205A (en) * 2022-03-23 2022-06-10 南京航空航天大学 Hybrid traffic scheduling method under time sensitive network based on time benefit function
CN114650261A (en) * 2022-02-24 2022-06-21 同济大学 Reordering scheduling method in time-sensitive network queue
CN114884893A (en) * 2022-07-12 2022-08-09 之江实验室 Forwarding and control definable cooperative traffic scheduling method and system
CN114884890A (en) * 2022-04-25 2022-08-09 中国电子科技集团公司第五十八研究所 Time-sensitive network data frame preemption method
CN114915597A (en) * 2021-12-22 2022-08-16 天翼数字生活科技有限公司 Deterministic resource scheduling method for time-sensitive network
CN115333860A (en) * 2022-10-12 2022-11-11 北京合众方达科技有限公司 TSN network control method based on zero trust
CN115378865A (en) * 2022-08-12 2022-11-22 北京智芯微电子科技有限公司 Routing scheduling method and system for AVB stream time delay, storage medium and terminal equipment
CN115987891A (en) * 2021-10-14 2023-04-18 南京航空航天大学 Online routing and scheduling method for data center network mixed flow
CN116319598A (en) * 2023-05-19 2023-06-23 工业富联(佛山)产业示范基地有限公司 Mechanical arm control method, time-sensitive switch and storage medium
WO2023116126A1 (en) * 2021-12-22 2023-06-29 中兴通讯股份有限公司 Time-triggered scheduling method, node, electronic device, and storage medium
CN116566995A (en) * 2023-07-10 2023-08-08 安徽中科晶格技术有限公司 Block chain data transmission method based on classification and clustering algorithm
WO2024007395A1 (en) * 2022-07-08 2024-01-11 上海交通大学 Hardware acceleration-based efficient configuration method and system for time sensitive network
CN117896315A (en) * 2024-03-12 2024-04-16 南京邮电大学 Intelligent substation mixed flow scheduling method and system based on time-sensitive network

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180184450A1 (en) * 2016-12-27 2018-06-28 Dave A. Cavalcanti System and methods to configure contention-based access periods transmission rules to enable time sensitive applications in an ieee 802.11 wlan
CN108737003A (en) * 2017-04-25 2018-11-02 是德科技新加坡（控股）私人有限公司 For testing time sensitive network（TSN）Method, system and the computer-readable medium of element
CN109451052A (en) * 2018-12-18 2019-03-08 天津城建大学 A kind of SDN load-balancing method based on fuzzy logic
CN109600319A (en) * 2018-12-11 2019-04-09 浙江工商大学 A kind of traffic scheduling method in real-time Transmission mechanism
CN110601997A (en) * 2019-08-12 2019-12-20 北京时代民芯科技有限公司 Time division multiplexing method for mixed flow fusion
CN111327540A (en) * 2020-02-25 2020-06-23 重庆邮电大学 Deterministic scheduling method for industrial time-sensitive network data
CN111628942A (en) * 2020-05-28 2020-09-04 燕山大学 Resource allocation method in time-sensitive network
CN111740924A (en) * 2020-07-29 2020-10-02 上海交通大学 Traffic shaping and routing planning scheduling method of time-sensitive network gating mechanism

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180184450A1 (en) * 2016-12-27 2018-06-28 Dave A. Cavalcanti System and methods to configure contention-based access periods transmission rules to enable time sensitive applications in an ieee 802.11 wlan
CN108737003A (en) * 2017-04-25 2018-11-02 是德科技新加坡（控股）私人有限公司 For testing time sensitive network（TSN）Method, system and the computer-readable medium of element
CN109600319A (en) * 2018-12-11 2019-04-09 浙江工商大学 A kind of traffic scheduling method in real-time Transmission mechanism
CN109451052A (en) * 2018-12-18 2019-03-08 天津城建大学 A kind of SDN load-balancing method based on fuzzy logic
CN110601997A (en) * 2019-08-12 2019-12-20 北京时代民芯科技有限公司 Time division multiplexing method for mixed flow fusion
CN111327540A (en) * 2020-02-25 2020-06-23 重庆邮电大学 Deterministic scheduling method for industrial time-sensitive network data
CN111628942A (en) * 2020-05-28 2020-09-04 燕山大学 Resource allocation method in time-sensitive network
CN111740924A (en) * 2020-07-29 2020-10-02 上海交通大学 Traffic shaping and routing planning scheduling method of time-sensitive network gating mechanism

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
NARESH GANESH NAYAK;FRANK DÜRR;KURT ROTHERMEL: "Incremental Flow Scheduling and Routing in Time-Sensitive Software-Defined Networks", 《IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS》 *
WANG HONG;YUE PENG: "Delay control system of intelligent traffic scheduling based on deep learning and fuzzy control", 《JOURNAL OF INTELLIGENT & FUZZY SYSTEMS》 *
曹志鹏; 刘勤让; 刘冬培; 张霞: "面向时间敏感网络的流量调度方法", 《计算机工程》 *

Cited By (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113225266A (en) * 2021-03-17 2021-08-06 西安电子科技大学 TAS scheduling method and device on quasi-dynamic platform
CN113225266B (en) * 2021-03-17 2022-06-07 西安电子科技大学 TAS scheduling method and device on quasi-dynamic platform
CN113572706A (en) * 2021-06-16 2021-10-29 燕山大学 Self-adaptive hierarchical scheduling method for boundary-free cooperative control time-sensitive network
CN113572706B (en) * 2021-06-16 2023-02-21 燕山大学 Self-adaptive hierarchical scheduling method for boundary-free cooperative control time-sensitive network
CN113783793B (en) * 2021-07-23 2023-07-25 北京邮电大学 Traffic scheduling method for time-sensitive data frames and related equipment
CN113783793A (en) * 2021-07-23 2021-12-10 北京邮电大学 Traffic scheduling method for time-sensitive data frame and related equipment
CN113904991A (en) * 2021-08-26 2022-01-07 北京邮电大学 Traffic shaping method, device and system
CN113904991B (en) * 2021-08-26 2023-08-22 北京邮电大学 Traffic shaping method, device and system
CN115987891A (en) * 2021-10-14 2023-04-18 南京航空航天大学 Online routing and scheduling method for data center network mixed flow
CN114172851A (en) * 2021-10-26 2022-03-11 上海丰蕾信息科技有限公司 Transmission resource model construction device based on time sensitive network
WO2023116126A1 (en) * 2021-12-22 2023-06-29 中兴通讯股份有限公司 Time-triggered scheduling method, node, electronic device, and storage medium
CN114915597A (en) * 2021-12-22 2022-08-16 天翼数字生活科技有限公司 Deterministic resource scheduling method for time-sensitive network
CN114915597B (en) * 2021-12-22 2024-04-16 天翼数字生活科技有限公司 Deterministic resource scheduling method for time-sensitive network
CN114390000A (en) * 2022-01-17 2022-04-22 北京邮电大学 TSN traffic scheduling method based on enqueue shaping and related equipment
CN114390000B (en) * 2022-01-17 2023-08-01 北京邮电大学 TSN flow scheduling method and related equipment based on enqueue shaping
CN114301851B (en) * 2022-01-20 2023-12-01 燕山大学 Industrial field-oriented time-sensitive network flow hierarchical scheduling method
CN114301851A (en) * 2022-01-20 2022-04-08 燕山大学 Time-sensitive network flow hierarchical scheduling method for industrial site
CN114448894A (en) * 2022-02-10 2022-05-06 上海交通大学 Multi-level service scheduling engine facing time sensitive network and implementation method
CN114448894B (en) * 2022-02-10 2024-01-05 上海交通大学 Multi-level service scheduling engine for time sensitive network and implementation method
CN114650261A (en) * 2022-02-24 2022-06-21 同济大学 Reordering scheduling method in time-sensitive network queue
CN114615205B (en) * 2022-03-23 2024-03-08 南京航空航天大学 Mixed flow scheduling method under time sensitive network based on time benefit function
CN114615205A (en) * 2022-03-23 2022-06-10 南京航空航天大学 Hybrid traffic scheduling method under time sensitive network based on time benefit function
CN114884890A (en) * 2022-04-25 2022-08-09 中国电子科技集团公司第五十八研究所 Time-sensitive network data frame preemption method
WO2024007395A1 (en) * 2022-07-08 2024-01-11 上海交通大学 Hardware acceleration-based efficient configuration method and system for time sensitive network
CN114884893B (en) * 2022-07-12 2022-10-25 之江实验室 Forwarding and control definable cooperative traffic scheduling method and system
CN114884893A (en) * 2022-07-12 2022-08-09 之江实验室 Forwarding and control definable cooperative traffic scheduling method and system
CN115378865A (en) * 2022-08-12 2022-11-22 北京智芯微电子科技有限公司 Routing scheduling method and system for AVB stream time delay, storage medium and terminal equipment
CN115333860B (en) * 2022-10-12 2023-02-03 北京合众方达科技有限公司 TSN network control method based on zero trust
CN115333860A (en) * 2022-10-12 2022-11-11 北京合众方达科技有限公司 TSN network control method based on zero trust
CN116319598B (en) * 2023-05-19 2023-11-07 工业富联(佛山)产业示范基地有限公司 Time-sensitive mechanical arm control method, switch and storage medium
CN116319598A (en) * 2023-05-19 2023-06-23 工业富联(佛山)产业示范基地有限公司 Mechanical arm control method, time-sensitive switch and storage medium
CN116566995B (en) * 2023-07-10 2023-09-22 安徽中科晶格技术有限公司 Block chain data transmission method based on classification and clustering algorithm
CN116566995A (en) * 2023-07-10 2023-08-08 安徽中科晶格技术有限公司 Block chain data transmission method based on classification and clustering algorithm
CN117896315A (en) * 2024-03-12 2024-04-16 南京邮电大学 Intelligent substation mixed flow scheduling method and system based on time-sensitive network
CN117896315B (en) * 2024-03-12 2024-05-24 南京邮电大学 Intelligent substation mixed flow scheduling method and system based on time-sensitive network

Also Published As

Publication number Publication date
CN112291161B (en) 2022-03-11

Similar Documents

Publication Publication Date Title
CN112291161B (en) Time-sensitive network mixed flow scheduling method
Larrañaga et al. Analysis of 5G-TSN integration to support industry 4.0
CN111327540A (en) Deterministic scheduling method for industrial time-sensitive network data
CN113630893B (en) 5G and TSN joint scheduling method based on wireless channel information
CN114301851B (en) Industrial field-oriented time-sensitive network flow hierarchical scheduling method
CN114422448B (en) Time-sensitive network traffic shaping method
CN114666280B (en) Industrial Internet time delay optimization method based on time-sensitive software defined network
Zhang et al. Analysis of TSN for industrial automation based on network calculus
CN115314444B (en) SDN-based time-sensitive network gating decision method and device
CN113424500A (en) Method for routing in time-sensitive networks
Lv et al. Formal analysis of TSN scheduler for real-time communications
CN114650261A (en) Reordering scheduling method in time-sensitive network queue
CN115225587B (en) Asynchronous terminal system scheduling optimization method based on constraint planning
CN112821977A (en) Asynchronous low-delay time sensitive data processing method
CN112822268A (en) IP layer packet scheduling algorithm for multi-service coexistence and deterministic network requirements in industrial Internet of things
Wang et al. Deep reinforcement learning aided no-wait flow scheduling in time-sensitive networks
CN117896315A (en) Intelligent substation mixed flow scheduling method and system based on time-sensitive network
Hu et al. The delay bound analysis based on network calculus for asynchronous traffic shaping under parameter inconsistency
CN114205309B (en) Method for precisely calculating frame sending time facing TSN output interface
CN114915597B (en) Deterministic resource scheduling method for time-sensitive network
CN115811799A (en) DDPG (distributed data processing) -based 5G-TSN (time delay network) combined resource scheduling device and method
Liu et al. Network calculus-based modeling of time sensitive networking shapers for industrial automation networks
Ambrosy et al. 5G packet delay considerations for different 5G-TSN communication scenarios
WO2020088745A1 (en) Methods and devices for deadline-aware flow scheduling in time sensitive networks
CN113055303B (en) Gating scheduling method suitable for multi-cycle application in time-sensitive network

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