Finite-Length Analysis of Caching-Aided Coded Multicasting

IEEE Transactions on Information Theory

Volumn , Issue , 2016, Pages 5524-5537

  Shanmugam, Karthikeyan ^a,b   Ji, Mingyue ^a,c,d   Tulino, Antonia M ^a,e   Llorca, Jaime ^a   Dimakis, Alexandros G ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b The University of Texas at Austin   (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^d University of Utah   (United States)

^e UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

caching; clique cover; Coded multicasting; Finite Length analysis; index coding

Indexed keywords

CODES (SYMBOLS);

ASYMPTOTIC REGIMES; CACHING; CLIQUE COVER; FINITE LENGTH ANALYSIS; INDEX CODING; NUMBER OF TRANSMISSIONS; POLYNOMIAL NUMBER; RANDOM PLACEMENT;

MULTICASTING;

EID: 85041132490     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.2016.2599110     Document Type: Conference Paper

References (19)

1. K. Shanmugam, M. Ji, A. M. Tulino, J. Llorca, and A. G. Dimkakis, "Finite length analysis of caching-aided coded multicasting, " in Proc. 52nd Annu. Allerton Conf. Commun., Control, Comput. (Allerton), Oct. 2014, pp. 914-920.
2. Mobile, Cisco VNI, "Global mobile data traffic forecast update 2010-2015, " Cisco, Tech. Rep, 2011.
3. K. Shanmugam, N. Golrezaei, A. G. Dimakis, A. F. Molisch, and G. Caire, "FemtoCaching: Wireless content delivery through distributed caching helpers, " IEEE Trans. Inf. Theory, vol. 59, no. 12, pp. 8402-8413, Dec. 2013.
4. A. F. Molisch, G. Caire, D. Ott, J. R. Foerster, D. Bethanabhotla, and M. Ji. (May 2014). "Caching eliminates the wireless bottleneck in video aware wireless networks. " [Online]. Available: https://arxiv. org/abs/1405. 5864
5. M. Chen, J. Chen, Y. Ma, T. Yu, and Z. Wu, "Base station assisted device-to-device communications for content update network, " in Proc. IEEE Int. Conf. Comput. Intell. Theory, Syst. Appl., Dec. 2015, pp. 23-28.
6. M. Ji, G. Caire, and A. F. Molisch. (May 2013). "Wireless device-todevice caching networks: Basic principles and system performance. " [Online]. Available: http://arxiv. org/abs/1305. 5216
7. M. Ji, G. Caire, and A. F. Molisch. (Feb. 2013). "Optimal throughputoutage trade-off in wireless one-hop caching networks. " [Online]. Available: https://arxiv. org/abs/1302. 2168
8. M. Ji, G. Caire, and A. F. Molisch. (May 2014). "Fundamental limits of caching in wireless D2D networks. " [Online]. Available: https://arxiv. org/abs/1405. 5336
9. M. Langberg and A. Sprintson, "On the hardness of approximating the network coding capacity, " in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2008, pp. 315-319.
10. M. Effros, S. E. Rouayheb, and M. Langberg. (Nov. 2012). "An equivalence between network coding and index coding. " [Online]. Available: http://arxiv. org/abs/1211. 6660
11. 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.
12. H. Maleki, V. Cadambe, and S. Jafar, "Index coding: An interference alignment perspective, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2012, pp. 2236-2240.
13. M. A. Maddah-Ali and U. Niesen, "Fundamental limits of caching, " in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2013, pp. 1077-1081.
14. M. A. Maddah-Ali and U. Niesen. (Jan. 2013). "Decentralized coded caching attains order-optimal memory-rate tradeoff. " [Online]. Available: https://arxiv. org/abs/1301. 5848
15. M. Ji, A. M. Tulino, J. Llorca, and G. Caire, "On the average performance of caching and coded multicasting with random demands, " in Proc. 11th Int. Symp. Wireless Commun. Syst. (ISWCS), Aug. 2014, pp. 922-926.
16. M. Ji, A. M. Tulino, J. Llorca, and G. Caire. (Feb. 2015). "Order-optimal rate of caching and coded multicasting with random demands. " [Online]. Available: http://arxiv. org/abs/1502. 03124
17. D. P. Dubhashi and A. Panconesi, Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge, U. K. : Cambridge Univ. Press, 2009.
18. M. Raab and A. Steger, "'Balls into bins'-A simple and tight analysis, " in Randomization and Approximation Techniques in Computer Science. Berlin, Germany: Springer, 1998, pp. 159-170.
19. S. Jukna, Extremal Combinatorics: With Applications in Computer Science, vol. 2. Berlin, Germany: Springer, 2001.