基于强化学习的5G多域网络切片方法

Godfrey Kibalya, J. Serrat, J. Gorricho, R. Pasquini, Haipeng Yao, Peiying Zhang
{"title":"基于强化学习的5G多域网络切片方法","authors":"Godfrey Kibalya, J. Serrat, J. Gorricho, R. Pasquini, Haipeng Yao, Peiying Zhang","doi":"10.23919/CNSM46954.2019.9012674","DOIUrl":null,"url":null,"abstract":"Network Function Virtualization (NFV) and Machine Learning (ML) are envisioned as possible techniques for the realization of a flexible and adaptive 5G network. ML will provide the network with experiential intelligence to forecast, adapt and recover from temporal network fluctuations. On the other hand, NFV will enable the deployment of slice instances meeting specific service requirements. Moreover, a single slice instance may require to be deployed across multiple substrate networks; however, existing works on multi-substrate Virtual Network Embedding fall short on addressing the realistic slice constraints such as delay, location, etc., hence they are not suited for applications transcending multiple domains. In this paper, we address the multi-substrate slicing problem in a coordinated manner, and we propose a Reinforcement Learning (RL) algorithm for partitioning the slice request to the different candidate substrate networks. Moreover, we consider realistic slice constraints such as delay, location, etc. Simulation results show that the RL approach results into a performance comparable to the combinatorial solution, with more than 99% of time saving for the processing of each request.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"A Reinforcement Learning Based Approach for 5G Network Slicing Across Multiple Domains\",\"authors\":\"Godfrey Kibalya, J. Serrat, J. Gorricho, R. Pasquini, Haipeng Yao, Peiying Zhang\",\"doi\":\"10.23919/CNSM46954.2019.9012674\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network Function Virtualization (NFV) and Machine Learning (ML) are envisioned as possible techniques for the realization of a flexible and adaptive 5G network. ML will provide the network with experiential intelligence to forecast, adapt and recover from temporal network fluctuations. On the other hand, NFV will enable the deployment of slice instances meeting specific service requirements. Moreover, a single slice instance may require to be deployed across multiple substrate networks; however, existing works on multi-substrate Virtual Network Embedding fall short on addressing the realistic slice constraints such as delay, location, etc., hence they are not suited for applications transcending multiple domains. In this paper, we address the multi-substrate slicing problem in a coordinated manner, and we propose a Reinforcement Learning (RL) algorithm for partitioning the slice request to the different candidate substrate networks. Moreover, we consider realistic slice constraints such as delay, location, etc. Simulation results show that the RL approach results into a performance comparable to the combinatorial solution, with more than 99% of time saving for the processing of each request.\",\"PeriodicalId\":273818,\"journal\":{\"name\":\"2019 15th International Conference on Network and Service Management (CNSM)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 15th International Conference on Network and Service Management (CNSM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/CNSM46954.2019.9012674\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Conference on Network and Service Management (CNSM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/CNSM46954.2019.9012674","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

网络功能虚拟化(NFV)和机器学习(ML)被设想为实现灵活和自适应5G网络的可能技术。机器学习将为网络提供经验智能,以预测、适应和从时间网络波动中恢复。另一方面,NFV将支持满足特定服务需求的片实例的部署。此外,单个切片实例可能需要部署在多个基板网络上;然而,现有的多基板虚拟网络嵌入工作在解决诸如延迟、位置等现实切片约束方面存在不足,因此它们不适合跨多域应用。在本文中,我们以协调的方式解决了多基板切片问题,并提出了一种强化学习(RL)算法,用于将切片请求划分到不同的候选基板网络。此外,我们还考虑了实际的切片约束,如延迟、位置等。仿真结果表明,RL方法的性能可与组合解决方案相媲美,每个请求的处理时间节省99%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Reinforcement Learning Based Approach for 5G Network Slicing Across Multiple Domains
Network Function Virtualization (NFV) and Machine Learning (ML) are envisioned as possible techniques for the realization of a flexible and adaptive 5G network. ML will provide the network with experiential intelligence to forecast, adapt and recover from temporal network fluctuations. On the other hand, NFV will enable the deployment of slice instances meeting specific service requirements. Moreover, a single slice instance may require to be deployed across multiple substrate networks; however, existing works on multi-substrate Virtual Network Embedding fall short on addressing the realistic slice constraints such as delay, location, etc., hence they are not suited for applications transcending multiple domains. In this paper, we address the multi-substrate slicing problem in a coordinated manner, and we propose a Reinforcement Learning (RL) algorithm for partitioning the slice request to the different candidate substrate networks. Moreover, we consider realistic slice constraints such as delay, location, etc. Simulation results show that the RL approach results into a performance comparable to the combinatorial solution, with more than 99% of time saving for the processing of each request.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信