Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Context-Aware Proactive Content Caching With Service Differentiation in Wireless Networks

Published: 01 February 2017 Publication History

Abstract

Content caching in small base stations or wireless infostations is considered to be a suitable approach to improve the efficiency in wireless content delivery. Placing the optimal content into local caches is crucial due to storage limitations, but it requires knowledge about the content popularity distribution, which is often not available in advance. Moreover, local content popularity is subject to fluctuations, since mobile users with different interests connect to the caching entity over time. Which content a user prefers may depend on the user’s context. In this paper, we propose a novel algorithm for context-aware proactive caching. The algorithm learns context-specific content popularity online by regularly observing context information of connected users, updating the cache content and observing cache hits subsequently. We derive a sublinear regret bound, which characterizes the learning speed and proves that our algorithm converges to the optimal cache content placement strategy in terms of maximizing the number of cache hits. Furthermore, our algorithm supports service differentiation by allowing operators of caching entities to prioritize customer groups. Our numerical results confirm that our algorithm outperforms state-of-the-art algorithms in a real world data set, with an increase in the number of cache hits of at least 14%.

References

[1]
S. Müller, O. Atan, M. van der Schaar, and A. Klein, “ Smart caching in wireless small cell networks via contextual multi-armed bandits,” in Proc. IEEE Int. Conf. Commun. (ICC), May 2016, pp. 1–7.
[2]
(25, 2016). {Online}. Available: http://www.cisco.com/c/en/us/solutions/collateral/service-provider/visual-networking-index-vni/mobile-white-paper-c11-520862.html
[3]
X. Wang, M. Chen, T. Taleb, A. Ksentini, and V. C. M. Leung, “ Cache in the air: Exploiting content caching and delivery techniques for 5G systems,” IEEE Commun. Mag., vol. Volume 52, no. Issue 2, pp. 131–139, 2014.
[4]
S. Borst, V. Gupta, and A. Walid, “ Distributed caching algorithms for content distribution networks,” in Proc. IEEE Int. Conf. Comput. Commun. (INFOCOM), Mar. 2010, pp. 1–9.
[5]
L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “ Web caching and Zipf-like distributions: Evidence and implications,” in Proc. IEEE Comput. Commun. 18th Annu. Joint Conf. Soc. (INFOCOM), vol. Volume 1 . Mar. 1999, pp. 126–134.
[6]
J. Erman, A. Gerber, M. Hajiaghayi, D. Pei, S. Sen, and O. Spatscheck, “ To cache or not to cache: The 3G case,” IEEE Internet Comput., vol. Volume 15, no. Issue 2, pp. 27–34, 2011.
[7]
M. A. Maddah-Ali and U. Niesen, “ Fundamental limits of caching,” IEEE Trans. Inf. Theory, vol. Volume 60, no. Issue 5, pp. 2856–2867, 2014.
[8]
N. Golrezaei, A. F. Molisch, A. G. Dimakis, and G. Caire, “ Femtocaching and device-to-device collaboration: A new architecture for wireless video distribution,” IEEE Commun. Mag., vol. Volume 51, no. Issue 4, pp. 142–149, 2013.
[9]
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. Volume 59, no. Issue 12, pp. 8402–8413, 2013.
[10]
K. Poularakis and L. Tassiulas, “ Exploiting user mobility for wireless content delivery,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2013, pp. 1017–1021.
[11]
K. Poularakis, G. Iosifidis, V. Sourlas, and L. Tassiulas, “ Exploiting caching and multicast for 5G wireless networks,” IEEE Trans. Wireless Commun., vol. Volume 15, no. Issue 4, pp. 2995–3007, 2016.
[12]
E. Bastug, M. Bennis, and M. Debbah, “ Cache-enabled small cell networks: Modeling and tradeoffs,” in Proc. Int. Symp. Wireless Commun. Syst. (ISWCS), Aug. 2014, pp. 649–653.
[13]
E. Baştuğ, M. Bennis, and M. Debbah, “ Living on the edge: The role of proactive caching in 5G wireless networks,” IEEE Commun. Mag., vol. Volume 52, no. Issue 8, pp. 82–89, 2014.
[14]
E. Baştuğ et al., “ Big data meets telcos: A proactive caching perspective,” J. Commun. Netw., vol. Volume 17, no. Issue 6, pp. 549–557, 2015.
[15]
P. Blasco and D. Gündüz, “ Learning-based optimization of cache content in a small cell base station,” in Proc. IEEE Int. Conf. Commun. (ICC), Jun. 2014, pp. 1897–1903.
[16]
P. Blasco and D. Gündüz, “ Multi-armed bandit optimization of cache content in wireless infostation networks,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2014, pp. 51–55.
[17]
P. Blasco and D. Gündüz. (2014). “<chapter-title>Content-level selective offloading in heterogeneous networks: Multi-armed bandit optimization and regret bounds</chapter-title>.” {Online}. Available: https://arxiv.org/abs/1407.6154
[18]
A. Sengupta, S. Amuru, R. Tandon, R. M. Buehrer, and T. C. Clancy, “ Learning distributed caching strategies in small cell networks,” in Proc. IEEE Int. Symp. Wireless Commun. Syst. (ISWCS), Aug. 2014, pp. 917–921.
[19]
M. ElBamby, M. Bennis, W. Saad, and M. Latva-aho, “ Content-aware user clustering and caching in wireless small cell networks,” in Proc. IEEE Int. Symp. Wireless Commun. Syst. (ISWCS), Aug. 2014, pp. 945–949.
[20]
D. Goodman, J. Borras, N. B. Mandayam, and R. D. Yates, “ INFOSTATIONS: A new system model for data and messaging services,” in Proc. IEEE 47th Veh. Technol. Conf., vol. Volume 2 . May 1997, pp. 969–973.
[21]
A. L. Iacono and C. Rose, “<chapter-title>Infostations: New perspectives on wireless data networks</chapter-title>,” in Next Generation Wireless Networks, S. Tekinay, Ed. Boston, MA, USA: Springer, 2002, pp. 3–63.
[22]
P. Gill, M. Arlitt, Z. Li, and A. Mahanti, “ YouTube traffic characterization: A view from the edge,” in Proc. ACM Conf. Internet Meas. (IMC), Oct. 2007, pp. 15–28.
[23]
M. Zink, K. Suh, Y. Gu, and J. Kurose, “ Characteristics of YouTube network traffic at a campus network—Measurements, models, and implications,” Comput. Netw., vol. Volume 53, no. Issue 4, pp. 501–514, 2009.
[24]
A. Brodersen, S. Scellato, and M. Wattenhofer, “ YouTube around the world: Geographic popularity of videos,” in Proc. ACM Int. Conf. World Wide Web (WWW), Apr. 2012, pp. 241–250.
[25]
M.-L. Mares and Y. Sun, “ The multiple meanings of age for television content preferences,” Human Commun. Res., vol. Volume 36, no. Issue 3, pp. 372–396, 2010.
[26]
C. A. Hoffner and K. J. Levine, “ Enjoyment of mediated fright and violence: A meta-analysis,” Media Psychol., vol. Volume 7, no. Issue 2, pp. 207–237, 2005.
[27]
P. J. Rentfrow, L. R. Goldberg, and R. Zilca, “ Listening, watching, and reading: The structure and correlates of entertainment preferences,” J. Personality, vol. Volume 79, no. Issue 2, pp. 223–258, 2011.
[28]
D. Zillmann, “ Mood management through communication choices,” Amer. Behavioral Sci., vol. Volume 31, no. Issue 3, pp. 327–340, 1988.
[29]
C. Zhou, Y. Guo, Y. Chen, X. Nie, and W. Zhu, “ Characterizing user watching behavior and video quality in mobile devices,” in Proc. IEEE Int. Conf. Comput. Commun. Netw. (ICCCN), Aug. 2014, pp. 1–6.
[30]
B.-J. Ko, K.-W. Lee, K. Amiri, and S. Calo, “ Scalable service differentiation in a shared storage cache,” in Proc. IEEE Int. Conf. Distrib. Comput. Syst. (ICDCS), May 2003, pp. 184–193.
[31]
Y. Lu, T. F. Abdelzaher, and A. Saxena, “ Design, implementation, and evaluation of differentiated caching services,” IEEE Trans. Parallel Distrib. Syst., vol. Volume 15, no. Issue 5, pp. 440–452, 2004.
[32]
P. Cao and S. Irani, “ Cost-aware WWW proxy caching algorithms,” in Proc. USENIX Symp. Internet Technol. Syst., 1997, pp. 193–206.
[33]
S. Li, J. Xu, M. van der Schaar, and W. Li, “ Popularity-driven content caching,” in Proc. IEEE Int. Conf. Comput. Commun. (INFOCOM), Apr. 2016, pp. 1–9.
[34]
S. Li, J. Xu, M. van der Schaar, and W. Li, “ Trend-aware video caching through Online learning,” IEEE Trans. Multimedia, vol. Volume 18, no. Issue 12, pp. 2503–2516, 2016.
[35]
P. Auer, N. Cesa-Bianchi, and P. Fischer, “ Finite-time analysis of the multiarmed bandit problem,” Mach. Learn., vol. Volume 47, nos. Issue 2</issue>–<issue>3, pp. 235–256, 2002.
[36]
S. Maghsudi and E. Hossain, “ Multi-armed bandits with application to 5G small cells,” IEEE Wireless Commun., vol. Volume 23, no. Issue 3, pp. 64–73, 2016.
[37]
S. Amuru, C. Tekin, M. van der Schaar, and R. M. Buehrer, “ Jamming bandits—A novel learning method for optimal jamming,” IEEE Trans. Wireless Commun., vol. Volume 15, no. Issue 4, pp. 2792–2808, 2016.
[38]
C. Shen, C. Tekin, and M. van der Schaar, “ A non-stochastic learning approach to energy efficient mobility management,” IEEE J. Sel. Areas Commun., vol. Volume 34, no. Issue 12, pp. 3854–3868, 2016.
[39]
T. Lu, D. Pal, and M. Pal, “ Contextual multi-armed bandits,” in Proc. Int. Conf. Artif. Intell. Statist. (AISTATS), 2010, pp. 485–492.
[40]
A. Slivkins, “ Contextual bandits with similarity information,” J. Mach. Learn. Res., vol. Volume 15, no. Issue 1, pp. 2533–2568, 2014.
[41]
C. Tekin and M. van der Schaar, “ Distributed Online learning via cooperative contextual bandits,” IEEE Trans. Signal Process., vol. Volume 63, no. Issue 14, pp. 3700–3714, 2015.
[42]
C. Tekin, S. Zhang, and M. van der Schaar, “ Distributed Online learning in social recommender systems,” IEEE J. Sel. Topics Signal Process., vol. Volume 8, no. Issue 4, pp. 638–652, 2014.
[43]
H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems . Berlin, Germany: Springer, 2004.
[44]
(14, 2016). {Online}. Available: http://kang.nt.e-technik.tudarmstadt.de/nt/fileadmin/kt/Publikationen_PDFs/2016/TWC/TWC2016_Mueller_App.pdf
[45]
F. M. Harper and J. A. Konstan, “ The MovieLens datasets: History and context,” ACM Trans. Interact. Intell. Syst., vol. Volume 5, no. Issue 4, pp. 1–19, 2015.
[46]
(9, 2015). {Online}. Available: http://grouplens.org/datasets/movielens/1m/
[47]
W. Hoeffding, “ Probability inequalities for sums of bounded random variables,” J. Amer. Statist. Assoc., vol. Volume 58, no. Issue 301, pp. 13–30, 1963.
[48]
E. Chlebus, “ An approximate formula for a partial sum of the divergent p-series,” Appl. Math. Lett., vol. Volume 22, no. Issue 5, pp. 732–737, 2009.

Cited By

View all
  • (2025)A Survey on Privacy-Preserving Caching at Network Edge: Classification, Solutions, and ChallengesACM Computing Surveys10.1145/370663057:5(1-38)Online publication date: 9-Jan-2025
  • (2024)Agile Cache Replacement in Edge Computing via Offline-Online Deep Reinforcement LearningIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.336876335:4(663-674)Online publication date: 1-Apr-2024
  • (2024)Combining Lyapunov Optimization and Deep Reinforcement Learning for D2D Assisted Heterogeneous Collaborative Edge CachingIEEE Transactions on Network and Service Management10.1109/TNSM.2024.336179621:3(3236-3248)Online publication date: 1-Jun-2024
  • Show More Cited By
  1. Context-Aware Proactive Content Caching With Service Differentiation in Wireless Networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image IEEE Transactions on Wireless Communications
    IEEE Transactions on Wireless Communications  Volume 16, Issue 2
    February 2017
    682 pages

    Publisher

    IEEE Press

    Publication History

    Published: 01 February 2017

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 05 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2025)A Survey on Privacy-Preserving Caching at Network Edge: Classification, Solutions, and ChallengesACM Computing Surveys10.1145/370663057:5(1-38)Online publication date: 9-Jan-2025
    • (2024)Agile Cache Replacement in Edge Computing via Offline-Online Deep Reinforcement LearningIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2024.336876335:4(663-674)Online publication date: 1-Apr-2024
    • (2024)Combining Lyapunov Optimization and Deep Reinforcement Learning for D2D Assisted Heterogeneous Collaborative Edge CachingIEEE Transactions on Network and Service Management10.1109/TNSM.2024.336179621:3(3236-3248)Online publication date: 1-Jun-2024
    • (2024)Multi-Service Edge Computing Management With Multi-Stage Coalition Game Task OffloadingIEEE Transactions on Network and Service Management10.1109/TNSM.2024.335841421:3(3278-3291)Online publication date: 1-Jun-2024
    • (2023)Context-Aware Edge Caching Strategy Based On Mobility PredictionProceedings of the 2023 2nd International Conference on Networks, Communications and Information Technology10.1145/3605801.3605826(127-132)Online publication date: 16-Jun-2023
    • (2023)Community Detection and Attention-Weighted Federated Learning Based Proactive Edge Caching for D2D-Assisted Wireless NetworksIEEE Transactions on Wireless Communications10.1109/TWC.2023.324975622:11(7287-7303)Online publication date: 1-Nov-2023
    • (2023)Deep Reinforcement Learning for Reactive Content Caching With Predicted Content Popularity in Three-Tier Wireless NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2022.320799420:1(486-501)Online publication date: 1-Mar-2023
    • (2023)Caching in Dynamic Environments: A Near-Optimal Online Learning ApproachIEEE Transactions on Multimedia10.1109/TMM.2021.313215625(792-804)Online publication date: 1-Jan-2023
    • (2023)Recommendation-Driven Multi-Cell Cooperative Caching: A Multi-Agent Reinforcement Learning ApproachIEEE Transactions on Mobile Computing10.1109/TMC.2023.329721323:5(4764-4776)Online publication date: 20-Jul-2023
    • (2023)Multi-Objective Parallel Task Offloading and Content Caching in D2D-Aided MEC NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2022.319987622:11(6599-6615)Online publication date: 1-Nov-2023
    • Show More Cited By

    View Options

    View options

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media