Dual time scale network slicing algorithm based on D3QN for B5G multi-service scenarios
To effectively meet the differentiated quality of service (QoS) requirements of different slices, a dual time scale network slicing resource allocation algorithm based on dueling double DQN (D3QN) was proposed for B5G multi-service scenarios.The joint resource slicing and scheduling problem was form...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2022-11-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022207/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539954757337088 |
|---|---|
| author | Geng CHEN Shuhu QI Fei SHEN Qingtian ZENG |
| author_facet | Geng CHEN Shuhu QI Fei SHEN Qingtian ZENG |
| author_sort | Geng CHEN |
| collection | DOAJ |
| description | To effectively meet the differentiated quality of service (QoS) requirements of different slices, a dual time scale network slicing resource allocation algorithm based on dueling double DQN (D3QN) was proposed for B5G multi-service scenarios.The joint resource slicing and scheduling problem was formulated, with the weighted sum of the normalized spectral efficiency (SE) and the QoS of users indices of different slices as the optimization objective.On large time scale, the SDN controller used the D3QN algorithm to pre-allocate resources to different slices based on the resource requirements of each service, and then performed BS-level resource updating based on the load status of BS.On small time scale, the BS scheduled resources to end-users by using the round-robin scheduling algorithm.The simulation results show that the proposed algorithm has excellent performance in ensuring the QoS requirements of slice users, SE and system utility.Compared with the other 4 baseline algorithms, the system utility is improved by 3.22%, 3.81%, 7.48% and 21.14%, respectively. |
| format | Article |
| id | doaj-art-0c81a05008e2423cb5d1f0ea0c19e0e9 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2022-11-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-0c81a05008e2423cb5d1f0ea0c19e0e92025-01-14T06:29:24ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2022-11-014321322459393950Dual time scale network slicing algorithm based on D3QN for B5G multi-service scenariosGeng CHENShuhu QIFei SHENQingtian ZENGTo effectively meet the differentiated quality of service (QoS) requirements of different slices, a dual time scale network slicing resource allocation algorithm based on dueling double DQN (D3QN) was proposed for B5G multi-service scenarios.The joint resource slicing and scheduling problem was formulated, with the weighted sum of the normalized spectral efficiency (SE) and the QoS of users indices of different slices as the optimization objective.On large time scale, the SDN controller used the D3QN algorithm to pre-allocate resources to different slices based on the resource requirements of each service, and then performed BS-level resource updating based on the load status of BS.On small time scale, the BS scheduled resources to end-users by using the round-robin scheduling algorithm.The simulation results show that the proposed algorithm has excellent performance in ensuring the QoS requirements of slice users, SE and system utility.Compared with the other 4 baseline algorithms, the system utility is improved by 3.22%, 3.81%, 7.48% and 21.14%, respectively.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022207/dual time scaleresource allocationnetwork slicingdueling double DQNsystem utility |
| spellingShingle | Geng CHEN Shuhu QI Fei SHEN Qingtian ZENG Dual time scale network slicing algorithm based on D3QN for B5G multi-service scenarios Tongxin xuebao dual time scale resource allocation network slicing dueling double DQN system utility |
| title | Dual time scale network slicing algorithm based on D3QN for B5G multi-service scenarios |
| title_full | Dual time scale network slicing algorithm based on D3QN for B5G multi-service scenarios |
| title_fullStr | Dual time scale network slicing algorithm based on D3QN for B5G multi-service scenarios |
| title_full_unstemmed | Dual time scale network slicing algorithm based on D3QN for B5G multi-service scenarios |
| title_short | Dual time scale network slicing algorithm based on D3QN for B5G multi-service scenarios |
| title_sort | dual time scale network slicing algorithm based on d3qn for b5g multi service scenarios |
| topic | dual time scale resource allocation network slicing dueling double DQN system utility |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022207/ |
| work_keys_str_mv | AT gengchen dualtimescalenetworkslicingalgorithmbasedond3qnforb5gmultiservicescenarios AT shuhuqi dualtimescalenetworkslicingalgorithmbasedond3qnforb5gmultiservicescenarios AT feishen dualtimescalenetworkslicingalgorithmbasedond3qnforb5gmultiservicescenarios AT qingtianzeng dualtimescalenetworkslicingalgorithmbasedond3qnforb5gmultiservicescenarios |