arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.00901cs.ITcs.GTmath.IT
收藏

用于多接入边缘计算中用户关联与能量优化的破产理论

Ruin Theory for User Association and Energy Optimization in Multi-access Edge Computing

Do Hyeon Kim, Aunas Manzoor, Madyan Alsenwi, Yan Kyaw Tun, Walid Saad, Choong Seon Hong

AI总结:

针对多接入边缘计算的数据卸载问题,提出结合破产理论的两阶段用户关联与任务卸载优化框架,在保证可靠性和关联效率的同时最小化用户总能耗。

摘要:

在本通信中,提出了一个用于分析多接入边缘计算系统中数据卸载的新颖框架。具体而言,提出了一种两阶段算法,包括两个关键阶段:1)用户关联阶段和2)任务卸载阶段。在第一阶段,开发了一种基于破产理论的方法,以在考虑用户传输可靠性和资源利用效率的情况下获得用户关联。同时,在第二阶段,使用一种基于优化的算法来优化数据卸载过程。特别地,破产理论用于管理用户关联阶段,并考虑基于破产概率的偏好配置文件来控制提议用户的优先级。这里,破产概率由每个边缘节点在每个时隙的剩余缓冲区空间推导得出。在给定关联结果的情况下,构建了一个优化问题以优化卸载数据量,旨在最小化用户的能耗。仿真结果表明,所开发的解决方案在可容忍的剩余缓冲区大小值下保证了系统可靠性和关联效率,并最小化了所有用户的总能耗。

英文摘要:

In this correspondence, a novel framework is proposed for analyzing data offloading in a multi-access edge computing system. Specifically, a two-phase algorithm, is proposed, including two key phases: 1) user association phase and 2) task offloading phase. In the first phase, a ruin theory-based approach is developed to obtain the users association considering the users' transmission reliability and resource utilization efficiency. Meanwhile, in the second phase, an optimization-based algorithm is used to optimize the data offloading process. In particular, ruin theory is used to manage the user association phase, and a ruin probability-based preference profile is considered to control the priority of proposing users. Here, ruin probability is derived by the surplus buffer space of each edge node at each time slot. Giving the association results, an optimization problem is formulated to optimize the amount of offloaded data aiming at minimizing the energy consumption of users. Simulation results show that the developed solutions guarantee system reliability, association efficiency under a tolerable value of surplus buffer size, and minimize the total energy consumption of all users.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑