Sample-Efficient Multi-Agent DQNs for Scalable Multi-Domain 5G+ Inter-Slice Orchestration

Pavlos Doanis;Thrasyvoulos Spyropoulos
{"title":"Sample-Efficient Multi-Agent DQNs for Scalable Multi-Domain 5G+ Inter-Slice Orchestration","authors":"Pavlos Doanis;Thrasyvoulos Spyropoulos","doi":"10.1109/TMLCN.2024.3420268","DOIUrl":null,"url":null,"abstract":"Data-driven network slicing has been recently explored as a major driver for beyond 5G networks. Nevertheless, we are still a long way before such solutions are practically applicable in real problems. Most solutions addressing the problem of dynamically placing virtual network function chains (“slices”) on top of a physical topology still face one or more of the following hurdles: (i) they focus on simple slicing setups (e.g. single domain, single slice, simple VNF chains and performance metrics); (ii) solutions based on modern reinforcement learning theory have to deal with astronomically high action spaces, when considering multi-VNF, multi-domain, multi-slice problems; (iii) the training of the algorithms is not particularly data-efficient, which can hinder their practical application given the scarce(r) availability of cellular network related data (as opposed to standard machine learning problems). To this end, we attempt to tackle all the above shortcomings in one common framework. For (i), we propose a generic, queuing network based model that captures the inter-slice orchestration setting, supporting complex VNF chain topologies and end-to-end performance metrics. For (ii), we explore multi-agent DQN algorithms that can reduce action space complexity by orders of magnitude compared to standard DQN. For (iii), we investigate two mechanisms to store to and select from the experience replay buffer, in order to speed up the training of DQN agents. The proposed scheme was validated to outperform both vanilla DQN (by orders of magnitude faster convergence) and static heuristics (\n<inline-formula> <tex-math>$3\\times $ </tex-math></inline-formula>\n cost improvement).","PeriodicalId":100641,"journal":{"name":"IEEE Transactions on Machine Learning in Communications and Networking","volume":"2 ","pages":"956-977"},"PeriodicalIF":0.0000,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10577096","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Machine Learning in Communications and Networking","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10577096/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Data-driven network slicing has been recently explored as a major driver for beyond 5G networks. Nevertheless, we are still a long way before such solutions are practically applicable in real problems. Most solutions addressing the problem of dynamically placing virtual network function chains (“slices”) on top of a physical topology still face one or more of the following hurdles: (i) they focus on simple slicing setups (e.g. single domain, single slice, simple VNF chains and performance metrics); (ii) solutions based on modern reinforcement learning theory have to deal with astronomically high action spaces, when considering multi-VNF, multi-domain, multi-slice problems; (iii) the training of the algorithms is not particularly data-efficient, which can hinder their practical application given the scarce(r) availability of cellular network related data (as opposed to standard machine learning problems). To this end, we attempt to tackle all the above shortcomings in one common framework. For (i), we propose a generic, queuing network based model that captures the inter-slice orchestration setting, supporting complex VNF chain topologies and end-to-end performance metrics. For (ii), we explore multi-agent DQN algorithms that can reduce action space complexity by orders of magnitude compared to standard DQN. For (iii), we investigate two mechanisms to store to and select from the experience replay buffer, in order to speed up the training of DQN agents. The proposed scheme was validated to outperform both vanilla DQN (by orders of magnitude faster convergence) and static heuristics ( $3\times $ cost improvement).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
面向可扩展多域 5G+ 片间协调的样本高效多代理 DQN
数据驱动的网络切片最近被视为超越 5G 网络的主要驱动力。然而,要将这些解决方案实际应用于现实问题,我们还有很长的路要走。大多数解决在物理拓扑上动态放置虚拟网络功能链("切片")问题的解决方案仍然面临以下一个或多个障碍:(i)它们侧重于简单的切片设置(例如,单域、单切片、简单的网络功能链);(ii)它们缺乏对虚拟网络功能链的分析,因此无法对网络功能链进行分析。单域、单片、简单的 VNF 链和性能指标);(ii) 在考虑多 VNF、多域、多片问题时,基于现代强化学习理论的解决方案必须处理天文数字般的高行动空间;(iii) 算法的训练并不特别具有数据效率,这可能会阻碍其实际应用,因为蜂窝网络相关数据(相对于标准机器学习问题)非常稀缺。为此,我们尝试在一个通用框架内解决上述所有缺点。对于 (i),我们提出了一种基于队列网络的通用模型,该模型可捕捉片间协调设置,支持复杂的 VNF 链拓扑和端到端性能指标。对于 (ii),我们探索了多代理 DQN 算法,与标准 DQN 相比,该算法可将行动空间复杂度降低几个数量级。对于 (iii),我们研究了存储到经验重放缓冲区并从中进行选择的两种机制,以加快 DQN 代理的训练。经过验证,所提出的方案优于普通 DQN(收敛速度快了几个数量级)和静态启发式(成本提高了 3 美元/次)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Asynchronous Real-Time Federated Learning for Anomaly Detection in Microservice Cloud Applications Conditional Denoising Diffusion Probabilistic Models for Data Reconstruction Enhancement in Wireless Communications Multi-Agent Reinforcement Learning With Action Masking for UAV-Enabled Mobile Communications Online Learning for Intelligent Thermal Management of Interference-Coupled and Passively Cooled Base Stations Robust and Lightweight Modeling of IoT Network Behaviors From Raw Traffic Packets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1