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.

Ultra-dense edge caching under spatio-temporal demand and network dynamics

Kim, Hyesung; Park, Jihong; Bennis, Mehdi; Kim, Seong-Lyun; Debbah, Mérouane (2017-07-31)

 
Avaa tiedosto
nbnfi-fe2018080733498.pdf (1.617Mt)
nbnfi-fe2018080733498_meta.xml (34.58Kt)
nbnfi-fe2018080733498_solr.xml (37.96Kt)
Lataukset: 

URL:
https://doi.org/10.1109/ICC.2017.7996764

Kim, Hyesung
Park, Jihong
Bennis, Mehdi
Kim, Seong-Lyun
Debbah, Mérouane
Institute of Electrical and Electronics Engineers
31.07.2017

H. Kim, J. Park, M. Bennis, S. Kim and M. Debbah, "Ultra-dense edge caching under spatio-temporal demand and network dynamics," 2017 IEEE International Conference on Communications (ICC), Paris, 2017, pp. 1-7. doi: 10.1109/ICC.2017.7996764

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/ICC.2017.7996764
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2018080733498
Tiivistelmä

Abstract

This paper investigates a cellular edge caching design under an extremely large number of small base stations (SBSs) and users. In this ultra-dense edge caching network (UDCN), SBS-user distances shrink, and each user can request a cached content from multiple SBSs. Unfortunately, the complexity of existing caching controls’ mechanisms increases with the number of SBSs, making them inapphcable for solving the fundamental caching problem: How to maximize local caching gain while minimizing the replicated content caching? Furthermore, spatial dynamics of interference is no longer negligible in UDCNs due to the surge in interference. In addition, the caching control should consider temporal dynamics of user demands. To overcome such difficulties, we propose a novel caching algorithm weaving together notions of mean-field game theory and stochastic geometry. These enable our caching algorithm to become independent of the number of SBSs and users, while incorporating spatial interference dynamics as well as temporal dynamics of content popularity and storage constraints. Numerical evaluation validates the fact that the proposed algorithm reduces not only the long run average cost by at least 24% but also the number of replicated content by 56% compared to a popularity-based algorithm.

Kokoelmat
  • Avoin saatavuus [38865]
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