异构集成网络中基于多角色-注意力-批判联合竞价的网络切片资源分配优化

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Geng Chen;Xu Zhang;Shuhu Qi;Qingtian Zeng;Yu-Dong Zhang
{"title":"异构集成网络中基于多角色-注意力-批判联合竞价的网络切片资源分配优化","authors":"Geng Chen;Xu Zhang;Shuhu Qi;Qingtian Zeng;Yu-Dong Zhang","doi":"10.1109/JSYST.2024.3397829","DOIUrl":null,"url":null,"abstract":"The demand for various types of services is growing rapidly with the development of beyond 5G/6G networks, network slicing (NS) is considered as an effective technology to cope with the multiple services and large traffic demand. In this article, a NS resource allocation optimization algorithm based on multiactor-attention-critic (MAAC) joint with bidding is proposed to guarantee the service satisfaction rate (SSR) while increasing the profit of mobile virtual network operator (MVNO) in heterogeneous integrated networks. First, a pricing and bidding strategies are designed for users with different service requirements and service indexes, and the resource allocation is modeled to maximize the sum of utility of all MVNO subjected to MVNO's pricing and bandwidth constraints accordingly. Second, the optimization problem is analyzed based on the augment Lagrange method, relaxed and has been proved as a convex optimization, and then, the alternating direction multiplier method is adopted to obtain the theoretical upper bound with 32.047 of the network utility. Meanwhile, the gradient descent method with different learning rates is used to accelerate the convergence rate. Third, the MAAC-based algorithm is proposed and the resource allocation procedures are transformed into a partially observable Markov decision process, in which the interactions with multiagent environment are performed accurately. Finally, the simulation results indicate that the network utility of the proposed algorithm can be improved by 25.074% while ensuring the users' SSR. Compared with multiagent deep determination strategy gradient and dueling deep Q network, the network utility by the proposed algorithm can be improved by 6.265% and 39.791%, respectively, up to 27.664, which can be closest to the theoretical upper bound at the greatest extent.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"1186-1197"},"PeriodicalIF":4.0000,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Network Slicing Resource Allocation Optimization Based on Multiactor-Attention-Critic Joint With Bidding in Heterogeneous Integrated Network\",\"authors\":\"Geng Chen;Xu Zhang;Shuhu Qi;Qingtian Zeng;Yu-Dong Zhang\",\"doi\":\"10.1109/JSYST.2024.3397829\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The demand for various types of services is growing rapidly with the development of beyond 5G/6G networks, network slicing (NS) is considered as an effective technology to cope with the multiple services and large traffic demand. In this article, a NS resource allocation optimization algorithm based on multiactor-attention-critic (MAAC) joint with bidding is proposed to guarantee the service satisfaction rate (SSR) while increasing the profit of mobile virtual network operator (MVNO) in heterogeneous integrated networks. First, a pricing and bidding strategies are designed for users with different service requirements and service indexes, and the resource allocation is modeled to maximize the sum of utility of all MVNO subjected to MVNO's pricing and bandwidth constraints accordingly. Second, the optimization problem is analyzed based on the augment Lagrange method, relaxed and has been proved as a convex optimization, and then, the alternating direction multiplier method is adopted to obtain the theoretical upper bound with 32.047 of the network utility. Meanwhile, the gradient descent method with different learning rates is used to accelerate the convergence rate. Third, the MAAC-based algorithm is proposed and the resource allocation procedures are transformed into a partially observable Markov decision process, in which the interactions with multiagent environment are performed accurately. Finally, the simulation results indicate that the network utility of the proposed algorithm can be improved by 25.074% while ensuring the users' SSR. Compared with multiagent deep determination strategy gradient and dueling deep Q network, the network utility by the proposed algorithm can be improved by 6.265% and 39.791%, respectively, up to 27.664, which can be closest to the theoretical upper bound at the greatest extent.\",\"PeriodicalId\":55017,\"journal\":{\"name\":\"IEEE Systems Journal\",\"volume\":\"18 2\",\"pages\":\"1186-1197\"},\"PeriodicalIF\":4.0000,\"publicationDate\":\"2024-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Systems Journal\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10534879/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Systems Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10534879/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

随着超 5G/6G 网络的发展,各类业务的需求迅速增长,网络切片(NS)被认为是应对多业务、大流量需求的有效技术。本文提出了一种基于多扇区注意力评判器(MAAC)与竞价相结合的网络切片资源分配优化算法,以保证服务满意率(SSR),同时提高异构综合网络中移动虚拟网络运营商(MVNO)的利润。首先,针对不同服务需求和服务指标的用户设计了定价和竞价策略,并建立了资源分配模型,以最大化所有 MVNO 的效用总和,同时相应地限制了 MVNO 的定价和带宽。其次,基于增强拉格朗日法对优化问题进行分析,将其放松并证明为凸优化,然后采用交替方向乘法得到网络效用 32.047 的理论上限。同时,采用不同学习率的梯度下降法加快收敛速度。第三,提出了基于 MAAC 的算法,并将资源分配过程转化为部分可观测的马尔可夫决策过程,在此过程中可以准确地执行与多代理环境的交互。最后,仿真结果表明,在保证用户 SSR 的前提下,所提算法的网络效用可提高 25.074%。与多代理深度判定策略梯度和决斗深度 Q 网络相比,所提算法的网络效用分别提高了 6.265% 和 39.791%,最高可达 27.664,可以最大程度地接近理论上限。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Network Slicing Resource Allocation Optimization Based on Multiactor-Attention-Critic Joint With Bidding in Heterogeneous Integrated Network
The demand for various types of services is growing rapidly with the development of beyond 5G/6G networks, network slicing (NS) is considered as an effective technology to cope with the multiple services and large traffic demand. In this article, a NS resource allocation optimization algorithm based on multiactor-attention-critic (MAAC) joint with bidding is proposed to guarantee the service satisfaction rate (SSR) while increasing the profit of mobile virtual network operator (MVNO) in heterogeneous integrated networks. First, a pricing and bidding strategies are designed for users with different service requirements and service indexes, and the resource allocation is modeled to maximize the sum of utility of all MVNO subjected to MVNO's pricing and bandwidth constraints accordingly. Second, the optimization problem is analyzed based on the augment Lagrange method, relaxed and has been proved as a convex optimization, and then, the alternating direction multiplier method is adopted to obtain the theoretical upper bound with 32.047 of the network utility. Meanwhile, the gradient descent method with different learning rates is used to accelerate the convergence rate. Third, the MAAC-based algorithm is proposed and the resource allocation procedures are transformed into a partially observable Markov decision process, in which the interactions with multiagent environment are performed accurately. Finally, the simulation results indicate that the network utility of the proposed algorithm can be improved by 25.074% while ensuring the users' SSR. Compared with multiagent deep determination strategy gradient and dueling deep Q network, the network utility by the proposed algorithm can be improved by 6.265% and 39.791%, respectively, up to 27.664, which can be closest to the theoretical upper bound at the greatest extent.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Systems Journal
IEEE Systems Journal 工程技术-电信学
CiteScore
9.80
自引率
6.80%
发文量
572
审稿时长
4.9 months
期刊介绍: This publication provides a systems-level, focused forum for application-oriented manuscripts that address complex systems and system-of-systems of national and global significance. It intends to encourage and facilitate cooperation and interaction among IEEE Societies with systems-level and systems engineering interest, and to attract non-IEEE contributors and readers from around the globe. Our IEEE Systems Council job is to address issues in new ways that are not solvable in the domains of the existing IEEE or other societies or global organizations. These problems do not fit within traditional hierarchical boundaries. For example, disaster response such as that triggered by Hurricane Katrina, tsunamis, or current volcanic eruptions is not solvable by pure engineering solutions. We need to think about changing and enlarging the paradigm to include systems issues.
×
引用
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学术官方微信