AS201281 Wiki - univ:utbm

anonymous@undisclosed.example.com (Anonymous) — Mon, 04 Jan 2021 20:41:02 +0000

The base station permanently but not continuously receives data (bits stored in a queue). Each bit (fifo) is stored in a buffer when this buffer has free space. This buffer may be either a simple array, in this case each bit has to be “tagged” as belonging to a given user, or several arrays each belonging to one user. Let's take one array per user. Those datas are then available to the

Max-CQI scheduler

anonymous@undisclosed.example.com (Anonymous) — Mon, 04 Jan 2021 20:41:02 +0000

Max-CQI scheduler user = { CQI, RBG } data = { UE_ID } rbg = { RB[] } data[] buffer data[] ue_data rbg [] blocks user[] users user get_ue_max_cqi () ue = users[0] for i in users do if ue.CQI < i.CQI then ue = i fi done end while is_there_free_ressources_block_group do ue = get_ue_max_cqi () if buffer.has_data_for ( ue ) not null rbg = get_free_ressources_block_group () ue.RBG.add ( rbg ) fi done for ue in users do for b in nb_bits_per_sequence do …

Proportional fair

anonymous@undisclosed.example.com (Anonymous) — Mon, 04 Jan 2021 20:41:02 +0000

Proportional fair This scheduler algorithm is a mix between the 2 previous algorithms : round-robin & max-CQI. It combines the equity principle of round-robin and the throughput optimization principle of max-CQI. Proportional fair allocates resources to the UE which maximize the metric following :

anonymous@undisclosed.example.com (Anonymous) — Mon, 04 Jan 2021 20:41:02 +0000

DATA { INT ind_user; } RGB { RB rbs[] } USER { RGB rgbs[]; DATA datas_to_transmit[]; } # in the case of a lonely array as a buffer DATA buffer[] # previously initialized # and continuously filled by the incoming datas RGB all_rgbs[] DATA u_data[nb_bits_per_sequence] USER users[] INT nb_bits_per_sequence # scheduler size FOR u IN users DO #FOR i in nb_bits_per_sequence DO # u_data[i] = buffer.get_bit(u) #ENDFOR u_data[0] = buffer.get_bit(u) IF u_data.[0] IS NOT None u.rgbs += GET…

anonymous@undisclosed.example.com (Anonymous) — Mon, 04 Jan 2021 20:41:02 +0000

1. PURPOSE OF THE SYSTEM FUNCTION (10 lines) The purpose of our system function is to simulate the sub-carriers allocation for packets transmission in the case of LTE communication. The system will focus on ressources allocation scheduling in the case of downlink communications. Several parts will be implemented:

RE56 project

anonymous@undisclosed.example.com (Anonymous) — Mon, 04 Jan 2021 20:41:02 +0000

RE56 project Produced code LTE (Long Term Evolution) - 4G Documents to write * Specifications document * Round Robin scheduler * Max-CQI scheduler * Proportional Faire scheduler * Round robin example Introduction LTE is like an UMTS upgrade. 4G network means LTE Advanced (next step). OFDMA/SC-FDMA LTE is an IP based network v4 & v6. Voice over LTE: VoLTE

UTBM

anonymous@undisclosed.example.com (Anonymous) — Mon, 04 Jan 2021 20:41:02 +0000

UTBM * Home * University * UTBM ---------- * Selected UV * UV TO52 * RE56 project

UTBM

anonymous@undisclosed.example.com (Anonymous) — Mon, 04 Jan 2021 20:41:02 +0000

UTBM

UV TO52

anonymous@undisclosed.example.com (Anonymous) — Mon, 04 Jan 2021 20:41:02 +0000

UV TO52 Sujet proposé Architecture et déploiement d'un réseau résistant aux ruptures de liens extérieurs. Mise en place d'un réseau renforcé par externalisation du routage de bordure, redondance du lien vers le coeur de réseau, et découpage en sous-réseaux par fonction, dans le but de maintenir l'accessibilité des services.

Selected UV

anonymous@undisclosed.example.com (Anonymous) — Mon, 04 Jan 2021 20:41:02 +0000

Selected UV Semester 1 * LO41: Architecture et utilisation des systèmes d'exploitation (successful [D]) * MI41: Architecture des systèmes informatiques (successful [C]) * RE42: Local area networks (successful [B]) * MT45: Fondements en algèbre et analyse (failed [F])