公开(公告)号：US10917355B1

公开(公告)日：2021-02-09

申请号：US16554210

申请日：2019-08-28

Applicant: HONEYWELL INTERNATIONAL INC.

Inventor： Benjamin F. DeLay ,  Srivatsan Varadarajan ,  Theodore J. Bonk ,  William T. Smithgall ,  Brent A. Morin

IPC: H04L12/869 ,  H04L12/803 ,  H04L12/919 ,  H04L12/841 ,  H04L12/935

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.

公开(公告)号：US20210067459A1

公开(公告)日：2021-03-04

申请号：US16554210

申请日：2019-08-28

Applicant: HONEYWELL INTERNATIONAL INC.

Inventor： Benjamin F. DeLay ,  Srivatsan Varadarajan ,  Theodore J. Bonk ,  William T. Smithgall ,  Brent A. Morin

IPC: H04L12/869 ,  H04L12/803 ,  H04L12/935 ,  H04L12/841 ,  H04L12/919

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.