CN113271264A

CN113271264A - Data stream transmission method and device of time-sensitive network

Info

Publication number: CN113271264A
Application number: CN202110552876.7A
Authority: CN
Inventors: 薛俊礼; 寿国础; 刘雅琼; 胡怡红
Original assignee: Beijing University of Posts and Telecommunications
Current assignee: Beijing University of Posts and Telecommunications
Priority date: 2021-05-20
Filing date: 2021-05-20
Publication date: 2021-08-17
Anticipated expiration: 2041-05-20
Also published as: CN113271264B

Abstract

The embodiment of the application provides a data stream transmission method and device of a time-sensitive network. The scheme is as follows: acquiring mapping information and GCL corresponding to a plurality of data streams to be transmitted; the mapping information and the GCL are determined according to the transmission delay function of each data stream to be transmitted, and the transmission delay is minimized under the preset constraint condition; when at least one data stream to be transmitted is received, storing the at least one data stream to be transmitted into a plurality of virtual queues; based on the mapping relation between the virtual queues and the physical queues included in the mapping information, mapping and storing the data streams to be transmitted in the virtual queues to the physical queues; and aiming at the transmission gate on each physical queue, transmitting the data stream to be transmitted stored in the physical queue after the transmission gate is opened based on GCL. By applying the technical scheme provided by the embodiment of the application, the mutual interference among the data streams is avoided, the time delay requirement of data stream transmission is ensured, and the number of the data streams which can be dispatched by the TSN is increased.

Description

Data stream transmission method and device of time-sensitive network

Technical Field

The application relates to the technical field of internet of things, in particular to a data stream transmission method and device of a time-sensitive network.

Background

In a Time Sensitive Network (TSN), in order to enable a network node to accurately transmit a data stream, and thus provide a delay guarantee for a deterministic service Traffic (i.e., a Scheduled Traffic (ST)), a Time Aware Scheduling (TAS) mode is used to implement Traffic Scheduling in the TSN.

The TAS mode mainly consists of a gating mechanism and a scheduling algorithm. The gating mechanism is a hardware mechanism, and controls data stream transmission by setting the gate state of a transmission gate on a physical queue. And operating a scheduling algorithm in the flow scheduling process, calculating to obtain a gating List (GCL), and maintaining the Gate state and the time interval of each transmission Gate in the GCL, so that the opening and closing of each transmission Gate in the TSN are controlled according to the GCL, and the Control of data stream transmission is realized.

However, when traffic scheduling is performed by the TAS method, a plurality of data streams are inevitably transmitted in the same physical queue due to the limitation of physical resources of the physical queue, particularly in the case of a large number of data streams. At this time, the transmission delay is random due to mutual interference among the data streams, and it is difficult to meet the delay requirement of data stream transmission, thereby limiting the number of data streams schedulable by the TSN.

Disclosure of Invention

An object of the embodiments of the present application is to provide a method and an apparatus for transmitting data streams in a time-sensitive network, so as to avoid related interference between data streams under a condition of physical resource limitation, ensure a delay requirement of data stream transmission, and increase the number of data streams schedulable by a TSN. The specific technical scheme is as follows:

the embodiment of the application provides a data stream transmission method of a time sensitive network, which is applied to a target node in a Time Sensitive Network (TSN), wherein a plurality of virtual queues are preset in the target node, and the method comprises the following steps:

acquiring mapping information and GCL corresponding to a plurality of data streams to be transmitted; the mapping information and the GCL are determined according to the transmission delay function of each to-be-transmitted data stream under the condition of minimizing transmission delay under the preset constraint condition, the transmission delay function of each to-be-transmitted data stream is constructed according to quintuple information of each to-be-transmitted data stream and path information in the TSN, and the preset constraint condition is determined according to queue resources in each node in the TSN, the time when each to-be-transmitted data stream is transmitted to the next node and the deadline in the quintuple information of each to-be-transmitted data stream;

when at least one data stream to be transmitted in the plurality of data streams to be transmitted is received, storing the at least one data stream to be transmitted into the plurality of virtual queues;

based on the mapping relation between the virtual queues and the physical queues included in the mapping information, mapping and storing the data streams to be transmitted stored in the virtual queues to the physical queues;

and aiming at the transmission gate on each physical queue, after the transmission gate on the physical queue is opened based on the opening time specified by the GCL, transmitting the data stream to be transmitted stored in the physical queue.

Optionally, the transmission delay function of each to-be-transmitted data stream is represented as:

wherein ed_kFor a data stream f to be transmitted_kAlong the transmission path_kTransmission delay of transmission, v_i-1Path for transmission path_kNode v of_i-1，v_iPath for transmission path_kNode v of_i，[v_i-1，v_i]Representing a slave node v_i-1Transmission to node v_i，

For a data stream f to be transmitted_kSlave node v_i-1Transmission to node v_iPropagation delay of time, denoted as data stream f to be transmitted_kAt node v_i-1To node v_iThe time delay experienced by propagation on the physical link between,

for a data stream f to be transmitted_kAt the source node src_kThe serialization delay of (a) is delayed,

for a data stream f to be transmitted_kAt the destination node dst_kOf (a) is a serialized time delay of V'_kPath for transmission path_kAll of the nodes in the network are connected,

for a data stream f to be transmitted_kNode v_iThe time delay of the serialization of (a) and (b),

is a node v_iData flow f to be transmitted_kIs represented as a data stream f to be transmitted_kAt node v_iThe forwarding delay experienced by the TSN is taken into account,

for a data stream f to be transmitted_kAt node v_iThe queuing delay of (1) is expressed as a data stream f to be transmitted_kAt node v_iWaiting for a queuing delay when transmitting to a next node;

said queuing delay

Expressed as:

wherein the content of the first and second substances,

is a node v_iPhysical queue of output portq_mThe opening time of the upper transmission gate is,

for a data stream f to be transmitted_kTransmission to node v_iPhysical queue q of output port_mThe time of the corresponding time is the corresponding time,

for a data stream f to be transmitted_kAt node v_iThe time offset parameter of (a) to (b),

for a data stream f to be transmitted_rAt node v_iWith a serialization delay of (k-1) the data stream to be transmitted f_kPhysical queue q of the place_mArranged in a data stream f to be transmitted_kNumber of preceding data streams to be transmitted, Wⁱ(k, m) is node v_iAnd mapping information between the medium virtual queue k and the physical queue m, wherein k is the virtual queue serial number, and m is the physical queue serial number.

Optionally, the preset constraint condition includes a first constraint condition, a second constraint condition, and a third constraint condition;

the first constraint is expressed as:

wherein the content of the first and second substances,

for a full term, denoted each, V is the set of all nodes in the TSN, F is the set of all data streams to be transmitted, l_kFor a data stream f to be transmitted_kThe length of (a) of (b),

is a node v_iPhysical queue q of output port_mThe bandwidth of the communication channel is controlled,

is a node v_iPhysical queue q of output port_mUpper transfer door open window, gcⁱIs a node v_i(ii) a cycle period of the GCL of (1);

the second constraint is expressed as:

wherein f is_kFor a data stream f to be transmitted_k，f_jFor a data stream f to be transmitted_j，

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

For storage at node v_iVirtual queue vq of_nTo be transmitted stream f_kThe corresponding mapped physical queue is a physical queue q_m，

Is a node v_iVirtual queue vq in (1)_n′，

Is a node v_iIn (2) a physical queue q_m′，

For storage at node v_iVirtual queue vq of_n′To be transmitted stream f_jThe corresponding mapped physical queue is a physical queue q_m′，

Is a node v_iPhysical queue q of output port_mThe opening time of the upper transmission gate is,

is a node v_iPhysical queue q of output port_m′The opening time of the upper transmission gate is,

is a physical queue q_m′The open time period of the upper transmission gate,

is a physical queue q_mThe opening duration of the upper transmission gate is U, and the operation is a union set;

the third constraint is expressed as:

wherein st_kFor a data stream f to be transmitted_kAt the moment when the source node starts transmitting, ed_kFor a data stream f to be transmitted_kAlong the transmission path_kTransmission delay in transmission, dl_kFor a data stream f to be transmitted_kThe deadline of (2).

Optionally, the mapping information and the GCL are calculated by using the following formula:

min{sum{ed_k|f_k∈F}}

where min is the minimum operation and sum is the sum operation, { ed_k|f_ke.F is the transmission time delay set of the data stream to be transmitted ed_kFor a data stream f_kAlong the transmission path_kThe transmission delay of the transmission, s.t. represents a constraint,

is a node v_iPhysical queue q of output port_mThe bandwidth of the allocation is determined by the bandwidth allocation,

is a node v_iPhysical queue q of output port_mUpper transfer door open window, gcⁱIs a node v_iCycle period of GCL in (1), f_kFor a data stream f to be transmitted_k，f_jFor a data stream f to be transmitted_j，

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

Is a node v_iVirtual queue vq in (1)_n′，

Is a node v_iIn (2) a physical queue q_m′，

is a physical queue q_m′The open time period of the upper transmission gate,

is a physical queue q_mThe opening duration of the upper transmission gate, U is the union operation, st_kFor a data stream f to be transmitted_kAt the moment when the source node starts transmitting, ed_kFor a data stream f to be transmitted_kAlong the transmission path_kTransmission delay in transmission, dl_kFor a data stream f to be transmitted_kThe deadline of (2).

Optionally, the mapping information further includes a numerical value indicating an order in which each data stream to be transmitted is mapped to the physical queue;

the step of mapping and storing the data streams to be transmitted stored in the plurality of virtual queues to the physical queues based on the mapping relationship between the virtual queues and the physical queues included in the mapping information includes:

and based on the mapping relation between the virtual queues and the physical queues included in the mapping information and a numerical value indicating the sequence of mapping each data stream to be transmitted to the physical queues, mapping and storing each data stream to be transmitted stored in the plurality of virtual queues to the physical queues.

The embodiment of the present application further provides a data stream transmission device for a time-sensitive network, which is applied to a target node in a TSN of the time-sensitive network, where the target node is preset with a plurality of virtual queues, and the device includes:

the device comprises an acquisition module, a transmission module and a transmission module, wherein the acquisition module is used for acquiring mapping information and GCL corresponding to a plurality of data streams to be transmitted; the mapping information and the GCL are determined according to the minimum transmission delay and the minimum transmission delay of the transmission delay function of each to-be-transmitted data stream under a preset constraint condition, the transmission delay function of each to-be-transmitted data stream is constructed according to quintuple information of each to-be-transmitted data stream and path information in the TSN, and the preset constraint condition is determined based on queue resources in each node in the TSN, the time when each to-be-transmitted data stream is transmitted to the next node and the deadline in the quintuple information of each to-be-transmitted data stream;

the first storage module is used for storing at least one data stream to be transmitted into the plurality of virtual queues when the at least one data stream to be transmitted in the plurality of data streams to be transmitted is received;

a second storage module, configured to map and store data streams to be transmitted stored in the plurality of virtual queues to a physical queue based on a mapping relationship between the virtual queue and the physical queue included in the mapping information;

and the transmission module is used for transmitting the data stream to be transmitted stored in the physical queue after the transmission gate on the physical queue is opened based on the opening time specified by the GCL aiming at the transmission gate on each physical queue.

is to be transmittedStream f_kAt node v_iThe queuing delay of (1) is expressed as a data stream f to be transmitted_kAt node v_iWaiting for a queuing delay when transmitting to a next node;

said queuing delay

Expressed as:

wherein the content of the first and second substances,

is a node v_iThe opening moment of the transmission gate on the physical queue qm of the output port,

the first constraint is expressed as:

wherein the content of the first and second substances,

the second constraint is expressed as:

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

For storage at node v_iVirtual queue vq of_nTo be transmitted stream f_kThe corresponding mapped physicsThe queues are physical queues q_m，

Is a node v_iVirtual queue vq in (1)_n′，

Is a node v_iIn (2) a physical queue q_m′，

is a physical queue q_m′The open time period of the upper transmission gate,

the third constraint is expressed as:

wherein st_kFor a data stream f to be transmitted_kAt the moment when the source node starts transmitting, ed_kFor a data stream f to be transmitted_kAlong the transmission path_kTransmission ofTime delay of transmission, dl_kFor a data stream f to be transmitted_kThe deadline of (2).

min{sum{ed_k|f_k∈F}}

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

Is a node v_iVirtual queue vq in (1)_n′，

Is a node v_iIn (2) a physical queue q_m′，

is a physical queue q_m′The open time period of the upper transmission gate,

the second storage module is specifically configured to map and store each to-be-transmitted data stored in the plurality of virtual queues to the physical queue based on a mapping relationship between the virtual queue and the physical queue included in the mapping information and a numerical value indicating a sequence in which each to-be-transmitted data stream is mapped to the physical queue.

The embodiment of the application also provides a TSN node, which comprises a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory complete mutual communication through the communication bus;

a memory for storing a computer program;

and the processor is used for realizing the data stream transmission method steps of any one time-sensitive network when executing the program stored in the memory.

An embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored, and when being executed by a processor, the computer program implements any of the above steps of the data stream transmission method for a time-sensitive network.

Embodiments of the present application further provide a computer program product containing instructions, which when run on a computer, cause the computer to execute any one of the above-mentioned methods for data streaming of a time-sensitive network.

The embodiment of the application has the following beneficial effects:

according to the data stream transmission method and device for the time-sensitive network, a plurality of virtual queues are preset in each node in the TSN, so that when any node receives at least one data stream to be transmitted, the data stream to be transmitted stored in the virtual queues can be mapped and stored to the physical queues according to the obtained mapping information, and then the transmission gate on the physical queue is opened according to the obtained GCL specified open time to transmit the data stream to be transmitted in the physical queue. Compared with the related technology, the data to be transmitted is mapped and stored from the virtual queue to the physical queue through the mapping information, and the GCL controls the opening of the transmission gate on the physical queue, so that the stream isolation of a plurality of data streams to be transmitted can be effectively realized, and the mutual interference among the data streams to be transmitted is avoided. In addition, the mapping information and the GCL are determined according to the minimum transmission delay and the minimum transmission delay of the transmission delay function of each to-be-transmitted data under the preset constraint condition, and are constrained by the preset constraint condition, that is, the bandwidth resource of the physical queue of each node, the time when each to-be-transmitted data stream is transmitted to the next node, and the constraint condition corresponding to the deadline in the quintuple information of each to-be-transmitted data stream, so that the determined mapping information and the GCL ensure the transmission time of each to-be-transmitted data stream on the premise of meeting the deadline of each to-be-transmitted data, that is, the maximization of the number of the data streams transmitted by each node on the premise of ensuring the minimum transmission delay and the minimum transmission delay. Therefore, by adopting the technical scheme provided by the application, under the condition of physical resource limitation, the isolation among a plurality of data streams is realized through the configuration of virtual resources in the virtual queue, the mutual interference among the data streams is avoided, the time delay requirement of data stream transmission is ensured, and the number of data streams schedulable by the TSN is increased.

Of course, not all advantages described above need to be achieved at the same time in the practice of any one product or method of the present application.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and it is also obvious for a person skilled in the art to obtain other embodiments according to the drawings.

FIG. 1 is a schematic diagram of any node in a TSN of the related art;

fig. 2 is a schematic flowchart of a data stream transmission method of a time-sensitive network according to an embodiment of the present application;

fig. 3 is a schematic diagram of a data streaming process of a time-sensitive network according to an embodiment of the present application;

fig. 4 is a schematic diagram of the number of TSN maximum schedulable data streams provided by the embodiment of the present application;

fig. 5 is a schematic diagram of a cumulative distribution of propagation delays according to an embodiment of the present application;

fig. 6 is a schematic structural diagram of a data stream transmission apparatus of a time-sensitive network according to an embodiment of the present application;

fig. 7 is a schematic structural diagram of a TSN node according to an embodiment of the present disclosure.

Detailed Description

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments that can be derived by one of ordinary skill in the art from the description herein are intended to be within the scope of the present disclosure.

A plurality of nodes (i.e., TSN nodes) are included in the TSN, each node being an electronic device. Here, the number of nodes included in the TSN is not particularly limited.

For ease of understanding, fig. 1 is used as an example for illustration. Fig. 1 is a schematic diagram of any node in a TSN of the related art. In the node shown in fig. 1, 4 physical queues, physical queue 1-physical queue 4, are included on the output port of the node. There is a corresponding transmission gate on each physical queue, transmission gate S1-transmission gate S4. The GCL module in the node shown in FIG. 1 implements the opening and closing of the transmission gate S1-transmission gate S4 according to the received GCL, thereby implementing the transmission of the data stream stored in the corresponding physical queue.

When a large number of data streams to be transmitted are received by the TSN, because the number of the data streams to be transmitted is large, the number of the data streams to be transmitted received by the node shown in fig. 1 may be one or more. For example, there are 7 data streams to be transmitted at a time transmitted by the node shown in fig. 1. At this time, due to the limitation of the physical resource of the physical queue in the node, in the transmission process, the related interference between different data streams in the same physical queue and the mutual interference between data streams in different physical queues also cause that the transmission delay of each to-be-transmitted data stream has randomness, so that the transmission delay of the data stream may not meet the transmission delay requirement of the data stream, for example, exceed the deadline (i.e., deadline) of the data stream, thereby limiting the number of data streams schedulable by the TSN.

In order to solve the problems in the related art, embodiments of the present application provide a data streaming method for a time-sensitive network. As shown in fig. 2, fig. 2 is a schematic flowchart of a data stream transmission method of a time-sensitive network according to an embodiment of the present application. The method is applied to a target node in the TSN, and a plurality of virtual queues are preset in the target node. The method specifically comprises the following steps.

Step S201, obtaining mapping information and GCL corresponding to a plurality of data streams to be transmitted.

The mapping information and the GCL are determined according to the transmission delay function of each to-be-transmitted data stream under the condition of a preset constraint, and the transmission delay function of each to-be-transmitted data stream is constructed according to the quintuple information of each to-be-transmitted data stream and the path information in the TSN. The preset constraint condition is determined based on queue resources in each node in the TSN, the time when each data stream to be transmitted is transmitted to the next node, and the deadline in the quintuple information of each data stream to be transmitted.

Step S202, when at least one data stream to be transmitted in the multiple data streams to be transmitted is received, storing the at least one data stream to be transmitted into the multiple virtual queues.

Step S203, based on the mapping relationship between the virtual queue and the physical queue included in the mapping information, mapping and storing the to-be-transmitted data stream stored in the plurality of virtual queues to the physical queue.

Step S204 is to transmit the data stream to be transmitted stored in each physical queue after the transmission gate on the physical queue is opened based on the open time specified by the GCL for the transmission gate on the physical queue.

In this embodiment of the present application, the TSN includes a plurality of nodes, and each node is preset with a plurality of virtual queues. The target node may be any node in the TSN. Here, the number of nodes included in the target node, TSN, and the number of virtual queues included in each node are not particularly limited.

By adopting the method provided by the embodiment of the application, a plurality of virtual queues are preset in each node in the TSN, so that when any node receives at least one data stream to be transmitted, the data stream to be transmitted stored in the virtual queue can be mapped and stored to the physical queue according to the obtained mapping information, and then the data stream to be transmitted in the physical queue is transmitted by opening the transmission gate on the physical queue according to the obtained GCL specified open time. Compared with the related technology, the data to be transmitted is mapped and stored from the virtual queue to the physical queue through the mapping information, and the GCL controls the opening of the transmission gate on the physical queue, so that the stream isolation of a plurality of data streams to be transmitted can be effectively realized, and the mutual interference among the data streams to be transmitted is avoided. In addition, the mapping information and the GCL are determined according to the minimum transmission delay and the minimum transmission delay of the transmission delay function of each to-be-transmitted data under the preset constraint condition, and are constrained by the preset constraint condition, that is, the bandwidth resource of the physical queue of each node, the time when each to-be-transmitted data stream is transmitted to the next node, and the constraint condition corresponding to the deadline in the quintuple information of each to-be-transmitted data stream, so that the determined mapping information and the GCL ensure the transmission time of each to-be-transmitted data stream on the premise of meeting the deadline of each to-be-transmitted data, that is, the maximization of the number of the data streams transmitted by each node on the premise of ensuring the minimum transmission delay and the minimum transmission delay. Therefore, by adopting the technical scheme provided by the application, under the condition of physical resource limitation, the isolation among a plurality of data streams is realized through the configuration of virtual resources in the virtual queue, the mutual interference among the data streams is avoided, the time delay requirement of data stream transmission is ensured, and the number of data streams schedulable by the TSN is increased.

The following examples are given to illustrate the examples of the present application.

For the step S201, mapping information and GCL corresponding to a plurality of data streams to be transmitted are obtained.

In this step, after a first node in the TSN receives data streams to be transmitted sent by a plurality of other devices, a traffic scheduling module included in a configuration scheduling layer in the network constructs and obtains a transmission delay function of each data stream to be transmitted when the data stream to be transmitted is transmitted in the TSN according to quintuple information of each data stream to be transmitted and path information in the TSN by using a scheduling algorithm, so that the sum of transmission delays is minimized under a preset constraint condition according to the transmission delay function of each data stream to be transmitted, and mapping information and GCL are determined. At this time, the traffic scheduling module may issue the mapping information and the GCL to each node in the TSN. Each node in the TSN receives the mapping information and the GCL sent by the traffic scheduling module. For the determination of the mapping information and GCL, reference is made to the following description, which is not specifically described herein.

In this embodiment of the present application, when the target node is the first node in the TSN, the steps of obtaining the mapping information and the GCL are performed after the step of receiving the data stream to be transmitted. When the target node is not the first node in the TSN, the above steps of obtaining the mapping information and the GCL are performed before the step of receiving the data stream to be transmitted. Here, the execution sequence of the step of the target node acquiring the mapping information and the GCL and the step of the target node receiving the data stream to be processed is not particularly limited.

The data stream to be transmitted is the ST stream. The data streams in the TSN may include timely serviced data streams and punctual serviced data streams. The data streams for the just-in-time service and the data streams for the just-in-time service are collectively referred to as ST streams. The delay requirement of the timely-served data stream defines an upper limit value of the transmission delay, that is, the data stream must be transmitted at a time corresponding to the upper limit value. The delay requirement of the data stream of the just-in-time service defines an upper limit value and a lower limit value of the transmission delay, that is, the data stream must be transmitted within a time period corresponding to the upper limit value and the lower limit value.

With respect to the step S202, when at least one data stream to be transmitted in the multiple data streams to be transmitted is received, the at least one data stream to be transmitted is stored in the multiple virtual queues.

In this step, when the target node receives at least one to-be-transmitted data stream of the multiple to-be-transmitted data streams, a corresponding virtual queue may be allocated for each received to-be-transmitted data stream, and each to-be-transmitted data stream is stored in the allocated virtual queue.

When the corresponding virtual queue is allocated to each received data to be transmitted, each virtual queue can be allocated to only one data stream to be transmitted. That is, only one data stream to be transmitted is stored in each virtual queue.

In an optional embodiment, the target node may allocate a corresponding virtual queue to each received data stream to be transmitted according to the virtual resource of each virtual queue and the data amount of each data stream to be transmitted. Here, the allocation of the virtual queue corresponding to each data stream to be transmitted is not specifically described.

In step S203, the to-be-transmitted data streams stored in the virtual queues are mapped and stored to the physical queues based on the mapping relationship between the virtual queues and the physical queues included in the mapping information.

In this embodiment, the mapping information received by each node in the TSN includes a mapping relationship between the virtual queue and the physical queue, and a numerical value (i.e., a sequence number) indicating an order in which each data stream to be transmitted is mapped to the physical queue.

In an optional embodiment, in step S203, based on the mapping relationship between the virtual queue and the physical queue included in the mapping information, the to-be-transmitted data stream stored in the multiple virtual queues is mapped and stored to the physical queue, which may be specifically represented as:

and mapping and storing each data to be transmitted stored in the plurality of virtual queues to the physical queue based on the mapping relation between the virtual queues and the physical queues included in the mapping information and a numerical value indicating the sequence of mapping each data stream to be transmitted to the physical queue.

For the sake of understanding, the above mapping information is described by taking the form of a mapping matrix as an example. In the mapping matrix, the value of a matrix element corresponding to the mapping relationship between a virtual queue and a physical queue is 0, which indicates that the data stream to be transmitted stored in the virtual queue cannot be mapped and stored in the physical queue. The value of a matrix element corresponding to the mapping relation between a certain virtual queue and a certain physical queue is greater than 0, which indicates that the data stream to be transmitted stored in the virtual queue is mapped and stored to the physical queue, and the matrix element greater than 0 indicates the sequence of the data stream to be transmitted stored in the virtual queue mapped to the physical queue.

Assume now that the number of virtual queues in the target node is 4, queue A1-queue A4. The number of physical queues is 2, queue B1 and queue B2. The number of the data streams to be transmitted currently received by the target node is 4, namely, the data streams 1 to 4, and the data streams 1 to 4 are respectively and correspondingly stored in the queues a1 to a 4. The mapping information between the virtual queue and the physical queue in the node may be shown as a matrix a, where the matrix a:

according to the matrix a, the target node may determine that data stream 1 and data stream 4 stored in the queue a1 and the queue a4 are mapped and stored in the queue B2, data stream 2 and data stream 3 stored in the queue a2 and the queue A3 are mapped and stored in the queue B1, and the mapping sequence corresponding to data stream 1-data stream 4 sequentially is: data stream 1, data stream 2, data stream 3 and data stream 4.

The above embodiment only exemplifies that the mapping information is represented in the form of a mapping matrix, and besides, the mapping information may be represented in other forms, such as a mapping table. Here, the expression form of the mapping information is not particularly limited.

In this embodiment, the target node includes a plurality of physical queues, and the number of the physical queues included in the target node is not specifically limited.

In step S204, that is, for the transmission gate on each physical queue, after the transmission gate on the physical queue is opened based on the open time specified by the GCL, the data stream to be transmitted stored in the physical queue is transmitted.

In this step, each physical queue in the target node has a corresponding transmission gate, and after the GCL is obtained, the GCL includes a gate state and a time interval corresponding to the transmission gate in each physical queue. The target node may control the opening or closing of the transmission gate on each physical queue, and the opening duration or the closing duration according to the acquired gate state and time interval included in the GCL. After the data streams to be transmitted stored in each virtual queue are mapped and stored in the physical queues, the target node may open the transmission gate on each physical queue according to the obtained open time specified by the GCL, and sequentially transmit each data stream to be transmitted according to the arrangement order of the data streams to be transmitted on each physical queue when the transmission gate on each physical queue is open.

In the embodiment of the present application, the data stream transmission method of the time-sensitive network shown in fig. 2 is described by taking transmission of a data stream to be transmitted on one node of a TSN as an example. And according to the difference of the source node and the destination node in the quintuple information of each data stream to be transmitted, the transmission path of each data stream to be transmitted in the TSN is different. That is, each data stream to be transmitted passes through different nodes. The transmission process of each node on the corresponding transmission path of each data stream to be transmitted can refer to the transmission process in the target node, which is not specifically described herein.

For ease of understanding, the transmission process of the data stream to be transmitted received by the TSN is described below with reference to fig. 3. Fig. 3 is a schematic diagram of a data stream transmission process of a time-sensitive network according to an embodiment of the present application.

The configuration scheduling layer and the network infrastructure layer are mainly included in fig. 3. The configuration scheduling layer comprises a topology building module, a flow scheduling module and a virtual resource pool. The topology discovery in the topology construction module is used for determining the topology relationship among the nodes in the TSN, that is, the connection relationship among the nodes. And the path calculation in the topology construction module is used for calculating the path information of the TSN according to the output result of the topology discovery. And the traffic scheduling module is used for performing mapping table calculation and GCL calculation so as to obtain the mapping information and GCL, and sending the calculated mapping information and GCL to the node 1-node n. The queue resources of the virtual queue allocated to each node in the TSN, that is, the queues, buffers, bandwidths, and the like shown in fig. 3, are recorded in the virtual resource pool. The network facility layer comprises a terminal 1, a TSN and a terminal 2. The TSN includes a plurality of nodes, i.e., node 1-node n shown in fig. 3.

Now, assume that the terminal 1 sends a data stream a, i.e. the data stream to be transmitted, to the terminal 2 through the TSN, where a transmission path of the data stream a is from node 1 to node n in the TSN shown in fig. 3. The transmission of this data stream a is accompanied by the transmission of a large number of other data streams to be transmitted.

When the node 1 in the TSN receives the data stream a and other data streams to be transmitted, the traffic scheduling module determines a mapping table corresponding to a mapping relationship between a virtual queue and a physical queue, that is, the mapping information, and a GCL corresponding to each transmission gate, according to quintuple information of each data stream to be transmitted currently, path information of the TSN calculated by the topology construction module, and queue resources in the virtual resource pool, and sends the determined mapping table and the GCL to each node in the TSN.

After data flow a is transmitted to node 1, node 1 may assign one of queue a 1-queue D1 included in the virtual queue to data flow a. For example, node 1 assigns queue a1 to data flow a. At this point, data flow a will be stored in queue a 1. According to the mapping table sent by the traffic scheduling module, the data stream a stored in the queue a1 is mapped and stored into a corresponding physical queue (i.e., the queue 11 or the queue 12 shown in fig. 3). For example, data flow a is mapped to physical queue 11. The transmission gates on the queue 11 are opened and closed according to the GCL issued by the traffic scheduling module. If there is no other data stream to be transmitted before the data stream a in the queue 11, the data stream a is transmitted to the node 2 in the TSN when the transmission gate on the queue 11 is opened next time. By analogy, data stream a is transmitted to node n according to the transmission path of data stream a, so that data stream a is transmitted to terminal 2 through node n.

Compared with the related art, by arranging the virtual queue in each node of the TSN, the method and the system can realize the flow isolation of a plurality of data flows under the condition of not being limited by physical resources, avoid the mutual interference among the data flows to be transmitted, ensure the time delay requirement of data flow transmission and increase the number of the data flows schedulable by the TSN.

In this embodiment of the present application, the multiple data streams to be transmitted may be represented as a data stream set, that is, a set F, where any data stream to be transmitted in the set is denoted as a data stream F to be transmitted_k，f_k∈F。

Each data stream f to be transmitted_ke.F from quintuple information (src)_k，dst_k，dl_k，p_k，l_k) And (4) showing. Wherein, src_kFor a data stream f to be transmitted_kSource node of, dst_kFor a data stream f to be transmitted_kDestination node of dl_kFor a data stream f to be transmitted_kDeadline of p_kFor a data stream f to be transmitted_kPeriod of (a) of_kFor a data stream f to be transmitted_kLength of (d).

L in the above five-tuple information_kExpressed as the size of the data stream to be transmitted in each period, l_kThe unit is a byte. Dl as described above_kMeans must be in dl_kData flow f to be transmitted is completed before_kTo be transmitted.

In the embodiment of the present application, all the parameters in the five-tuple information of each data stream to be transmitted are positive integers for the sake of no loss of generality.

In the embodiment of the present application, the TSN may be expressed as (V, E) in the directed graph G. Where V is the set of all nodes in the TSN, E is the set of all physical links in the TSN, and the link [ V ] in E_i，v_j]Connection source node v_iAnd destination node v_j. By node v_iFor example, at node v_iInvolving a plurality of virtual queues, i.e. VQⁱSpecifically, it can be expressed as:

node v_iThe output port corresponds to a set of physical queues QⁱSpecifically, it can be expressed as:

in an optional embodiment, when the TSN receives multiple data to be transmitted, the traffic scheduling module may determine a transmission path of each data stream to be transmitted in the TSN according to a source node and a destination node in the received quintuple information of each data stream to be transmitted and path information in the TSN. Therefore, for each data stream to be transmitted, a transmission delay function when the data stream to be transmitted is transmitted in the TSN, that is, a transmission delay function corresponding to the transmission delay (that is, end-to-end delay) in the process of transmitting the data stream to be transmitted from the source node to the target node, is constructed according to the propagation delay, the forwarding delay, the serialization delay and the queuing delay of the data stream to be transmitted when the data stream to be transmitted is transmitted between every two nodes on the corresponding transmission path. The queuing delay is determined according to a time offset parameter corresponding to the data stream to be transmitted after the data stream to be transmitted is mapped to the physical queue from the virtual queue.

Specifically, for each acquired data stream to be transmitted, the quintuple information of the data stream to be transmitted includes a source node and a destination node, that is, the src_kAnd dst_kAccording to eachThe source node and the destination node included in the quintuple information of the data stream to be transmitted and the path information in the TSN calculated by the path calculation module can obtain the transmission path of each data stream to be transmitted when the data stream is transmitted in the TSN. I.e., each node through which each data stream to be transmitted passes when transmitted in the TSN, and the order of each node through which each data stream passes.

For ease of understanding, the data stream f to be transmitted is still referred to above_kFor example, a data stream f to be transmitted_kTransmission path in TSN_kCan be expressed as: path_k＝{[src_k，v₁]，[v₁，v₂]，...，[v_i-1，v_i]，[v_i，dst_k]}。

After the transmission path of each data stream to be transmitted in the TSN is determined, considering that each data stream to be transmitted needs to sequentially pass through a serialization process, a data transmission process, a queuing process and a forwarding process when transmitted between any two nodes, for each data stream to be transmitted, a transmission delay function when the data stream to be transmitted is transmitted in the TSN is constructed and obtained according to a propagation delay, a forwarding delay, a serialization delay and a queuing delay which are correspondingly generated when the data stream to be transmitted is transmitted between every two nodes on the corresponding transmission path.

For the sake of understanding, only the data stream f to be transmitted is described above_kAt its corresponding transmission path_kUpper by node v_i-1Transmission to node v_iThe description is given for the sake of example.

Data stream f to be transmitted_kAt the slave node v_i-1Transmission to node v_iAt node v, at_i-1To transmit data stream f_kThe serialization process is carried out, and the process generates serialization time delay which is marked as

After the serialization process, pass through node v_i-1And node v_iThe physical link between the two transmits the serialized data stream f to be transmitted_kPropagation to node v_iThis process will create propagation delayIs marked as

At node v_iWill receive node v_i-1Transmitted serialized data stream f to be transmitted_kAt this time, the received data stream is serialized, and this process generates serialization delay, which is recorded as

After the serialization process, the data stream f to be transmitted_kStoring the data stream f to be transmitted in the virtual queue according to the determined mapping relation between the virtual queue and the physical queue_kWill be mapped to a physical queue and await transmission to the next node via the transmission gate on that physical queue, in the process due to the data flow f to be transmitted_kThere may be other data streams to be transmitted in the mapped physical queue, so this process will generate queuing delay, which is denoted as

In this embodiment, the above serialization process may be divided into serialization processes (i.e. transmitting the data stream to be transmitted from the node cache to the physical link), as described above

Corresponding serialization process and deserialization process (i.e., transferring data to be transferred from physical link cache to node), as described above

Corresponding serialization processing procedure. Since each data stream to be transmitted is serialized and deserialized in each node, for convenience of description, the data stream f to be transmitted is_kAt the slave node v_i-1Transmission to node v_iThere is no distinction between serialization and deserialization.

In an optional embodiment, the transmission delay function of each data stream to be transmitted, which is constructed according to the quintuple information of each data stream to be transmitted and the path information in the TSN, may be represented as:

wherein ed_kFor a data stream f to be transmitted_kAlong the transmission path_kTransmission delay of the transmission, i.e. the above-mentioned end-to-end delay, v_i-1Path for transmission path_kNode v of_i-1，v_iPath for transmission path_kNode v of_i，[v_i-1，v_i]Representing a slave node v_i-1Transmission to node v_i，

is a nodev_iData flow f to be transmitted_kIs represented as a data stream f to be transmitted_kAt node v_iThe forwarding delay experienced by the TSN is taken into account,

for a data stream f to be transmitted_kAt node v_iThe queuing delay of (1) is expressed as a data stream f to be transmitted_kAt node v_iWaiting for the queuing delay to be transmitted to the next node.

In the embodiments of the present application, the above

Comprising a data stream f to be transmitted_kNode v_iThe serialization delay generated by the up-serialization process and the serialization delay generated by the de-serialization process.

In this embodiment, for each physical queue in the nodes, because multiple data streams to be transmitted may be stored in the physical queue, after a transmission gate on the physical queue is opened, the data streams to be transmitted stored in the physical queue are sequentially transmitted to a corresponding next node according to the sequence in which the data streams to be transmitted are mapped and stored in the physical queue. That is, only one pending data stream stored in the physical queue of the transmission gate is transmitted every time the transmission gate is opened. Therefore, the queuing delay is determined by the delay of waiting for the transmission gate to open and the delay required by the transmission of the data stream to be transmitted, which is arranged before the data stream to be transmitted, in the physical queue to complete transmission. And, as the number of data streams to be transmitted stored in the physical queue increases, the queuing delay is delayed for the transmission delay ed_kWill gradually increase.

In an alternative embodiment, the queuing delay is

Can be expressed as:

wherein the content of the first and second substances,

As described above

For a data stream f to be transmitted_kAnd the time offset parameter between the data stream to be transmitted and the head of the physical queue where the data stream is located. I.e. the data stream f to be transmitted is arranged in the physical queue_kThe time delay required by the completion of the transmission of the previous data stream to be transmitted.

In an alternative embodiment, the preset constraint condition may include a first constraint condition, a second constraint condition and a third constraint condition. The first constraint condition is determined based on queue resources of a physical queue of each node in the TSN, the second constraint condition is determined based on the time of transmission of each data stream to be transmitted to the next node, and the third constraint condition is determined based on the deadline in the quintuple information of each data stream to be transmitted.

In an alternative embodiment, the first constraint condition may be expressed as:

wherein the content of the first and second substances,

is a node v_iPhysical queue q of output port_mUpper transfer door open window, gcⁱIs a node v_iCycle period of the GCL in (1).

In this embodiment of the present application, when the data stream to be transmitted is a periodic time-sensitive traffic, a cycle period of each physical queue is a period of the data stream, and a cycle period of the GCL is a least common multiple of the cycle period of each physical queue.

In the embodiment of the present application, for each data stream to be transmitted, if the data stream to be transmitted cannot be completely transmitted within one open duration of the transmission gate on the physical queue, the data stream to be transmitted will wait for the transmission of the next open duration to the transmission gate, even wait for the transmission of the next gating period to the transmission gate, which will result in the transmission delay (i.e., ed)_k) Variations occur that affect the accuracy of the determined mapping information and GCL. Therefore, each data stream to be transmitted needs to be transmitted within one gating period of the transmission gate. Passing the limit of the first constraintTherefore, each data stream to be transmitted can be effectively ensured to be transmitted within one opening duration of the transmission gate on the physical queue of the node, that is, each time the transmission gate is opened, only one data stream to be transmitted is transmitted, so that the determined mapping relation and the accuracy of the GCL are ensured.

In an alternative embodiment, the second constraint may be expressed as:

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

Is a node v_iVirtual queue vq in (1)_n′，

Is a node v_iIn (2) a physical queue q_m′，

For storage at node v_iVirtual queue vq of_n′To be transmitted stream f_jThe corresponding mapped physical queue is physicalQueue q_m′，

is a physical queue q_m′The open time period of the upper transmission gate,

is a physical queue q_mThe opening duration of the upper transmission gate is U, and the U is a union operation.

In the embodiment of the present application, in order to avoid interference of data streams to be transmitted in different queues during transmission, a situation that transmission gates on multiple physical queues overlap in a time domain within an opening duration is not allowed in each node, that is, only one transmission gate is opened in each node at a time, and only one data stream to be transmitted is transmitted through the transmission gate, so that stream isolation between multiple data streams to be transmitted in different physical queues is achieved. Therefore, the transmission gates on the plurality of physical queues can be guaranteed not to be overlapped in time domain within the opening duration through the second constraint condition, so that the stream isolation among the plurality of data streams to be transmitted is guaranteed.

In an alternative embodiment, the third constraint condition may be expressed as:

wherein st_kFor a data stream f to be transmitted_kAt the moment when the source node starts transmitting, ed_kFor a data stream f to be transmitted_kAlong the transmission path_kWhile transmittingYan, dl_kFor a data stream f to be transmitted_kThe deadline of (2).

The data stream f to be transmitted can be made to be transmitted by the limitation of the third constraint condition_kAt the moment when the source node starts to send and the data flow f to be transmitted_kAlong the transmission path_kThe sum of the transmission delays during transmission is less than the data stream f to be transmitted_kThereby ensuring that the data stream f is to be transmitted_kThe transmission can be completed before the corresponding deadline, so that the time delay requirement of each data stream to be transmitted is met, and the effectiveness of the transmitted data stream to be transmitted is ensured.

In the embodiment of the application, for a plurality of data streams to be transmitted stored in the same physical queue, because each data stream to be transmitted has a corresponding time offset parameter, and the time offset parameters corresponding to each data stream to be transmitted are different, the data streams to be transmitted in the same physical queue can be transmitted without affecting each other, that is, the data streams to be transmitted do not interfere with each other, thereby ensuring the stream isolation among the data streams to be transmitted in each physical queue, and reducing the randomness of the transmission delay of the data streams to be transmitted.

In the embodiment of the present application, in each node, when the virtual queue maps each data stream to be transmitted to each physical queue, the data stream to be transmitted is mapped according to the value of the corresponding matrix element in the mapping matrix, so that two data streams to be transmitted cannot be transmitted simultaneously in the same physical link. That is, due to the constraint of the flow isolation of each data flow in the physical queue, the flow isolation of the data flow transmitted in the physical link can be ensured.

In this embodiment of the present application, the mapping information and the GCL are determined according to a minimum maximum transmission delay of a transmission delay function of each to-be-transmitted data under the preset constraint condition.

In an optional embodiment, the traffic scheduling module may determine mapping information and GCL corresponding to a plurality of data streams to be transmitted by using the following formula:

min{sum{ed_k|f_k∈F}}

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

Is a node v_iVirtual queue vq in (1)_n′，

Is a node v_iIn (2) a physical queue q_m′，

is a physical queue q_m′The open time period of the upper transmission gate,

is a physical queue q_mThe opening duration of the upper transmission gate, U is the union operation, st_kFor a data stream f to be transmitted_kAt the moment when the source node starts to transmit，ed_kFor a data stream f to be transmitted_kAlong the transmission path_kTransmission delay in transmission, dl_kFor a data stream f to be transmitted_kThe deadline of (2).

In an optional embodiment, for each node in the TSN, when determining the mapping information between the virtual queues and the physical queues included in the mapping information, if the number of the virtual queues in the node is greater than the number of the physical queues, the virtual queues may be used as a cluster, so as to determine the mapping relationship between each cluster and the physical queues, and obtain the mapping relationship between each virtual queue and the physical queues. Because the physical queues corresponding to each virtual queue in the same cluster are the same, in order to ensure the orderliness when mapping data streams to be transmitted in different virtual queues in the same cluster, a merging and sorting algorithm can be used for sorting, that is, specific numerical values corresponding to matrix elements larger than 0 in the mapping matrix are determined.

In an optional embodiment, when the merging and sorting algorithm is used for sorting, sorting may be performed according to the remaining transmission duration of each data stream to be transmitted. For example, the transmission order corresponding to the to-be-transmitted data stream with the smaller remaining transmission duration is earlier, and the numerical value indicating that the to-be-transmitted data stream is mapped to the physical queue order in the mapping information is smaller. The remaining transmission duration may be represented as a time difference between a deadline of the data stream to be transmitted and a current time. Here, the sorting method by the merge sorting algorithm is not particularly limited.

In the above embodiment, only the merging and sorting algorithm is taken as an example to describe the sorting of the data streams to be transmitted in different virtual queues in the same cluster. Other sorting algorithms may be used for sorting. For example, other ranking algorithms include, but are not limited to, bubble ranking algorithms, quick ranking algorithms, insert ranking algorithms, and select ranking algorithms. Here, the sorting algorithm used for sorting the data streams to be transmitted in different virtual queues in the same cluster is not specifically limited.

In an alternative embodiment, when determining the queue resources of the transmission gates on the physical queue of each node, the GCL may be calculated by using an Integer Linear Programming (ILP) solver or a Satisfiability Modeling Theory (SMT) solver. Here, the method of determining the GCL is not particularly limited.

For ease of understanding, the following description is made in conjunction with specific examples. It is assumed that the destination nodes of all data flows are the same. The period of each data stream is 100 microseconds (us) -2 milliseconds (ms), and each data stream to be transmitted needs to be transmitted within the cycle period of a gating list. The total hop count is set to be 7 hops, the propagation delay is 0.5us, and the serialization delay is 1 us. Wherein, each time a data stream passes through a node, the data stream is represented as 1 hop, and the numerical value of the hop number is equal to the number of links included on a transmission path. The link bandwidths (i.e., B) are 1 gigabit per second (Gbps) and 10Gbps, respectively. The length (i.e., L) of the data stream transmitted during the cycle of one gating list is 64 bytes, 256 bytes, 1518 bytes. The probability of 3/4/5/6/7 hops per data flow path is 0.1/0.1/0.1/0.3/0.4, respectively. The period is the same for all data streams. All data streams are transmitted through the TSN, resulting in the schematic diagram shown in fig. 4. Fig. 4 is a schematic diagram of the number of TSN maximum schedulable data streams according to the embodiment of the present application.

In fig. 4, the curve 401 corresponds to 64 bytes, B10 Gbps, the curve 402 corresponds to 256 bytes, B10 Gbps, the curve 403 corresponds to 64 bytes, B1 Gbps, the curve 404 corresponds to 1518 bytes, B10 Gbps, the curve 405 corresponds to 256 bytes, B1 Gbps, the curve 406 corresponds to 1518 bytes, and B1 Gbps.

In the curve 401-406 shown in fig. 4, the number of data streams schedulable by the TSN increases approximately linearly with the deadline of the data stream.

Comparing the

curves

401, 402 and 404 shown in fig. 4, or comparing the

curves

403, 405 and 406 shown in fig. 4, the number of data streams schedulable by the TSN will decrease with the increase of the length of the data stream under the same link bandwidth.

For example, in fig. 4, when the data stream is 256 bytes and 1518 bytes in length, the number of TSN schedulable data streams is about 1/2 and 1/23 of the number of TSN schedulable data streams when the length is 64 bytes.

As another example, when the data stream has a deadline of 2ms (i.e., 2000us) and a link bandwidth of 1Gbps, if the data stream has a length of 64 bytes (i.e., curve 403), 256 bytes (i.e., curve 405), and 1518 bytes (i.e., curve 405), the number of TSN maximum schedulable data streams is 3911, 978, and 168, respectively.

In addition, the number of data streams that can be scheduled by the TSN is related to the link bandwidth at different link bandwidths. For example, in fig. 4, at a link bandwidth of 10Gbps, the number of TSN schedulable data streams is about 10 times the number of TSN schedulable data streams at a link bandwidth of 1Gbps, i.e., the ratio of the link bandwidths.

For example, curve 401 and curve 403 in fig. 4 are data streams of the same length (i.e., 64 bytes), respectively, and the number of data streams schedulable by TSN at link bandwidths of 10Gbps and 1Gbps varies accordingly. In the

curves

401 and 403, the number of TSN adjustable data streams shown in the curve 401 is about 10 times the number of TSN adjustable data streams shown in the curve 403 at the same final limit.

This shows that, when the traffic transmission method provided in the embodiment of the present application is used, the queuing delay of a data stream is mainly affected by the transmission delay of other data streams.

When the length of the data stream is 1518 bytes and the deadline requirement is less than 500us, the number of data streams that can be dispatched by the TSN is relatively more distant. For example, a 1518 byte data stream may be scheduled at a bandwidth of 10Gbps (i.e., curve 404) for a TSN of 87 for a 100us deadline, and at a bandwidth of 1Gbps (i.e., curve 406) for a TSN of 4. This is because the length of the data stream is 1518 bytes, the delay introduced by 5-hop, 6-hop and 7-hop paths, except the queuing delay, already exceeds 100us, only the data streams with 3-hop and 4-hop paths can be scheduled, and the delay introduced by the 3-hop path, except the queuing delay, also exceeds 50us, so the number of data streams schedulable by the TSN is relatively small.

In fig. 4, as the number of data streams increases, although the data streaming method for the time-sensitive network provided by the embodiment of the present application increases the number of data streams that can be scheduled by the TSN, the limitation of physical resources is the most critical limiting factor, and the link bandwidth becomes the critical physical resource in the data streaming method for the time-sensitive network provided by the embodiment of the present application, especially for the data streams with larger lengths.

As shown in fig. 5, fig. 5 is a schematic diagram of a cumulative distribution of propagation delays according to an embodiment of the present application. Where, N is 100, B is 10Gbps, N is 200, B is 10Gbps, N is 100, B is 1Gbps, N is 200, and B is 1Gbps, respectively, for the curve 501 and the curve 504, respectively. Where N represents the number of data streams.

In the curves 501-504 shown in fig. 5, when N is 100 or N is 200, the transmission delay of all data streams is less than 100 us. When N is 100 and B is 1Gbps (i.e., curve 503), the maximum transmission delay of the data stream is about 48us, the average transmission delay is about 33us, and the transmission delay of 50% of the data streams is less than 35 us. When N is 200 and B is 1Gbps (i.e., curve 504), the maximum transmission delay of the data stream is about 100us, the average transmission delay is about 57us, the transmission delay of 50% of the data streams is less than 58us, and the minimum transmission delay is about 7 us. The mean transmission delay is similar to the median, and the curve of the Cumulative Distribution Function (CDF) is approximately linear, which indicates that the transmission delay Distribution is relatively uniform, and also indicates that the time offset parameters between two adjacent data streams are approximately equal (mainly because the transmission delays are equal due to the equal lengths of all the data streams). The CDF curve exhibits the same characteristics when B is 10Gbps (i.e., curve 501 and curve 502).

In fig. 5, when N is 100, if B is 10Gbps (i.e., curve 501), the maximum transmission delay of the data stream is about 12us, which is 1/4 of B is 1Gbps (i.e., curve 503). When N is 200, if B is 10Gbps (i.e., curve 502), the maximum transmission delay of the data stream is about 15us, which is about 1/6 when B is 1Gbps (i.e., curve 504). The minimum transit delays for

curves

501 and 502 are each about 3us, and curves 503 and 504 are 1/2 of the minimum transit delay.

With the CDF curve shown in fig. 5, as the number of data streams increases, the ratio of the queuing delay of the data streams to the transmission delay of the data streams increases significantly compared to other delays.

Based on the same inventive concept, according to the data stream transmission method of the time-sensitive network provided by the embodiment of the present application, the embodiment of the present application further provides a data stream transmission device of the time-sensitive network. As shown in fig. 6, fig. 6 is a schematic structural diagram of a data stream transmission apparatus of a time-sensitive network according to an embodiment of the present application. The device is applied to a target node in a TSN (traffic service network), a plurality of virtual queues are preset in the target node, and the device comprises:

an obtaining module 601, configured to obtain mapping information and GCL corresponding to multiple data streams to be transmitted; the mapping information and the GCL are determined according to the transmission delay function of each to-be-transmitted data stream under the condition of the minimum transmission delay under the preset constraint condition, the transmission delay function of each to-be-transmitted data stream is constructed according to the quintuple information of each to-be-transmitted data stream and the path information in the TSN, and the preset constraint condition is determined according to the queue resource in each node in the TSN, the time when each to-be-transmitted data stream is transmitted to the next node and the deadline in the quintuple information of each to-be-transmitted data stream;

a first storage module 602, configured to store at least one to-be-transmitted data stream into a plurality of virtual queues when at least one to-be-transmitted data stream in a plurality of to-be-transmitted data streams is received;

a second storage module 603, configured to map and store data streams to be transmitted stored in the multiple virtual queues to the physical queues based on a mapping relationship between the virtual queues and the physical queues included in the mapping information;

the transmission module 604 is configured to transmit, for a transmission gate on each physical queue, a data stream to be transmitted stored in the physical queue after the transmission gate on the physical queue is opened based on the open time specified by the GCL.

the queuing delay

Expressed as:

wherein the content of the first and second substances,

the first constraint condition is expressed as:

wherein the content of the first and second substances,

The second constraint is expressed as:

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

For storage at node v_iVirtual team ofColumn vq_nTo be transmitted stream f_kThe corresponding mapped physical queue is a physical queue q_m，

Is a node v_iVirtual queue vq in (1)_n′，

Is a node v_iIn (2) a physical queue q_m′，

is a physical queue q_m′The open time period of the upper transmission gate,

The third constraint is expressed as:

min{sum{ed_k|f_k∈F}}

is a node v_iPhysical queue q of output port_mUpper transfer door open window, gcⁱIs a node v_iCycle period of GCL in (1), f_kFor data to be transmittedFlow f_k，f_jFor a data stream f to be transmitted_j，

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

Is a node v_iVirtual queue vq in (1)_n′，

Is a node v_iIn (2) a physical queue q_m′，

is a physical queue q_m′Upload toThe length of time that the gate is opened,

the second storage module 603 may be specifically configured to map and store each to-be-transmitted data stored in the plurality of virtual queues to the physical queue based on a mapping relationship between the virtual queue and the physical queue included in the mapping information and a numerical value indicating an order in which each to-be-transmitted data stream is mapped to the physical queue.

By applying the device provided by the embodiment of the application, a plurality of virtual queues are preset in each node in the TSN, so that when any node receives at least one data stream to be transmitted, the data stream to be transmitted stored in the virtual queue can be mapped and stored to the physical queue according to the obtained mapping information, and then the data stream to be transmitted in the physical queue is transmitted by opening the transmission gate on the physical queue according to the obtained GCL specified open time. Compared with the related technology, the data to be transmitted is mapped and stored from the virtual queue to the physical queue through the mapping information, and the GCL controls the opening of the transmission gate on the physical queue, so that the stream isolation of a plurality of data streams to be transmitted can be effectively realized, and the mutual interference among the data streams to be transmitted is avoided. In addition, the mapping information and the GCL are determined according to the minimum transmission delay and the minimum transmission delay of the transmission delay function of each to-be-transmitted data under the preset constraint condition, and are constrained by the preset constraint condition, that is, the bandwidth resource of the physical queue of each node, the time when each to-be-transmitted data stream is transmitted to the next node, and the constraint condition corresponding to the deadline in the quintuple information of each to-be-transmitted data stream, so that the determined mapping information and the GCL ensure the transmission time of each to-be-transmitted data stream on the premise of meeting the deadline of each to-be-transmitted data, that is, the maximization of the number of the data streams transmitted by each node on the premise of ensuring the minimum transmission delay and the minimum transmission delay. Therefore, by adopting the technical scheme provided by the application, under the condition of physical resource limitation, the isolation among a plurality of data streams is realized through the configuration of virtual resources in the virtual queue, the mutual interference among the data streams is avoided, the time delay requirement of data stream transmission is ensured, and the number of data streams schedulable by the TSN is increased.

Based on the same inventive concept, according to the data stream transmission method of the time-sensitive network provided by the embodiment of the present application, the embodiment of the present application further provides a TSN node, as shown in fig. 7, including a processor 701, a communication interface 702, a memory 703 and a communication bus 704, where the processor 701, the communication interface 702 and the memory 703 complete mutual communication through the communication bus 704,

a memory 703 for storing a computer program;

the processor 701 is configured to implement the following steps when executing the program stored in the memory 703:

acquiring mapping information and GCL corresponding to a plurality of data streams to be transmitted; the mapping information and the GCL are determined according to the transmission delay function of each to-be-transmitted data stream under the condition of the minimum transmission delay under the preset constraint condition, the transmission delay function of each to-be-transmitted data stream is constructed according to the quintuple information of each to-be-transmitted data stream and the path information in the TSN, and the preset constraint condition is determined according to the queue resource in each node in the TSN, the time when each to-be-transmitted data stream is transmitted to the next node and the deadline in the quintuple information of each to-be-transmitted data stream;

when at least one data stream to be transmitted in a plurality of data streams to be transmitted is received, storing the at least one data stream to be transmitted into a plurality of virtual queues;

The node provided by the embodiment of the application is characterized in that a plurality of virtual queues are preset in each node in the TSN, so that when any node receives at least one data stream to be transmitted, the data stream to be transmitted stored in the virtual queue can be mapped and stored to the physical queue according to the obtained mapping information, and then the data stream to be transmitted in the transmission gate transmission physical queue on the physical queue is opened according to the obtained GCL specified open time. Compared with the related technology, the data to be transmitted is mapped and stored from the virtual queue to the physical queue through the mapping information, and the GCL controls the opening of the transmission gate on the physical queue, so that the stream isolation of a plurality of data streams to be transmitted can be effectively realized, and the mutual interference among the data streams to be transmitted is avoided. In addition, the mapping information and the GCL are determined according to the minimum transmission delay and the minimum transmission delay of the transmission delay function of each to-be-transmitted data under the preset constraint condition, and are constrained by the preset constraint condition, that is, the bandwidth resource of the physical queue of each node, the time when each to-be-transmitted data stream is transmitted to the next node, and the constraint condition corresponding to the deadline in the quintuple information of each to-be-transmitted data stream, so that the determined mapping information and the GCL ensure the transmission time of each to-be-transmitted data stream on the premise of meeting the deadline of each to-be-transmitted data, that is, the maximization of the number of the data streams transmitted by each node on the premise of ensuring the minimum transmission delay and the minimum transmission delay. Therefore, by adopting the technical scheme provided by the application, under the condition of physical resource limitation, the isolation among a plurality of data streams is realized through the configuration of virtual resources in the virtual queue, the mutual interference among the data streams is avoided, the time delay requirement of data stream transmission is ensured, and the number of data streams schedulable by the TSN is increased.

The communication bus mentioned in the TSN node may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.

The communication interface is used for communication between the TSN node and other devices.

The Memory may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.

The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components.

Based on the same inventive concept, according to the data stream transmission method of the time-sensitive network provided by the embodiment of the present application, the embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the data stream transmission method of any one of the time-sensitive networks.

Based on the same inventive concept, according to the data streaming method of the time-sensitive network provided in the embodiments of the present application, the embodiments of the present application also provide a computer program product containing instructions, which when run on a computer, causes the computer to execute the data streaming method of any one of the time-sensitive networks in the embodiments.

In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.

It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. The term "comprising", without further limitation, means that the element so defined is not excluded from the group consisting of additional identical elements in the process, method, article, or apparatus that comprises the element.

All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for embodiments of the apparatus, TSN node, computer-readable storage medium, computer program product, and the like, since they are substantially similar to the method embodiments, the description is relatively simple, and for relevant points, reference may be made to some descriptions of the method embodiments.

The above description is only for the preferred embodiment of the present application and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application are included in the protection scope of the present application.

Claims

1. A data stream transmission method of a time sensitive network is applied to a target node in a Time Sensitive Network (TSN), wherein a plurality of virtual queues are preset in the target node, and the method comprises the following steps:

acquiring mapping information and a gating list GCL corresponding to a plurality of data streams to be transmitted; the mapping information and the GCL are determined according to the transmission delay function of each to-be-transmitted data stream under the condition of minimizing transmission delay under the preset constraint condition, the transmission delay function of each to-be-transmitted data stream is constructed according to quintuple information of each to-be-transmitted data stream and path information in the TSN, and the preset constraint condition is determined according to queue resources in each node in the TSN, the time when each to-be-transmitted data stream is transmitted to the next node and the deadline in the quintuple information of each to-be-transmitted data stream;

2. The method of claim 1, wherein the transmission delay function of each data stream to be transmitted is represented as:

said queuing delay

Expressed as:

wherein the content of the first and second substances,

3. The method of claim 1, wherein the preset constraints comprise a first constraint, a second constraint, and a third constraint;

the first constraint is expressed as:

wherein the content of the first and second substances,

the second constraint is expressed as:

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

Is a node v_iVirtual queue vq in (1)_n′，

Is a node v_iIn (2) a physical queue q_m′，

is a section ofPoint v_iPhysical queue q of output port_m′The opening time of the upper transmission gate is,

is a physical queue q_m′The open time period of the upper transmission gate,

is a physical queue q_mThe opening duration of the upper transmission gate is the union operation;

the third constraint is expressed as:

4. The method according to claim 2 or 3, wherein the mapping information and the GCL are calculated using the following formulas:

min{sum{ed_k|f_k∈F}}

whereinMin is the minimum operation, sum is the sum operation, { ed_k|f_ke.F is the transmission time delay set of the data stream to be transmitted ed_kFor a data stream f_kAlong the transmission path_kThe transmission delay of the transmission, s.t. represents a constraint,

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

Is a section ofPoint v_iVirtual queue vq in (1)_n′，

Is a node v_iIn (2) a physical queue q_m′，

is a physical queue q_m′The open time period of the upper transmission gate,

is a physical queue q_mThe opening duration of the upper transfer gate, U, is a union operation, st_kFor a data stream f to be transmitted_kAt the moment when the source node starts transmitting, ed_kFor a data stream f to be transmitted_kAlong the transmission path_kTransmission delay in transmission, dl_kFor a data stream f to be transmitted_kThe deadline of (2).

5. The method of claim 1, wherein the mapping information further comprises a numerical value indicating an order in which each data stream to be transmitted is mapped to the physical queue;

6. A data stream transmission device of a time sensitive network is applied to a target node in a Time Sensitive Network (TSN), wherein a plurality of virtual queues are preset in the target node, and the device comprises:

the device comprises an acquisition module, a transmission module and a control module, wherein the acquisition module is used for acquiring mapping information and a gating list GCL corresponding to a plurality of data streams to be transmitted; the mapping information and the GCL are determined according to the minimum transmission delay and the minimum transmission delay of the transmission delay function of each to-be-transmitted data stream under a preset constraint condition, the transmission delay function of each to-be-transmitted data stream is constructed according to quintuple information of each to-be-transmitted data stream and path information in the TSN, and the preset constraint condition is determined based on queue resources in each node in the TSN, the time when each to-be-transmitted data stream is transmitted to the next node and the deadline in the quintuple information of each to-be-transmitted data stream;

7. The apparatus of claim 6, wherein the transmission delay function of each data stream to be transmitted is represented as:

for a data stream f to be transmitted_kAt node v_iThe queuing delay of (1) is expressed as a data stream f to be transmitted_kAt node v_oWaiting for a queuing delay when transmitting to a next node;

said queuing delay

Expressed as:

wherein the content of the first and second substances,

8. The apparatus of claim 6, wherein the preset constraints comprise a first constraint, a second constraint, and a third constraint;

the first constraint is expressed as:

wherein the content of the first and second substances,

the second constraint is expressed as:

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

Is a node v_iVirtual queue vq in (1)_n′，

Is a node v_iIn (2) a physical queue q_m′，

is a physical queue q_m′The open time period of the upper transmission gate,

the third constraint is expressed as:

9. The apparatus according to claim 7 or 8, wherein the mapping information and the GCL are calculated by using the following formula:

min{sum{ed_k|f_k∈F}}

where min is the minimum operation and sum is the sum operation, { ed_k|f_ke.F is the transmission time delay set of the data stream to be transmitted ed_kFor a data stream f_kAlong the transmission path_kTransmission delay of transmission, s.t. denotesThe constraint condition is that,

Is a node v_iVirtual queue vq in (1)_n，

Is a node v_iPhysical queue q in an output port_m，

Is a node v_iVirtual queue vq in (1)_n′，

Is a node v_iInQueue q_m′，

is a physical queue q_m′The open time period of the upper transmission gate,

10. The apparatus of claim 6, wherein the mapping information further comprises a numerical value indicating an order in which each data stream to be transmitted is mapped to the physical queue;