Mean-field Games for Distributed Caching in Ultra-Dense Small Cell Networks

Kenza Hamidouche (1) , Walid Saad (2) , Merouane Debbah (1, 3)

1 LANEAS - Large Networks and Systems Group
2 ECE - Department of Electrical and Computer Engineering [Blacksburg]
3 Mathematical and Algorithmic Sciences Lab [Paris]

Exponential growth of mobile video traffic. •Limited capacity of wireless networks. •Dense deployment of small base stations (SBSs). •Capacity-limited and heterogeneous backhaul links. Solution: Distributed caching •Predict the popularity of the files. •Cache the content at the SBSs ahead of time.

Domaines: Mathématiques [math]; Sciences de l'ingénieur [physics]; Statistiques [stat]

Kenza Hamidouche, Walid Saad, Merouane Debbah. Mean-field Games for Distributed Caching in Ultra-Dense Small Cell Networks. IEEE Communication Theory Workshop, May 2015, Dana Point, United States. Proceedings of the IEEE Communication Theory Workshop. ⟨hal-01242584⟩