Adaptive Delivery in Caching Networks

摘要

The problem of content delivery in caching networks is investigated for the scenarios where multiple users request identical files. An adaptive method is proposed for the delivery of redundant demands in caching networks. Based on the redundancy pattern in the current demand vector, the proposed method decides between the transmission of uncoded messages or the coded messages of Maddah-Ali and Niesen for delivery. Moreover, a lower bound on the delivery rate of redundant requests is derived. The performance of the adaptive method is investigated through numerical examples and Monte Carlo simulations. It is shown that the adaptive method considerably reduces the performance gap to the lower bound for the specific ranges of network parameters.