In this paper, we propose a novel resource management scheme that jointly allocates the transmit 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 minimizes the energy consumption of task offloading while takes the end-to-end latency, i.e., the transmission, execution, and propagation latencies of each task, into account. We aim to allocate the transmit power and computational resources such that the maximum acceptable latency of each task is satisfied. Since the optimization problem is non-convex, we divide it into two sub-problems, one for transmit power allocation and another for task placement and computational resource allocation. Transmit power is allocated via the convex-concave procedure. In addition, a heuristic algorithm is proposed to jointly manage computational resources and task placement. We also propose a feasibility analysis that finds a feasible subset of tasks. Furthermore, a disjoint method that separately allocates the transmit power and the computational resources is proposed as the baseline of comparison. A lower bound on the optimal solution of the optimization problem is also derived based on exhaustive search over task placement decisions and utilizing Karush-Kuhn-Tucker conditions. Simulation results show that the joint method outperforms the disjoint method in terms of acceptance ratio. Simulations also show that the optimality gap of the joint method is less than 5%.
翻译:在本文中,我们提出一个新的资源管理方案,在中央无线电接入网络架构中共同分配传输动力和计算资源。网络由一组计算节点组成,不同用户要求的任务将卸载。优化问题将任务卸载的能量消耗最小化,同时考虑到端到端的延迟时间,即每项任务的传输、执行和传播延迟时间。我们的目标是分配传输动力和计算资源,以便满足每项任务的最大可接受延迟时间。由于优化问题是非convex,我们将其分为两个子问题,一个是传输电力分配问题,另一个是任务安排和计算资源分配问题。最优化的能量分配是通过convex-concable程序分配的。此外,我们提议采用超导算算算算法来联合管理计算资源和任务安排。我们还建议进行可行性研究,找到一个可行的分解任务组。此外,由于优化的传输力和计算资源分配方法不同,我们提议将其分为两个子问题,作为比较的基线。根据最优化的卡通方法,在最优化的排序方法上显示最优化的排序结果,在Sim-K结果上显示最优的排序后,在最优化的排序方法上显示最优的排序后,在最优的排序上,在最优的排序基础上显示最优的排序后,最优的排序后,在最优的排序方法中显示最优选择的方法是最优的排序后,在最优的排序后,即最优的排序后,即最优选择的方法是比比比比比。