Hyppää sisältöön
    • FI
    • ENG
  • FI
  • /
  • EN
OuluREPO – Oulun yliopiston julkaisuarkisto / University of Oulu repository
Näytä viite 
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

A novel caching policy with content popularity prediction and user preference learning in Fog-RAN

Jiang, Yanxiang; Ma, Miaoli; Bennis, Mehdi; Zheng, Fuchun; You, Xiaohu (2018-01-25)

 
Avaa tiedosto
nbnfi-fe2018073033117.pdf (168.9Kt)
nbnfi-fe2018073033117_meta.xml (33.03Kt)
nbnfi-fe2018073033117_solr.xml (31.16Kt)
Lataukset: 

URL:
https://doi.org/10.1109/GLOCOMW.2017.8269166

Jiang, Yanxiang
Ma, Miaoli
Bennis, Mehdi
Zheng, Fuchun
You, Xiaohu
Institute of Electrical and Electronics Engineers
25.01.2018

Y. Jiang, M. Ma, M. Bennis, F. Zheng and X. You, "A Novel Caching Policy with Content Popularity Prediction and User Preference Learning in Fog-RAN," 2017 IEEE Globecom Workshops (GC Wkshps), Singapore, 2017, pp. 1-6. doi: 10.1109/GLOCOMW.2017.8269166

https://rightsstatements.org/vocab/InC/1.0/
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1109/GLOCOMW.2017.8269166
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2018073033117
Tiivistelmä

Abstract

In this paper, the edge caching problem in fog radio access networks (F-RAN) is investigated. By maximizing the cache hit rate, we formulate the edge caching optimization problem to find the optimal edge caching policy. Considering that users prefer to request the contents they are interested in, we propose to implement online content popularity prediction by leveraging the content features and user preferences, and offline user preference learning by using the "Follow The (Proximally) Regularized Leader" (FTRL-Proximal) algorithm and the "Online Gradient Descent" (OGD) method. Our proposed edge caching policy not only can promptly predict the future content popularity in an online fashion with low computational complexity, but also can track the popularity changes in time without delay. Simulation results show that the cache hit rate of our proposed policy approaches the optimal performance and is superior to those of the traditional policies.

Kokoelmat
  • Avoin saatavuus [37659]
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen
 

Selaa kokoelmaa

NimekkeetTekijätJulkaisuajatAsiasanatUusimmatSivukartta

Omat tiedot

Kirjaudu sisäänRekisteröidy
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen