Randomised Geographic Caching and its Applications in Wireless Networks

Anastasios Giovanidis (1) , Bartłomiej Błaszczyszyn (2)

1 NPA - Networks and Performance Analysis
2 DYOGENE - Dynamics of Geometric Networks

The randomised (or probabilistic) geographic caching is a proactive content placement strategy that has attracted a lot of attention, because it can simplify a great deal cache-management problems at the wireless edge. It diversifies content placement over caches and applies to scenarios where a request can be possibly served by multiple cache memories. Its simplicity and strength is due to randomisation. It allows one to formulate continuous optimisation problems for content placement over large homogeneous geographic areas. These can be solved to optimality by standard convex methods, and can even provide closed-form solutions for specific cases. This way the algorithmic obstacles from NP-hardness are avoided and optimal solutions can be derived with low computational cost. Randomised caching has a large spectrum of applications in real-world wireless problems, including femto-caching, multi-tier networks, device-to-device communications, mobility, mm-wave, security, UAVs, and more. In this chapter we will formally present the main policy with its applications in various wireless scenarios. We will further introduce some very useful extensions related to unequal file-sizes and content placement with neighbourhood dependence.

Mots clés: Wireless networks; Edge-caching; Cache; Probabilistic policy

Domaines: Réseaux et télécommunications [cs.NI]; Théorie de l'information [cs.IT]

Anastasios Giovanidis, Bartłomiej Błaszczyszyn. Randomised Geographic Caching and its Applications in Wireless Networks. H. Vincent Poor; Wei Chen. Edge Caching for Mobile Networks, The Institution of Engineering and Technology, pp.371--404, 2021, 978-1-83953-122-4. ⟨hal-02994177v2⟩