{"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}
引用次数: 0
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.
期刊介绍:
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.