[go: up one dir, main page]

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

Time-sensitive network mixed flow scheduling method Download PDF

Info

Publication number
CN112291161B
CN112291161B CN202011076958.0A CN202011076958A CN112291161B CN 112291161 B CN112291161 B CN 112291161B CN 202011076958 A CN202011076958 A CN 202011076958A CN 112291161 B CN112291161 B CN 112291161B
Authority
CN
China
Prior art keywords
traffic
queue
time
flow
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.)
Active
Application number
CN202011076958.0A
Other languages
Chinese (zh)
Other versions
CN112291161A (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

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416Real-time traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/245Traffic characterised by specific attributes, e.g. priority or QoS using preemption
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2483Traffic characterised by specific attributes, e.g. priority or QoS involving identification of individual flows
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • H04L47/62Queue scheduling characterised by scheduling criteria
    • H04L47/625Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6275Queue 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)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale 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.一种时间敏感网络混合流量调度方法,其特征在于包括以下步骤:1. a time-sensitive network mixed traffic scheduling method, is characterized in that comprising the following steps: 步骤1,定义网络拓扑各数据帧特征参数,流量集合中的流量由一个六元组<S,D,p,d,q,l>表征,S表示源节点,D表示目标节点,p表示传输周期,d表示截止时间,q表示传输队列ID,l表示数据帧长度, 其中,各流量均满足p≤d;Step 1: Define the characteristic parameters of each data frame in the network topology. The traffic in the traffic set is represented by a six-tuple <S, D, p, d, q, l>, S represents the source node, D represents the target node, and p represents the transmission Period, d represents the deadline, q represents the ID of the transmission queue, and l represents the length of the data frame, where each traffic satisfies p≤d; 步骤2,根据IEEE802.1Qbv标准,利用时间感知整形器设计门控制列表区分处理TT流量与非TT流量,其中非TT流量包含AVB流量与BE流量,时间感知整形器为TAS,门控制列表为GCL,通过建立完全独立的时间窗口保证TT流量的确定实时传输;Step 2: According to the IEEE802.1Qbv standard, use the time-aware shaper to design a gate control list to distinguish between TT traffic and non-TT traffic, where the non-TT traffic includes AVB traffic and BE traffic, the time-aware shaper is TAS, and the gate control list is GCL , by establishing a completely independent time window to ensure the definite real-time transmission of TT traffic; 步骤3,在传输过程中各队列流量依据公式Step 3: During the transmission process, the traffic of each queue is based on the formula
Figure FDA0002718084440000011
Figure FDA0002718084440000011
判定优先程度并进行队列流量的重新排序,将W数值较低的流量排列在队列前方以便于优先发送;t代表流量到达节点时刻,d代表各类型流量截止时间;Determine the priority and reorder the queue traffic, and arrange the traffic with a lower W value in front of the queue for priority sending; t represents the time when the traffic arrives at the node, and d represents the deadline for each type of traffic; 步骤4,根据门控机制各类流量在特定的时隙窗口打开期间进行传输;其中,在非TT流量时隙窗口打开期间,AVB流量与BE流量采用基于模糊控制的限制抢占调度方法,限制抢占调度方法是根据剩余时间比例与剩余传输比例的差值和流量优先级制定的模糊准则允许AVB流量对BE流量的抢占,降低较高优先级流量的延时,并在一定程度上减小频繁抢占带来的带宽浪费;Step 4: According to the gating mechanism, various types of traffic are transmitted during the opening of a specific time slot window; among them, during the opening of the non-TT traffic time slot window, the AVB traffic and BE traffic adopt a limited preemption scheduling method based on fuzzy control to limit preemption. The scheduling method is to allow AVB traffic to preempt BE traffic, reduce the delay of higher priority traffic, and reduce frequent preemption to a certain extent. bandwidth waste; 步骤5,根据步骤4制定模糊规则Step 5, formulate fuzzy rules according to step 4 (1)剩余时间比例与剩余传输比例的差值规则:(1) The difference rule between the remaining time ratio and the remaining transmission ratio: 剩余时间比例:
Figure FDA0002718084440000012
Ratio of remaining time:
Figure FDA0002718084440000012
剩余传输比例:
Figure FDA0002718084440000013
Remaining transfer ratio:
Figure FDA0002718084440000013
差值:Δ=M-NDifference: Δ=M-N Tpm代表当前时刻,d代表截止时间,Ttc代表流量所处位置对应的已完成传输时间,Tnq代表无排队时流量所需的传输时间;T pm represents the current time, d represents the deadline, T tc represents the completed transmission time corresponding to the location of the traffic, and T nq represents the transmission time required by the traffic when there is no queue; 根据差值Δ确定紧急程度,差值越小紧急程度越高;Determine the degree of urgency according to the difference Δ, the smaller the difference, the higher the degree of urgency; (2)队列规则:(2) Queue rules: 交换机共包含7个非TT流量优先级队列,队列编号从0至6,编号越高,存储流量的优先级越高;队列7用于传输TT流量,队列6和队列5用于传输AVB流量,剩余队列用于传输BE流量;The switch contains a total of 7 non-TT traffic priority queues. The queue numbers are from 0 to 6. The higher the number, the higher the priority of the stored traffic. Queue 7 is used to transmit TT traffic, and queue 6 and queue 5 are used to transmit AVB traffic. The remaining queues are used to transmit BE traffic; 步骤6,根据差值Δ和优先级所对应的隶属度对模糊性对象进行精确描述,再利用模糊逻辑控制表获取模糊输出所对应的最终等级;若AVB流量模糊输出等级高于BE流量,则允许抢占事件发生,反之则不允许抢占。Step 6: Accurately describe the fuzzy object according to the membership degree corresponding to the difference Δ and the priority, and then use the fuzzy logic control table to obtain the final level corresponding to the fuzzy output; if the fuzzy output level of the AVB flow is higher than the BE flow, then Preemption events are allowed to occur, otherwise preemption is not allowed.
2.根据权利要求1所述的一种时间敏感网络混合流量调度方法,其特征在于:所述步骤2中,每个TAS有8个用于存储等待在相应链路上转发数据帧的队列,每个队列都有一个具备两种状态的门,即打开状态和关闭状态;仅当关联的门打开时队列中等待的帧才有资格转发,关联的门关闭期间队列中的帧处于等待转发状态;通过强制性的完全隔离消除最坏情况下延迟过高现象;仅考虑在第一个超周期当中如何生成的GCL,在第一个超周期过后,后续的调度遵循周期性循环规则,第一个超周期为各流量的周期的最小公倍数。2. a kind of time-sensitive network mixed traffic scheduling method according to claim 1, is characterized in that: in described step 2, each TAS has 8 queues for storing and waiting to forward data frames on corresponding links, Each queue has a gate with two states, an open state and a closed state; frames waiting in the queue are only eligible for forwarding when the associated gate is open, and frames in the queue are in the waiting state for forwarding while the associated gate is closed ; Eliminate the worst-case high latency phenomenon through mandatory complete isolation; only consider how the GCL is generated in the first super cycle, after the first super cycle, the subsequent scheduling follows the periodic round-robin rule, the first Each superperiod is the least common multiple of the period of each flow. 3.根据权利要求1所述的一种时间敏感网络混合流量调度方法,其特征在于:所述步骤3中,队列流量重新排序机制允许后进入队列且紧急程度较高的流量优先发送,队列重排只局限于本队列,不涉及跨队列重新排序。3. A time-sensitive network hybrid traffic scheduling method according to claim 1, wherein: in the step 3, the queue traffic reordering mechanism is allowed to enter the queue and the traffic with higher urgency is sent first, and the queue is reordered. The queue is limited to this queue and does not involve reordering across queues. 4.根据权利要求1所述的一种时间敏感网络混合流量调度方法,其特征在于:步骤4-步骤6中,在TT队列关联门打开期间,完成TT流量的确定高质传输;在AVB、BE队列关联门打开期间,AVB流量基于模糊控制允许对BE流量进行限制抢占。4. a kind of time-sensitive network mixed traffic scheduling method according to claim 1, is characterized in that: in step 4-step 6, during the opening period of TT queue correlation gate, complete the determined high-quality transmission of TT traffic; During the opening of the BE queue association gate, AVB traffic is allowed to limit preemption of BE traffic 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 CN112291161A (en) 2021-01-29
CN112291161B true 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)

Families Citing this family (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113225266B (en) * 2021-03-17 2022-06-07 西安电子科技大学 TAS scheduling method and device on quasi-dynamic platform
CN113572706B (en) * 2021-06-16 2023-02-21 燕山大学 An Adaptive Hierarchical Scheduling Method for Time-Sensitive Networks with Borderless Cooperative Control
CN113783793B (en) * 2021-07-23 2023-07-25 北京邮电大学 Traffic scheduling method for time-sensitive data frames and related equipment
CN113904991B (en) * 2021-08-26 2023-08-22 北京邮电大学 Traffic shaping method, device and system
CN115987891B (en) * 2021-10-14 2025-04-22 南京航空航天大学 An online routing and scheduling method for mixed traffic in data center networks
CN114172851A (en) * 2021-10-26 2022-03-11 上海丰蕾信息科技有限公司 Transmission resource model construction device based on time sensitive network
CN114915597B (en) * 2021-12-22 2024-04-16 天翼数字生活科技有限公司 Deterministic resource scheduling method for time-sensitive network
CN116346627A (en) * 2021-12-22 2023-06-27 中兴通讯股份有限公司 Time trigger scheduling method, node, electronic equipment and storage medium
CN114390000B (en) * 2022-01-17 2023-08-01 北京邮电大学 TSN traffic scheduling method and related equipment based on queue shaping
CN114301851B (en) * 2022-01-20 2023-12-01 燕山大学 Industrial field-oriented time-sensitive network flow hierarchical scheduling 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
CN114884890A (en) * 2022-04-25 2022-08-09 中国电子科技集团公司第五十八研究所 Time-sensitive network data frame preemption method
CN117411783A (en) * 2022-07-08 2024-01-16 上海交通大学 An efficient time-sensitive network configuration method and system based on hardware acceleration
CN114884893B (en) * 2022-07-12 2022-10-25 之江实验室 A forwarding and control definable cooperative traffic scheduling method and system
CN115378865B (en) * 2022-08-12 2024-08-13 北京智芯微电子科技有限公司 Routing scheduling method and system for AVB stream delay, storage medium and terminal equipment
CN115665221B (en) * 2022-09-28 2024-11-29 国科础石(重庆)软件有限公司 Communication method, device, vehicle and electronic equipment between vehicle-mounted containers
CN115333860B (en) * 2022-10-12 2023-02-03 北京合众方达科技有限公司 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
CN116566995B (en) * 2023-07-10 2023-09-22 安徽中科晶格技术有限公司 Block chain data transmission method based on classification and clustering algorithm
CN117896315B (en) * 2024-03-12 2024-05-24 南京邮电大学 A hybrid flow dispatching method and system for intelligent substation based on time-sensitive network
CN119356840A (en) * 2024-08-26 2025-01-24 安徽数安系统集成有限公司 New energy vehicle operation data processing method, electronic device and storage medium

Family Cites Families (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
CN108737003B (en) * 2017-04-25 2021-10-26 是德科技新加坡(销售)私人有限公司 Methods, systems, and computer readable media for testing Time Sensitive Network (TSN) elements
CN109600319B (en) * 2018-12-11 2022-07-08 浙江工商大学 A 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
CN110601997B (en) * 2019-08-12 2023-03-31 北京时代民芯科技有限公司 Time division multiplexing method for mixed flow fusion
CN111327540A (en) * 2020-02-25 2020-06-23 重庆邮电大学 A Deterministic Scheduling Method for Industrial Time-Sensitive Network Data
CN111628942B (en) * 2020-05-28 2022-03-25 燕山大学 Resource allocation method in time-sensitive network
CN111740924B (en) * 2020-07-29 2022-03-01 上海交通大学 Traffic shaping and routing planning scheduling method of time-sensitive network gating mechanism

Also Published As

Publication number Publication date
CN112291161A (en) 2021-01-29

Similar Documents

Publication Publication Date Title
CN112291161B (en) Time-sensitive network mixed flow scheduling method
WO2023273385A1 (en) 5g and tsn joint scheduling method based on wireless channel information
CN114301851B (en) Industrial field-oriented time-sensitive network flow hierarchical scheduling method
CN113424500B (en) Method for routing in a time-sensitive network
CN110943899A (en) A system and method for adapting an EPA industrial bus to a time-sensitive network
CN112260957B (en) Hierarchical cross traffic scheduling system of time perception shaper
CN112751783B (en) Time-sensitive network gating shaping resource scheduling method
CN112003791A (en) Industrial Internet of things capable of adaptively adjusting slot window and bandwidth sharing based on TSN
CN114666280B (en) Industrial Internet time delay optimization method based on time-sensitive software defined network
CN114650261A (en) Reordering scheduling method in time-sensitive network queue
CN114422448A (en) Time-sensitive network traffic shaping method
CN115022182B (en) A Real-time Flow Scheduling Optimization Method for Train Communication Network Based on QSILP Algorithm
CN115314444B (en) A time-sensitive network gating decision-making method and device based on SDN
Lv et al. Formal analysis of TSN scheduler for real-time communications
CN112822268B (en) A method for multi-service coexistence and IP layer data packet scheduling in the Industrial Internet of Things
CN116032855B (en) Enhanced time-aware shaper for emergency event flows in time-sensitive networks
CN117896315A (en) A hybrid flow dispatching method and system for intelligent substation based on time-sensitive network
CN118694702A (en) Incremental Scheduling Method for Time-Sensitive Networks Based on Link Status
Ambrosy et al. 5G packet delay considerations for different 5G-TSN communication scenarios
CN113055303B (en) Gating scheduling method suitable for multi-cycle application in time-sensitive network
CN116132374A (en) A Transmission Delay Control Method for Power Communication Networks Combining Routing and Gating Planning
CN114884904A (en) Deterministic traffic scheduling method and device suitable for predictable time critical services
WO2022157750A1 (en) Centralized control of time gates for time sensitive networking (tsn)
WO2025081917A1 (en) Time-sensitive network routing and scheduling calculation method based on improved particle swarm algorithm
Liu et al. Network calculus-based modeling of time sensitive networking shapers for industrial automation networks

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