Online Coded Caching

IEEE/ACM Transactions on Networking

Volumn 24, Issue 2, 2016, Pages 836-845

  Pedarsani, Ramtin ^a   Maddah Ali, Mohammad Ali ^b   Niesen, Urs ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c New Jersey Nanofabrication Center   (United States)

Author keywords

Coded caching; content distribution; online scheme

Indexed keywords

MARKOV PROCESSES; TIME SERIES;

BOTTLENECK LINK; CACHING ALGORITHM; CACHING SCHEME; CONTENT DISTRIBUTION; FINITE MEMORY; LEAST RECENTLY USED; MARKOV MODEL; SINGLE ORIGIN;

SOCIAL NETWORKING (ONLINE);

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

References (27)

1. L. A. Belady, "A study of replacement algorithms for a virtual-storage computer, " IBM Syst. J., vol. 5, no. 2, pp. 78-101, 1966.
2. D. D. Sleator and R. E. Tarjan, "Amortized efficiency of list update and paging rules, " Commun. ACM, vol. 28, pp. 202-208, Feb. 1985.
3. A. Fiat, R. M. Karp, M. Luby, L. A. McGeoch, D. D. Sleator, and N. E. Young, "Competitive paging algorithms, " J. Algorithms, vol. 12, pp. 685-699, Dec. 1991.
4. L. A. McGeoch and D. D. Sleator, "A strongly competitive randomized paging algorithm, " Algorithmica, vol. 6, pp. 816-825, 1991.
5. A. Borodin, S. Irani, P. Raghavan, and B. Schieber, "Competitive paging with locality of reference, " in Proc. ACM STOC, 1991, pp. 249-259.
6. A. R. Karlin, S. J. Phillips, and P. Raghavan, "Markov paging, " in Proc. IEEE FOCS, Oct. 1992, pp. 208-217.
7. N. Young, "The -server dual and loose competitiveness for paging, " Algorithmica, vol. 11, no. 6, pp. 525-541, 1994.
8. P. Cao and S. Irani, Cost-Aware WWW Proxy Caching Algorithms, pp. 193-206, Dec. 1997.
9. M. Chrobak and J. Noga, "LRU is better than FIFO, " in Proc. ACMSIAM SODA, Jan. 1998, pp. 78-81.
10. N. E. Young, "On-line file caching, " in Proc. ACM-SIAM SODA, Jan. 1998, pp. 82-86.
11. E. Torng, "A unified analysis of paging and caching, " Algorithmica, vol. 20, pp. 175-200, Feb. 1998.
12. E. Koutsoupias and C. H. Papadimitriou, "Beyond competitive analysis, " SIAM J. Comput., vol. 30, pp. 300-317, Jul. 2000.
13. S. Angelopoulos, R. Dorrigiv, and A. López-Ortiz, "On the separation and equivalence of paging strategies, " in Proc. ACM-SIAMSODA, Jan. 2007, pp. 229-237.
14. B. Awerbuch, Y. Bartal, and A. Fiat, "Distributed paging for general networks, " in Proc. ACM-SIAM SODA, Jan. 1996, pp. 574-583.
15. F. M. auf der Heide, B. Vöcking, and M. Westermann, "Caching in networks, " in Proc. ACM-SIAM SODA, Jan. 2000, pp. 430-439.
16. X. Li, C. G. Plaxton, M. Tiwari, and A. Venkataramani, "Online hierarchical cooperative caching, " Theory Comput. Syst., vol. 39, pp. 851-874, Nov. 2006.
17. M. A. Maddah-Ali and U. Niesen, "Fundamental limits of caching, " IEEE Trans. Inf. Theory, vol. 60, no. 5, pp. 2856-2867, May 2014.
18. M. A. Maddah-Ali and U. Niesen, "Decentralized coded caching attains order-optimal memory-rate tradeoff, " IEEE/ACM Trans. Netw., vol. PP, no. 99, 2014, DOI: 10.1109/TNET.2014.2317316.
19. U. Niesen and M. A. Maddah-Ali, "Coded caching with nonuniform demands, " arXiv:1308.0178 [cs.IT], Aug. 2013.
20. D. H. Fremlin, Measure Theory, Torres Fremlin, 2001, vol. 2.
21. N. Karamchandani, U. Niesen, M. A. Maddah-Ali, and S. Diggavi, "Hierarchical coded caching, " Art. ID arXiv:1403.7007 [cs.IT], Mar. 2014.
22. U. Niesen and M. A. Maddah-Ali, "Coded caching for delay-sensitive content, " Art. ID arXiv:1407.4489 [cs.IT], 2014.
23. 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.
24. 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.
25. M. Effros, S. El Rouayheb, and M. Langberg, "An equivalence between network coding and index coding, " arXiv:1211.6660 [cs.IT], Nov. 2012.
26. 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.
27. 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.