Design and implementation of a network slicing aware radio scheduler

Thumbnail Image
Publication date
Defense date
Journal Title
Journal ISSN
Volume Title
Google Scholar
Research Projects
Organizational Units
Journal Issue
In this project we will be introducing an overview of the concept of network slicing and its main implications when applied towards Long Term Evolution technologies. It starts by reviewing the main definitions and implications of LTE, regarding its protocols, physical channels and reference signals, so the reader can understand the basis of this technology, before moving to the meaning of network slicing in terms of real case scenarios. This thesis focuses on scheduling algorithms, specifically downlink scheduling algorithms. There is a review of the Round Robin scheduling algorithm which will be later compared to the newly introduced scheduling algorithm based on slicing the network into “bandwidth slots”. Firstly, there is a simulation on Matlab how the throughput varies from one algorithm to the other, and how we can assign an effectively a bigger throughput to a desired user. After completing this first simulation, the project moves on to a real software implementation and executes the proposed algorithm on srsLTE. Once again, there is an analysis of the results in terms of throughput on the new proposed algorithm in which a conclusion is reached on how the throughput varies depending the amount of bandwidth or slots we assign to each one of the users. The second part of the analysis shows a comparation of this throughput with respect to time.
5G, Network slicing, Network architecture, Long Term Evolution (LTE), Scheduling algorithm, Simulación
Bibliographic citation