.png){kind=icon}
返回
Network Coding For Data Delivery in Caching at Edge: Concept, Model, and Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2019.2933667.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To deal with the explosive traffic demand, caching at the edge of mobile networks has been proposed to improve the quality of user experience. Presently, the edge caching systems are based on the direct and simple relay transmission, which is hard to achieve high system throughput and good content service. In such situations, network coding can effectively solve these problems. One problem arises in the application of network coding: how to form X topology network. We formulate the X topology formation problem as a function of system throughput and content service satisfaction degree. Then we propose a coalition game theory based algorithm to solve this NP-hard problem and prove the Nash stability of our coalition formation game. We evaluate our proposed algorithm through extensive simulations in different network environments. The experiment results demonstrate that our algorithm achieves nearly optimal performance and significantly outperforms the four widely-accepted baseline algorithms.
Keyword:
Servers
Network coding
Relays
Topology
Network topology
Throughput
Game theory
Caching
edge
network coding
coalition game
D2D
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
.png){kind=icon}
查看更多内容