基于边缘横向协作的在线内容缓存与交付方法

Online Content Caching and Delivery Method Based on Edge Horizontal Collaboration

传统的网络架构无法满足用户对内容缓存的需求,并且在内容交付中存在低延迟要求和高通信成本之间的冲突.为了解决这些问题,在边缘节点横向协作场景下,提出了一种基于Lyapunov优化和分支定界法的在线内容缓存与交付算法,以平衡交付时延与成本、高效的决策内容缓存与内容交付.提出的算法基于Lyapunov优化理论分解连续问题为单时隙在线优化问题,并利用分支定界算法求解.仿真实验表明,提出的算法能在有限的内容交付成本预算下实现较低的平均内容交付时延、较高的内容命中率,并且能够自适应地平衡内容交付时延与交付成本.

Traditional network architectures cannot meet user needs for content caching,and there is a conflict between low latency requirements and high communication costs in content delivery.To address these problems,an online content caching and delivery algorithm based on Lyapunov optimization and branch and bound method is proposed under the scenario of horizontal collaboration between edge nodes to balance delivery delay and cost and to make efficient decisions on content caching and content delivery.The proposed algorithm decomposes the continuous problem into a single slot online optimization problem based on Lyapunov optimization theory,and solves them using branch and bound algorithms.Simulation experiments showed that the proposed algorithm can achieve lower average content delivery delay and higher content hit rate under a limited content delivery cost budget.It can also adaptively balance content delivery delay and delivery cost.