| CPC H04L 47/28 (2013.01) [H04L 47/24 (2013.01); H04L 47/6275 (2013.01)] | 14 Claims |

|
1. A method implemented in a packet-switched network for scheduling transmission of Ethernet frames, comprising:
a) identifying, among the Ethernet frames to transmit, time-critical traffic frames, and respective priority levels of said time-critical traffic frames,
b) obtaining data of a transmission time of each time-critical traffic frame and of a transmission duration of each time-critical traffic frame,
c) comparing the transmission times of the respective time-critical traffic frames so as to determine a list of said transmission times by increasing order,
d) for a first frame having a first transmission time at top of the list, determining a result of addition of said first transmission time and a transmission duration of said first frame,
e) determining whether at least one second transmission time in said list is lower than said result of addition, and:
* if not, a next transmission time of a time-critical traffic frame is determined as the first transmission time,
* if yes, determining whether a priority of a second frame having said second transmission time in the list, is higher than a priority of the first frame, and
** if not, a next transmission time of a time-critical traffic frame is determined as the first transmission time, and
** if yes, removing the first transmission time from the list and repeating d) and e) with a new transmission time following the first transmission time in the list, said new transmission time becoming the first transmission time for the implementation of the repetition of d) and e),
f) scheduling the next transmission time of the time-critical traffic frame having a transmission time which remains the first transmission time of the list.
|