Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Hybrid Coded-Uncoded Caching in Multi-Access Networks with Non-uniform Demands

Abdollah Ghaffari Sheshjavani, Ahmad Khonsari, Masoumeh Moradian, Seyed Pooya Shariatpanahi, Seyedeh Bahereh Hassanpour

TL;DR

MAHC addresses the challenge of delivering content in ultra-dense cellular networks where users access multiple caches and content popularity is non-uniform. It introduces a cluster-based hybrid caching framework that partitions cache memory into coded and uncoded parts across multiple cache clusters and formulates an optimization problem to minimize the shared-link delivery load. The authors analyze and evaluate MAHC in 2-SBS topologies, showing it outperforms traditional uncoded caching and existing MACC schemes under non-uniform popularity distributions. This work provides a practical caching strategy for dense networks and guides cache placement and clustering decisions to reduce backhaul and radio access traffic.

Abstract

To address the massive growth of data traffic over cellular networks, increasing spatial reuse of the frequency spectrum by the deployment of small base stations (SBSs) has been considered. For rapid deployment of SBSs in the networks, caching popular content along with new coded caching schemes are proposed. To maximize the cellular network's capacity, densifying it with small base stations is inevitable. In ultra-dense cellular networks, coverage of SBSs may overlap. To this aim, the multi-access caching system, where users potentially can access multiple cache nodes simultaneously, has attracted more attention in recent years. Most previous works on multi-access coded caching, only consider specific conditions such as cyclic wrap-around network topologies. In this paper, we investigate caching in ultra-dense cellular networks, where different users can access different numbers of caches under non-uniform content popularity distribution, and propose Multi-Access Hybrid coded-uncoded Caching (MAHC). We formulate the optimization problem of the proposed scheme for general network topologies and evaluate it for 2-SBS network scenarios. The numerical and simulation results show that the proposed MAHC scheme outperforms optimal conventional uncoded and previous multi-access coded caching (MACC) schemes.

Hybrid Coded-Uncoded Caching in Multi-Access Networks with Non-uniform Demands

TL;DR

MAHC addresses the challenge of delivering content in ultra-dense cellular networks where users access multiple caches and content popularity is non-uniform. It introduces a cluster-based hybrid caching framework that partitions cache memory into coded and uncoded parts across multiple cache clusters and formulates an optimization problem to minimize the shared-link delivery load. The authors analyze and evaluate MAHC in 2-SBS topologies, showing it outperforms traditional uncoded caching and existing MACC schemes under non-uniform popularity distributions. This work provides a practical caching strategy for dense networks and guides cache placement and clustering decisions to reduce backhaul and radio access traffic.

Abstract

To address the massive growth of data traffic over cellular networks, increasing spatial reuse of the frequency spectrum by the deployment of small base stations (SBSs) has been considered. For rapid deployment of SBSs in the networks, caching popular content along with new coded caching schemes are proposed. To maximize the cellular network's capacity, densifying it with small base stations is inevitable. In ultra-dense cellular networks, coverage of SBSs may overlap. To this aim, the multi-access caching system, where users potentially can access multiple cache nodes simultaneously, has attracted more attention in recent years. Most previous works on multi-access coded caching, only consider specific conditions such as cyclic wrap-around network topologies. In this paper, we investigate caching in ultra-dense cellular networks, where different users can access different numbers of caches under non-uniform content popularity distribution, and propose Multi-Access Hybrid coded-uncoded Caching (MAHC). We formulate the optimization problem of the proposed scheme for general network topologies and evaluate it for 2-SBS network scenarios. The numerical and simulation results show that the proposed MAHC scheme outperforms optimal conventional uncoded and previous multi-access coded caching (MACC) schemes.
Paper Structure (12 sections, 2 theorems, 16 equations, 3 figures, 1 table)

This paper contains 12 sections, 2 theorems, 16 equations, 3 figures, 1 table.

Table of Contents

  1. Introduction
  2. Background and Related Works
  3. Background on coded and hybrid coded-uncoded caching
  4. Related Works
  5. System Model
  6. Proposed Scheme
  7. The proposed Multi Access Hybrid coded-uncoded Caching ($MAHC$)
  8. Problem Formulation
  9. Performance Analysis
  10. Numerical Results
  11. Conclusion and future works
  12. Lemma1Proof

Key Result

Lemma 1

Let $P_{c,i}$ denote the probability that the number of distinct coded requests from the users who have access only to SBS $c$, denoted by $l_{c}$, is equal to or greater than $i$$i$ refers to the step $i$ of coded caching scheme (please refer to Section hybrid_Back for more detail) (i.e., $P_{c,i}= Also, let $\text{Pr}\{ l_{c}^{(z)} = j \}$ be the probability of having $j$ distinct coded requests

Figures (3)

  • Figure 1: Illustrative system model of caching in dense cellular networks.
  • Figure 2: Network topology for two cache scenario with $Z$ users.
  • Figure 3: Expected traffic load over the shared link in the delivery phase versus (a) the popularity parameter ($\alpha$), (b), the ratio of $S_{intersection}/S_{union}$ and (c) the number of users in the system ($Z$), (results have been normalized to $F$, rectangles indicate the 95% confidence intervals).

Theorems & Definitions (5)

  • Lemma 1
  • proof
  • Proposition 1
  • proof
  • proof