Scheduling Data Traffic in Wireless Time Sensitive Networks

1. A system for scheduling data traffic in a wireless time sensitive network (TSN) having nodes that are wired nodes and wireless nodes, comprising: a computer in communication with a memory, the computer is configured to synchronize clocks of all nodes with a common clock in the TSN, then a network scheduler communicates with a set of nodes to deliver data traffic to the TSN, to prioritize the data traffic as TSN data streams classified as time critical data traffic and non-time critical data traffic; determine link layer routing paths using the data traffic and stored routing protocol data, and compute for each link layer routing path, a link communication delay for each link of one or more relay nodes connecting a source node to a destination node for each TSN stream using a network scheduler, wherein the link communication delay includes a transmission duration that is a portion of a link delay, the transmission duration includes a total transmission time, a total guard time, and the link delay includes a queueing delay; determine interfering links for each wireless link using the network scheduler, wherein the interfering links do not have an overlapping transmission time, then, determine a scheduling period using the network scheduler, for transmission of each TSN stream at least once in a scheduling period; determine optimal scheduling using an optimal scheduling module, to generate a gate control list for each egress port of the wired node and a wireless transmitter of the TSN, then generate the gate control list for each egress port of the wired node and the wireless transmitter of the TSN; and begin transmission of the data based on the generated gate control list.

2. The system of claim 1 , wherein the synchronizing of the clocks of all nodes with the common clock in the TSN is based on using IEEE 1588 Precision Time Protocol (PTP) standards series and IEEE 802.1AS Timing and Synchronization standard series, in order for the TSN to be prepared to deliver data traffic, and wherein the stored routing protocol data is IEEE 802.1Qca path reservation protocols.

3. The system of claim 1 , wherein the set of nodes includes wired end nodes and wireless end nodes, and the data traffic is prioritized into TSN data streams that is classified as the time critical data traffic and best effort traffic data that is classified as the non-time critical data traffic.

4. The system of claim 1 , wherein a schedule for a TSN stream is a transmission window in a form of a Node ID, a Queue ID, a Time Offset and a Transmission Duration, wherein for a queue identified by the Queue ID of a node identified by the Node ID, the Time Offset corresponds to a gate open time, and the Time Offset plus the Transmission Duration corresponds to a gate close time.

5. A method for scheduling data traffic in a wireless time sensitive network (TSN), comprising: synchronizing clocks of all nodes with a common clock in the TSN, then a network scheduler communicates with a set of nodes to deliver data traffic to the TSN, to prioritize the data traffic as TSN data streams classified as time critical data traffic and non-time critical data traffic; determining link layer routing paths using the data traffic and stored routing protocol data; compute for each link layer routing path, a link communication delay for each link of one or more relay nodes connecting a source node to a destination node for each TSN stream using a network scheduler, wherein the link communication delay includes a transmission duration that is a portion of a link delay, the transmission duration includes a total transmission time to transmit all frames in the TSN stream and a total inter-frame-guard-time, and the link delay includes a queueing delay; determining interfering links for each wireless link using the network scheduler, wherein the interfering links do not have an overlapping transmission time, then, determining a scheduling period using the network scheduler, for transmission of each TSN stream at least once in a scheduling period, followed by determining optimal scheduling using an optimal scheduling module, to generate a gate control list for each egress port of the wired node and a wireless transmitter of the TSN; generating the gate control list for each egress port of the wired node and the wireless transmitter of the TSN; and starting transmission of the data based on the generated gate control list.

6. The method of claim 5 , wherein a schedule for a TSN stream is a transmission window in a form of a Node ID, a Queue ID, a Time Offset and a Transmission Duration, wherein for a queue identified by the Queue ID of a node identified by the Node ID, the Time Offset corresponds to a gate open time, and the Time Offset plus the Transmission Duration corresponds to a gate close time.

7. The method of claim 5 , wherein nodes of the TSN are started or woken up prior to the synchronizing of the clocks of all the nodes with the common clock in the TSN, and wherein the set of nodes includes wired end nodes and wireless end nodes, and wherein the data traffic is prioritized into TSN data streams that is classified as the time critical data traffic and best effort traffic data that is classified as the non-time critical data traffic.

8. The method of claim 5 , wherein the TSN data traffic includes periodic data stream and event-based data traffic, and wherein the queueing delay is determined using the optimal scheduling module.

9. The method of claim 5 , wherein the TSN data stream includes (a) prioritization data that maps data traffic to a queue with appropriate priority, (b) an end-to-end delay requirement, (c) a data period for data production or generation, (d) a number of frames within each period, and (e) a size of a data frame such that the TSN stream includes one or more data frames.

10. The method of claim 9 , wherein the prioritization data is used by a priority filter to place data into a prioritized queue identification (ID) location, such that the prioritized queue ID location identifies a queue whose data stream is scheduled to be transmitted, wherein each wired node and wireless node includes up to eight queues.

11. The method of claim 9 , wherein the end-to-end delay requirement is a summation of delays at all the nodes along a routing path, the end-to-end delay includes an upper layer queueing delay and a TSN delay according to an equation of, (end to end (E2E) Delay=Upper Layer Delay+E2E TSN Delay).

12. The method of claim 11 , wherein an upper layer queueing delay is measured at the source node, and is a time difference from a time that data traffic is produced to a time the data traffic reaches a link layer.

13. The method of claim 11 , wherein the TSN delay is determined per an equation of: E2E TSN delay Σ i=0 N D s i : where (D s I =TSN Queuing time+Optional Backoff time+Total TX time+Propagation time+Total guard time), is a time difference from a time that data traffic reaches the link layer at the data traffic source node to a time the data traffic reaches the link layer of a destination node, wherein the data traffic is forwarded up to an application without a delay.

14. The method of claim 9 , wherein the data period is an amount of time according to which the data is produced or generated.

15. The method of claim 9 , wherein the number of frames within each period includes data frames that need to be transmitted as a stream, wherein an inter-frame-guard-time separates transmission of two consecutive frames, and wherein the size of the frame is measured as number of data bits.

17. A system for scheduling data traffic in a wireless time sensitive network (TSN) having nodes that are wired nodes and wireless nodes, comprising: a computer in communication with a memory, the computer is configured to synchronize clocks of all nodes with a common clock in the TSN, then a network scheduler communicates with a set of nodes to deliver data traffic to the TSN, to prioritize the data traffic as TSN data streams classified as time critical data traffic and non-time critical data traffic; determine link layer routing paths using the data traffic and stored routing protocol data, then compute for each link layer routing path, a link communication delay for each link of one or more relay nodes connecting a source node to a destination node for each TSN stream using a network scheduler; determine interfering links for each wireless link using the network scheduler, wherein the interfering links do not have an overlapping transmission time, then determine a scheduling period using the network scheduler, for transmission of each TSN stream at least once in a scheduling period; determine optimal scheduling using an optimal scheduling module, to generate a gate control list for each egress port of the wired node and a wireless transmitter of the TSN, then generate the gate control list for each egress port of the wired node and the wireless transmitter of the TSN; and begin transmission of the data based on the generated gate control list.

18. The system of claim 17 , wherein the link communication delay includes a transmission duration that is a portion of a link delay, the transmission duration includes a total transmission time to transmit all frames in the TSN stream and a total inter-frame-guard-time and a propagation time, and the link delay includes a queueing delay.

19. A system for scheduling data traffic in a wireless time sensitive network (TSN), comprising: a computer in communication with a memory, the computer is configured to synchronize clocks of all nodes with a common clock in the TSN, wherein the nodes include end nodes and relay nodes, the end nodes include wired and wireless data source and destination nodes, and relay nodes include wired and wireless bridges/switches/routers/access points; obtain data traffic information using a network scheduler for the TSN to establish routing paths, by communicating with the wired and wireless end nodes for TSN data traffic, wherein the TSN data traffic includes TSN data streams and the best effort data traffic, wherein the TSN data stream is time prioritized into time critical data traffic and the best effort traffic data is classified as non-time critical data; determine routing paths using the obtained data traffic information and stored routing information via the memory, wherein each routing path begins from a source node and ends at a destination node, along with one or more relay nodes connecting the source node to the destination node; compute a link communication delay for each link of the one or more relay nodes connecting the source node to the destination node for each TSN stream using a network scheduler, wherein the link communication delay includes a transmission duration that is a portion of a link delay that includes a queueing delay, wherein the queueing delay is determined by an optimal scheduling module, wherein transmission duration includes a total time to transmit all frames in the TSN stream and a total inter-frame-guard-time; determine interfering links for each wireless link using the network scheduler, wherein the interfering links do not have an overlapping transmission time; determining a scheduling period using the network scheduler, for transmission of each TSN stream at least once in a scheduling period; determine optimal scheduling using an optimal scheduling module, wherein a schedule for a TSN stream is a transmission window in a form of a Node ID, a Queue ID, a Time Offset and a Transmission Duration, wherein for a queue identified by the Queue ID of a node identified by the Node ID, the Time Offset corresponds to a gate open time, and the Time Offset plus the Transmission Duration corresponds to a gate close time, to generate a gate control list for each egress port of the wired node and a wireless transmitter of the TSN; generate the gate control list for each egress port of the wired node and the wireless transmitter of the TSN; and begin transmission of the data based on the generated gate control list.

20. A non-transitory computer readable storage medium embodied thereon a program executable by a computer for performing a method, the method for scheduling data traffic in a wireless time sensitive network (TSN), comprising: synchronizing clocks of all nodes with a common clock in the TSN, wherein the nodes include end nodes and relay nodes, the end nodes include wired and wireless data source and destination nodes, and relay nodes include wired and wireless bridges/switches/routers/access points; obtaining data traffic information using a network scheduler for the TSN to establish routing paths, by communicating with the wired and wireless end nodes for TSN data traffic, wherein the TSN data traffic includes TSN data streams and best effort data traffic, wherein the TSN data stream is time prioritized into time critical data traffic and the best effort traffic data is classified as non-time critical data; determining routing paths using the obtained data traffic information and stored routing information via the memory, such that each routing path begins from a source node and ends at a destination node, along with one or more relay nodes connecting the source node to the destination node; computing a link communication delay for each link of the one or more relay nodes connecting the source node to the destination node for each TSN stream using a network scheduler, wherein the link communication delay includes a transmission duration that is a portion of a link delay that includes a queueing delay, wherein the queueing delay is determined by an optimal scheduling module, wherein transmission duration includes a total time to transmit all frames in the TSN stream and a total inter-frame-guard-time; determining interfering links for each wireless link using the network scheduler, wherein the interfering links do not have an overlapping transmission time; determining a scheduling period using the network scheduler, for transmission of each TSN stream at least once in a scheduling period; determining optimal scheduling using an optimal scheduling module, wherein a schedule for a TSN stream is a transmission window in a form of a Node ID, a Queue ID, a Time Offset and a Transmission Duration, wherein for a queue identified by the Queue ID of a node identified by the Node ID, the Time Offset corresponds to a gate open time, and the Time Offset plus the Transmission Duration corresponds to a gate close time, to generate a gate control list for each egress port of the wired node and a wireless transmitter of the TSN; generating the gate control list for each egress port of the wired node and the wireless transmitter of the TSN; and starting transmission of the data based on the generated gate control list.