Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff

IEEE/ACM Transactions on Networking

Volumn 23, Issue 4, 2015, Pages 1029-1040

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

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Cache networks; coded caching; content distribution; prefetching

Indexed keywords

SOFTWARE ENGINEERING;

CACHE NETWORKS; CACHING SCHEME; CODED CACHING; CONTENT DISTRIBUTION; NETWORK LOAD; OPTIMAL MEMORY; PERFORMANCE GAIN; PREFETCHING;

MULTICASTING;

EID: 85028213475     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2014.2317316     Document Type: Article

References (17)

1. L. W. Dowdy and D. V. Foster, "Comparative models of the file assignment problem," Comput. Surveus, 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.
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.
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. 1-9.
8. M. A. Maddah-Ali and U. Niesen, "Fundamental limits of caching," IEEE Trans. Inf. Theory, vol. 60, no. 5, pp. 2856-2867, May 2014.
9. U. Niesen and M. A. Maddah-Ali, "Coded caching with nonuniform demands," ArXiv:1308.0178 cs.IT, Aug. 2013.
10. R. Pedarsani, M. A. Maddah-Ali, and U. Niesen, "Online coded caching," ArXiv:1311.3646 cs.IT, Nov. 2013.
11. N. Karamchandani, U. Niesen, M. A. Maddah-Ali, and S. Diggavi, "Hierarchical coded caching," ArXiv:1403.7007 cs.IT, Mar. 2014.
12. 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.
13. 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.
14. M. Effros, S. E. Rouayheb, and M. Langberg, "An equivalence between network coding and index coding," ArXiv:1211.6660 cs.IT, Nov. 2012.
15. R. Ahlswede, N. Cai, S.-Y Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Apr. 2000.
16. 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.
17. D. D. Sleator and R. E. Tarjan, "Amortized efficiency of list update and paging rules," Commun. ACM, vol. 28, pp. 202-208, Feb. 1985.