Network Coding For Data Delivery in Caching at Edge: Concept, Model, and Algorithms
Network Coding For Data Delivery in Caching at Edge: Concept, Model, and Algorithms
复制标题
DOI：
10.1109/tvt.2019.2933667
复制
发表时间：
2019-08
影响因子：
6.8
通讯作者：
Dianlei Xu;Amit Samanta;Yong Li;Manzoor Ahmed;Jianbo Li;P. Hui
中科院分区：
文献类型：
--
作者：
Dianlei Xu;Amit Samanta;Yong Li;Manzoor Ahmed;Jianbo Li;P. Hui
为了应对爆炸性的业务需求，已经提出了在移动的网络边缘处的缓存以提高用户体验的质量。目前的边缘缓存系统都是基于直接简单的中继传输，难以实现高的系统吞吐量和良好的内容服务。在这种情况下，网络编码可以有效地解决这些问题。网络编码在实际应用中遇到的一个问题是如何构造“X”拓扑网络。我们制定的“X”拓扑形成问题作为系统吞吐量和内容服务满意度的函数。然后，我们提出了一个基于联盟博弈论的算法来解决这个NP-难问题，并证明了我们的联盟形成游戏的纳什稳定性。我们评估我们提出的算法，通过广泛的模拟在不同的网络环境。实验结果表明，我们的算法达到了接近最佳的性能，显着优于四个广泛接受的基线算法。
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.