CN114205315B - Frame output scheduling method supporting Qbv mechanism in time sensitive network - Google Patents
Frame output scheduling method supporting Qbv mechanism in time sensitive network Download PDFInfo
- Publication number
- CN114205315B CN114205315B CN202111681665.XA CN202111681665A CN114205315B CN 114205315 B CN114205315 B CN 114205315B CN 202111681665 A CN202111681665 A CN 202111681665A CN 114205315 B CN114205315 B CN 114205315B
- Authority
- CN
- China
- Prior art keywords
- time slot
- queue
- gating
- time
- slice
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 230000005540 biological transmission Effects 0.000 claims description 6
- 230000000694 effects Effects 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 238000007493 shaping process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
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/6295—Queue scheduling characterised by scheduling criteria using multiple queues, one for each individual QoS, connection, flow or 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/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a frame output scheduling method supporting Qbv mechanism in a time sensitive network, which relates to the technical field of time sensitive networks and comprises the following steps: and calibrating an ST time slot slicing strategy and an RC time slot slicing strategy in advance, carrying out slicing allocation strategy on time slot resources according to flow characteristics, calibrating Qbv output queue constraint to simplify data plane forwarding logic and control plane planning, calibrating Qbv gating table structures based on the ST time slot slicing strategy and the RC time slot slicing strategy, and carrying out ST time slot slicing frame output scheduling processing and RC time slot frame output scheduling processing based on the ST time slot slicing strategy and the RC time slot slicing strategy. The invention decouples the ST flow and RC flow scheduling planning, designs a Qbv output queue structure, a gating table structure and a frame output scheduling method based on the ST/RC time slot slicing strategy, and can provide effective support for the scheduling logic of the data plane output port and the design of an upper layer planning algorithm.
Description
Technical Field
The invention relates to the technical field of time-sensitive networks, in particular to a frame output scheduling method supporting a Qbv mechanism in a time-sensitive network.
Background
Time sensitive networks (Time-SENSITIVE NETWORKING, TSNs) are an ethernet technology that guarantees deterministic transmission of critical traffic, where the traffic shaping mechanism is the key to guarantee certainty. The IEEE 802.1 working group defines a Time-aware shaping mechanism (Time-AWARE SHAPER, TAS) in the 802.1 Qbv standard, through which the certainty of the transmission delay of critical traffic on end systems and switches is guaranteed.
The principle of the gating mechanism specified by the 802.1Qbv is shown in fig. 1, 8 gating is set at the standard 8 queue output ends, the gating state is on and indicates that the queue is allowed to output the message, and the gating state is off and indicates that the queue is not allowed to output the message. The gating state is determined by the Qbv gating table and the current time. The Qbv gating table describes gating states of each time period within a gating period, and the gating states are set through circulation. Each entry defines the gating state of each queue at each slot, and the validation time of that entry. When the gating states of the queues are open, the output queue selection algorithm selects a specific queue output message according to the strategy. Thus, in 802.1Qbv enabled devices, the generation of control plane Qbv gating tables and the support of data planes for gating-based output scheduling method design are critical.
The effective time and all gating states of a gating table in the Qbv gating table need to be calculated, time slot allocation of ST flow and non-ST flow in the existing method can interfere with each other, and a feasible solution needs to be found through repeated iteration adjustment of a time slot allocation strategy, so that the design complexity and the calculation complexity of a control plane planning algorithm are very high. To simplify Qbv gating table generation,
The invention designs decoupling ST flow scheduling and non-ST flow scheduling, and the main idea is to divide a time line into equal-length time slot blocks (blocks), wherein each time slot Block comprises an ST time slot slice and an RC time slot slice, the ST time slot slice is exclusively used for transmitting ST frames and BE frames, and the RC time slot slice is exclusively used for transmitting RC frames and BE frames. And a Guard Band (GB) slot slice is used between the ST slot slice and the RC slot slice to ensure isolation. Based on this slot allocation strategy, ST flows and non-ST flow planning do not interfere with each other and partial gating states can be predetermined prior to execution of the planning algorithm, thereby effectively simplifying computation of the control plane Qbv gating table.
For the problems in the related art, no effective solution has been designed at present.
Disclosure of Invention
Aiming at the problems in the related art, the invention designs a frame output scheduling method supporting a Qbv mechanism in a time sensitive network so as to overcome the technical problems in the prior art.
The technical scheme of the invention is realized as follows:
a frame output scheduling method supporting Qbv mechanism in time sensitive network includes the following steps:
The method comprises the following steps:
Step S1, pre-calibrating ST time slot slices and RC time slot slices, wherein the steps include that time slot resources are subjected to a slice allocation strategy according to flow characteristics;
S2, calibrating Qbv output queue structure, wherein the Qbv output queue structure comprises calibration Qbv output queue constraint to simplify data plane forwarding logic and control plane planning;
S3, calibrating a Qbv gating table structure, wherein the Qbv gating table structure is calibrated based on ST time slot slices and RC time slot slices;
s4, performing frame scheduling, including ST time slot slice frame output scheduling processing and RC time slot frame output scheduling processing based on ST time slot slice and RC time slot slice strategies;
the ST time slot slice frame output scheduling processing comprises the steps of scheduling and transmitting packets in an ST queue and a BE queue with gating states being opened;
and the RC time slot frame output scheduling processing comprises scheduling and transmitting the packets in an RC queue and a BE queue with open gating states.
The slice allocation strategy for the time slot resources according to the flow characteristics comprises the following steps:
The calibration time line is divided into equal-length time periods which are expressed as blocks, the length of each Block is T4-T0, and the interior of each Block comprises an ST time slot slice, an RC time slot slice and a GB time slot slice;
ST slot slice transmits ST and BE frames, RC slot slice transmits RC and BE frames, GB slot slice avoids packet transmission across ST and RC slot slices;
The method comprises the steps that the lengths of each time slot slice in each Block are the same, and the starting time and the ending time of each time slot in the first Block are determined;
And calculating the starting time and the ending time of each time slot in each subsequent Block based on the number and the length of the Block.
The Qbv output queue constraint calibration method comprises the following steps:
constraint self-defining total number of output queues, flow type and priority corresponding to each queue;
in the same gating list item, at most, only 1 ST queue is gated on, and other ST queues with gating off can only input messages;
restricting the ST queue which is opened for gating, outputting messages only, and requiring all messages in the queue to be completely emptied in an opening time period;
The constraint output queue is selected in a strict priority mode, priorities of all ST queues are the same, priorities can BE distinguished among RC queues, priorities can BE distinguished among BE queues, and meanwhile, the priorities of ST queues are guaranteed to BE higher than priorities of all RC queues and are higher than priorities of all BE queues.
Wherein, qbv gating table structure includes: queue ID, gating start time and gating state, wherein;
The queue ID represents a queue number corresponding to the gating state;
the gating start time represents the start time of the current gating state to take effect, and the difference value between the effective time of the next gating state and the start time of the current gating state is the time for keeping the current gating state;
The gating states comprise an opening state and a closing state, wherein the opening state represents that the queue allows output messages at the current moment, and the closing state represents that the queue prohibits output messages at the current moment.
The ST time slot slice frame output scheduling process comprises the following steps:
Step S401, acquiring an ST queue ST_X with the gating on;
step S402, outputting all frames in the ST_X queue;
step S403, judging whether all BE queues in the ST time slot slice can send messages, if so, executing step S404; if not, then step S405 is performed;
Step S404, outputting a packet in BE queue with highest priority in ST time slot slice;
step S405, judging whether ST time slot slicing is cut off, if yes, finishing execution; if not, step S403 is performed.
The RC time slot frame output scheduling processing comprises the following steps:
step S406, judging whether all RC queues in the RC time slot slice can send messages, if so, executing step S407; if not, executing step S409;
Step S407, outputting a packet in the RC queue with the highest priority in the RC time slot slice;
step S408, judging whether the RC time slot slice is cut off, if so, finishing execution; if not, then step S406 is performed;
Step S409, judging whether all BE queues in the RC time slot slice can send messages, if so, executing step S410; if not, then step S408 is performed;
Step S410, a packet in the BE queue with the highest priority in the RC slot slice is output, and step S408 is executed.
The invention has the beneficial effects that:
The invention discloses a frame output scheduling method supporting Qbv mechanism in a time sensitive network, which comprises the steps of calibrating ST time slot slicing and RC time slot slicing strategies in advance, carrying out slicing allocation strategies on time slot resources according to flow characteristics, calibrating Qbv output queue constraint to simplify data plane forwarding logic and control plane planning, calibrating Qbv gating table structures based on the ST time slot slicing and RC time slot slicing strategies, carrying out ST time slot slice frame output scheduling processing and RC time slot frame output scheduling processing based on the ST time slot slicing and RC time slot slicing strategies, realizing decoupling of ST flow and RC flow scheduling planning, not only defining the number of queues in the output queue structure and the flow types corresponding to each queue by a user, but also driving frame output scheduling output according to gating states, wherein the frame scheduling method comprises Qbv gating tables and frame output scheduling, the gating states in the Qbv gating tables are configured by upper layer planning tools, supporting the ST time slot slicing and the slot gating strategies, and the frame output scheduling selecting grouping output according to the current queue gating states and priority strategies, and providing effective support for scheduling logic and upper layer algorithm planning output of data plane output ports.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of a Qbv gating mechanism of a frame output scheduling method supporting a Qbv mechanism in a time sensitive network according to an embodiment of the invention;
fig. 2 is a schematic diagram of ST slot slice and RC slot slice allocation for a frame output scheduling method supporting Qbv mechanism in a time sensitive network according to an embodiment of the present invention;
FIG. 3 is an output queue structure and frame scheduling method for a frame output scheduling method supporting a Qbv mechanism in a time sensitive network according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a Qbv gating table structure of a frame output scheduling method supporting a Qbv mechanism in a time sensitive network according to an embodiment of the invention;
FIG. 5 is a flow chart of ST slot slice frame scheduling for a frame output scheduling method supporting Qbv mechanism in a time sensitive network according to an embodiment of the present invention;
Fig. 6 is a flow chart of RC slot slice frame scheduling for a frame output scheduling method supporting Qbv mechanism in a time sensitive network according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which are derived by a person skilled in the art based on the embodiments of the invention, fall within the scope of protection of the invention.
According to the embodiment of the invention, a frame output scheduling method supporting a Qbv mechanism in a time sensitive network is provided.
As shown in fig. 1 to 6, according to the frame output scheduling method supporting the Qbv mechanism in the time-sensitive network, the scheduling logic of the data plane output port adopting the Qbv gating mechanism and the upper layer planning algorithm design provide effective support, and the method comprises the following steps:
Step S1, pre-calibrating ST time slot slices and RC time slot slices, wherein the steps include that time slot resources are subjected to a slice allocation strategy according to flow characteristics;
In this technical solution, as shown in fig. 2, the time line is divided into equal-length time segments, denoted as blocks, each Block has a length of T4-T0, and includes an ST slot slice (T0-T1 in Block 0), an RC slot slice (T2-T3 in Block 0), and two GB slot slices (T1-T2 and T3-T4 in Block 0). ST slot slice transmits ST and BE frames, RC slot slice transmits RC and BE frames, and GB slot slice avoids packet transmissions across ST and RC slot slices. The respective slot slice lengths of the ST/RC/GB slot slices in each Block are the same, so that as long as the start and end times (T0, T1, T2, T3, T4) of each slot inside the first Block are determined, the start and end times of each slot inside the subsequent blocks can be calculated based on the number of the blocks and the Block length (blen), for example, the RC slot slice real time t6=t2+ blen of the Block 1.
S2, calibrating Qbv output queue structure, wherein the Qbv output queue structure comprises calibration Qbv output queue constraint to simplify data plane forwarding logic and control plane planning;
According to the technical scheme, the design of a data plane forwarding logic and a control plane planning algorithm supporting Qbv is simplified, and Qbv output queue constraint is calibrated based on an output queue structure and a frame scheduling method in the 802.1 Qbv standard, and the method specifically comprises the following steps:
constraint self-defining total number of output queues, flow type and priority corresponding to each queue;
in the same gating list item, at most, only 1 ST queue is gated on, and other ST queues with gating off can only input messages;
restricting the ST queue which is opened for gating, outputting messages only, and requiring all messages in the queue to be completely emptied in an opening time period;
The constraint output queue is selected in a strict priority mode, priorities of all ST queues are the same, priorities can BE distinguished among RC queues, priorities can BE distinguished among BE queues, and meanwhile, the priorities of ST queues are guaranteed to BE higher than priorities of all RC queues and are higher than priorities of all BE queues.
In addition, as shown in fig. 3, in the present technical solution, the Qbv output queues have 8 queues in total, and mainly include the following features:
a) Among the 8 queues, there are 4 ST queues, 2 RC queues (high-low priority) and 2 BE queues (high-low priority);
b) In the same gating list item, at most, gating of 1 ST queues is opened, and other ST queues with gating closed can only input messages.
D) And for the ST queue with the open gate control, only the messages can be output, all the messages in the queue are required to be completely emptied in the opening time period, and the ST time slot planning algorithm can ensure that the ST time slot slice boundary is not exceeded before the emptying.
D) The output queues are selected by adopting a strict priority mode, the priorities of the 4 ST queues are 4, the priorities of the 2 RC queues are 3 and 2, the priorities of the 2 BE queues are 1 and 0, and the priority order is ST0=ST1=ST2=ST3 > RC0> RC1> BE0> BE1.
S3, calibrating a Qbv gating table structure, wherein the Qbv gating table structure is calibrated based on ST time slot slices and RC time slot slices;
according to the technical scheme, as shown in fig. 4, the Qbv gating table structure comprises: queue ID, gating start time and gating state, wherein;
Queue ID, which indicates the queue number corresponding to the gating state;
the gating start time represents the start time of the current gating state to take effect, and the difference value between the effective time of the next gating state and the start time of the current gating state is the time for keeping the current gating state;
The gating state comprises an opening state and a closing state, wherein the opening state represents that the queue allows output of the message at the current moment, and the closing state represents that the queue prohibits output of the message at the current moment.
In addition, to effectively support the slot slice allocation strategy, the Qbv gating table is logically composed of a plurality of blocks, and each Block has 4 entries corresponding to 4 slot slices respectively. In each Block, the gating state of the first entry, i.e., ST slot slice, is: 1 ST queue gating state is on, all BE queue gating states are on, and other queue gating states are off; the third entry, i.e., the gating state of the RC slot slice, is: all RC queues and all BE queues are gated on, and other queues are all off; the gating states of the second and fourth entries, i.e. the GB slots, are all 0. In each Block, except that the gating state of the ST queue in the ST slot slice is configurable, the remaining gating states are predetermined according to the ST slot slice and RC slot slice policies. And determining the gating state of the ST queue in the ST slot slice according to a slot planning result.
In addition, as shown in fig. 4, in this technical solution, the Qbv gating table is logically composed of a plurality of blocks, and each Block has 4 entries corresponding to 4 slot slices. In each Block, the gating states are predetermined except that the gating states of the 4 ST queues in the ST slot slice are configurable. In Block 0, the gating states of the first entry, i.e., the ST slot slice, are in turn: s0=x0, st1=x1, st2=x2, st3=x3, rc0=0, rc1=0, be0=1; BE1 = 1; the third entry, i.e. the gating state of the RC slot slice, is in turn: st0=0, st1=0, st2=0, st3=0, rc0=1, rc1=1, be0=1; BE1 = 1; the gating states of the second and fourth entries, i.e. the GB slots, are all 0. X0, X1, X2, X3 in Block 0, these values need to be determined from the slot planning result of the ST frame.
S4, performing frame scheduling, including ST time slot slice frame output scheduling processing, RC time slot frame output scheduling processing and GB time slot frame output scheduling processing based on ST time slot slice and RC time slot slice strategies; the ST time slot slice frame output scheduling processing mainly schedules and transmits packets in an ST queue and a BE queue with open gating states; the RC time slot frame output scheduling processing mainly schedules and transmits packets in an RC queue and a BE queue with open gating states; and the GB time slot frame output schedule processes that the gating states in the GB time slots are all closed, and scheduling transmission is not performed.
In addition, as shown in fig. 5, in the present technical solution, in Block 0, the time T0-T1 is the ST slot slice, one of four queues ST0, ST1, ST2 and ST3 is gated on, two BE queues are on, and other ST queues and two RC queues are gated off, including the following steps:
step 1, acquiring an ST queue ST_X with a gating on;
step 2, outputting all frames in the ST_X queue;
Step 3: judging whether a BE0 queue in the ST time slot slice has a transmittable message, if so, executing the step 4; if not, executing the step 6;
step 4: outputting a packet in a BE0 queue in the ST slot slice;
step 5: judging whether ST time slot slicing is cut off or not, if so, finishing execution; if not, executing the step 3;
Step 6: judging whether a BE1 queue in the ST time slot slice can send a message, if so, executing a step 7, and if not, executing a step 5;
step 7: outputting one packet in the BE1 queue in the ST slot slice, and executing step 5.
In addition, in this technical solution, as shown in fig. 6, in the RC slot frame output scheduling process, in Block 0, the times T2-T3 are RC slot slices, two RC queues and two BE queues are gated on, and all ST queues are gated off. Executing RC time slot slice frame scheduling process in RC time slot slice, comprising the following steps:
step 1, judging whether a message which can be sent exists in an RC0 queue in an RC time slot, and if so, executing step 2; if not, executing the step 4;
step 2, outputting a packet in an RC0 queue in an RC time slot;
step 3: judging whether the RC time slot is cut off, if so, finishing execution; if not, executing the step 1;
step 4: judging whether a message which can be sent exists in an RC1 queue in an RC time slot, and if so, executing a step 5; if not, executing the step 6;
step 5: outputting a group in an RC1 queue in an RC time slot, and executing the step 3;
step 6: judging whether a BE0 queue in the RC time slot has a transmittable message, if so, executing the step 7; if not, executing the step 8;
Step 7: outputting a packet in a BE0 queue in an RC time slot;
Step 8: judging whether a BE1 queue in the ST time slot slice has a transmittable message, if so, executing a step 9; if not, executing the step 3;
step 9: outputting one packet in the BE1 queue in the ST slot slice, and executing step 3.
In addition, according to the technical scheme, the GB time slot slice frame output scheduling processing is performed, in the Block 0, two time periods of T1-T2 and T3-T4 are GB time slots, the gating states of all queues are closed, and the frame scheduling operation is not executed.
In summary, by means of the above technical solution of the present invention, through pre-calibrating the ST/RC slot slicing strategy, slice allocation strategy is performed on slot resources according to flow characteristics, calibration Qbv output queue constraint is performed to simplify data plane forwarding logic and control plane planning, the structure of the Qbv gating table is calibrated based on the ST slot slicing strategy and the RC slot slicing strategy, ST slot frame output scheduling processing and RC slot frame output scheduling processing are performed based on the ST slot slicing strategy and the RC slot slicing strategy, decoupling of ST flow and RC flow scheduling planning is achieved, not only the number of queues in the output queue structure and the flow type corresponding to each queue are defined by a user, but also the frame output scheduling output is driven according to the gating state, and meanwhile, the frame scheduling method includes the Qbv gating table and frame output scheduling, the gating state in the Qbv gating table is configured by an upper layer planning tool, the scheduling logic and upper layer algorithm design of the data plane output port can be effectively supported, and the frame output scheduling is selected and packet output according to the current queue gating state and priority strategy.
The foregoing is merely a preferred embodiment of the present application and is not intended to limit the present application, and other embodiments of the present disclosure will readily occur to those skilled in the art upon consideration of the specification and disclosure at the examples. This application is intended to cover any adaptations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It is to be understood that the present disclosure is not limited to the precise arrangements and instrumentalities shown in the drawings, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.
Claims (3)
1. A frame output scheduling method supporting Qbv mechanism in a time sensitive network is characterized by comprising the following steps:
Step S1, pre-calibrating ST time slot slices and RC time slot slices, wherein the steps include that time slot resources are subjected to a slice allocation strategy according to flow characteristics;
S2, calibrating Qbv output queue structure, wherein the Qbv output queue structure comprises calibration Qbv output queue constraint to simplify data plane forwarding logic and control plane planning;
S3, calibrating a Qbv gating table structure, wherein the Qbv gating table structure is calibrated based on ST time slot slices and RC time slot slices;
s4, performing frame scheduling, including ST time slot slice frame output scheduling processing and RC time slot frame output scheduling processing based on ST time slot slice and RC time slot slice strategies;
the ST time slot slice frame output scheduling processing comprises the steps of scheduling and transmitting packets in an ST queue and a BE queue with gating states being opened;
the RC time slot frame output scheduling processing comprises scheduling and transmitting the packets in an RC queue and a BE queue with gating states being opened;
The slice allocation strategy for the time slot resources according to the flow characteristics comprises the following steps:
The calibration time line is divided into equal-length time periods which are expressed as blocks, the length of each Block is T4-T0, and the interior of each Block comprises an ST time slot slice, an RC time slot slice and a GB time slot slice;
ST slot slice transmits ST and BE frames, RC slot slice transmits RC and BE frames, GB slot slice avoids packet transmission across ST and RC slot slices;
The method comprises the steps that the lengths of each time slot slice in each Block are the same, and the starting time and the ending time of each time slot in the first Block are determined;
the start and end time of each time slot inside each subsequent Block is calculated based on the Block number and the Block length,
Calibrating Qbv output queue constraint, which comprises the following steps:
constraint self-defining total number of output queues, flow type and priority corresponding to each queue;
in the same gating list item, at most, only 1 ST queue is gated on, and other ST queues with gating off can only input messages;
restricting the ST queue which is opened for gating, outputting messages only, and requiring all messages in the queue to be completely emptied in an opening time period;
the constraint output queues are selected in a strict priority mode, priorities of all ST queues are the same, priorities can BE distinguished among RC queues, priorities can BE distinguished among BE queues, and meanwhile, the priorities of ST queues are guaranteed to BE higher than priorities of all RC queues and are higher than priorities of all BE queues;
wherein, qbv gating table structure includes: queue ID, gating start time and gating state, wherein;
The queue ID represents a queue number corresponding to the gating state;
the gating start time represents the start time of the current gating state to take effect, and the difference value between the effective time of the next gating state and the start time of the current gating state is the time for keeping the current gating state;
The gating states comprise an opening state and a closing state, wherein the opening state represents that the queue allows output messages at the current moment, and the closing state represents that the queue prohibits output messages at the current moment.
2. The frame output scheduling method supporting Qbv mechanism in a time sensitive network according to claim 1, wherein the ST slot slice frame output scheduling process comprises the steps of:
Step S401, acquiring an ST queue ST_X with the gating on;
step S402, outputting all frames in the ST_X queue;
step S403, judging whether all BE queues in the ST time slot slice can send messages, if so, executing step S404; if not, then step S405 is performed;
Step S404, outputting a packet in BE queue with highest priority in ST time slot slice;
step S405, judging whether ST time slot slicing is cut off, if yes, finishing execution; if not, step S403 is performed.
3. The frame output scheduling method supporting Qbv mechanism in a time sensitive network according to claim 2, wherein the RC slot frame output scheduling process comprises the steps of:
step S406, judging whether all RC queues in the RC time slot slice can send messages, if so, executing step S407; if not, executing step S409;
Step S407, outputting a packet in the RC queue with the highest priority in the RC time slot slice;
step S408, judging whether the RC time slot slice is cut off, if so, finishing execution; if not, then step S406 is performed;
Step S409, judging whether all BE queues in the RC time slot slice can send messages, if so, executing step S410; if not, then step S408 is performed;
Step S410, a packet in the BE queue with the highest priority in the RC slot slice is output, and step S408 is executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111681665.XA CN114205315B (en) | 2021-12-30 | 2021-12-30 | Frame output scheduling method supporting Qbv mechanism in time sensitive network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111681665.XA CN114205315B (en) | 2021-12-30 | 2021-12-30 | Frame output scheduling method supporting Qbv mechanism in time sensitive network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114205315A CN114205315A (en) | 2022-03-18 |
| CN114205315B true CN114205315B (en) | 2024-04-19 |
Family
ID=80657963
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111681665.XA Active CN114205315B (en) | 2021-12-30 | 2021-12-30 | Frame output scheduling method supporting Qbv mechanism in time sensitive network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114205315B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107113246A (en) * | 2015-02-13 | 2017-08-29 | 三菱电机株式会社 | Method and its device and computer program product for the traffic shaping of data frame in network |
| CN108235432A (en) * | 2016-12-14 | 2018-06-29 | 中国航空工业集团公司西安航空计算技术研究所 | A kind of BE data frames pre-scheduling method and device based on TTE agreements |
| US10511455B1 (en) * | 2017-09-18 | 2019-12-17 | Xilinx, Inc. | Time sensitive networking control circuitry |
| CN111740924A (en) * | 2020-07-29 | 2020-10-02 | 上海交通大学 | Traffic shaping and routing planning scheduling method of time-sensitive network gating mechanism |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9288149B2 (en) * | 2012-03-08 | 2016-03-15 | Marvell World Trade Ltd. | Method and apparatus for transmitting packets in accordance with IEEE 802.1 Qbv |
| EP3503485B1 (en) * | 2017-12-22 | 2023-01-25 | Marelli Europe S.p.A. | Method for managing traffic in a network based upon ethernet switches, vehicle, communication interface, and corresponding computer program product |
| US11811665B2 (en) * | 2018-01-24 | 2023-11-07 | Renesas Electronics Corporation | Time-sensitive networking |
-
2021
- 2021-12-30 CN CN202111681665.XA patent/CN114205315B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107113246A (en) * | 2015-02-13 | 2017-08-29 | 三菱电机株式会社 | Method and its device and computer program product for the traffic shaping of data frame in network |
| CN108235432A (en) * | 2016-12-14 | 2018-06-29 | 中国航空工业集团公司西安航空计算技术研究所 | A kind of BE data frames pre-scheduling method and device based on TTE agreements |
| US10511455B1 (en) * | 2017-09-18 | 2019-12-17 | Xilinx, Inc. | Time sensitive networking control circuitry |
| CN111740924A (en) * | 2020-07-29 | 2020-10-02 | 上海交通大学 | Traffic shaping and routing planning scheduling method of time-sensitive network gating mechanism |
Non-Patent Citations (1)
| Title |
|---|
| SSA:一种面向CQF模型的TSN资源调度算法;姜旭艳;严锦立;全巍;孙志刚;;东北大学学报(自然科学版)(第06期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114205315A (en) | 2022-03-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gavriluţ et al. | AVB-aware routing and scheduling of time-triggered traffic for TSN | |
| US20220124020A1 (en) | Method of routing in time-sensitive networks | |
| Nayak et al. | Routing algorithms for IEEE802. 1Qbv networks | |
| CN112235194B (en) | Method and device for scheduling delay sensitive flow on line route | |
| KR101977523B1 (en) | Method of traffic shaping of data frames in a network and its devices and computer programs | |
| WO2019084970A1 (en) | Packet forwarding method, forwarding device, and network device | |
| dos Santos et al. | TSNSCHED: Automated schedule generation for time sensitive networking | |
| CN113032938B (en) | Time-sensitive flow routing scheduling method, device, electronic equipment and medium | |
| EP3468118B1 (en) | Method and device to configure real-time networks | |
| US20210067417A1 (en) | Methods, systems and appratuses for optimizing the bin selection of a network scheduling and configuration tool (nst) by bin allocation, demand prediction and machine learning | |
| Ginthör et al. | End-to-end optimized joint scheduling of converged wireless and wired time-sensitive networks | |
| US20210067459A1 (en) | Methods, systems and appratuses for optimizing time-triggered ethernet (tte) network scheduling by using a directional search for bin selection | |
| Heilmann et al. | Size-based queuing: An approach to improve bandwidth utilization in TSN networks | |
| CN112733303B (en) | Multi-strategy industrial TSN shaper modeling method based on deterministic network algorithm | |
| CN114448894A (en) | Multi-level service scheduling engine facing time sensitive network and implementation method | |
| Li et al. | Joint routing and scheduling for dynamic applications in multicast time-sensitive networks | |
| Berisa et al. | AVB-aware routing and scheduling for critical traffic in time-sensitive networks with preemption | |
| Addanki et al. | Moving a step forward in the quest for Deterministic Networks (DetNet) | |
| CN107040440B (en) | Method and apparatus for initiating triggers in a network in an Ethernet-based vehicle | |
| Mariño et al. | Elastic queueing engine for time sensitive networking | |
| Máté et al. | Asynchronous time-aware shaper for time-sensitive networking | |
| CN114205315B (en) | Frame output scheduling method supporting Qbv mechanism in time sensitive network | |
| Singh | Routing algorithms for time sensitive networks | |
| Zheng et al. | Mix-flow scheduling for concurrent multipath transmission in time-sensitive networking | |
| Hotescu et al. | Scheduling rate constrained traffic in end systems of time-aware 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 |