CN114884904A - Deterministic traffic scheduling method and device suitable for predictable time critical services - Google Patents

Deterministic traffic scheduling method and device suitable for predictable time critical services Download PDF

Info

Publication number
CN114884904A
CN114884904A CN202210274896.7A CN202210274896A CN114884904A CN 114884904 A CN114884904 A CN 114884904A CN 202210274896 A CN202210274896 A CN 202210274896A CN 114884904 A CN114884904 A CN 114884904A
Authority
CN
China
Prior art keywords
time
gating
gate
preset
scheduling
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
CN202210274896.7A
Other languages
Chinese (zh)
Other versions
CN114884904B (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.)
Xidian University
Original Assignee
Xidian 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 Xidian University filed Critical Xidian University
Priority to CN202210274896.7A priority Critical patent/CN114884904B/en
Publication of CN114884904A publication Critical patent/CN114884904A/en
Application granted granted Critical
Publication of CN114884904B publication Critical patent/CN114884904B/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
    • H04L49/00Packet switching elements
    • H04L49/30Peripheral units, e.g. input or output ports
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/02Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]

Abstract

The invention discloses a deterministic traffic scheduling method and a deterministic traffic scheduling device suitable for predictable time-critical services, wherein the method comprises the following steps: acquiring a preset scheduling table and a multi-level gating table; in the data forwarding process, the gate state of the queue is set according to the scheduling table and the multi-level gate control table, and the corresponding received data frame is forwarded out of the port according to the current gate state. Because the invention adopts a double-table execution mechanism, controls the change of the gate state of the queue by configuring the multi-level gate control table, and utilizes the scheduling table to schedule and manage the multi-level gate control table, a time protection window can be opened for the expected real-time service flow when the data frame reaches the node, thereby providing the deterministic low-delay and low-jitter transmission service for the intelligent and customized industrial production and the new applications of virtual reality, auxiliary virtual reality, meta space and the like.

Description

Deterministic traffic scheduling method and device suitable for predictable time critical services
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a deterministic traffic scheduling method and device suitable for a predictable Time Critical (Time Critical) service.
Background
Under certain scenarios, the frame transmission time and the overall delay and jitter experienced by the frame arriving at the node are required to have high certainty, for example, in industrial applications such as automobile control, data frames carrying key control information need to be sent according to a certain time period, otherwise, the delay and jitter problems of such time-sensitive frames may cause system failure. The TSN (Time Sensitive Network) can provide real-Time and reliable QoS (Quality of Service) for Time Sensitive services based on the standard ethernet. The gate control scheduling mechanism of the Qbv protocol can create an exclusive protection window on a time axis for the time-sensitive services, only the time-sensitive services are allowed to be transmitted in the protection window, and all other services cannot be involved in a channel. By having a time sensitive frame open a protection window for the time sensitive frame when it reaches a node, it can be ensured that the data frame is processed with minimal delay.
However, with the high integration of industrial manufacturing and information technology, the customization and intelligence of industrial production further develop, the time-critical data transmission mode in the network becomes more and more complex, and currently, the time-critical data transmitted in a single fixed period mode in the TSN may only meet part of the requirements. The transmission pattern of future time critical data streams may be complex periodic or even non-periodic but variations thereof are contemplated. For such complex real-time traffic, the gating scheduling mechanism in the prior art is no longer applicable. Therefore, how to establish a protection window for a complex time-sensitive flow in such an expected service scenario and provide real-time and reliable QoS for the time-sensitive flow becomes a technical problem to be solved in the field.
Disclosure of Invention
In order to solve the above problems in the prior art, the present invention provides a deterministic traffic scheduling method and apparatus suitable for predictable time-critical services. The technical problem to be solved by the invention is realized by the following technical scheme:
in a first aspect, the present invention provides a deterministic traffic scheduling method applicable to an expected time-critical service, which is applied to an output port of a switch, and includes:
acquiring a preset scheduling table and a multi-level gating table; the scheduling table comprises an execution sequence and an execution time of a multi-level gating table in a data forwarding process, the multi-level gating table comprises a plurality of gating tables, and the gating tables comprise gate states preset according to arrival time of data frames;
and in the data forwarding process, setting the gate state of the queue according to the scheduling table and the multi-level gate control table, and forwarding the corresponding received data frame to an output port according to the current gate state.
In one embodiment of the invention, the time of arrival of the data frame is predictable.
In an embodiment of the present invention, the data frame forwarding process includes a plurality of preset periods, and the arrival of the data frame is a periodic function; alternatively, the first and second electrodes may be,
the data frame forwarding process comprises at least one expected arrival time, and the arrival of the data frame is a non-periodic function.
In an embodiment of the present invention, the periodic function is a piecewise function, the preset period includes a plurality of preset time periods, the multi-level gating table includes a plurality of gating tables corresponding to the preset time periods, the scheduling table includes an execution sequence and an execution time of the gating table corresponding to each preset time period in the preset period, and the gating table includes a gate state preset according to an arrival time of a data frame in each preset time period.
In an embodiment of the present invention, in the current preset period, after the step of setting the gate states of the queues according to the schedule table and the multi-level gating table, and forwarding the corresponding received data frame to the output port according to the current gate state, the method further includes:
detecting whether a first cycle start signal is received;
if yes, in the next preset period, executing the steps of setting the gate states of the queue according to the scheduling table and the gate control table corresponding to each time period, and forwarding the corresponding received data frame to the output port according to the current gate state.
In an embodiment of the present invention, in the current preset period, the step of setting a gate state of the queue according to the schedule table and the multi-level gating table, and forwarding a corresponding received data frame to an output port according to the current gate state includes:
in the current preset period, setting the gate state of the queue according to the scheduling table and a gate control table corresponding to the current preset time period, and forwarding the corresponding received data frame to an output port according to the current gate state;
detecting whether a second cycle start signal is received;
if yes, returning to the step of setting the gate state of the queue according to the gate control table corresponding to the scheduling table and the current preset time period;
if not, the gating table in the current preset time period is continuously executed until the execution is finished.
In a second aspect, the present invention further provides a deterministic traffic scheduling apparatus for expectable time-critical traffic, applied to a receiving port of a switch, including:
the device comprises an acquisition unit, a control unit and a control unit, wherein the acquisition unit is used for acquiring a preset scheduling table and a multi-level gating table; the scheduling table comprises an execution sequence and an execution time of a multi-level gating table in a data forwarding process, the multi-level gating table comprises a plurality of gating tables, and the gating tables comprise gate states preset according to arrival time of data frames;
and the setting unit is used for setting the gate state of the queue according to the scheduling table and the multi-level gating table in the data forwarding process and forwarding the corresponding received data frame to the output port according to the current gate state.
Compared with the prior art, the invention has the beneficial effects that:
the invention provides a deterministic traffic scheduling method and a deterministic traffic scheduling device suitable for predictable time-critical services, wherein the method comprises the following steps: acquiring a preset scheduling table and a multi-level gating table; in the data forwarding process, the gate state of the queue is set according to the scheduling table and the multi-level gate control table, and the corresponding received data frame is forwarded out of the port according to the current gate state. Because the invention adopts a double-table execution mechanism, controls the change of the gate state of the queue by configuring the multi-level gate control table, and utilizes the scheduling table to schedule and manage the multi-level gate control table, a time protection window can be opened for the expected real-time service flow when the data frame reaches the node, thereby providing deterministic low-delay and low-jitter transmission service for intelligent and customized industrial production and the expected time sensitive flow which has complex flow characteristics and can appear in the new application of virtual reality, auxiliary virtual reality, meta space and the like.
The present invention will be described in further detail with reference to the accompanying drawings and examples.
Drawings
FIG. 1 is a diagram illustrating the implementation of a gating table in the related art;
FIG. 2 is a diagram illustrating the creation of a protection window in the related art;
fig. 3 is a flowchart of a deterministic traffic scheduling method applicable to an expected time-critical service according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating a preset period being a piecewise function according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a deterministic traffic scheduling method applicable to an expected time-critical service according to an embodiment of the present invention;
fig. 6 is another schematic diagram of a deterministic traffic scheduling method suitable for expectable time-critical traffic according to an embodiment of the present invention;
FIG. 7 is a schematic diagram of a configuration module provided by an embodiment of the invention;
FIG. 8 is a diagram of a schedule execution module and a multi-level gated table execution module according to an embodiment of the present invention;
FIG. 9 is a flowchart of a gated table loop execution provided by an embodiment of the present invention;
FIG. 10 is another flow diagram of a gated table loop execution provided by embodiments of the present invention;
fig. 11 is a schematic structural diagram of a deterministic traffic scheduling apparatus suitable for expectable time-critical services according to an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to specific examples, but the embodiments of the present invention are not limited thereto.
At present, in the transmission process of the time-sensitive stream, in order to avoid interference of other services to the transmission of the time-sensitive service, the gating scheduling algorithm refers to the principle of time division multiplexing, that is, an exclusive transmission protection window is created for the time-sensitive service on a time axis. In the protection window, only time-sensitive service data is allowed to be transmitted, and all other services cannot access a channel; and outside the protection window, other service data is allowed to be transmitted according to respective scheduling algorithms. In order to ensure that the time-sensitive traffic data monopolizes the protection window, it is necessary to ensure that the transmission operation of other traffic data is stopped before the protection window is opened to release the port, thereby avoiding introducing extra delay for the time-sensitive traffic. Therefore, the method must set a guard bandwidth guard band before each guard window is opened, and before the guard bandwidth is finished, the data frame can be transmitted as long as the data frame can be transmitted, otherwise, the transmission is not allowed. The above-mentioned protection window is created by a door operation, the basic principle of which is as follows:
each transmit queue at the output port is associated with a respective gate state, where the gate states are open (o) and closed (c): (A) when the gate state is open, the data frames in the queue can be transmitted according to a corresponding transmission selection algorithm; (B) when the gate state is closed, the data frames in the queue are not allowed to be transmitted. In addition, before each data frame is transmitted, the transmission time of the data and the remaining time when the gate state is opened must be judged, and if the remaining time is not enough for complete transmission of one frame of data, the data frame is not transmitted.
Fig. 1 is a schematic diagram illustrating an implementation process of a gating table in the related art. As shown in fig. 1, each output port of the switch maintains a gating list, and each entry of the gating list corresponds to a gate operation; specifically, each door operation mainly sets two parameters: the system comprises a GateState and a TimeInterval, wherein the gateState is used for setting the corresponding gate state of each transmission queue, and the TimeInterval represents the time interval between two adjacent gate operations. By sequentially executing the gate operations in the gating list, the gate state of each transmission queue can be switched as required, and by reasonably setting the gating list, a protection window as described above can be created for a specific service.
Fig. 2 is a schematic diagram of creating a protection window in the related art. As shown in fig. 2, a gate operation is performed at time T1, and the gate state of each transmission queue is set to ccccccccccc, i.e., the gate states of the other queues are closed except for the gate state of transmission queue 3, and time T1 is the opening time of the protection window; and executing the next gate operation at the time point T2, updating the gate state of each queue to OOOOOOCOOO, namely, the gate states of the other queues are all set to be open except the gate state of the transmission queue 3 is closed, and the time point T2 is the end time of the protection window. By performing these two gate operations, only the gate state of the transmit queue 3 is open from T1 to T2, i.e., only the data frames in the transmit queue 3 can be allowed to be transmitted during this period.
As the actual service scene becomes more and more complex, the transmission mode of the real-time service becomes more and more variable. For complex and variable time-sensitive traffic flows, the traditional gating scheduling mechanism is no longer applicable. How to establish a protection window for a time-sensitive flow in an expected service scene and further provide real-time and reliable QoS for the time-sensitive flow becomes a technical problem to be solved in the field.
In view of this, the present invention provides a deterministic traffic scheduling method suitable for an expectable time-critical service.
Fig. 3 is a flowchart of a deterministic traffic scheduling method applicable to an expected time-critical service according to an embodiment of the present invention. Referring to fig. 3, fig. 3 is a deterministic traffic scheduling method applicable to an expectable time-critical service according to an embodiment of the present invention, and is applied to an output port of a switch, where the method includes:
s1, acquiring a preset scheduling table and a multi-level gating table; the scheduling table comprises an execution sequence and an execution time of a multi-level gating table in the data forwarding process, the multi-level gating table comprises a plurality of gating tables, and the gating tables comprise gate states preset according to the arrival time of data frames;
and S2, in the process of data forwarding, setting the gate state of the queue according to the scheduling table and the multi-level gating table, and forwarding the corresponding received data frame to the output port according to the current gate state.
It should be appreciated that in the deterministic traffic scheduling method provided by the present invention, which is applicable to predictable time critical traffic, all switches between the data source and the receiver are synchronized and the time of arrival of the data frame is predictable.
Illustratively, the forwarding process of the data frame includes a plurality of preset periods, and the arrival of the data frame is a periodic function; alternatively, the data frame forwarding process includes at least one expected arrival time, and the arrival of the data frame is a non-periodic function.
The invention adopts a double-table execution mechanism, can open a time protection window for expectable real-time service flow when a data frame reaches a node, controls the gate state change of a queue by configuring a multi-level gate control table, and carries out scheduling management on the multi-level gate control table by utilizing a scheduling table.
Further, the expected data frame inter-arrival time T i Can be expressed as a discrete function, T i Can be a discrete periodic function or a discrete non-periodic function; specifically, the method comprises the following steps:
(A)T i m, i is 0,1,2, …, i.e. the arrival time interval of the data frame is fixed M.
(B)T i For a complex discrete periodic function, such as a discrete piecewise function:
Figure BDA0003555445260000081
at this time, one preset period may include a plurality of preset time periods, the schedule table includes an execution sequence and an execution time of the gate table corresponding to each preset time period in the preset period, and the gate table includes a gate state preset according to an arrival time of the data frame in each preset time period. Wherein the data source is at t 0 ~t 1 In a preset time period, M 1 The data is transmitted in time intervals, the data source being at t 1 ~t 2 In a preset time period, M 2 The data is transmitted in time intervals, the data source being at t 2 ~t 3 In a preset time period, M 3 The time interval is over which data is transmitted, and then the cycle is repeated.
Fig. 4 is a schematic diagram of a case where the predetermined period is a piecewise function according to an embodiment of the present invention. As shown in FIG. 4, the predetermined period is 20T 0 In the case of (a) as an example,
Figure BDA0003555445260000082
the preset period includes T 0 ~6T 0 Preset time period, 6T 0 ~11T 0 Preset time period and 11T 0 ~20T 0 A preset time period, wherein the time period is 0-6T 0 In a preset time period, the time interval of sending data by the data source is M, and the time interval is 6T 0 ~11T 0 The time interval of the data source for sending the data in the preset time period is 2M and is 11T 0 ~20T 0 And in the preset time period, the time interval of sending data by the data source is 3M, and then the circulation is continued.
(C) f (t) is a discrete non-periodic function, such as: t is i =ai+b,i=0,1,2…。
On the premise that all switches between a sender and a receiver are synchronous, scheduling information is configured in advance according to the time when a service can be expected to reach an output port of the switch, the arrival condition of a data frame under a time margin delta T is predicted for the time when the time reaches a periodic function or a non-periodic function, a protection window is opened for a time sensitive service flow when the time sensitive service flow reaches the output port of the switch, so that the time sensitive data frame is guaranteed to be transmitted in a priority mode, and the time sensitive flow is processed in a determined mode. It should be understood that the time margin Δ T refers to a period of time after the current time, and the length of the time margin Δ T can be set according to the performance of the switch.
Optionally, in the current preset period, after the step of setting the gate state of the queue according to the scheduling table and the multi-level gating table, and forwarding the corresponding received data frame to the port according to the current gate state, the method further includes:
detecting whether a first cycle start signal is received;
if yes, in the next preset period, the steps of setting the gate states of the queues according to the scheduling table and the gate control tables corresponding to all the time periods and forwarding the corresponding received data frames to the output port according to the current gate states are executed.
Specifically, after the output port of the switch completes forwarding the data frame for the current preset period, if the switch receives the first cycle start signal, the gate state of the queue is set according to the scheduling table and the gate control table corresponding to each time period in the next preset period, and the data frame sent by the data source is continuously forwarded.
Optionally, in the step S2, in the current preset period, the step of setting the gate state of the queue according to the scheduling table and the multi-level gating table, and forwarding the corresponding received data frame to the port according to the current gate state includes:
in the current preset period, setting the gate state of the queue according to the scheduling table and a gate control table corresponding to the current preset time period, and forwarding the corresponding received data frame to an output port according to the current gate state;
detecting whether a second cycle start signal is received;
if yes, returning to the step of setting the gate state of the queue according to the gate control table corresponding to the scheduling table and the current preset time period;
if not, the gating table in the current preset time period is continuously executed until the execution is finished.
Fig. 5 is a schematic diagram of a deterministic traffic scheduling method suitable for an expected time-critical service according to an embodiment of the present invention. Specifically, please refer to fig. 4-5, still taking a predetermined period of 20T 0 Each preset period comprising T 0 ~6T 0 Preset time period, 6T 0 ~11T 0 Preset time period and 11T 0 ~20T 0 The case of a preset time period is taken as an example; as shown in fig. 4, for T 0 ~6T 0 Preset time period, switchAccording to schedule and T 0 ~6T 0 A gate state of the queue is set in a gate control table 1 corresponding to a preset time period, and a corresponding received data frame is forwarded according to the gate state at the moment; it should be noted that the gate state of each queue in the preset time period is recorded in the gate control table, and the gate state may change in the preset time period; illustratively, the gating table may store a plurality of entries for determining the gate states of the transmission queues, and the change of the gate states is implemented by executing the entries in the gating table in sequence.
Then, whether a second cycle start signal is received or not is detected; if yes, then T is executed again 0 ~6T 0 And setting the gate state of the queue according to the gate state of the gate table 1 corresponding to the preset time period, and forwarding the corresponding received data frame to the output port according to the gate state at the moment.
When T is 0 ~6T 0 After the data frame in the preset time period is forwarded, selecting the next preset time period 6T according to the scheduling table 0 ~11T 0 Gating table 2, according to 6T 0 ~11T 0 The gate control table 2 corresponding to the preset time period sets the gate state of the queue, continues to receive the data frame sent by the data source, detects a second start signal, and if the second start signal is the second start signal, re-executes 6T 0 ~11T 0 A gate control table 2 corresponding to a preset time period is executed all the time if the preset time period is not the preset time period, and 6T is executed all the time 0 ~11T 0 And (4) presetting a gate control table 2 corresponding to the time period until the execution is finished. Similarly, when 6T 0 ~11T 0 After the data frame in the preset time period is forwarded, the switch transmits the data frame according to the scheduling table and the 11T 0 ~20T 0 The gate control table 3 corresponding to the preset time period sets the gate state of the queue, since 11T 0 ~20T 0 Receiving and forwarding process and T of data frame in preset time period 0 ~6T 0 And 6T 0 ~11T 0 The preset time periods are the same, and therefore are not described herein again.
Fig. 6 is another schematic diagram of a deterministic traffic scheduling method suitable for an expected time-critical service according to an embodiment of the present invention, fig. 7 is a schematic diagram of a configuration module according to an embodiment of the present invention, and fig. 8 is a schematic diagram of a configuration module according to an embodiment of the present inventionThe relationship diagram of the scheduling table execution module and the multi-level gating table execution module. As shown in fig. 6 to 8, the output port of the switch in this embodiment includes a traffic flow monitoring module, a configuration module, and an execution module. The service flow monitoring module is mainly responsible for predicting the sending condition of the data frame and sending a configuration instruction to the configuration module, and specifically, the service flow monitoring module can predict the arrival condition of the service flow in the delta T by combining the sending condition of the data source and the time margin delta T, so as to send a configuration control instruction to the configuration module. If the transmission time interval of the data source is a periodic function with the period as T, a preset period can be divided into T/delta T sections, and the multi-level gating table is configured according to the arrival condition of data in each section. For example, the data frames are at fixed time intervals T 0 Sending data, T can be sent 0 Time period division into T 0 The/delta T sections are the same as the data arrive in each section, so that only one multi-level gating table needs to be configured. On the contrary, if data transmission is performed at non-periodic intervals, the arrival situation of data in the next delta T time is predicted, a new gating table is generated every delta T time, and then a gating scheduling table is configured according to the arrival situation of the data stream and the number of the multi-level gating tables to control the switching of the gating tables.
Further, the configuration module is mainly used for configuring the scheduling table and the multi-level gating table so as to produce the scheduling table and the multi-level gating table according to the configuration control instruction.
Fig. 9 is a flowchart of the gated table loop execution provided by the embodiment of the present invention, and fig. 10 is another flowchart of the gated table loop execution provided by the embodiment of the present invention. Referring to FIGS. 9-10, the execution module primarily controls the queue's gate state changes. The execution module consists of a gate table cycle execution module and a scheduling table cycle execution module and is respectively responsible for the execution of the multi-level gate table and the execution of the scheduling table. As shown in fig. 9, the gated table loop execution module only executes one gated table during operation, and is mainly responsible for executing the currently selected gated table entry, and executing the loop from the first entry to the last entry. And in the process of executing the gate control table circulation execution module, monitoring a gate control table switching instruction at any time, abandoning the current gate control table according to the instruction when receiving the switching instruction, selecting a new gate control table to execute, and otherwise, continuously executing the current gate control table.
The execution flow of the entries of the gating table is shown in fig. 10, where each time the gating table is executed, the gating table is executed sequentially from the first entry, and when the last entry is executed, the gating table is executed again from the first entry. The entry execution flow of the gating scheduling table is consistent with the entry execution flow of the gating table: the execution is started from the first entry, and the execution is started from the first entry to the last entry. When the scheduling table executes a new item content, a gating table switching instruction is given out, and the gating table circulation execution module is instructed to switch the gating table which is currently executed.
Fig. 11 is a schematic structural diagram of a deterministic traffic scheduling apparatus suitable for expecting time-critical services according to an embodiment of the present invention. As shown in fig. 11, an embodiment of the present invention further provides a deterministic traffic scheduling apparatus applicable to predictable time-critical traffic, which is applied to an output port of a switch, and includes:
an obtaining unit 1101, configured to obtain a preset scheduling table and a multi-level gating table; the scheduling table comprises an execution sequence and an execution time of a multi-level gating table in the data forwarding process, the multi-level gating table comprises a plurality of gating tables, and the gating tables comprise gate states preset according to the arrival time of data frames;
the setting unit 1102 is configured to set a gate state of the queue according to the scheduling table and the multi-level gating table during data forwarding, and forward a corresponding received data frame to an output port according to the current gate state.
The embodiment shows that the beneficial effects of the invention are as follows:
the invention provides a deterministic traffic scheduling method and a deterministic traffic scheduling device suitable for predictable time-critical services, wherein the method comprises the following steps: acquiring a preset scheduling table and a multi-level gating table; in the data forwarding process, the gate state of the queue is set according to the scheduling table and the multi-level gate control table, and the corresponding received data frame is forwarded out of the port according to the current gate state. Because the invention adopts a double-table execution mechanism, controls the change of the gate state of the queue by configuring the multi-level gate control table, and utilizes the scheduling table to schedule and manage the multi-level gate control table, a time protection window can be opened for the expected real-time service flow when the data frame reaches the node, thereby providing deterministic low-delay and low-jitter transmission service for intelligent and customized industrial production and the expected time sensitive flow which has complex flow characteristics and can appear in the new application of virtual reality, auxiliary virtual reality, meta space and the like.
In the description of the present invention, the terms "first" and "second" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implying any number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of the present invention, "a plurality" means two or more unless specifically defined otherwise.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples described in this specification can be combined and combined by those skilled in the art.
While the present application has been described in connection with various embodiments, other variations to the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed application, from a review of the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other elements or steps, and the word "a" or "an" does not exclude a plurality. A single processor or other unit may fulfill the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.
The foregoing is a more detailed description of the invention in connection with specific preferred embodiments and it is not intended that the invention be limited to these specific details. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.

Claims (7)

1. A deterministic traffic scheduling method applicable to predictable time-critical traffic, applied to an output port of a switch, includes:
acquiring a preset scheduling table and a multi-level gating table; the scheduling table comprises an execution sequence and an execution time of a multi-level gating table in a data forwarding process, the multi-level gating table comprises a plurality of gating tables, and the gating tables comprise gate states preset according to arrival time of data frames;
and in the data forwarding process, setting the gate state of the queue according to the scheduling table and the multi-level gate control table, and forwarding the corresponding received data frame to an output port according to the current gate state.
2. The method of claim 1, wherein the time of arrival of the data frame is predictable.
3. The method of claim 2, wherein the data frame forwarding process comprises a plurality of preset periods, and the arrival of the data frame is a periodic function; alternatively, the first and second electrodes may be,
the data frame forwarding process comprises at least one expected arrival time, and the arrival of the data frame is a non-periodic function.
4. The method according to claim 3, wherein the periodic function is a piecewise function, the preset period includes a plurality of preset time periods, the multi-level gating table includes a plurality of gating tables corresponding to the preset time periods, the scheduling table includes an execution sequence and an execution time of the gating tables corresponding to each preset time period in the preset period, and the gating tables include a gate state preset according to an arrival time of a data frame in each preset time period.
5. The method according to claim 4, wherein after the step of setting the gate states of the queues according to the scheduling table and the multi-level gating table and forwarding the corresponding received data frames to the ports according to the current gate states in the current preset period, the method further comprises:
detecting whether a first cycle start signal is received;
if yes, in the next preset period, executing the steps of setting the gate states of the queue according to the scheduling table and the gate control table corresponding to each time period, and forwarding the corresponding received data frame to the output port according to the current gate state.
6. The method according to claim 5, wherein the step of setting the gate states of the queue according to the scheduling table and the multi-level gating table and forwarding the corresponding received data frame to the output port according to the current gate state in the current preset period comprises:
in the current preset period, setting the gate state of the queue according to the scheduling table and a gate control table corresponding to the current preset time period, and forwarding the corresponding received data frame to an output port according to the current gate state;
detecting whether a second cycle start signal is received;
if yes, returning to the step of setting the gate state of the queue according to the gate control table corresponding to the scheduling table and the current preset time period;
if not, the gating table in the current preset time period is continuously executed until the execution is finished.
7. A deterministic traffic scheduling apparatus for expectable time critical traffic, applied to an output port of a switch, comprising:
the device comprises an acquisition unit, a control unit and a control unit, wherein the acquisition unit is used for acquiring a preset scheduling table and a multi-level gating table; the scheduling table comprises an execution sequence and an execution time of a multi-level gating table in a data forwarding process, the multi-level gating table comprises a plurality of gating tables, and the gating tables comprise gate states preset according to arrival time of data frames;
and the setting unit is used for setting the gate state of the queue according to the scheduling table and the multi-level gating table in the data forwarding process and forwarding the corresponding received data frame to the output port according to the current gate state.
CN202210274896.7A 2022-03-21 2022-03-21 Deterministic traffic scheduling method and device applicable to predictable time-critical service Active CN114884904B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210274896.7A CN114884904B (en) 2022-03-21 2022-03-21 Deterministic traffic scheduling method and device applicable to predictable time-critical service

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210274896.7A CN114884904B (en) 2022-03-21 2022-03-21 Deterministic traffic scheduling method and device applicable to predictable time-critical service

Publications (2)

Publication Number Publication Date
CN114884904A true CN114884904A (en) 2022-08-09
CN114884904B CN114884904B (en) 2023-08-04

Family

ID=82667093

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210274896.7A Active CN114884904B (en) 2022-03-21 2022-03-21 Deterministic traffic scheduling method and device applicable to predictable time-critical service

Country Status (1)

Country Link
CN (1) CN114884904B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115883482A (en) * 2023-02-27 2023-03-31 鹏城实验室 Implementation method for enhancing TSN equipment gating list and related equipment
WO2024036969A1 (en) * 2022-08-19 2024-02-22 中兴通讯股份有限公司 Control method, communication method, controller, node device, and readable medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113163450A (en) * 2021-04-25 2021-07-23 上海映驰科技有限公司 Gate control list generation method, network device and computer readable storage medium
CN113572706A (en) * 2021-06-16 2021-10-29 燕山大学 Self-adaptive hierarchical scheduling method for boundary-free cooperative control time-sensitive network
CN113645149A (en) * 2021-10-15 2021-11-12 鹏城实验室 Time-sensitive network gating list implementation method and gating list entry generation method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113163450A (en) * 2021-04-25 2021-07-23 上海映驰科技有限公司 Gate control list generation method, network device and computer readable storage medium
CN113572706A (en) * 2021-06-16 2021-10-29 燕山大学 Self-adaptive hierarchical scheduling method for boundary-free cooperative control time-sensitive network
CN113645149A (en) * 2021-10-15 2021-11-12 鹏城实验室 Time-sensitive network gating list implementation method and gating list entry generation method

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2024036969A1 (en) * 2022-08-19 2024-02-22 中兴通讯股份有限公司 Control method, communication method, controller, node device, and readable medium
CN115883482A (en) * 2023-02-27 2023-03-31 鹏城实验室 Implementation method for enhancing TSN equipment gating list and related equipment

Also Published As

Publication number Publication date
CN114884904B (en) 2023-08-04

Similar Documents

Publication Publication Date Title
CN114884904B (en) Deterministic traffic scheduling method and device applicable to predictable time-critical service
TWI601395B (en) Method for traffic shaping of data frames in network and device and computer program product therefor
CN109787919B (en) Information transmission method and device, computer storage medium and terminal
US10447583B2 (en) Packet processing technique for a communication network
Silva et al. On the adequacy of SDN and TSN for Industry 4.0
CN113163450B (en) Gate control list generation method, network device and computer readable storage medium
Imtiaz et al. A performance study of Ethernet Audio Video Bridging (AVB) for Industrial real-time communication
CN114422448B (en) Time-sensitive network traffic shaping method
US11088962B2 (en) Method for performant data transmission in a data network with, in part, real-time requirements and apparatus for carrying out the method
EP2479925B1 (en) Dynamic power management in a communications device
CN116016371A (en) Method, equipment and system for sending message
JP6576571B2 (en) Very low transmission latency for sporadic network traffic
CN112260957A (en) Hierarchical cross traffic scheduling system and method of time-aware shaper for mobile forward network
CN110419204A (en) Transmit method, entity and the program of signal of communication frame
EP3905615A1 (en) Pfc frame-based congestion control method, apparatus, system and storage medium
Yang et al. TC-Flow: Chain flow scheduling for advanced industrial applications in time-sensitive networks
Lv et al. Formal analysis of TSN scheduler for real-time communications
Zhang et al. Wireless/wired integrated transmission for industrial cyber-physical systems: risk-sensitive co-design of 5G and TSN protocols
TWI756666B (en) Method implemented by computer means of a communicating entity in a packet-switched network, and computer program and computer-readable non-transient recording medium thereof, and communicating entity of a packet-switched network
Sabry et al. AVB/TSN protocols in automotive networking
Mateu et al. LETRA: Mapping legacy ethernet-based traffic into TSN traffic classes
CN114205309B (en) Method for precisely calculating frame sending time facing TSN output interface
WO2020088745A1 (en) Methods and devices for deadline-aware flow scheduling in time sensitive networks
WO2022193860A1 (en) Data transmission method and apparatus, electronic device, and storage medium
CN114221912A (en) Time-sensitive network access method for non-periodic time-triggered service flow

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