Fundamental Limits of Caching: Improved Bounds For Small Buffer Users

In this work, the peak rate of the caching problem is investigated, under the scenario that the users are with small buffer sizes and the number of users is no less than the amount of files in the server. A novel coded caching strategy is proposed for such a scenario, leading to a lower peak rate compared to recent results in the literature. Furthermore, it is verified that our peak rates coincides with the cut-set bound analytically in an information-theoretic view.

[1]  Kevin C. Almeroth,et al.  The Use of Multicast Delivery to Provide a Scalable and Interactive Video-on-Demand Service , 1996, IEEE J. Sel. Areas Commun..

[2]  Chaitanya Swamy,et al.  Approximation Algorithms for Data Placement Problems , 2008, SIAM J. Comput..

[3]  Asit Dan,et al.  Dynamic batching policies for an on-demand video server , 1996, Multimedia Systems.

[4]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.

[5]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[6]  Urs Niesen,et al.  Decentralized Caching Attains Order-Optimal Memory-Rate Tradeoff , 2013, ArXiv.

[7]  Sem C. Borst,et al.  Distributed Caching Algorithms for Content Distribution Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[8]  Kamesh Munagala,et al.  Web caching using access statistics , 2001, SODA '01.

[9]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[10]  Giuseppe Caire,et al.  Fundamental limits of distributed caching in D2D wireless networks , 2013, 2013 IEEE Information Theory Workshop (ITW).

[11]  T. Charles Clancy,et al.  Fundamental Limits of Caching With Secure Delivery , 2013, IEEE Transactions on Information Forensics and Security.

[12]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[13]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[14]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

[15]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[16]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.