Controle de admissão para network slicing considerando recursos de comunicação e computação
Autor(a) principal: | |
---|---|
Data de Publicação: | 2023 |
Tipo de documento: | Tese |
Idioma: | por |
Título da fonte: | Repositório Institucional da UFG |
dARK ID: | ark:/38995/00130000091bs |
Texto Completo: | http://repositorio.bc.ufg.br/tede/handle/tede/12872 |
Resumo: | The 5G networks have enabled the application of various innovative and disruptive technologies such as Network Function Virtualization (NFV) and Software-Defined Networking (SDN). Together, these technologies act as enablers of Network Slicing (NS), transforming the way networks are operated, managed, and monetized. Through the concept of Slice-as-a-Service (SlaaS), telecommunications operators can monetize the physical and logical infrastructure by offering network slices to new customers, such as vertical industries. This thesis addresses the problem of tenant admission control using NS. We propose three admission control models for NS (MONETS-OBD, MONETS-OBS, and CAONS) that consider both communication and computation resources. To evaluate the proposed models, we compare the results with different classical algorithms from the literature, such as eUCB, e-greedy, and ONETS. We use data from different applications to enrich the analysis. The results indicate that the MONETS-OBD, MONETS-OBS, and CAONS heuristics perform admission control that approaches the set of ideal solutions. We achieve high efficiency with the MONETS-OBD and MONETS-OBS heuristics in controlling tenant admission, reaching acceptance rates of up to 99% in some cases. Furthermore, the CAONS heuristic, which employs penalties, not only achieves acceptance and reward rates close to the optimal solution but also significantly reduces the number of capacity violations. Lastly, the results highlight that the process of slice admission control should consider both communication and computation resources, which are scarce at the network edge. A solution that considers only communication resources can lead to incorrect and unfeasible interpretations, overestimating the capacity of computation resources. |
id |
UFG-2_5fcaa64b7ed9554745d4348cd122bc41 |
---|---|
oai_identifier_str |
oai:repositorio.bc.ufg.br:tede/12872 |
network_acronym_str |
UFG-2 |
network_name_str |
Repositório Institucional da UFG |
repository_id_str |
|
spelling |
Corrêa, Sand Luzhttp://lattes.cnpq.br/3386409577930822Cardoso, Kleber Vieirahttp://lattes.cnpq.br/0268732896111424Corrêa, Sand LuzCardoso, Kleber VieiraOliveira Júnior, Antônio Carlos deCosta, Ronaldo Martins daBoth, Cristiano Bonatohttp://lattes.cnpq.br/1807688763533892Lima, Henrique Valle de2023-05-31T11:50:46Z2023-05-31T11:50:46Z2023-05-10LIMA, H. V. Controle de admissão para network slicing considerando recursos de comunicação e computação. 2023. 101 f. Tese (Doutorado em Ciência da Computação) - Universidade Federal de Goiás, Goiânia, 2023.http://repositorio.bc.ufg.br/tede/handle/tede/12872ark:/38995/00130000091bsThe 5G networks have enabled the application of various innovative and disruptive technologies such as Network Function Virtualization (NFV) and Software-Defined Networking (SDN). Together, these technologies act as enablers of Network Slicing (NS), transforming the way networks are operated, managed, and monetized. Through the concept of Slice-as-a-Service (SlaaS), telecommunications operators can monetize the physical and logical infrastructure by offering network slices to new customers, such as vertical industries. This thesis addresses the problem of tenant admission control using NS. We propose three admission control models for NS (MONETS-OBD, MONETS-OBS, and CAONS) that consider both communication and computation resources. To evaluate the proposed models, we compare the results with different classical algorithms from the literature, such as eUCB, e-greedy, and ONETS. We use data from different applications to enrich the analysis. The results indicate that the MONETS-OBD, MONETS-OBS, and CAONS heuristics perform admission control that approaches the set of ideal solutions. We achieve high efficiency with the MONETS-OBD and MONETS-OBS heuristics in controlling tenant admission, reaching acceptance rates of up to 99% in some cases. Furthermore, the CAONS heuristic, which employs penalties, not only achieves acceptance and reward rates close to the optimal solution but also significantly reduces the number of capacity violations. Lastly, the results highlight that the process of slice admission control should consider both communication and computation resources, which are scarce at the network edge. A solution that considers only communication resources can lead to incorrect and unfeasible interpretations, overestimating the capacity of computation resources.As redes 5G, possibilitaram a aplicação de diversas tecnologias inovadoras e disruptivas como Network Function Virtualization (NFV) e Software-Defined Networking (SDN). Juntas, essas tecnologias atuam como habilitadoras de Network Slicing (NS), transformado a forma de operar, gerenciar e monetizar as redes. Através de conceitos de Slice- as-a-Service (SlaaS), as operadoras de telecomunicação podem monetizar a infraestrutura física e lógica, oferecendo slices na rede a novos clientes, como indústrias verticais. Esta tese aborda o problema de controle de admissão de inquilinos com uso de NS. Propompos três modelos de controle de admissão para NS (MONETS-OBD, MONETS-OBS e CAONS) que consideram recursos de comunicação e computação. Para avaliar os modelos propostos, comparamos os resultados com diferentes algoritmos clássicos da literatura, como o eUCB, o e-greedy e o ONETS. Utilizamos dados de diferentes aplicações para enriquecer a análise. Os resultados indicam que as heurísticas MONETS-OBD, MONETS- OBS e CAONS realizam um controle de admissão que se aproxima do conjunto de soluções ideais. Atingimos alta eficiência das heurísticas MONETS-OBD e MONETS-OBS em controlar a admissão dos inquilinos, atingindo taxas de aceitação de requisições de até 99% em alguns casos. Além disso, a heurística CAONS, que utiliza penalizações, além de alcançar taxas de aceitação e recompensa próximas da solução ótima, ainda reduz significativamente o número de violações da capacidade do sistema. Por fim, os resultados evidenciam que o processo de controle de admissão de slices deve considerar os recursos de comunicação e os recursos de computação, escassos na borda da rede. Uma solução que considere somente os recursos de comunicação pode levar a interpretações incorretas e inviáveis, superestimando a capacidade dos recursos de computação.Submitted by Marlene Santos (marlene.bc.ufg@gmail.com) on 2023-05-30T19:16:40Z No. of bitstreams: 2 Tese - Henrique Valle de Lima - 2023.pdf: 7306474 bytes, checksum: e54fd704036169dcb348149896a3a6cf (MD5) license_rdf: 805 bytes, checksum: 4460e5956bc1d1639be9ae6146a50347 (MD5)Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2023-05-31T11:50:45Z (GMT) No. of bitstreams: 2 Tese - Henrique Valle de Lima - 2023.pdf: 7306474 bytes, checksum: e54fd704036169dcb348149896a3a6cf (MD5) license_rdf: 805 bytes, checksum: 4460e5956bc1d1639be9ae6146a50347 (MD5)Made available in DSpace on 2023-05-31T11:50:46Z (GMT). No. of bitstreams: 2 Tese - Henrique Valle de Lima - 2023.pdf: 7306474 bytes, checksum: e54fd704036169dcb348149896a3a6cf (MD5) license_rdf: 805 bytes, checksum: 4460e5956bc1d1639be9ae6146a50347 (MD5) Previous issue date: 2023-05-10Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPESporUniversidade Federal de GoiásPrograma de Pós-graduação em Ciência da Computação (INF)UFGBrasilInstituto de Informática - INF (RMG)Attribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessNetwork slicingMulti-access edge computingMulti- armed bandits5GControle de admissãoCIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAOControle de admissão para network slicing considerando recursos de comunicação e computaçãoAdmission control for network slicing considering communication and computing resourcesinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesis20500500500500261841reponame:Repositório Institucional da UFGinstname:Universidade Federal de Goiás (UFG)instacron:UFGORIGINALTese - Henrique Valle de Lima - 2023.pdfTese - Henrique Valle de Lima - 2023.pdfapplication/pdf7306474http://repositorio.bc.ufg.br/tede/bitstreams/bfe7fdb0-59cc-4e25-be60-5b24beab9db4/downloade54fd704036169dcb348149896a3a6cfMD53LICENSElicense.txtlicense.txttext/plain; charset=utf-81748http://repositorio.bc.ufg.br/tede/bitstreams/53447055-d188-4dd0-8755-5516d4561fc2/download8a4605be74aa9ea9d79846c1fba20a33MD51CC-LICENSElicense_rdflicense_rdfapplication/rdf+xml; charset=utf-8805http://repositorio.bc.ufg.br/tede/bitstreams/a1b861f7-b14f-49c1-873d-71b335f20853/download4460e5956bc1d1639be9ae6146a50347MD52tede/128722023-05-31 08:50:46.258http://creativecommons.org/licenses/by-nc-nd/4.0/Attribution-NonCommercial-NoDerivatives 4.0 Internationalopen.accessoai:repositorio.bc.ufg.br:tede/12872http://repositorio.bc.ufg.br/tedeRepositório InstitucionalPUBhttp://repositorio.bc.ufg.br/oai/requesttasesdissertacoes.bc@ufg.bropendoar:2023-05-31T11:50:46Repositório Institucional da UFG - Universidade Federal de Goiás (UFG)falseTk9URTogUExBQ0UgWU9VUiBPV04gTElDRU5TRSBIRVJFClRoaXMgc2FtcGxlIGxpY2Vuc2UgaXMgcHJvdmlkZWQgZm9yIGluZm9ybWF0aW9uYWwgcHVycG9zZXMgb25seS4KCk5PTi1FWENMVVNJVkUgRElTVFJJQlVUSU9OIExJQ0VOU0UKCkJ5IHNpZ25pbmcgYW5kIHN1Ym1pdHRpbmcgdGhpcyBsaWNlbnNlLCB5b3UgKHRoZSBhdXRob3Iocykgb3IgY29weXJpZ2h0Cm93bmVyKSBncmFudHMgdG8gRFNwYWNlIFVuaXZlcnNpdHkgKERTVSkgdGhlIG5vbi1leGNsdXNpdmUgcmlnaHQgdG8gcmVwcm9kdWNlLAp0cmFuc2xhdGUgKGFzIGRlZmluZWQgYmVsb3cpLCBhbmQvb3IgZGlzdHJpYnV0ZSB5b3VyIHN1Ym1pc3Npb24gKGluY2x1ZGluZwp0aGUgYWJzdHJhY3QpIHdvcmxkd2lkZSBpbiBwcmludCBhbmQgZWxlY3Ryb25pYyBmb3JtYXQgYW5kIGluIGFueSBtZWRpdW0sCmluY2x1ZGluZyBidXQgbm90IGxpbWl0ZWQgdG8gYXVkaW8gb3IgdmlkZW8uCgpZb3UgYWdyZWUgdGhhdCBEU1UgbWF5LCB3aXRob3V0IGNoYW5naW5nIHRoZSBjb250ZW50LCB0cmFuc2xhdGUgdGhlCnN1Ym1pc3Npb24gdG8gYW55IG1lZGl1bSBvciBmb3JtYXQgZm9yIHRoZSBwdXJwb3NlIG9mIHByZXNlcnZhdGlvbi4KCllvdSBhbHNvIGFncmVlIHRoYXQgRFNVIG1heSBrZWVwIG1vcmUgdGhhbiBvbmUgY29weSBvZiB0aGlzIHN1Ym1pc3Npb24gZm9yCnB1cnBvc2VzIG9mIHNlY3VyaXR5LCBiYWNrLXVwIGFuZCBwcmVzZXJ2YXRpb24uCgpZb3UgcmVwcmVzZW50IHRoYXQgdGhlIHN1Ym1pc3Npb24gaXMgeW91ciBvcmlnaW5hbCB3b3JrLCBhbmQgdGhhdCB5b3UgaGF2ZQp0aGUgcmlnaHQgdG8gZ3JhbnQgdGhlIHJpZ2h0cyBjb250YWluZWQgaW4gdGhpcyBsaWNlbnNlLiBZb3UgYWxzbyByZXByZXNlbnQKdGhhdCB5b3VyIHN1Ym1pc3Npb24gZG9lcyBub3QsIHRvIHRoZSBiZXN0IG9mIHlvdXIga25vd2xlZGdlLCBpbmZyaW5nZSB1cG9uCmFueW9uZSdzIGNvcHlyaWdodC4KCklmIHRoZSBzdWJtaXNzaW9uIGNvbnRhaW5zIG1hdGVyaWFsIGZvciB3aGljaCB5b3UgZG8gbm90IGhvbGQgY29weXJpZ2h0LAp5b3UgcmVwcmVzZW50IHRoYXQgeW91IGhhdmUgb2J0YWluZWQgdGhlIHVucmVzdHJpY3RlZCBwZXJtaXNzaW9uIG9mIHRoZQpjb3B5cmlnaHQgb3duZXIgdG8gZ3JhbnQgRFNVIHRoZSByaWdodHMgcmVxdWlyZWQgYnkgdGhpcyBsaWNlbnNlLCBhbmQgdGhhdApzdWNoIHRoaXJkLXBhcnR5IG93bmVkIG1hdGVyaWFsIGlzIGNsZWFybHkgaWRlbnRpZmllZCBhbmQgYWNrbm93bGVkZ2VkCndpdGhpbiB0aGUgdGV4dCBvciBjb250ZW50IG9mIHRoZSBzdWJtaXNzaW9uLgoKSUYgVEhFIFNVQk1JU1NJT04gSVMgQkFTRUQgVVBPTiBXT1JLIFRIQVQgSEFTIEJFRU4gU1BPTlNPUkVEIE9SIFNVUFBPUlRFRApCWSBBTiBBR0VOQ1kgT1IgT1JHQU5JWkFUSU9OIE9USEVSIFRIQU4gRFNVLCBZT1UgUkVQUkVTRU5UIFRIQVQgWU9VIEhBVkUKRlVMRklMTEVEIEFOWSBSSUdIVCBPRiBSRVZJRVcgT1IgT1RIRVIgT0JMSUdBVElPTlMgUkVRVUlSRUQgQlkgU1VDSApDT05UUkFDVCBPUiBBR1JFRU1FTlQuCgpEU1Ugd2lsbCBjbGVhcmx5IGlkZW50aWZ5IHlvdXIgbmFtZShzKSBhcyB0aGUgYXV0aG9yKHMpIG9yIG93bmVyKHMpIG9mIHRoZQpzdWJtaXNzaW9uLCBhbmQgd2lsbCBub3QgbWFrZSBhbnkgYWx0ZXJhdGlvbiwgb3RoZXIgdGhhbiBhcyBhbGxvd2VkIGJ5IHRoaXMKbGljZW5zZSwgdG8geW91ciBzdWJtaXNzaW9uLgo= |
dc.title.pt_BR.fl_str_mv |
Controle de admissão para network slicing considerando recursos de comunicação e computação |
dc.title.alternative.eng.fl_str_mv |
Admission control for network slicing considering communication and computing resources |
title |
Controle de admissão para network slicing considerando recursos de comunicação e computação |
spellingShingle |
Controle de admissão para network slicing considerando recursos de comunicação e computação Lima, Henrique Valle de Network slicing Multi-access edge computing Multi- armed bandits 5G Controle de admissão CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
title_short |
Controle de admissão para network slicing considerando recursos de comunicação e computação |
title_full |
Controle de admissão para network slicing considerando recursos de comunicação e computação |
title_fullStr |
Controle de admissão para network slicing considerando recursos de comunicação e computação |
title_full_unstemmed |
Controle de admissão para network slicing considerando recursos de comunicação e computação |
title_sort |
Controle de admissão para network slicing considerando recursos de comunicação e computação |
author |
Lima, Henrique Valle de |
author_facet |
Lima, Henrique Valle de |
author_role |
author |
dc.contributor.advisor1.fl_str_mv |
Corrêa, Sand Luz |
dc.contributor.advisor1Lattes.fl_str_mv |
http://lattes.cnpq.br/3386409577930822 |
dc.contributor.advisor-co1.fl_str_mv |
Cardoso, Kleber Vieira |
dc.contributor.advisor-co1Lattes.fl_str_mv |
http://lattes.cnpq.br/0268732896111424 |
dc.contributor.referee1.fl_str_mv |
Corrêa, Sand Luz |
dc.contributor.referee2.fl_str_mv |
Cardoso, Kleber Vieira |
dc.contributor.referee3.fl_str_mv |
Oliveira Júnior, Antônio Carlos de |
dc.contributor.referee4.fl_str_mv |
Costa, Ronaldo Martins da |
dc.contributor.referee5.fl_str_mv |
Both, Cristiano Bonato |
dc.contributor.authorLattes.fl_str_mv |
http://lattes.cnpq.br/1807688763533892 |
dc.contributor.author.fl_str_mv |
Lima, Henrique Valle de |
contributor_str_mv |
Corrêa, Sand Luz Cardoso, Kleber Vieira Corrêa, Sand Luz Cardoso, Kleber Vieira Oliveira Júnior, Antônio Carlos de Costa, Ronaldo Martins da Both, Cristiano Bonato |
dc.subject.eng.fl_str_mv |
Network slicing Multi-access edge computing Multi- armed bandits |
topic |
Network slicing Multi-access edge computing Multi- armed bandits 5G Controle de admissão CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
dc.subject.por.fl_str_mv |
5G Controle de admissão |
dc.subject.cnpq.fl_str_mv |
CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
description |
The 5G networks have enabled the application of various innovative and disruptive technologies such as Network Function Virtualization (NFV) and Software-Defined Networking (SDN). Together, these technologies act as enablers of Network Slicing (NS), transforming the way networks are operated, managed, and monetized. Through the concept of Slice-as-a-Service (SlaaS), telecommunications operators can monetize the physical and logical infrastructure by offering network slices to new customers, such as vertical industries. This thesis addresses the problem of tenant admission control using NS. We propose three admission control models for NS (MONETS-OBD, MONETS-OBS, and CAONS) that consider both communication and computation resources. To evaluate the proposed models, we compare the results with different classical algorithms from the literature, such as eUCB, e-greedy, and ONETS. We use data from different applications to enrich the analysis. The results indicate that the MONETS-OBD, MONETS-OBS, and CAONS heuristics perform admission control that approaches the set of ideal solutions. We achieve high efficiency with the MONETS-OBD and MONETS-OBS heuristics in controlling tenant admission, reaching acceptance rates of up to 99% in some cases. Furthermore, the CAONS heuristic, which employs penalties, not only achieves acceptance and reward rates close to the optimal solution but also significantly reduces the number of capacity violations. Lastly, the results highlight that the process of slice admission control should consider both communication and computation resources, which are scarce at the network edge. A solution that considers only communication resources can lead to incorrect and unfeasible interpretations, overestimating the capacity of computation resources. |
publishDate |
2023 |
dc.date.accessioned.fl_str_mv |
2023-05-31T11:50:46Z |
dc.date.available.fl_str_mv |
2023-05-31T11:50:46Z |
dc.date.issued.fl_str_mv |
2023-05-10 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/doctoralThesis |
format |
doctoralThesis |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
LIMA, H. V. Controle de admissão para network slicing considerando recursos de comunicação e computação. 2023. 101 f. Tese (Doutorado em Ciência da Computação) - Universidade Federal de Goiás, Goiânia, 2023. |
dc.identifier.uri.fl_str_mv |
http://repositorio.bc.ufg.br/tede/handle/tede/12872 |
dc.identifier.dark.fl_str_mv |
ark:/38995/00130000091bs |
identifier_str_mv |
LIMA, H. V. Controle de admissão para network slicing considerando recursos de comunicação e computação. 2023. 101 f. Tese (Doutorado em Ciência da Computação) - Universidade Federal de Goiás, Goiânia, 2023. ark:/38995/00130000091bs |
url |
http://repositorio.bc.ufg.br/tede/handle/tede/12872 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.relation.program.fl_str_mv |
20 |
dc.relation.confidence.fl_str_mv |
500 500 500 500 |
dc.relation.department.fl_str_mv |
26 |
dc.relation.cnpq.fl_str_mv |
184 |
dc.relation.sponsorship.fl_str_mv |
1 |
dc.rights.driver.fl_str_mv |
Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Universidade Federal de Goiás |
dc.publisher.program.fl_str_mv |
Programa de Pós-graduação em Ciência da Computação (INF) |
dc.publisher.initials.fl_str_mv |
UFG |
dc.publisher.country.fl_str_mv |
Brasil |
dc.publisher.department.fl_str_mv |
Instituto de Informática - INF (RMG) |
publisher.none.fl_str_mv |
Universidade Federal de Goiás |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFG instname:Universidade Federal de Goiás (UFG) instacron:UFG |
instname_str |
Universidade Federal de Goiás (UFG) |
instacron_str |
UFG |
institution |
UFG |
reponame_str |
Repositório Institucional da UFG |
collection |
Repositório Institucional da UFG |
bitstream.url.fl_str_mv |
http://repositorio.bc.ufg.br/tede/bitstreams/bfe7fdb0-59cc-4e25-be60-5b24beab9db4/download http://repositorio.bc.ufg.br/tede/bitstreams/53447055-d188-4dd0-8755-5516d4561fc2/download http://repositorio.bc.ufg.br/tede/bitstreams/a1b861f7-b14f-49c1-873d-71b335f20853/download |
bitstream.checksum.fl_str_mv |
e54fd704036169dcb348149896a3a6cf 8a4605be74aa9ea9d79846c1fba20a33 4460e5956bc1d1639be9ae6146a50347 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFG - Universidade Federal de Goiás (UFG) |
repository.mail.fl_str_mv |
tasesdissertacoes.bc@ufg.br |
_version_ |
1815172606620336128 |