Abstract: Methods, systems and apparatuses to enable an optimum bin selection by implementing a neural network with a network scheduling and configuration tool (NST), the method includes: configuring an agent with a critic function from neural networks wherein the agent neural network represents each bin of the collection of bins in the network that performs an action, and a critic function evaluates a criteria of success for performing the action; processing, by a scheduling algorithm, the VLs by the NST; determining one or more reward functions using global quality measurements based on criteria comprising: a lack of available bins, a lack of available VLs, and successfully scheduling operations of a VL into a bin; and training the network based on a normalized state model of the scheduled network by using input data sets to arrive at an optimum bin selection.

Abstract: Methods, systems, and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by pre-processing, by a scheduling algorithm implemented by a Network Scheduling Tool (NST), VL information prior to initiating a scheduling procedure by, detecting VL information associated with VLs that having common physical resources that include a common direction of a switching port or an egress end system port; and storing the VL information associated with the set of VLs for retrieval by the NST to parse a VL list for scheduling to determine one or more conflicting VLs in functionalities with a VL that is to be scheduled by a first pass that attempts favoring scheduling a VL into a bin when previously scheduled VLs fail to exhibit conflicts; and a second pass that attempts to resolve at least one conflict exhibited in the scheduling procedure by offsetting a transmit time.

Abstract: Methods, systems, and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by determining a subset of a group of bins allocated to TT traffic; restricting the subset bin groups to a specified harmonic subdivided pattern with a certain duration; allocating the subset of bin groups in accordance with bin group equated with a rate at least twice as high as a highest TT traffic rate available in the network to enable control of partitioned traffic by using a set of media reservations; checking whether a bin selected via a bin selection process for scheduling a TT Virtual Link (VL) is a valid TT bin, else proceeding to a subsequent bin until a valid TT bin is returned for the TT VL, and reserving using at least one media reservation for a TT VL to be scheduled by temporal partitioning at the restricted rate.

Abstract: Methods, systems, and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by determining a subset of a group of bins allocated to TT traffic; restricting the subset bin groups to a specified harmonic subdivided pattern with a certain duration; allocating the subset of bin groups in accordance with bin group equated with a rate at least twice as high as a highest TT traffic rate available in the network to enable control of partitioned traffic by using a set of media reservations; checking whether a bin selected via a bin selection process for scheduling a TT Virtual Link (VL) is a valid TT bin, else proceeding to a subsequent bin until a valid TT bin is returned for the TT VL, and reserving using at least one media reservation for a TT VL to be scheduled by temporal partitioning at the restricted rate.

Abstract: Methods, systems, and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by pre-processing, by a scheduling algorithm implemented by a Network Scheduling Tool (NST), VL information prior to initiating a scheduling procedure by, detecting VL information associated with VLs that having common physical resources that include a common direction of a switching port or an egress end system port; and storing the VL information associated with the set of VLs for retrieval by the NST to parse a VL list for scheduling to determine one or more conflicting VLs in functionalities with a VL that is to be scheduled by a first pass that attempts favoring scheduling a VL into a bin when previously scheduled VLs fail to exhibit conflicts; and a second pass that attempts to resolve at least one conflict exhibited in the scheduling procedure by offsetting a transmit time.

Abstract: Methods, systems, and apparatuses for orchestrating the re-configuration of a Time-Triggered Ethernet (TTE) network for a plurality of configuration definitions (CDs) within a network configuration superset (NCS) by a Network Scheduling Tool (NST), including coupling a plurality of FSs to at least one common control FS (CCFS) to enable control by the NST of each FS by a runtime procedure wherein each FS of the plurality of FSs is composed of Virtual Links (VLs); scheduling the plurality of features sets (FSs) based on a target configuration of a specified FSs coupled to the CCFS within the TTE network; collecting, in a first scheduling pass by the NST, multiple FSs related to a plurality of phase configurations wherein the FSs are used to derive a specified target FS configuration; and forming a common FS by using an application to determine features associated with each FS of the plurality of FSs.

Abstract: Methods, systems, and apparatuses for orchestrating the re-configuration of a Time-Triggered Ethernet (TTE) network for a plurality of configuration definitions (CDs) within a network configuration superset (NCS) by a Network Scheduling Tool (NST), including coupling a plurality of FSs to at least one common control FS (CCFS) to enable control by the NST of each FS by a runtime procedure wherein each FS of the plurality of FSs is composed of Virtual Links (VLs); scheduling the plurality of features sets (FSs) based on a target configuration of a specified FSs coupled to the CCFS within the TTE network; collecting, in a first scheduling pass by the NST, multiple FSs related to a plurality of phase configurations wherein the FSs are used to derive a specified target FS configuration; and forming a common FS by using an application to determine features associated with each FS of the plurality of FSs.

Abstract: Methods, systems and apparatuses to enable an optimum bin selection by implementing a neural network with a network scheduling and configuration tool (NST), the method includes: configuring an agent with a critic function from neural networks wherein the agent neural network represents each bin of the collection of bins in the network that performs an action, and a critic function evaluates a criteria of success for performing the action; processing, by a scheduling algorithm, the VLs by the NST; determining one or more reward functions using global quality measurements based on criteria comprising: a lack of available bins, a lack of available VLs, and successfully scheduling operations of a VL into a bin; and training the network based on a normalized state model of the scheduled network by using input data sets to arrive at an optimum bin selection.

Abstract: Methods, systems and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by a network scheduling and configuration tool (NST) by establishing a collection of bins that corresponds to the smallest harmonic period allowing full network traversal of a time-triggered traffic packet in the network for determining available bin sets for sending the VL data by the NST; processing by a scheduling algorithm the VLs to be sent in accordance with a strict order comprising scheduling all the highest rate VLs prior to scheduling lower rate VLs; and scheduling reservations for the VLs in bins by tracking the available time available in each bin and optionally spreading the VL data across available bin sets by sorting a list of available bins by ascending bin utilization and by specifying a left-to-right or right-to-left sort order when searching for available bins based on a position in the timeline between the transmitter and receiver end stations.

Abstract: Methods, systems and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by a network scheduling and configuration tool (NST) by establishing a collection of bins that corresponds to the smallest harmonic period allowing full network traversal of a time-triggered traffic packet in the network for determining available bin sets for sending the VL data by the NST; processing by a scheduling algorithm the VLs to be sent in accordance with a strict order comprising scheduling all the highest rate VLs prior to scheduling lower rate VLs; and scheduling reservations for the VLs in bins by tracking the available time available in each bin and optionally spreading the VL data across available bin sets by sorting a list of available bins by ascending bin utilization and by specifying a left-to-right or right-to-left sort order when searching for available bins based on a position in the timeline between the transmitter and receiver end stations.

Abstract: Methods, systems and apparatuses for scheduling a plurality of Virtual Links (VLs) in a Time-Triggered Ethernet (TTE) network by determining a weight for each of the plurality of VLs, the determined weight being proportional to a demand each of the plurality of VLs will place on the time-triggered ethernet network; generating a plurality of bins whose length in time is harmonic to all the scheduled rates of the plurality of VLs; determining a demand value proportional to how often the bin is expected to be used based upon a green zone of each of the plurality of VLs and the determined weight for each of the plurality of VLs; updating the demand value for each bin within the green zone; sorting the plurality of bins from least demanded to most demanded based upon the updated demand value; and scheduling the sorted plurality of VLs within the sorted plurality of bins.

Abstract: Systems and methods for interference cognizant network scheduling are provided. In certain embodiments, a method of scheduling communications in a network comprises identifying a bin of a global timeline for scheduling an unscheduled virtual link, wherein a bin is a segment of the timeline; identifying a pre-scheduled virtual link in the bin; and determining if the pre-scheduled and unscheduled virtual links share a port. In certain embodiments, if the unscheduled and pre-scheduled virtual links don't share a port, scheduling transmission of the unscheduled virtual link to overlap with the scheduled transmission of the pre-scheduled virtual link; and if the unscheduled and pre-scheduled virtual links share a port: determining a start time delay for the unscheduled virtual link based on the port; and scheduling transmission of the unscheduled virtual link in the bin based on the start time delay to overlap part of the scheduled transmission of the pre-scheduled virtual link.

Abstract: Systems and methods for network bandwidth, buffers and timing management using hybrid scheduling of traffic with different priorities and guarantees are provided. In certain embodiments, a method of managing network scheduling and configuration comprises, for each transmitting end station, reserving one exclusive buffer for each virtual link to be transmitted from the transmitting end station; for each receiving end station, reserving exclusive buffers for each virtual link to be received at the receiving end station; and for each switch, reserving a exclusive buffer for each virtual link to be received at an input port of the switch. The method further comprises determining if each respective transmitting end station, receiving end station, and switch has sufficient capability to support the reserved buffers; and reporting buffer infeasibility if each respective transmitting end station, receiving end station, and switch does not have sufficient capability to support the reserved buffers.

Abstract: Systems and methods for systematic hybrid network scheduling for multiple traffic classes with host timing and phase constraints are provided. In certain embodiments, a method of scheduling communications in a network comprises scheduling transmission of virtual links pertaining to a first traffic class on a global schedule to coordinate transmission of the virtual links pertaining to the first traffic class across all transmitting end stations on the global schedule; and scheduling transmission of each virtual link pertaining to a second traffic class on a local schedule of the respective transmitting end station from which each respective virtual link pertaining to the second traffic class is transmitted such that transmission of each virtual link pertaining to the second traffic class is coordinated only at the respective end station from which each respective virtual link pertaining to the second traffic class is transmitted.

Abstract: Systems and methods for network bandwidth, buffers and timing management using hybrid scheduling of traffic with different priorities and guarantees are provided. In certain embodiments, a method of managing network scheduling and configuration comprises, for each transmitting end station, reserving one exclusive buffer for each virtual link to be transmitted from the transmitting end station; for each receiving end station, reserving exclusive buffers for each virtual link to be received at the receiving end station; and for each switch, reserving a exclusive buffer for each virtual link to be received at an input port of the switch. The method further comprises determining if each respective transmitting end station, receiving end station, and switch has sufficient capability to support the reserved buffers; and reporting buffer infeasibility if each respective transmitting end station, receiving end station, and switch does not have sufficient capability to support the reserved buffers.

Abstract: Systems and methods for systematic hybrid network scheduling for multiple traffic classes with host timing and phase constraints are provided. In certain embodiments, a method of scheduling communications in a network comprises scheduling transmission of virtual links pertaining to a first traffic class on a global schedule to coordinate transmission of the virtual links pertaining to the first traffic class across all transmitting end stations on the global schedule; and scheduling transmission of each virtual link pertaining to a second traffic class on a local schedule of the respective transmitting end station from which each respective virtual link pertaining to the second traffic class is transmitted such that transmission of each virtual link pertaining to the second traffic class is coordinated only at the respective end station from which each respective virtual link pertaining to the second traffic class is transmitted.

Abstract: Systems and methods for interference cognizant network scheduling are provided. In certain embodiments, a method of scheduling communications in a network comprises identifying a bin of a global timeline for scheduling an unscheduled virtual link, wherein a bin is a segment of the timeline; identifying a pre-scheduled virtual link in the bin; and determining if the pre-scheduled and unscheduled virtual links share a port. In certain embodiments, if the unscheduled and pre-scheduled virtual links don't share a port, scheduling transmission of the unscheduled virtual link to overlap with the scheduled transmission of the pre-scheduled virtual link; and if the unscheduled and pre-scheduled virtual links share a port: determining a start time delay for the unscheduled virtual link based on the port; and scheduling transmission of the unscheduled virtual link in the bin based on the start time delay to overlap part of the scheduled transmission of the pre-scheduled virtual link.