计算机科学
基站
Lyapunov优化
计算机网络
聚类分析
最优化问题
GSM演进的增强数据速率
数学优化
分布式计算
用户设备
算法
Lyapunov重新设计
人工智能
李雅普诺夫指数
数学
机器学习
电信
混乱的
作者
Langtian Qin,Hancheng Lu,Yao Lu,Chenwu Zhang,Feng Wu
标识
DOI:10.1109/tmc.2023.3323161
摘要
Edge service caching can effectively reduce the delay or bandwidth overhead for acquiring and initializing applications. To address single-base station (BS) transmission limitation and serious edge effect in traditional cellular-based edge service caching networks, in this paper, we proposed a novel user-centric edge service caching framework where each user is jointly provided with edge caching and wireless transmission services by a specific BS cluster instead of a single BS. To minimize the long-term average delay under the constraint of the caching cost, a mixed integer non-linear programming (MINLP) problem is formulated by jointly optimizing the BS clustering and service caching decisions. To tackle the problem, we propose JO-CDSD, an efficiently joint optimization algorithm based on Lyapunov optimization and generalized benders decomposition (GBD). In particular, the long-term optimization problem can be transformed into a primal problem and a master problem in each time slot that is much simpler to solve. The near-optimal clustering and caching strategy can be obtained through solving the primal and master problem alternately. Extensive simulations show that the proposed joint optimization algorithm outperforms other algorithms and can effectively reduce the long-term delay and caching cost.
科研通智能强力驱动
Strongly Powered by AbleSci AI