Order-Optimal Decentralized Coded Caching Schemes with Good Performance in Finite File Size Regime | IEEE Conference Publication | IEEE Xplore

Order-Optimal Decentralized Coded Caching Schemes with Good Performance in Finite File Size Regime


Abstract:

Recently, a new class of decentralized random coded caching schemes have received increasing interest, as they can achieve order-optimal memory-load tradeoff through dece...Show More

Abstract:

Recently, a new class of decentralized random coded caching schemes have received increasing interest, as they can achieve order-optimal memory-load tradeoff through decentralized content placement when the file size goes to infinity. However, most of these existing decentralized schemes may not provide enough coded- multicasting opportunities in the practical operating regime where the file size is limited. In this paper, we focus on the finite file size regime and propose a decentralized random coded caching scheme and a partially decentralized sequential coded caching scheme. These two schemes have different requirements on coordination in the content placement phase and can be applied to different scenarios. The content placement of the proposed schemes aims at ensuring abundant coded-multicasting opportunities in the content delivery phase when the file size is finite. We analyze the worst-case (over all possible requests) loads of our schemes and show that the sequential coded caching scheme outperforms the random coded caching scheme in the finite file size regime. Analytical results indicate that, when the file size grows to infinity, the proposed schemes achieve the same memory- load tradeoff as Maddah-Ali-Niesen's decentralized scheme, and hence are also order optimal. Numerical results show that the two proposed schemes outperform Maddah-Ali-Niesen's decentralized scheme when the file size is not very large.
Date of Conference: 04-08 December 2016
Date Added to IEEE Xplore: 06 February 2017
ISBN Information:
Conference Location: Washington, DC, USA

I. Introduction

The rapid proliferation of smart mobile devices has triggered an unprecedented growth of the global mobile data traffic. Recently, to support the dramatic growth of wireless data traffic, caching and multicasting have been proposed as two promising approaches for massive content delivery in wireless networks. By proactively placing content closer to or even at end-users during the off-peak hours, network congestion during the peak hours can be greatly reduced. In addition, leveraging the broadcast nature of the wireless medium by multicast transmission, popular content can be delivered to multiple requesters simultaneously.

Contact IEEE to Subscribe

References

References is not available for this document.