| 摘要: |
| 随着多媒体数据流量的急剧增长，传统云计算模式难以满足用户对于低延时和高带宽的需求.虽然边缘计算中基站等边缘设备拥有的计算能力以及基站与用户之间的短距离通信能够使用户获得更高的服务质量，但是如何利用边缘节点的收益和成本之间的关系设计边缘缓存策略，仍然是一个具有挑战性的问题.利用5G和协作边缘计算技术，在大量短视频应用场景下，提出了一种协作边缘缓存技术来同时解决以下3个问题：（1）通过减少传输延时，提高了用户的服务体验；（2）通过近距离传输，降低了骨干网络的数据传输压力；（3）分布式的工作模式减少了云服务器的工作负载.首先定义了一个协作边缘缓存模型，其中，边缘节点配备有容量有限的存储空间，移动用户可以接入这些边缘节点，一个边缘节点可以服务多个用户；其次，设计了一个非协作博弈模型来研究边缘节点之间的协作行为，每一个边缘节点看成一个玩家并且可以做出缓存初始和缓存重放策略；最后，找到了该博弈的纳什均衡，并设计了一个分布式的算法以达到均衡.实验仿真结果表明，提出的边缘缓存策略能够降低用户20%的延时，并且减少了80%的骨干网络的流量. |
| 关键词: 非协作博弈 纳什均衡 分布式缓存放置 缓存命中率 平均边缘效用 |
| DOI：10.13328/j.cnki.jos.006322 |
| 分类号:TP391 |
| 基金项目:国家自然科学基金（U1709217）；浙江省自然科学基金（LQ20F020010） |
|
| Distributed Edge Caching Scheme Using Non-cooperative Game |
|
GU Hui-Xian1, WANG Hai-Jiang1, WEI Gui-Yi2
|
|
1.School of Information and Electronic Engineering, Zhejiang University of Science and Technology, Hangzhou 310023, China;2.School of Computer and Information Engineering, Zhejiang Gongshang University, Hangzhou 310018, China
|
| Abstract: |
| Due to the rapid growth of multimedia data traffic, the traditional cloud computing model has been greatly challenged in satisfying users' demands for low latency and high bandwidth. Therefore, edge computing is becoming an emerging computing paradigm. The computing capacity of edge devices such as base stations and the short distance between users and base stations enable users to obtain higher service quality. It is still a challenging problem to design edge caching strategy based on the relationship between benefits and costs of edge nodes. Using 5G and collaborative edge computing technology, in a large number of short video application scenarios, this study proposes a collaborative edge caching technology to simultaneously solve the following three problems:(1) by reducing the transmission delay, to improve users' service experience; (2) by cutting down transmission latency to reduce the data transmission pressure of the backbone network; (3) through distributed computing to reduce the workload of the cloud servers. First, a collaborative edge caching model is defined where the edge nodes are equipped with limited storage space, mobile users can access to edge nodes, one node can serve multiple users. Second, a non-cooperative game model is designed to study the cooperative behavior between edge nodes. Each edge node is treated as a player and can make cache initialization and cache replacement strategies. Thirdly, the Nash equilibrium of the game is found, and then a distributed algorithm is designed to reach the equilibrium. Finally, the simulation results show that the proposed edge caching strategy can reduce the latency of users by 20% and reduce the traffic of backbone network by 80%. |
| Key words: non-cooperative game theory Nash equilibrium distributed cache placement cache hit rate average edge utility |
