Augmented Lagrangian-Based Reinforcement Learning for Network Slicing in IIoT

Network slicing enables the multiplexing of independent logical networks on the same physical network infrastructure to provide different network services for different applications. The resource allocation problem involved in network slicing is typically a decision-making problem, falling within th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronics (Basel) Ročník 11; číslo 20; s. 3385
Hlavní autoři: Qi, Qi, Lin, Wenbin, Guo, Boyang, Chen, Jinshan, Deng, Chaoping, Lin, Guodong, Sun, Xin, Chen, Youjia
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.10.2022
Témata:
Algorithms
Bandwidths
Computer networks
Constraints
Decision making
Factories
Genetic algorithms
Information networks
Lagrange multiplier
Learning
Methods
Mixed integer
Multiplexing
Network slicing
Neural networks
Nonlinear programming
Optimization
Problem solving
Reinforcement learning (Machine learning)
Resource allocation
Wireless networks
China
ISSN:2079-9292, 2079-9292
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Network slicing enables the multiplexing of independent logical networks on the same physical network infrastructure to provide different network services for different applications. The resource allocation problem involved in network slicing is typically a decision-making problem, falling within the scope of reinforcement learning. The advantage of adapting to dynamic wireless environments makes reinforcement learning a good candidate for problem solving. In this paper, to tackle the constrained mixed integer nonlinear programming problem in network slicing, we propose an augmented Lagrangian-based soft actor–critic (AL-SAC) algorithm. In this algorithm, a hierarchical action selection network is designed to handle the hybrid action space. More importantly, inspired by the augmented Lagrangian method, both neural networks for Lagrange multipliers and a penalty item are introduced to deal with the constraints. Experiment results show that the proposed AL-SAC algorithm can strictly satisfy the constraints, and achieve better performance than other benchmark algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2079-9292
2079-9292
DOI:10.3390/electronics11203385