5G Service Function Chain Provisioning: A Deep Reinforcement Learning-Based Framework

IF 5.4 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Network and Service Management Pub Date : 2024-08-05 DOI:10.1109/TNSM.2024.3438438
Thinh Duy Tran;Brigitte Jaumard;Quang Huy Duong;Kim-Khoa Nguyen
{"title":"5G Service Function Chain Provisioning: A Deep Reinforcement Learning-Based Framework","authors":"Thinh Duy Tran;Brigitte Jaumard;Quang Huy Duong;Kim-Khoa Nguyen","doi":"10.1109/TNSM.2024.3438438","DOIUrl":null,"url":null,"abstract":"We study the dynamic joint service function chain (SFC) embedding problem in a network function virtualization (NFV)-enabled edge cloud network. Our design goal is to optimize the network throughput by maximizing the average number of SFCs successfully embedded into the network, i.e., the Grade of Service (GoS), while guaranteeing their individual stringent end-to-end delay and resource constraints over a time horizon. To this end, we proposed a deep reinforcement learning (DRL)-based framework for jointly performing VNF embedding and routing tasks for the arrival SFCs in the considered NFV-enabled network. We implemented two versions of the proposed framework, one with the Deep Q-learning (DQL) method and one with the Advantage Actor-Critic (A2C) as the core algorithms, respectively. Moreover, for training these DRL algorithms and demonstrating the performance of the proposed framework, we implement a network environment based on the real-world network topology and a service request generator for generating SFCs traffic. Numerical results show that the DQL and A2C versions of the proposed framework achieve over 95% of the average GoS and over 95% of the network throughput ratio compared to the upper bound. This performance level is comparable to that of the near-optimal optimization-based approach while having ten times shorter execution times.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6614-6629"},"PeriodicalIF":5.4000,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10623413/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

We study the dynamic joint service function chain (SFC) embedding problem in a network function virtualization (NFV)-enabled edge cloud network. Our design goal is to optimize the network throughput by maximizing the average number of SFCs successfully embedded into the network, i.e., the Grade of Service (GoS), while guaranteeing their individual stringent end-to-end delay and resource constraints over a time horizon. To this end, we proposed a deep reinforcement learning (DRL)-based framework for jointly performing VNF embedding and routing tasks for the arrival SFCs in the considered NFV-enabled network. We implemented two versions of the proposed framework, one with the Deep Q-learning (DQL) method and one with the Advantage Actor-Critic (A2C) as the core algorithms, respectively. Moreover, for training these DRL algorithms and demonstrating the performance of the proposed framework, we implement a network environment based on the real-world network topology and a service request generator for generating SFCs traffic. Numerical results show that the DQL and A2C versions of the proposed framework achieve over 95% of the average GoS and over 95% of the network throughput ratio compared to the upper bound. This performance level is comparable to that of the near-optimal optimization-based approach while having ten times shorter execution times.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
5G 服务功能链供应:基于深度强化学习的框架
研究了支持网络功能虚拟化(NFV)的边缘云网络中动态联合业务功能链(SFC)嵌入问题。我们的设计目标是通过最大化成功嵌入网络的sfc的平均数量(即服务等级(go))来优化网络吞吐量,同时在一定时间范围内保证它们各自严格的端到端延迟和资源约束。为此,我们提出了一个基于深度强化学习(DRL)的框架,用于在考虑的nfv支持的网络中为到达的sfc联合执行VNF嵌入和路由任务。我们实现了两个版本的框架,一个采用深度q -学习(DQL)方法,另一个采用优势行动者-评论家(A2C)作为核心算法。此外,为了训练这些DRL算法并演示所提出框架的性能,我们实现了一个基于真实网络拓扑的网络环境和一个用于生成sfc流量的服务请求生成器。数值结果表明,与上界相比,DQL和A2C版本的框架实现了95%以上的平均go和95%以上的网络吞吐率。此性能级别与基于优化的接近最优方法相当,但执行时间缩短了10倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
期刊最新文献
Entity-Level Autoregressive Relational Triple Extraction Toward Knowledge Graph Construction for Network Operation and Maintenance BiTrustChain: A Dual-Blockchain Empowered Dynamic Vehicle Trust Management for Malicious Detection in IoV A UAV-Aided Digital Twin Framework for IoT Networks With High Accuracy and Synchronization AI-Empowered Multivariate Probabilistic Forecasting: A Key Enabler for Sustainability in Open RAN Privacy-Preserving and Collusion-Resistant Data Query Scheme for Vehicular Platoons
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1