In this paper, we propose a novel resource management scheme that jointly allocates the transmission power and computational resources in a centralized radio access network architecture. The network comprises a set of computing nodes to which the requested tasks of different users are offloaded. The optimization problem takes the transmission, execution, and propagation delays of each task into account, with the aim to allocate the transmission power and computational resources such that the user's maximum tolerable latency is satisfied. Since the optimization problem is highly non-convex, we adopt the alternate search method (ASM) to divide it into smaller subproblems. A heuristic algorithm is proposed to jointly manage the allocated computational resources and placement of the tasks derived by ASM. We also propose an admission control mechanism for finding the set of tasks that can be served by the available resources. Furthermore, a disjoint method that separately allocates the transmission power and the computational resources is proposed as the baseline of comparison. The optimal solution of the optimization problem is also derived based on exhaustive search over offloading decisions and utilizing Karush-Kuhn-Tucker optimality conditions. The simulation results show that the joint method outperforms the disjoint task offloading and power allocation. Moreover, simulations show that the performance of the proposed method is almost equal to that of the optimal solution.
翻译:在本文中,我们提出一个新的资源管理方案,在中央无线电接入网络架构中共同分配传输动力和计算资源。网络由一组计算节点组成,将不同用户要求的任务卸载到这些节点中。优化问题还考虑到每个任务的传输、执行和传播延迟,目的是分配传输动力和计算资源,使用户的最大可容忍潜值得到满足。由于优化问题高度非电解密,因此我们采用替代搜索方法(ASM)将其分为较小的子问题。建议采用超速算法,以联合管理分配的计算资源和安排由ASM产生的任务。我们还建议采用一个接收控制机制,以寻找可利用资源完成的一组任务。此外,还提议采用一种分离方法,分别分配传输动力和计算资源,作为比较基线。优化问题的最佳解决办法也是基于彻底搜索,从卸载决定和使用Karush-Kuhn-Tucker最佳性条件。我们提出的超速算算法还提出了一套接收机制,以模拟结果显示联合方法的绩效,以模拟方式取代了拟议的最佳方式。