Mostrar el registro sencillo

dc.contributor.authorErazo-Agredo, Cristian C.
dc.contributor.authorGarza-Fabre, Mario
dc.contributor.authorAgüero Calvo, Ramón 
dc.contributor.authorDíez Fernández, Luis Francisco 
dc.contributor.authorSerrat Fernández, Joan
dc.contributor.authorRubio-Loyola, Javier
dc.contributor.otherUniversidad de Cantabriaes_ES
dc.date.accessioned2021-12-14T08:15:24Z
dc.date.available2021-12-14T08:15:24Z
dc.date.issued2021-12
dc.identifier.issn1932-4537
dc.identifier.otherRTI2018-093475-AI00es_ES
dc.identifier.urihttp://hdl.handle.net/10902/23426
dc.description.abstractThis work tackles the problem faced by network/infrastructure providers of jointly selecting routing and functional split level to satisfy requests from virtual mobile network operators (vMNOs). We build a novel system model that brings together all the involved elements and features, embracing split levels defined by the 3GPP and packet switch fronthaul network. To our best knowledge, this is the first work that provides a solution for multiple vMNO requests considering the two aforementioned sub-problems (i.e. split selection and routing). We use the model defined to formulate an optimization problem, which is characterized by the exponential size of its search space. We propose two heuristic approaches to address this problem: (1) a greedy scheme, and (2) an evolutionary algorithm, which is also improved with a specialized initialization. We conduct extensive experiments to assess the performance and behavior of the proposed methods, over varying network instances. When possible, we also perform comparisons with respect to the optimal solution and a well-known commercial solver. Our results indicate that the proposed techniques represent appropriate trade-offs between solution quality and execution time, and can serve complementary goals: the quality of the results yielded by our evolutionary method are better, but at the cost of longer execution times; in contrast, our greedy algorithm offers a reasonably appropriate performance, with an execution time that is notably lower. Our experiments show that it is possible to produce near-optimal results to the above complex problem through computationally efficient algorithmic solutions.es_ES
dc.description.sponsorshipThis paper has been partially supported by the Secretary of Public Education of Mexico (SEP) and Cinvestav through research grant 262, and the National Council of Research and Technology (CONACYT) through grant ERANetLACFONCICYT No. 272278. Luis Diez and Ramon Agüero acknowledge the funding by the Spanish Government (Ministerio de Economía y Competitividad, Fondo Europeo de Desarrollo Regional, MINECO-FEDER) by means of the project FIERCE: Future Internet Enabled Resilient smart CitiEs (RTI2018-093475-AI00).es_ES
dc.format.extent23 p.es_ES
dc.language.isoenges_ES
dc.publisherInstitute of Electrical and Electronics Engineeerses_ES
dc.rights© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.es_ES
dc.sourceIEEE Transactions on Network and Service Management, 2021, 18(4), 4616-4638es_ES
dc.subject.otherRoute selectiones_ES
dc.subject.otherFunctional splites_ES
dc.subject.other5Ges_ES
dc.subject.otherC-RANes_ES
dc.titleJoint route selection and split level management for 5G C-RANes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.relation.publisherVersionhttps://doi.org/10.1109/TNSM.2021.3091543es_ES
dc.rights.accessRightsopenAccesses_ES
dc.identifier.DOI10.1109/TNSM.2021.3091543
dc.type.versionacceptedVersiones_ES


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo