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.
翻译:催促智能技术实现开放无线电接入网络(O-RAN)中计算机资源的自动分配,以节省计算资源,提高它们的利用率,并减少拖延;然而,解决这一资源分配问题的现有问题提法并不合适,因为它以不适当的方式界定了资源的能力效用,并往往造成很大的延误;此外,目前的问题只是试图通过贪婪的搜索来解决,因为这种搜索是不理想的,因为它可能会被困在本地的Popima;考虑到这些,提出了一种更能描述问题的新配方。此外,作为一种众所周知的全球搜索元超常方法,还设计了一种进化算法(EA),用于解决新的问题配方,以找到一种资源配置办法,积极主动和动态地部署计算资源,用于处理即将出现的交通数据。对几个真实世界数据集进行的实验研究,以及新产生的人造数据集,其特性超过真实世界数据集的特性,表明在不同参数环境下比基线的贪婪算法具有显著优势。此外,还进行了实验研究,以比较拟议的EA和两个变式,以显示不同的算法的影响。