An efficient coded multicasting scheme preserving the multiplicative caching gain

Proceedings - IEEE INFOCOM

Volumn 2015-August, Issue , 2015, Pages 251-256

  Vettigli, Giuseppe ^a   Ji, Mingyue ^b   Tulino, Antonia M ^a   Llorca, Jaime ^c   Festa, Paola ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c NOKIA RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; POLYNOMIAL APPROXIMATION;

ASYMPTOTIC REGIMES; CACHING PERFORMANCE; CONTENT DELIVERY NETWORK; DEMAND DISTRIBUTION; HETEROGENEOUS CACHES; LIMITING PERFORMANCE; OPTIMAL PERFORMANCE; POLYNOMIAL-TIME ALGORITHMS;

MULTICASTING;

EID: 84943272684     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOMW.2015.7179393     Document Type: Conference Paper

References (21)

1. M. Ji, A.M. Tulino, J. Llorca, and G. Caire, "On the average performance of caching and coded multicasting with random demands," in ISWCS, 2014. IEEE, 2014, pp. 922-926.
2. M. Ji, A.M. Tulino, J. Llorca, and G. Caire, "Order-optimal rate of caching and coded multicasting with random demands," arXiv preprint:1502.03124, 2015.
3. J. Llorca, A.M. Tulino, K. Guan, and D. Kilper, "Network-coded caching-aided multicast for efficient content delivery," in ICC, 2013 Proceedings. IEEE, 2013
4. M. Ji, G. Caire, and A.F. Molisch, "The throughput-outage tradeoff of wireless one-hop caching networks," arXiv:1302.2168, 2013.
5. M. Ji, G. Caire, and A. F. Molisch, "Wireless device-to-device caching networks: Basic principles and system performance," arXiv:1305.5216, 2013.
6. M.A. Maddah-Ali and U. Niesen, "Fundamental limits of caching," Information Theory, IEEE Transactions on, vol. 60, no. 5, pp. 2856-2867, May 2014.
7. M.A. Maddah-Ali and U. Niesen, "Decentralized coded caching attains order-optimal memory-rate tradeoff," Networking, IEEE/ACM Transactions on, vol. PP, no. 99, pp. 1-1, 2014.
8. M Ji, G. Caire, and A. F. Molisch, "Fundamental limits of caching in wireless d2d networks," arXiv:1405.5336, 2014.
9. M. Ji, A.M. Tulino, J. Llorca, and G. Caire, "Caching and coded multicasting: Multiple groupcast index coding," in GlobalSIP, 2014. IEEE, 2014, pp. 881-885.
10. K. Shanmugam, M. Ji, A. M. Tulino, J. Llorca, and A. Dimakis, "Finite length analysis of caching-aided coded multicasting," in IEEE Allerton conference, 2014.
11. Cisco, the Zettabyte Era-Trends and Analysis," 2013
12. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web caching and zipf-like distributions: Evidence and implications," in INFOCOM99. Proceedings. IEEE, 1999, vol. 1, pp. 126-134.
13. Z. Bar-Yossef, Y. Birk, T.S. Jayram, and T. Kol, "Index coding with side information," Information Theory, IEEE Transactions on, vol. 57, no. 3, pp. 1479-1494, 2011.
14. M. Garey and D. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979.
15. M. Garey and D. Johnson, "The Complexity of Near-Optimal Coloring," Journal of the ACM, vol. 23, pp. 43-49, 1976.
16. T.A. Feo and M.G.C. Resende, "Greedy randomized adaptive search procedures," Journal of Global Optimization, vol. 6, pp. 109-133, 1995.
17. P. Festa and M.G.C. Resende, "GRASP: An annotated bibliography," in Essays and Surveys on Metaheuristics, C.C. Ribeiro and P. Hansen, Eds., pp. 325-367. Kluwer Academic Publishers, 2002.
18. P. Festa and M.G.C. Resende, "An annotated bibliography of GRASP-Part I: Algorithms," International Transactions in Operational Research, vol. 16, no. 1, pp. 1-24, 2009.
19. P. Festa and M.G.C. Resende, "An annotated bibliography of GRASP-Part II: Applications," International Transactions in Operational Research, vol. 16, no. 2, pp. 131-172, 2009.
20. P. Festa and M.G.C. Resende, "GRASP: Basic components and enhancements," Telecommunication Systems, vol. 46, no. 3, pp. 253-271, 2011.
21. M. Laguna and R. Martí, "A GRASP for coloring sparse graphs," Computational Optimization and Applications, vol. 19, no. 2, pp. 165-178, 2001.