A time-sensitive network gating configuration method and device

Abstract

The present application discloses a method and device for configuring time-sensitive network gating, which solves the problem of complicated gating configuration caused by too many GCL entries in the prior art. A method for configuring time-sensitive network gating, used in TSN switches, comprises the following steps: obtaining high time-sensitive traffic information; the high time-sensitive traffic information comprises a sequence of arrival times of high time-sensitive flows; determining high time-sensitive flows with a traffic density higher than a set threshold as high-density time periods; the traffic density is the proportion of high-sensitive traffic in the total bandwidth; determining a GCL entry for the high-density time period; all information flows in the high-density time period use the GCL entry. The gating configuration method proposed in the present application combines flow-by-flow scheduling with flow batch processing methods, which reduces the waste of bandwidth resources while ensuring high reliability and low-latency transmission of HTS traffic.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a method and device for configuring time-sensitive network gating. Background Art

[0002] Time-Sensitive Networking (TSN) is defined by the IEEE 802.1 working group. It is a set of standards designed to support the low-latency, high-reliability and deterministic communication needs in areas such as industrial automation, automotive electronics and audio and video transmission. The Time-Aware Shaper (TAS) technology defined by IEEE 802.1Qbv is the core technology of TSN. It achieves precise control of Ethernet traffic through time division multiple access (TDMA). Each TSN switch maintains a gate control list (GCL). TAS gating mechanism is as follows: Figure 1 As shown, GCL usually maintains 8 priority gated queues from 7 to 0. The higher the number, the higher the priority. Traffic with a certain priority is transmitted only when the gate of the corresponding priority is open. Through precise gated scheduling, TAS ensures that high-priority traffic is transmitted within the specified time to prevent low-priority traffic from interfering with it. In addition, TAS is mainly used for high time-sensitive (HTS) traffic. The arrival time of this type of traffic is known and it is cyclical, and its period is the same as the GCL cycle or an integer multiple of it. At present, most studies on TAS set the highest priority queue as the HTS queue, which has a unique transmission time window, and divides the GCL entries into two types, namely: 1. Open the HTS queue gate (priority 7) and close the low time-sensitive (LTS) queue gate (priority 6-0). 2. Close the HTS queue gate and open the LTS queue gate. For the setting of the gate opening time, there are two configuration methods for different scenarios:

[0003] The first method is flow-by-flow scheduling, which allocates a dedicated time slot for each HTS flow, strictly opens the HTS queue gate according to the arrival time of each HTS flow, and closes the gate immediately after each HTS flow transmission is completed, while transmitting LTS flow at other times when HTS is not transmitting. Although this method can accurately arrange each HTS flow in a dedicated time slot to avoid interference from other flows, due to too many GCL entries, the number of guard bands will increase sharply, resulting in a waste of bandwidth resources. The guard band mechanism is an important part of TAS, which can prevent low-priority flows in the LTS queue from not completing transmission after closing the gate, thereby affecting the transmission of high-priority flows in the HTS queue.

[0004] The second method is to perform a coarser-grained stream batch processing GCL configuration method, allocating a larger time window to the HTS priority queue and leaving the rest of the time for LTS traffic transmission. This configuration method minimizes the GCL entries and greatly simplifies the gating configuration, but if there is no time offset for the TSN end device to send traffic, this method will cause the waiting time window to increase significantly, making it impossible for HTS traffic to meet the deadline requirements. In actual applications, traditional terminal devices (such as off-the-shelf sensors) usually do not support the TSN mechanism. In scenarios such as large factories, it is obviously impractical to replace all industrial terminals with TSN-enabled devices. Summary of the invention

[0005] The embodiments of the present application provide a method and device for configuring a time-sensitive network gating, which solves the problem of too many GCL entries and complex gating configuration in the prior art.

[0006] In a first aspect, an embodiment of the present application provides a time-sensitive network gating configuration method for a TSN switch, comprising the steps of:

[0007] Acquire highly time-sensitive traffic information; the highly time-sensitive traffic information includes a highly time-sensitive flow arrival time sequence;

[0008] Determine the high time-sensitive flow whose traffic density is higher than the set threshold as a high-density period; the traffic density is the proportion of the high-sensitive traffic in the total bandwidth;

[0009] A GCL entry is determined for a high-density period; all information flows in the high-density period use the GCL entry.

[0010] In one of the embodiments, the time required for transmission of the highly time-sensitive flows is different, and the highly time-sensitive flow information further includes the time sequence required for transmission;

[0011] The flow density is determined by subtracting the difference between the arrival times of adjacent highly time-sensitive flows from the time required for transmission of the preceding highly time-sensitive flow.

[0012] In one of the embodiments, the time required for transmission of the highly time-sensitive flows is the same, and the traffic density is determined by comparing the arrival times of the highly time-sensitive flows.

[0013] In one embodiment, determining the high density time period specifically comprises the steps of:

[0014] Calculate the traffic density between high time-sensitive flows sequentially;

[0015] The traffic density is compared with the set threshold to determine the high-density period.

[0016] In one embodiment, the difference between the arrival times of adjacent highly time-sensitive flows is less than the time required for transmission of the preceding highly time-sensitive flow, and the starting point of the window of the succeeding highly time-sensitive flow is postponed backward by the difference between the two.

[0017] In one embodiment, the method further comprises the steps of:

[0018] In response to receiving a burst of emergency traffic, determining that the reserved bandwidth can accommodate a high-density period of transmission of at least one burst of emergency traffic; the reserved bandwidth is a continuous bandwidth in the high-density period except for a highly time-sensitive flow;

[0019] Allocate a gate of a certain priority level to sudden emergency traffic;

[0020] A high-density time period that meets the requirements is selected, and a GCL entry of the high-density time period is modified, and an original gate of the GCL entry and a gate of a certain priority level are opened in the entry at the same time.

[0021] Furthermore, within the same gating cycle, the burst emergency traffic selects the high-density time period at the later time.

[0022] In a second aspect, an embodiment of the present application further provides a time-sensitive network gating configuration device, which is used in the gating configuration method described in any one of the embodiments of the first aspect, and comprises: an acquisition module, which is used to acquire high time-sensitive traffic information. A calculation module, which is used to determine that a high time-sensitive flow with a traffic density higher than a set threshold is a high-density period. A determination module, which is used to determine a GCL entry for the high-density period.

[0023] In a third aspect, an embodiment of the present application further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method described in any embodiment of the first aspect.

[0024] In a fourth aspect, an embodiment of the present application further provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the method described in any embodiment of the first aspect is implemented.

[0025] At least one of the above technical solutions adopted in the embodiments of the present application can achieve the following beneficial effects:

[0026] The gating configuration method proposed in this application combines flow-by-flow scheduling with flow batch processing methods, reducing the waste of bandwidth resources while ensuring high-reliability and low-latency transmission of HTS traffic. A method for calculating traffic arrival density and a method for marking high-density time periods are proposed, and the gating configuration method proposed in this application is completed based on the density division, overcoming the resource waste and delay problems caused by too many GCL entries or coarse configuration granularity in existing methods. The proposed configuration method specifically considers the low-latency and high-reliability transmission requirements of sudden emergency control traffic (such as emergency stop button signals), and combines the gating configuration method proposed in this application to utilize existing bandwidth resources to ensure the coordinated transmission of HTS traffic and sudden emergency control traffic, ensuring that sudden emergency traffic can be transmitted in a timely manner even when the network load is large. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0028] Figure 1 It is a schematic diagram of the TAS gating mechanism in the prior art;

[0029] Figure 2 This is a flow chart of a method for configuring a time-sensitive network gating according to an embodiment of the present application;

[0030] Figure 3 This is a schematic diagram of the HTS stream arrival time and the transmission time on the time axis according to an embodiment of the present application;

[0031] Figure 4 This is a schematic diagram of HDI distribution in an embodiment of the present application;

[0032] Figure 5 This is a flow chart of another method for configuring time-sensitive network gating according to an embodiment of the present application;

[0033] Figure 6 A schematic diagram of bandwidth reserved for an embodiment of the present application;

[0034] Figure 7 This is a schematic diagram of the final GCL configuration of the embodiment of the present application;

[0035] Figure 8 This is a structural diagram of a time-sensitive network gating configuration device according to an embodiment of the present application;

[0036] Fig. 9 This is a schematic diagram of the structure of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0037] In order to make the purpose, technical solution and advantages of the present application clearer, the technical solution of the present application will be clearly and completely described below in combination with the specific embodiments of the present application and the corresponding drawings. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present application.

[0038] In order to overcome the defects of the two configuration methods and the pain point of high replacement cost of TSN end equipment, the present invention proposes and designs a gating configuration method based on traffic arrival density, aiming to ensure high reliability and low latency transmission of HTS traffic while reducing bandwidth resource waste. In addition, the method proposed in this application can also provide high reliability and low latency transmission guarantee for sporadic burst emergency control traffic, and provide additional solutions for the transmission of burst high time-sensitive flows.

[0039] The technical solutions provided by various embodiments of the present application are described in detail below in conjunction with the accompanying drawings.

[0040] Figure 2 This is a flow chart of a time-sensitive network gating configuration method according to an embodiment of the present application, which is used in a TSN switch and includes steps 110 to 130.

[0041] Step 110: Acquire highly time-sensitive traffic information; the highly time-sensitive traffic information includes a highly time-sensitive flow arrival time sequence;

[0042] In one of the embodiments, if the time required for transmission of highly time-sensitive flows is the same, the traffic density is determined by comparing the arrival times of the highly time-sensitive flows.

[0043] Since the transmission time of each highly time-sensitive flow is the same, there is no need to consider whether the transmission time of the highly time-sensitive flow will exceed the reserved bandwidth. The traffic density can be calculated by comparing the arrival time difference of adjacent highly time-sensitive flows.

[0044] In one of the embodiments, if the time required for transmission of the highly time-sensitive flows is different, the highly time-sensitive flow information further includes a sequence of time required for transmission;

[0045] The flow density is determined by subtracting the difference between the arrival times of adjacent highly time-sensitive flows from the time required for transmission of the preceding highly time-sensitive flow.

[0046] By calculating the difference between the arrival times of adjacent highly time-sensitive flows and the difference between the transmission times of the preceding highly time-sensitive flows, the size of the reserved bandwidth between the two adjacent highly time-sensitive flows is obtained. By comparing the size of the reserved bandwidth with the set threshold, the traffic density is determined.

[0047] Select the TSN switch that needs to be gated, collect and record the size of each HTS flow and the time when each HTS flow arrives at this switch, and form a time series required for HTS flow transmission {r 1 ,r 2 ,…,r n} and HTS stream transmission starting sequence {t 1 ,t 2 ,…,t n}. i represents the time required for the i-th HTS flow to be transmitted in the switch, r i It is proportional to the size of the HTS flow and is calculated by the ratio of the HTS flow size to the link transmission rate. i Indicates the start time of the transmission of the i-th HTS stream. If the arrival time of this stream does not overlap with the previous stream, then t i is the time when this HTS stream arrives at the switch; if there is overlap, then t i It is necessary to add the waiting time. Assuming that the arrival time of the HTS stream is a positive integer multiple of the gate cycle time (Cycletime, CT), the HTS stream arrival time and the transmission time on the time axis are expressed as follows: Figure 3 shown.

[0048] Step 120: Determine the high time-sensitive flow whose traffic density is higher than the set threshold as a high-density period; the traffic density is the proportion of the high-sensitive traffic in the total bandwidth;

[0049] The traffic density is the ratio of the bandwidth occupied by high-sensitive traffic to the total bandwidth between any high-sensitive traffic.

[0050] In one embodiment, in step 120, determining a high density period specifically includes the steps of:

[0051] Set a density threshold D according to the actual network situation th (D th <1), D th The high density interval (HDI) is calculated for the first to nth streams in sequence, where i = (1, 2, ..., n):

[0052] Step 120-1, sequentially calculating the flow arrival density between high time-sensitive flows;

[0053] Initialize the window starting point to t i＝1 The traffic arrival density between the i-th flow to the k-th flow is calculated sequentially, where k = (i+1, i+2, …, n) and increases. The calculation method of the traffic arrival density is:

[0054]

[0055] The numerator represents the sum of the traffic transmission time between the start of the i-th flow transmission and the end of the k-th flow transmission.

[0056] The denominator represents the total time between the start of the i-th stream transmission and the end of the k-th stream transmission.

[0057] Step 120 - 2 : Compare the traffic arrival density with the set threshold to determine the high-density period.

[0058] The traffic arrival density is a parameter used to measure whether the arrival and transmission of traffic is relatively concentrated or relatively dispersed within a certain period of time.

[0059] Comparison of traffic arrival density and the set threshold:

[0060] If D(i,k) is less than D when k is i+1 th , then it is judged that there is no i The starting HDI of the next calculation window is set to t i+1 ;

[0061] That is, when starting the calculation from the i-th stream, if the density of the first calculation (i.e. k is i+1) does not meet the requirement, the k value will no longer be incremented to continue the calculation, but the calculation of the next stream (i+1) will be directly performed.

[0062] If D(i,k) is greater than D th And D(i,k+1) is less than D th , then t i to k +r k The time period is marked as HDI, and the starting point of the next calculation window is set to t i＝k+1 ;

[0063] That is, when k increases to exceed the set threshold, the density before the set threshold conforms to HDI, and the density after the threshold does not conform to HDI, then the calculation is stopped and the calculation of the k+1th stream is directly started.

[0064] The flow arrival density is calculated and the HDI is determined according to the starting point of the window for the next calculation until i=n.

[0065] In one embodiment, the difference between the arrival times of adjacent highly time-sensitive flows is less than the time required for transmission of the preceding highly time-sensitive flow, and the starting point of the window of the succeeding highly time-sensitive flow is postponed backward by the difference between the two.

[0066] Step 130: Determine a GCL entry for the high-density period; all information flows in the high-density period use the GCL entry.

[0067] After calculating the traffic arrival density and marking HDI for all flows, the HDI distribution is as follows: Figure 4 As shown in the figure, a GCL entry is configured for each HDI at the switch egress port according to the HDI distribution diagram, and a GCL entry is configured for each separate HTS flow that is not within the HDI.

[0068] That is, several entries in each HDI share a configured GCL entry, while each separate HTS not in the HDI uses a separate GCL entry.

[0069] Figure 5 This is another flow chart of a time-sensitive network gating configuration method according to an embodiment of the present application, including steps 210 to 260.

[0070] Step 210: Acquire highly time-sensitive traffic information; the highly time-sensitive traffic information includes a highly time-sensitive flow arrival time sequence;

[0071] Step 220: Determine the high time-sensitive flow whose traffic density is higher than the set threshold as a high-density period; the traffic density is the size of the reserved bandwidth between adjacent high-sensitive flows;

[0072] Step 230: Determine a GCL entry for the high-density period; all information flows in the high-density period use the GCL entry.

[0073] In one embodiment, the method further comprises the steps of:

[0074] Step 240: In response to receiving the burst emergency traffic, determine that the reserved bandwidth can accommodate a high-density period of transmission of at least one burst emergency traffic; the reserved bandwidth is a continuous bandwidth in the high-density period except for the high time-sensitive flow;

[0075] For example, determine the ratio of the size of the burst emergency traffic to the maximum rate of the link.

[0076] If the reserved bandwidth is at least one times greater than the ratio, the high-density period meets the requirement.

[0077] Step 250: Allocate a gate of a certain priority level to the sudden emergency traffic;

[0078] For example, for burst emergency control traffic (such as traffic generated by pressing a red emergency stop button, which is characterized by a small number of bytes and a small burst), priority 6 is assigned to these traffic.

[0079] Step 260: Select a high-density time period that meets the requirements, modify the GCL entry of the high-density time period, and open the original gate of the GCL entry and the gate of a certain priority in the entry at the same time.

[0080] Among the marked HDIs, find the one that meets the requirements, that is, reserve bandwidth B res >λ×burst emergency traffic size / maximum link rate, λ is an integer multiple. The reserved bandwidth is shown as follows Figure 6 Modify the configured gating list and open the gates of queue 7 and queue 6 (i.e. the first and second priority gates) in the GCL entries of the HDI that meets the requirements, to ensure that the emergency control traffic does not occupy additional bandwidth resources and can still be transmitted normally when the LTS flow load is large. The final GCL configuration is as follows Figure 7 shown.

[0081] The guard band mechanism is a key part of TAS, which can prevent low-priority traffic in the LTS queue from failing to complete transmission after the gate is closed, thereby affecting the transmission of high-priority traffic in the HTS queue.

[0082] If the transmission time slot of a high-priority flow is preceded by the transmission time slot of a low-priority flow, a guard band needs to be added between the two time slots. The length of the guard band is fixed to the time length that can accommodate the transmission of a maximum byte flow. The configuration of the guard band is to close the gate completely. Figure 7 Adding the guard band shows the reduction of the guard band and also shows the final GCL configuration.

[0083] In order to ensure the rapid transmission of emergency control traffic, when a burst of emergency control traffic arrives after a certain HDI that meets the requirements, if the previous HDI is selected, it is necessary to wait for the next gating cycle, which seriously affects the efficiency. Therefore, further, within the same gating cycle, the burst of emergency traffic selects the high-density period at the later time.

[0084] Figure 8 This is a structural diagram of a time-sensitive network gating configuration device according to an embodiment of the present application, which is used to implement the gating configuration method described in any embodiment of the first aspect, and includes an acquisition module 310, a calculation module 320 and a determination module 330:

[0085] The acquisition module 310 is used to acquire highly time-sensitive traffic information.

[0086] The calculation module 320 is used to determine that the high time-sensitive flow with a flow density higher than a set threshold is a high-density period.

[0087] The determination module 330 is configured to determine a GCL entry for the high density period.

[0088] In one of the embodiments, the acquisition module further includes a first acquisition unit for acquiring highly time-sensitive traffic information.

[0089] In one of the embodiments, the calculation module further includes a first calculation unit, which is used to determine that a high time-sensitive flow with a flow density higher than a set threshold is a high-density period.

[0090] In one of the embodiments, the determining module comprises a first determining unit configured to determine a GCL entry for the high density period.

[0091] In one of the embodiments, the acquisition module further comprises a second acquisition unit for receiving sudden emergency traffic;

[0092] The calculation module further includes a second calculation unit, which is used for comparing and calculating the sudden emergency flow and the reserved bandwidth.

[0093] The determination module further comprises a second determination unit, which is used to determine a gate to which priority is allocated for sudden emergency traffic.

[0094] The determination module further includes a third determination unit, which is used to select a high-density period that meets the requirements and modify the GCL entry of the high-density period.

[0095] In one of the embodiments, the calculation module further comprises a third calculation unit for calculating the flow density by comparing the arrival time of the high time-sensitive flow.

[0096] In one of the embodiments, the calculation module further comprises a fourth calculation unit, which is used to compare and calculate that the difference between the arrival times of adjacent highly time-sensitive flows is less than the time required for transmission of the preceding highly time-sensitive flow.

[0097] In one of the embodiments, the determining module further comprises a fourth determining unit, configured to determine the time when the sudden emergency traffic arrives.

[0098] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0099] Therefore, the present application also proposes a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the method described in any embodiment of the present application is implemented.

[0100] Furthermore, the present application also proposes an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method described in any embodiment of the present application when executing the computer program.

[0101] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0102] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0103] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0104] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory. The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. Memory is an example of a computer-readable medium.

[0105] Fig. 9 6 is a schematic diagram of the structure of an electronic device according to an embodiment of the present application. The electronic device 600 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiment of the present application. It includes: one or more processors 620; a storage device 610, which is used to store one or more programs. When the one or more programs are run by the one or more processors 620, the one or more processors 620 implement the gate configuration method provided in the embodiment of the present application. The method includes:

[0106] Acquire highly time-sensitive traffic information; the highly time-sensitive traffic information includes a highly time-sensitive flow arrival time sequence;

[0107] Determine the high time-sensitive flow whose traffic density is higher than the set threshold as a high-density period; the traffic density is the size of the reserved bandwidth between adjacent high-sensitive flows;

[0108] A GCL entry is determined for a high-density period; all information flows in the high-density period use the GCL entry.

[0109] The electronic device 600 further includes an input device 630 and an output device 640; the processor 620, storage device 610, input device 630 and output device 640 in the electronic device can be connected via a bus or other means, and the figure takes the connection via a bus 650 as an example.

[0110] The storage device 610, as a computer-readable storage medium, can be used to store software programs, computer executable programs, and module units, such as program instructions corresponding to the method for determining the cloud bottom height in the embodiment of the present application. The storage device 610 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created according to the use of the terminal, etc. In addition, the storage device 610 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the storage device 610 may further include a memory remotely arranged relative to the processor 620, and these remote memories may be connected via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0111] The input device 630 may be used to receive input numbers, character information or voice information, and generate key signal input related to user settings and function control of the electronic device. The output device 640 may include electronic devices such as a display screen and a speaker.

[0112] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0113] The above is only an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.

Claims

1. A time-sensitive network gating configuration method for a TSN switch, characterized in that: Contains steps: Acquire highly time-sensitive traffic information; the highly time-sensitive traffic information includes a highly time-sensitive flow arrival time sequence; Determine the high time-sensitive flow with a flow density higher than a set threshold as a high-density period; The traffic density is the proportion of high-sensitivity traffic in the total bandwidth; A GCL entry is determined for a high-density period; all information flows in the high-density period use the GCL entry; several entries in each high-density period share a configured GCL entry, and each individual high time-sensitive flow not in the high-density period uses a separate GCL entry.

2. The time-sensitive network gating configuration method according to claim 1, characterized in that: Also includes the steps: In response to receiving a burst of emergency traffic, determining that the reserved bandwidth can accommodate a high-density period of transmission of at least one burst of emergency traffic; the reserved bandwidth is a continuous bandwidth in the high-density period except for a highly time-sensitive flow; Allocate a gate of a certain priority level to sudden emergency traffic; A high-density time period that meets the requirements is selected, and a GCL entry of the high-density time period is modified, and an original gate of the GCL entry and a gate of a certain priority level are opened in the entry at the same time.

3. The time-sensitive network gating configuration method according to claim 1, characterized in that: The time required for transmission of highly time-sensitive flows is different, so the highly time-sensitive flow information also includes the time sequence required for transmission; The flow density is determined by subtracting the difference between the arrival times of adjacent highly time-sensitive flows from the time required for transmission of the preceding highly time-sensitive flow.

4. The time-sensitive network gating configuration method according to claim 1, characterized in that: The time required for transmission of highly time-sensitive flows is the same, and the traffic density is determined by comparing the arrival times of the highly time-sensitive flows.

5. The time-sensitive network gating configuration method according to claim 1, characterized in that: Determine the high-density period, including the following steps: Calculate the traffic density between high time-sensitive flows sequentially; The traffic density is compared with the set threshold to determine the high-density period.

6. The time-sensitive network gating configuration method according to claim 1, characterized in that: If the difference between the arrival times of adjacent highly time-sensitive flows is less than the time required for transmission of the preceding highly time-sensitive flow, the starting point of the window of the succeeding highly time-sensitive flow is postponed backward by the difference between the two.

7. The time-sensitive network gating configuration method according to claim 2, characterized in that: In the same gating cycle, emergency traffic selects the high-density period at the later time.

8. A time-sensitive network gating configuration device, characterized in that: The method for configuring time-sensitive network gating according to any one of claims 1 to 7 comprises: An acquisition module, used to obtain highly time-sensitive traffic information; A calculation module, used for determining a high time-sensitive flow with a flow density higher than a set threshold as a high-density period; A determination module is used to determine a GCL entry for the high density period.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

10. An electronic device comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the method according to any one of claims 1 to 7 is implemented.

Images