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

Hyesung Kim, Jihong Park, Mehdi Bennis, Seong Lyun Kim, Merouane Debbah

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

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.

Original languageEnglish
Title of host publication2017 IEEE International Conference on Communications, ICC 2017
EditorsMerouane Debbah, David Gesbert, Abdelhamid Mellouk
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781467389990
DOIs
Publication statusPublished - 2017 Jul 28
Event2017 IEEE International Conference on Communications, ICC 2017 - Paris, France
Duration: 2017 May 212017 May 25

Publication series

NameIEEE International Conference on Communications
ISSN (Print)1550-3607

Other

Other2017 IEEE International Conference on Communications, ICC 2017
CountryFrance
CityParis
Period17/5/2117/5/25

Fingerprint

Base stations
Game theory
Geometry
Costs

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Kim, H., Park, J., Bennis, M., Kim, S. L., & Debbah, M. (2017). Ultra-dense edge caching under spatio-temporal demand and network dynamics. In M. Debbah, D. Gesbert, & A. Mellouk (Eds.), 2017 IEEE International Conference on Communications, ICC 2017 [7996764] (IEEE International Conference on Communications). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2017.7996764
Kim, Hyesung ; Park, Jihong ; Bennis, Mehdi ; Kim, Seong Lyun ; Debbah, Merouane. / Ultra-dense edge caching under spatio-temporal demand and network dynamics. 2017 IEEE International Conference on Communications, ICC 2017. editor / Merouane Debbah ; David Gesbert ; Abdelhamid Mellouk. Institute of Electrical and Electronics Engineers Inc., 2017. (IEEE International Conference on Communications).
@inproceedings{eb2e4ee978da4083902694825b554664,
title = "Ultra-dense edge caching under spatio-temporal demand and network dynamics",
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.",
author = "Hyesung Kim and Jihong Park and Mehdi Bennis and Kim, {Seong Lyun} and Merouane Debbah",
year = "2017",
month = "7",
day = "28",
doi = "10.1109/ICC.2017.7996764",
language = "English",
series = "IEEE International Conference on Communications",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
editor = "Merouane Debbah and David Gesbert and Abdelhamid Mellouk",
booktitle = "2017 IEEE International Conference on Communications, ICC 2017",
address = "United States",

}

Kim, H, Park, J, Bennis, M, Kim, SL & Debbah, M 2017, Ultra-dense edge caching under spatio-temporal demand and network dynamics. in M Debbah, D Gesbert & A Mellouk (eds), 2017 IEEE International Conference on Communications, ICC 2017., 7996764, IEEE International Conference on Communications, Institute of Electrical and Electronics Engineers Inc., 2017 IEEE International Conference on Communications, ICC 2017, Paris, France, 17/5/21. https://doi.org/10.1109/ICC.2017.7996764

Ultra-dense edge caching under spatio-temporal demand and network dynamics. / Kim, Hyesung; Park, Jihong; Bennis, Mehdi; Kim, Seong Lyun; Debbah, Merouane.

2017 IEEE International Conference on Communications, ICC 2017. ed. / Merouane Debbah; David Gesbert; Abdelhamid Mellouk. Institute of Electrical and Electronics Engineers Inc., 2017. 7996764 (IEEE International Conference on Communications).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

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

AU - Kim, Hyesung

AU - Park, Jihong

AU - Bennis, Mehdi

AU - Kim, Seong Lyun

AU - Debbah, Merouane

PY - 2017/7/28

Y1 - 2017/7/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85028359907&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85028359907&partnerID=8YFLogxK

U2 - 10.1109/ICC.2017.7996764

DO - 10.1109/ICC.2017.7996764

M3 - Conference contribution

AN - SCOPUS:85028359907

T3 - IEEE International Conference on Communications

BT - 2017 IEEE International Conference on Communications, ICC 2017

A2 - Debbah, Merouane

A2 - Gesbert, David

A2 - Mellouk, Abdelhamid

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Kim H, Park J, Bennis M, Kim SL, Debbah M. Ultra-dense edge caching under spatio-temporal demand and network dynamics. In Debbah M, Gesbert D, Mellouk A, editors, 2017 IEEE International Conference on Communications, ICC 2017. Institute of Electrical and Electronics Engineers Inc. 2017. 7996764. (IEEE International Conference on Communications). https://doi.org/10.1109/ICC.2017.7996764