University of Oulu

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

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

Saved in:
Author: Kim, Hyesung1; Park, Jihong2; Bennis, Mehdi3;
Organizations: 1School of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea
2Department of Electronic Systems, Aalborg University, Denmark
3Centre for Wireless Communications, University of Oulu, Finland
4Mathematical and Algorithmic Sciences Lab, Huawei France R&D, Paris, France
5Large Networks and Systems Group (LANEAS), CentraleSupélec, Gif-sur-Yvette, France
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 1.6 MB)
Persistent link:
Language: English
Published: Institute of Electrical and Electronics Engineers, 2017
Publish Date: 2018-08-07


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.

see all

Series: IEEE International Conference on Communications
ISSN: 1550-3607
ISSN-E: 1938-1883
ISSN-L: 1550-3607
ISBN: 978-1-4673-8999-0
ISBN Print: 978-1-4673-9000-2
Pages: 1 - 7
DOI: 10.1109/ICC.2017.7996764
Host publication: 2017 IEEE International Conference on Communications (ICC)
Conference: IEEE International Conference on Communications
Type of Publication: A4 Article in conference proceedings
Field of Science: 213 Electronic, automation and communications engineering, electronics
Funding: This research was supported by the Korean government through the National Research Foundation (NRF) of Korea Grant (NRF-2014R1A2A1A11053234), the Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIP) (No. 2015-0-00294, Spectrum Sensing and Future Radio Communication Platforms), the Academy of Finland CARMA project, the FOGGY project and the ERC Starting Grant 305123 MORE (Advanced Mathematical Tools for Complex Network Engineering).
Academy of Finland Grant Number: 289611
Detailed Information: 289611 (Academy of Finland Funding decision)
Copyright information: © 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.