Mostra el registre d'ítem simple

dc.contributorRuiz Boqué, Sílvia
dc.contributor.authorGuerra Gómez, Rolando
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions
dc.date.accessioned2020-03-12T16:20:01Z
dc.date.available2020-03-12T16:20:01Z
dc.date.issued2020-02-26
dc.identifier.urihttp://hdl.handle.net/2117/179832
dc.descriptionThis work was supported in part by the Spanish ministry of science through the projectRTI2018-099880-B-C32, with ERFD funds, and the Grant FPI-UPC provided by theUPC. It has been done under COST CA15104 IRACON EU project.
dc.description.abstractEfficient computational resource management in 5G Cloud Radio Access Network (CRAN) environments is a challenging problem because it has to account simultaneously for throughput, latency, power efficiency, and optimization tradeoffs. This work proposes the use of a modified and improved version of the realistic Vienna Scenario that was defined in COST action IC1004, to test two different scale C-RAN deployments. First, a large-scale analysis with 628 Macro-cells (Mcells) and 221 Small-cells (Scells) is used to test different algorithms oriented to optimize the network deployment by minimizing delays, balancing the load among the Base Band Unit (BBU) pools, or clustering the Remote Radio Heads (RRH) efficiently to maximize the multiplexing gain. After planning, real-time resource allocation strategies with Quality of Service (QoS) constraints should be optimized as well. To do so, a realistic small-scale scenario for the metropolitan area is defined by modeling the individual time-variant traffic patterns of 7000 users (UEs) connected to different services. The distribution of resources among UEs and BBUs is optimized by algorithms, based on a realistic calculation of the UEs Signal to Interference and Noise Ratios (SINRs), that account for the required computational capacity per cell, the QoS constraints and the service priorities. However, the assumption of a fixed computational capacity at the BBU pools may result in underutilized or oversubscribed resources, thus affecting the overall QoS. As resources are virtualized at the BBU pools, they could be dynamically instantiated according to the required computational capacity (RCC). For this reason, a new strategy for Dynamic Resource Management with Adaptive Computational capacity (DRM-AC) using machine learning (ML) techniques is proposed. Three ML algorithms have been tested to select the best predicting approach: support vector machine (SVM), time-delay neural network (TDNN), and long short-term memory (LSTM). DRM-AC reduces the average of unused resources by 96 %, but there is still QoS degradation when RCC is higher than the predicted computational capacity (PCC). For this reason, two new strategies are proposed and tested: DRM-AC with pre-filtering (DRM-AC-PF) and DRM-AC with error shifting (DRM-AC-ES), reducing the average of unsatisfied resources by 99.9 % and 98 % compared to the DRM-AC, respectively.
dc.language.isoeng
dc.publisherUniversitat Politècnica de Catalunya
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació
dc.subject.lcshBig data
dc.subject.lcshMachine learning
dc.subject.lcshComputer networks
dc.subject.lcshIntegrated services digital networks
dc.subject.otherC-RAN
dc.subject.other5G
dc.subject.otherMachine Learning
dc.subject.otherResource Allocation
dc.titleResource management with adaptive capacity in C-RAN
dc.typeMaster thesis
dc.subject.lemacDades massives
dc.subject.lemacAprenentatge automàtic
dc.subject.lemacOrdinadors, Xarxes d'
dc.subject.lemacXarxes Digitals de Serveis Integrats
dc.rights.accessOpen Access
dc.date.updated2020-02-28T05:08:05Z
dc.audience.educationlevelEstudis de primer/segon cicle
dc.audience.mediatorEscola d'Enginyeria de Telecomunicació i Aeroespacial de Castelldefels
dc.audience.degreeMÀSTER UNIVERSITARI EN APLICACIONS I GESTIÓ DE L'ENGINYERIA DE TELECOMUNICACIÓ (MASTEAM) (Pla 2015)


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple