| CPC H04W 72/54 (2023.01) [H04L 1/16 (2013.01); H04L 41/12 (2013.01); H04L 47/28 (2013.01); H04L 47/801 (2013.01); H04L 47/826 (2013.01); H04W 48/16 (2013.01)] | 22 Claims |

|
1. A method for scheduling transmissions of a plurality of data streams in a telecommunication network, wherein the transmissions are partitioned into transmission cycles with a predetermined length in time, and wherein respective repetitive transmissions of each of the plurality of data streams are transmitted with a time interval determined by the predetermined length in time of the transmission cycles multiplied by a respective repetition rate of the respective repetitive transmissions, the method comprising:
determining, for each of the plurality of data streams, a respective path through the telecommunication network used for the respective repetitive transmissions of the respective data stream;
determining a plurality of shared transmission links based on a comparison of the paths through the network, wherein each of the shared transmission links is part of at least two of the paths;
based on a numerical optimization, determining a respective phase of the respective repetitive transmissions for each of the plurality of data streams, the numerical optimization having an objective function comprising at least one value indicative of interference between two or more repetitive transmissions of the plurality of data streams; and
scheduling the respective repetitive transmissions of each of the plurality of data streams, wherein the respective repetitive transmissions start at a transmission cycle associated with the respective phase;
wherein the at least one value is based on a respective total traveling time of the respective repetitive transmissions of each of the plurality of data streams; and
wherein the numerical optimization takes into account one or more upper limits selected from a group consisting of: a worst-case traveling time, a worst-case arrival time, a worst-case delay, and a worst-case aggregate total travelling time.
|