CPC H04L 47/12 (2013.01) [H04L 41/12 (2013.01)] | 20 Claims |
1. A method of scheduling a transmission of data flows in a time sensitive network (TSN) comprising a set of nodes, each node having at least a respective transmission queue and a corresponding gate, the set of nodes communicatively coupled by a set of links, each link coupling a corresponding pair of nodes, the method comprising:
identifying an unscheduled set of data flows to be scheduled for a respective transmission in accordance with a TSN schema on a subset of the set of links defining a respective path from a first originating node to a second destination node;
scheduling a respective transmission of a subset of data flows on the respective path, wherein the schedule defines a start time, a duration, and a cycle time of the transmission on each respective link in the respective path;
determining a transmission queue and a corresponding gate at each respective node along the respective path for the respective transmission of the subset of data flows;
operating the corresponding gate at each node along the respective path according to the schedule;
displaying, for each scheduled data flow, a first image depicting each respective link in the path including a visual indication of a direction of the scheduled data flow on each respective link in the respective path, the first image overlaying a second image representative of a physical topology of the network, and a data transmission schedule chart with respect to each respective link in the respective path;
determining a conflict between a scheduled data flow and an unscheduled data flow of the unscheduled set of data flows with respect to a link in the respective path; and
modifying data flow requirements of at least one of the scheduled flow and the unscheduled flow to eliminate the conflict.
|