A Reinforcement Learning Approach to Virtual Network Embedding Problems in 5G Networks

IF 7.9 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Amir Javadpour;Forough Ja'fari;Tarik Taleb;Chafika Benzaïd;Pedro R. Tomas;Luis Rosa;Jorge Proença;Luis Cordeiro
{"title":"A Reinforcement Learning Approach to Virtual Network Embedding Problems in 5G Networks","authors":"Amir Javadpour;Forough Ja'fari;Tarik Taleb;Chafika Benzaïd;Pedro R. Tomas;Luis Rosa;Jorge Proença;Luis Cordeiro","doi":"10.1109/TNSE.2026.3675357","DOIUrl":null,"url":null,"abstract":"5G network slicing is the problem of mapping requested virtual networks on the substrate network resources. Due to resource capacity constraints, the performance of network slicing depends on the number of supported requests.This challenge is a type of Virtual Network Embedding (VNE) problem in which a weighted graph is divided into multiple smaller weighted graphs according to the user's custom requirements.These problems are NP-hard, and most existing solutions have suggested using Reinforcement Learning (RL) models to solve them. However, they do not adequately represent the weighted graph to the learning model. Therefore, their learning rate is limited. This paper proposes TRL-VNE, a Two-stage RL-based VNE solution to overcome these challenges. In the first stage of this solution, an RL model is utilized for mapping the central node of each request. Novel graph-based features (G-features) are used in this model to improve its learning rate. The second stage uses a greedy algorithm to map the other components. The simulation results show that TRL-VNE improves the requests acceptance ratio and maximum supported requests by 21% and 36%, respectively, compared to existing solutions. Moreover, we have proposed a network architecture based on TRL-VNE, and emulated it in Mininet to investigate the feasibility of the proposed solution.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"13 ","pages":"8200-8223"},"PeriodicalIF":7.9000,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11442735/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/3/18 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

5G network slicing is the problem of mapping requested virtual networks on the substrate network resources. Due to resource capacity constraints, the performance of network slicing depends on the number of supported requests.This challenge is a type of Virtual Network Embedding (VNE) problem in which a weighted graph is divided into multiple smaller weighted graphs according to the user's custom requirements.These problems are NP-hard, and most existing solutions have suggested using Reinforcement Learning (RL) models to solve them. However, they do not adequately represent the weighted graph to the learning model. Therefore, their learning rate is limited. This paper proposes TRL-VNE, a Two-stage RL-based VNE solution to overcome these challenges. In the first stage of this solution, an RL model is utilized for mapping the central node of each request. Novel graph-based features (G-features) are used in this model to improve its learning rate. The second stage uses a greedy algorithm to map the other components. The simulation results show that TRL-VNE improves the requests acceptance ratio and maximum supported requests by 21% and 36%, respectively, compared to existing solutions. Moreover, we have proposed a network architecture based on TRL-VNE, and emulated it in Mininet to investigate the feasibility of the proposed solution.
5G网络虚拟网络嵌入问题的强化学习方法
5G网络切片是将请求的虚拟网络映射到基板网络资源上的问题。由于资源容量的限制,网络切片的性能取决于支持的请求数量。该挑战是一种虚拟网络嵌入(VNE)问题,其中一个加权图根据用户的自定义需求被划分为多个较小的加权图。这些问题是np困难的,大多数现有的解决方案都建议使用强化学习(RL)模型来解决这些问题。然而,它们不能充分地将加权图表示为学习模型。因此,他们的学习率是有限的。本文提出了TRL-VNE,一种基于两阶段rl的VNE解决方案来克服这些挑战。在该解决方案的第一阶段,RL模型用于映射每个请求的中心节点。该模型采用了新的基于图的特征(G-features)来提高其学习率。第二阶段使用贪婪算法来映射其他组件。仿真结果表明,与现有方案相比,TRL-VNE方案的请求接受率和最大支持请求分别提高了21%和36%。此外,我们还提出了一种基于TRL-VNE的网络架构,并在Mininet中进行了仿真,以验证所提出解决方案的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书