HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Deterministic scheduling of periodic datagrams for low latency in 5G and beyond

Abstract : This thesis is the result of a collaboration between DAVID Laboratory and Nokia Bell Labs France.The original idea is to find algorithmic solutions to deterministically manage periodic flows in networks in order to control and minimize the transmission time, called latency. One of the objectives of 5G (C-RAN, for Cloud Radio Access Network) is to centralize the calculation units of the radio antennas of telecommunications networks (called Radio Access Network) in the same computer center (the Cloud). The network between the computing center and the antennas must be able to satisfy the latency constraints imposed by the protocols.We define the problem of finding a periodic scheduling for messages so that they never compete for the same resource, and prove that the different variants of the problem studied are NP-complete. We first study the problem for a particular topology in which all the streams share the same link. We first propose polynomial algorithms of increased sophistication, and FPT algorithms that allow us to find a solution when the number of routes is reasonable, which is the case for C-RAN networks.Since the algorithms developed in this first part are not directly adaptable to more general topologies, we then propose a canonical form to the problem which allows us to define an efficient neighborhood notion for local search heuristics (hill climbing, tabu search, simulated annealing). We use this canonical form to define an efficient Branch and Bound algorithm when the number of routes is moderate.We also propose a performance evaluation of the proposed solutions compared to current flow management solutions, and show that our model is feasible in practice thanks to new equipment under development.
Complete list of metadata

Contributor : Abes Star :  Contact
Submitted on : Wednesday, November 3, 2021 - 5:40:09 PM
Last modification on : Friday, November 5, 2021 - 4:12:40 AM


Version validated by the jury (STAR)


  • HAL Id : tel-03413419, version 1


Maël Guiraud. Deterministic scheduling of periodic datagrams for low latency in 5G and beyond. Operations Research [cs.RO]. Université Paris-Saclay, 2021. English. ⟨NNT : 2021UPASG034⟩. ⟨tel-03413419⟩



Record views


Files downloads