当前位置: X-MOL 学术Wireless Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
ProRec: a unified content caching and replacement framework for mobile edge computing
Wireless Networks ( IF 3 ) Pub Date : 2020-01-08 , DOI: 10.1007/s11276-020-02248-9
Peiyan Yuan , Yunyun Cai , Yihang Liu , Junna Zhang , Yali Wang , Xiaoyan Zhao

In this paper, we investigate the content deployment problem from precaching and device-to-device communication perspectives. In the precaching stage, contents are prefetched and stored in edge nodes to be quickly provided to end users. In the device-to-device communication process, intermediate nodes face a dilemma in deciding whether to cache contents coming from or going to neighboring nodes to accelerate the content delivery. We call the former proactive caching and the latter reactive caching. We then design ProRec, a unified caching framework, by jointly considering the two cases with the goal of maximizing the content hit ratio. ProRec first addresses the optimization problem using the method of Lagrangian multipliers and obtains a general solution to the optimal content copies. Second, a greedy solution, proven to achieve the optimum with a probability of at least \(1-1/e\), is used to cache and replace contents. Finally, an edge computing simulation platform that includes real and synthetic traces is built as a case study to verify the effectiveness of ProRec. The numerical results show that it simultaneously improves the cache hit ratio and content delivery delay.

中文翻译:

ProRec:用于移动边缘计算的统一内容缓存和替换框架

在本文中,我们从预缓存和设备到设备的通信角度研究了内容部署问题。在预缓存阶段,内容被预取并存储在边缘节点中,以快速提供给最终用户。在设备到设备的通信过程中,中间节点在决定是否缓存来自或去往相邻节点的内容以加速内容传递方面面临难题。我们将前者称为主动缓存,将后者称为被动缓存。然后,我们通过共同考虑这两种情况来设计ProRec(一个统一的缓存框架),以最大程度地提高内容命中率。ProRec首先使用拉格朗日乘子的方法解决优化问题,并获得最佳内容副本的一般解决方案。其次,贪婪的解决方案\(1-1 / e \),用于缓存和替换内容。最后,构建了一个包含真实轨迹和合成轨迹的边缘计算仿真平台,以验证ProRec的有效性。数值结果表明,它可以同时提高缓存命中率和内容交付延迟。
更新日期:2020-01-08
down
wechat
bug