Avaliação de performance de algoritmos de escalonamento em redes LTE

Abstract

The purpose of this work was to study the Long-Term Evolution (LTE) networks with a focus on the scheduling mechanisms and to compare these scheduling algorithms in the LTE network simulation software, the software chosen was ns-3. The simulated algorithms were the Proportional Fair (PF), Channel and QoS Aware Scheduler (CQA), Priority Set Scheduler (PSS) and Token Bank Fair Queue Scheduler (TBFQ), all of which were already implemented in the software. To construct the simulation, it was necessary to make a code in C ++ that used the libraries of the simulator, so all the APIs that relate to the simulated models were studied in order to generate the simulation. The simulated scenario considers a network with two types of users, one that requires QoS and another that uses a Best Effort service. The simulation results in the form of text files were processed in MATLAB for data organization and graphing. And, in order to facilitate the execution of the simulations, a bash script was created that simulates each algorithm in an automated way. As shown in the literature, the CQA algorithm was the best performing to guarantee limited delay.