Coded caching for delay-sensitive content

Coded caching is a recently proposed technique that achieves significant performance gains for cache networks compared to uncoded caching schemes. However, this substantial coding gain is attained at the cost of large delivery delay, which is not tolerable in delay-sensitive applications such as video streaming. In this paper, we identify and investigate the tradeoff between the performance gain of coded caching and the delivery delay. We propose a computationally efficient caching algorithm that provides the gains of coding and respects delay constraints. The proposed algorithm achieves the optimum performance for large delay, but still offers major gains for small delay. These gains are demonstrated in a practical setting with a video-streaming prototype.

[1]  Riccardo Zecchina,et al.  Coloring random graphs , 2002, Physical review letters.

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

[3]  G. Grimmett,et al.  On colouring random graphs , 1975 .

[4]  Urs Niesen,et al.  Online Coded Caching , 2013, IEEE/ACM Transactions on Networking.

[5]  Michael Langberg,et al.  An Equivalence Between Network Coding and Index Coding , 2015, IEEE Trans. Inf. Theory.

[6]  Michael Langberg,et al.  An Equivalence Between Network Coding and Index Coding , 2012, IEEE Transactions on Information Theory.

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

[8]  Urs Niesen,et al.  Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.

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

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

[11]  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).

[12]  Urs Niesen,et al.  Coded Caching With Nonuniform Demands , 2017, IEEE Transactions on Information Theory.

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

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

[15]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, Allerton.

[16]  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..

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

[18]  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.

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

[20]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

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

[22]  Rajmohan Rajaraman,et al.  Placement Algorithms for Hierarchical Cooperative Caching , 2001, J. Algorithms.