Multi-armed bandit optimization of cache content in wireless infostation networks

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2014, Pages 51-55

  Blasco, Pol ^a   Gunduz, Deniz ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; INFORMATION THEORY;

BROADBAND CONNECTION; CACHE CAPACITY; HIGH DATA RATE; KNAPSACK PROBLEMS; MULTI ARMED BANDIT; MULTI-ARMED BANDIT PROBLEM; SWITCHING COSTS; TIME INTERVAL;

CACHE MEMORY;

EID: 84906546045     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2014.6874793     Document Type: Conference Paper

References (10)

1. D. Goodman, J. Borras, N. B. Mandayam, and R. Yates, "Infostations: A new system model for data and messaging services, " in IEEE Vehicular Technology Conference, vol. 2, Phoneix, AZ, May 1997.
2. S. Borst, V. Gupta, and A. Walid, "Distributed caching algorithms for content distribution networks, " in IEEE INFOCOM, San Diego, CA, Mar. 2010.
3. K. Poularakis and L. Tassiulas, "Exploiting user mobility for wireless content delivery, " in IEEE International Symposium on Information Theory (ISIT), Istambul, Turkey, Jul. 2013.
4. N. Golrezaei, K. Shanmugam, A. Dimakis, A. Molisch, and G. Caire, "Femtocaching: Wireless video content delivery through distributed caching helpers, " in IEEE INFOCOM, Orlando, FL, 2012.
5. P. Blasco and D. Gunduz, "Learning-based optimzation of cache content in a small cell base station, " in IEEE International Conference in Communications (ICC), Sydney, Australia, Jul. 2014.
6. P. Auer, N. Cesa-Bianchi, and P. Fischer, "Finite-time analysis of the multiarmed bandit problem, " Machine Learning, vol. 47, 2002.
7. W. Chen, Y. Wang, and Y. Yuan, "Combinatorial multi-armed bandit: General framework, results and applications, " in International Conference on Machine Learning, Atlanta, GA, Jun. 2013.
8. R. Agrawal, M. V. Hegde, and D. Teneketzis, "Multi-armed bandit problems with multiple plays and switching cost, " Stochastics and Stochastic Reports, vol. 29, no. 4, Dec. 1990.
9. T. Lai and H. Robbins, "Asymptotically efficient adaptive allocation rules, " Advances in Applied Mathematics, vol. 6, 1985.
10. J. Komiyama, I. Sato, and H. Nakagawa, "Multi-armed bandit problem with lock-up periods, " in JMLR Workshop and Conference Proceedings: Asian Conference on Machine Learning, vol. 29, Canberra, Australia, Nov. 2013.