Fundamental Limits of Caching
暂无分享,去创建一个
[1] Chaitanya Swamy,et al. Approximation Algorithms for Data Placement Problems , 2008, SIAM J. Comput..
[2] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[3] Asit Dan,et al. Dynamic batching policies for an on-demand video server , 1996, Multimedia Systems.
[4] 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.
[5] Lawrence W. Dowdy,et al. Comparative Models of the File Assignment Problem , 1982, CSUR.
[6] Kamesh Munagala,et al. Web caching using access statistics , 2001, SODA '01.
[7] Robert D. Kleinberg,et al. Lexicographic Products and the Power of Non-linear Network Coding , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[8] 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..
[9] Ziv Bar-Yossef,et al. Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.
[10] Urs Niesen,et al. Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, Allerton.
[11] Placement Algorithms for Hierarchical Cooperative Caching , 1999, J. Algorithms.
[12] Michael Langberg,et al. On the Hardness of Approximating the Network Coding Capacity , 2011, IEEE Trans. Inf. Theory.
[13] Giuseppe Caire,et al. Fundamental limits of distributed caching in D2D wireless networks , 2013, 2013 IEEE Information Theory Workshop (ITW).
[14] Sem C. Borst,et al. Distributed Caching Algorithms for Content Distribution Networks , 2010, 2010 Proceedings IEEE INFOCOM.
[15] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.