Reducing Search Complexity of Coded Caching by Shrinking Search Space
Hankun Cao, Qifa Yan, Xiaohu Tang · IEEE Communications Letters · 2019
Coded caching is a new technique to reduce the communication load by utilizing local memories. In this letter, we propose an improved decentralized coded caching delivery algorithm to reduce the search complexity with limited performance loss. Besides, the problem of shrinking the search space is formulated as an optimization problem, and we relax this problem into an efficient computable one. Consequently, the proposed scheme can be applied to various network topologies efficiently.