Fundamental limits of caching

IEEE Transactions on Information Theory

Volumn 60, Issue 5, 2014, Pages 2856-2867

  Maddah Ali, Mohammad Ali ^a   Niesen, Urs ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Caching; coded caching; content distribution; prefetching.

Indexed keywords

INFORMATION THEORY;

BASIC STRUCTURE; CACHING; CACHING SCHEME; CODED CACHING; CONSTANT FACTORS; CONTENT DISTRIBUTION; PREFETCHING; PROBLEM PARAMETERS;

CACHE MEMORY;

EID: 84899645734     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2014.2306938     Document Type: Article

References (19)

1. L. W. Dowdy and D. V. Foster, Comparative models of the file assignment problem, ACM Comput. Surv., vol. 14, pp. 287-313, Jun. 1982.
2. K. C. Almeroth and M. H. Ammar, The use of multicast delivery to provide a scalable and interactive video-on-demand service, IEEE J. Sel. Areas Commun., vol. 14, no. 6, pp. 1110-1122, Aug. 1996. (Pubitemid 126543811)
3. A. Dan, D. Sitaram, and P. Shahabuddin, Dynamic batching policies for an on-demand video server, Multimedia Syst., vol. 4, pp. 112-121, Jun. 1996. (Pubitemid 126594442)
4. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman, Placement algorithms for hierarchical cooperative caching, in Proc. ACM-SIAM SODA, Jan. 1999, pp. 586-595.
5. A. Meyerson, K. Munagala, and S. Plotkin, Web caching using access statistics, in Proc. ACM-SIAM SODA, 2001, pp. 354-363.
6. I. Baev, R. Rajaraman, and C. Swamy, Approximation algorithms for data placement problems, SIAM J. Comput., vol. 38, pp. 1411-1429, Jul. 2008.
7. S. Borst, V. Gupta, and A. Walid, Distributed caching algorithms for content distribution networks, in Proc. IEEE INFOCOM, Mar. 2010, pp. 1478-1486.
8. Y. Birk and T. Kol, Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients, IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2825-2830, Jun. 2006. (Pubitemid 43898931)
9. Z. Bar-Yossef, Y. Birk, T. S. Jayram, and T. Kol, Index coding with side information, IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1479-1494, Mar. 2011.
10. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York, NY, USA: Wiley, 1991.
11. M. Effros, S. El Rouayheb, and M. Langberg, An equivalence between network coding and index coding, arXiv: 1211.6660 [cs.IT], Nov. 2012.
12. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, Network information flow, IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Apr. 2000.
13. M. Langberg and A. Sprintson, On the hardness of approximating the network coding capacity, IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1008-1014, Feb. 2011.
14. A. Blasiak, R. Kleinberg, and E. Lubetzky, Lexicographic products and the power of non-linear network coding, in Proc. IEEE 22nd FOCS, Oct. 2011, pp. 609-618.
15. M. A. Maddah-Ali and U. Niesen, Decentralized coded caching attains order-optimal memory-rate tradeoff, arXiv: 1301.5848 [cs.IT], Jan. 2013.
16. D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Commun. ACM, vol. 28, pp. 202-208, Feb. 1985.
17. R. Pedarsani, M. A. Maddah-Ali, and U. Niesen, Online coded caching, arXiv: 1311.3646 [cs.IT], Nov. 2013.
18. U. Niesen and M. A. Maddah-Ali, Coded caching with nonuniform demands, arXiv: 1308.0178 [cs. IT], Aug. 2013.
19. M. Ji, G. Caire, and A. Molisch, Fundamental limits of distributed caching in D2D wireless networks, in Proc. IEEE ITW, Sep. 2013, pp. 1-5.