论文标题
开放无线电访问网络中主动和动态计算资源分配的进化优化
Evolutionary Optimization for Proactive and Dynamic Computing Resource Allocation in Open Radio Access Network
论文作者
论文摘要
敦促智能技术在开放无线电访问网络(O-RAN)中实现计算资源的自动分配,以节省计算资源,提高其利用率并减少延迟。但是,解决此资源分配问题的现有问题制定是不合适的,因为它以不适当的方式定义了资源的容量效用,并且倾向于造成很大的延迟。此外,现有的问题仅是根据贪婪的搜索来解决的,这并不理想,因为它可能会陷入本地Optima。考虑到这些,提出了一种更好地描述问题的新表述。此外,作为一种众所周知的全球搜索元启发式方法,设计了用于解决新问题制定的进化算法(EA),以找到一种资源分配方案,以主动并动态部署计算资源来处理即将到来的流量数据。对几个现实世界数据集和新生成的人工数据集进行的实验研究具有更多的属性,这些属性超出了现实世界的数据集,证明了在不同的参数设置下,与基线贪婪算法相比具有显着优势。此外,进行了实验研究以比较拟议的EA和两个变体,以指示不同算法选择的影响。
Intelligent techniques are urged to achieve automatic allocation of the computing resource in Open Radio Access Network (O-RAN), to save computing resource, increase utilization rate of them and decrease the delay. However, the existing problem formulation to solve this resource allocation problem is unsuitable as it defines the capacity utility of resource in an inappropriate way and tends to cause much delay. Moreover, the existing problem has only been attempted to be solved based on greedy search, which is not ideal as it could get stuck into local optima. Considering those, a new formulation that better describes the problem is proposed. In addition, as a well-known global search meta heuristic approach, an evolutionary algorithm (EA) is designed tailored for solving the new problem formulation, to find a resource allocation scheme to proactively and dynamically deploy the computing resource for processing upcoming traffic data. Experimental studies carried out on several real-world datasets and newly generated artificial datasets with more properties beyond the real-world datasets have demonstrated the significant superiority over a baseline greedy algorithm under different parameter settings. Moreover, experimental studies are taken to compare the proposed EA and two variants, to indicate the impact of different algorithm choices.