arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.04594cs.LGstat.ML
收藏

基于离散归一化优势函数的深度强化学习在网络切片资源管理中的应用

Deep Reinforcement Learning with Discrete Normalized Advantage Functions for Resource Management in Network Slicing

Zhejiang University(浙江大学)

Chen Qi, Yuxiu Hua, Rongpeng Li, Zhifeng Zhao, Honggang Zhang

摘要:

网络切片承诺在一个基础设施中提供具有不同需求的多样化服务。深度强化学习(例如,深度$\mathcal{Q}$学习,DQL)被假定为通过将变化的需求和分配的带宽分别视为环境状态和动作来解决网络切片中的需求感知切片间资源管理问题的适当算法。然而,以更精细的分辨率分配带宽通常意味着更大的动作空间,不幸的是,DQL在这种情况下无法快速收敛。在DQL中引入离散归一化优势函数(DNAF),将$\mathcal{Q}$ -价值函数分离为状态-价值函数项和优势项,并利用确定性策略梯度下降(DPGD)算法避免了对每个状态-动作对进行不必要的$\mathcal{Q}$ -值计算。此外,由于DPGD只工作在连续的动作空间中,我们嵌入了一个k-最近邻算法到DQL中,以快速找到一个有效的动作在离散空间中最接近DPGD输出。最后,我们通过大量的模拟验证了基于DNAF的DQL的更快收敛。

英文摘要:

Network slicing promises to provision diversified services with distinct requirements in one infrastructure. Deep reinforcement learning (e.g., deep $\mathcal{Q}$-learning, DQL) is assumed to be an appropriate algorithm to solve the demand-aware inter-slice resource management issue in network slicing by regarding the varying demands and the allocated bandwidth as the environment state and the action, respectively. However, allocating bandwidth in a finer resolution usually implies larger action space, and unfortunately DQL fails to quickly converge in this case. In this paper, we introduce discrete normalized advantage functions (DNAF) into DQL, by separating the $\mathcal{Q}$-value function as a state-value function term and an advantage term and exploiting a deterministic policy gradient descent (DPGD) algorithm to avoid the unnecessary calculation of $\mathcal{Q}$-value for every state-action pair. Furthermore, as DPGD only works in continuous action space, we embed a k-nearest neighbor algorithm into DQL to quickly find a valid action in the discrete space nearest to the DPGD output. Finally, we verify the faster convergence of the DNAF-based DQL through extensive simulations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑