CARES: Computation-aware Scheduling in Virtualized Radio Access Networks

In a virtualized Radio Access Network (RAN), baseband processing is performed by software running in cloud- computing platforms. However, current protocol stacks were not designed to run in this kind of environments: the high variability on the computational resources consumed by RAN functions may l...

Descripción completa

Detalles Bibliográficos
Autores: Bega, Dario, Banchs, Albert|||0000-0003-3544-8537, Gramaglia, Marco, Costa-Perez, Xavier, Rost, Peter
Tipo de recurso: artículo
Fecha de publicación:2018
País:España
Institución:IMDEA Networks Institute
Repositorio:IMDEA Networks Institute Digital Repository
Idioma:inglés
OAI Identifier:oai:dspace.networks.imdea.org:20.500.12761/628
Acceso en línea:http://hdl.handle.net/20.500.12761/628
https://dx.doi.org/DOI: 10.1109/TWC.2018.2873324
Access Level:acceso abierto
Palabra clave:5G
Computation-aware scheduling
Virtualized RAN
joint scheduling
MCS selection
id ES_c25eaf9bd469daf7e6e2a67eb3efd4c7
oai_identifier_str oai:dspace.networks.imdea.org:20.500.12761/628
network_acronym_str ES
network_name_str España
repository_id_str
spelling CARES: Computation-aware Scheduling in Virtualized Radio Access NetworksBega, DarioBanchs, Albert|||0000-0003-3544-8537Gramaglia, MarcoCosta-Perez, XavierRost, Peter5GComputation-aware schedulingVirtualized RANjoint schedulingMCS selectionIn a virtualized Radio Access Network (RAN), baseband processing is performed by software running in cloud- computing platforms. However, current protocol stacks were not designed to run in this kind of environments: the high variability on the computational resources consumed by RAN functions may lead to eventual computational outages (where frames are not decoded on time), severely degrading the resulting performance. In this paper, we address this issue by re-designing two key functions of the protocol stack: (i) scheduling, to select the transmission of those frames that do not incur in computational outages, and (ii) modulation and coding scheme (MCS) selection, to downgrade the selected MCS in case no sufficient computational resources are available. We formulate the resulting problem as a joint optimization and compute the (asymptotically) optimal solution to this problem. We further show that this solution involves solving an NP-hard problem, and propose an algorithm to obtain an approximate solution that is computationally efficient while providing bounded performance over the optimal. We thoroughly evaluate the proposed approach via simulation, showing that it can provide savings as high as 80% of the computational resources while paying a small price in performance.pubIEEE20182018-12-01journal articlehttp://purl.org/coar/resource_type/c_6501NAhttp://purl.org/coar/version/c_be7fb7dd8ff6fe43info:eu-repo/semantics/articlehttp://hdl.handle.net/20.500.12761/628https://dx.doi.org/DOI: 10.1109/TWC.2018.2873324reponame:IMDEA Networks Institute Digital Repositoryinstname:IMDEA Networks InstituteInglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:dspace.networks.imdea.org:20.500.12761/6282026-06-06T12:35:51Z
dc.title.none.fl_str_mv CARES: Computation-aware Scheduling in Virtualized Radio Access Networks
title CARES: Computation-aware Scheduling in Virtualized Radio Access Networks
spellingShingle CARES: Computation-aware Scheduling in Virtualized Radio Access Networks
Bega, Dario
5G
Computation-aware scheduling
Virtualized RAN
joint scheduling
MCS selection
title_short CARES: Computation-aware Scheduling in Virtualized Radio Access Networks
title_full CARES: Computation-aware Scheduling in Virtualized Radio Access Networks
title_fullStr CARES: Computation-aware Scheduling in Virtualized Radio Access Networks
title_full_unstemmed CARES: Computation-aware Scheduling in Virtualized Radio Access Networks
title_sort CARES: Computation-aware Scheduling in Virtualized Radio Access Networks
dc.creator.none.fl_str_mv Bega, Dario
Banchs, Albert|||0000-0003-3544-8537
Gramaglia, Marco
Costa-Perez, Xavier
Rost, Peter
author Bega, Dario
author_facet Bega, Dario
Banchs, Albert|||0000-0003-3544-8537
Gramaglia, Marco
Costa-Perez, Xavier
Rost, Peter
author_role author
author2 Banchs, Albert|||0000-0003-3544-8537
Gramaglia, Marco
Costa-Perez, Xavier
Rost, Peter
author2_role author
author
author
author
dc.subject.none.fl_str_mv 5G
Computation-aware scheduling
Virtualized RAN
joint scheduling
MCS selection
topic 5G
Computation-aware scheduling
Virtualized RAN
joint scheduling
MCS selection
description In a virtualized Radio Access Network (RAN), baseband processing is performed by software running in cloud- computing platforms. However, current protocol stacks were not designed to run in this kind of environments: the high variability on the computational resources consumed by RAN functions may lead to eventual computational outages (where frames are not decoded on time), severely degrading the resulting performance. In this paper, we address this issue by re-designing two key functions of the protocol stack: (i) scheduling, to select the transmission of those frames that do not incur in computational outages, and (ii) modulation and coding scheme (MCS) selection, to downgrade the selected MCS in case no sufficient computational resources are available. We formulate the resulting problem as a joint optimization and compute the (asymptotically) optimal solution to this problem. We further show that this solution involves solving an NP-hard problem, and propose an algorithm to obtain an approximate solution that is computationally efficient while providing bounded performance over the optimal. We thoroughly evaluate the proposed approach via simulation, showing that it can provide savings as high as 80% of the computational resources while paying a small price in performance.
publishDate 2018
dc.date.none.fl_str_mv 2018
2018-12-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
NA
http://purl.org/coar/version/c_be7fb7dd8ff6fe43
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.12761/628
https://dx.doi.org/DOI: 10.1109/TWC.2018.2873324
url http://hdl.handle.net/20.500.12761/628
https://dx.doi.org/DOI: 10.1109/TWC.2018.2873324
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv IEEE
publisher.none.fl_str_mv IEEE
dc.source.none.fl_str_mv reponame:IMDEA Networks Institute Digital Repository
instname:IMDEA Networks Institute
instname_str IMDEA Networks Institute
reponame_str IMDEA Networks Institute Digital Repository
collection IMDEA Networks Institute Digital Repository
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869418660372676608
score 15,301603

Similares en LA Referencia