论文标题

计算和网络收敛编排中的强化学习

Reinforcement Learning in Computing and Network Convergence Orchestration

论文作者

Yang, Aidong, Wu, Mohan, Cheng, Boquan, Ye, Xiaozhou, Ouyang, Ye

论文摘要

随着计算能力已成为数字经济时代的核心生产力,计算和网络收敛的概念(CNC),根据该概念,可以根据用户的需求动态安排和分配网络和计算资源,并引起广泛关注。基于任务的属性,网络编排平面需要灵活地部署任务以适当计算节点并将路径安排到计算节点。这是一个涉及资源调度和路径布置的编排问题。由于CNC相对较新,因此在本文中,我们回顾了有关CNC的一些研究和应用。然后,我们使用强化学习(RL)设计了CNC编排方法,这是第一次尝试,可以灵活地分配和安排计算资源和网络资源。旨在高利润和低潜伏期。同时,我们使用多因素来确定优化目标,以便根据来自不同方面的总绩效(例如成本,利润,潜伏期和系统过载)在我们的实验中优化了编排策略。实验表明,与贪婪的方法,随机选择和平衡资源方法相比,所提出的基于RL的方法可以实现更高的利润和更低的潜伏度。我们证明RL适合CNC编排。本文启发了RL在CNC编排上的应用程序。

As computing power is becoming the core productivity of the digital economy era, the concept of Computing and Network Convergence (CNC), under which network and computing resources can be dynamically scheduled and allocated according to users' needs, has been proposed and attracted wide attention. Based on the tasks' properties, the network orchestration plane needs to flexibly deploy tasks to appropriate computing nodes and arrange paths to the computing nodes. This is a orchestration problem that involves resource scheduling and path arrangement. Since CNC is relatively new, in this paper, we review some researches and applications on CNC. Then, we design a CNC orchestration method using reinforcement learning (RL), which is the first attempt, that can flexibly allocate and schedule computing resources and network resources. Which aims at high profit and low latency. Meanwhile, we use multi-factors to determine the optimization objective so that the orchestration strategy is optimized in terms of total performance from different aspects, such as cost, profit, latency and system overload in our experiment. The experiments shows that the proposed RL-based method can achieve higher profit and lower latency than the greedy method, random selection and balanced-resource method. We demonstrate RL is suitable for CNC orchestration. This paper enlightens the RL application on CNC orchestration.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源