[Paper Review] Order Optimal Coded Caching-Aided Multicast under Zipf Demand Distributions.

Mingyue Ji, Antonia M. Tulino+2 more|arXiv (Cornell University)|Feb 19, 2014

Caching and Content Delivery11 references15 citations

TL;DR

This paper proposes an order-optimal coded caching-aided multicast scheme for networks with Zipf-distributed file requests, leveraging coded multicasting gains under skewed popularity. It establishes that the achievable average number of transmissions and the information-theoretic outer bound converge to within a constant factor as network size grows, proving near-optimal performance under general Zipf distributions.

ABSTRACT

Caching and multicasting are two key technologies for reducing traffic load in content delivery networks. While uncoded caching based delivery schemes can offer competitive performance under skewed popularity distributions, the use of coded transmission schemes of increased complexity has been recently shown to significantly improve multicast efficiency under flatter popularity distributions, by exploiting coded multicast opportunities created by simple cooperative caching policies. In this paper, we consider a caching network with one source, hosting m files, connected to n destinations, each with a storage capacity of M files, via a shared link. Given that file requests follow a Zipf popularity distribution, our objective is to characterize the minimum average number of transmissions to satisfy all user demands in the information theoretic sense. We present both achievable coded caching-aided multicast schemes and outer bounds for this network configuration and show that as m,n → ∞, for any M , the achievable average number of transmissions and the outer bound meets up to a constant factor.

Motivation & Objective

• To characterize the minimum average number of transmissions required to satisfy all user demands in a caching network with Zipf-distributed file requests.
• To design coded caching-aided multicast schemes that efficiently exploit file popularity skew and coded multicasting opportunities.
• To derive information-theoretic outer bounds to establish fundamental limits on transmission reduction.
• To show that the gap between the achievable scheme and the outer bound is bounded by a constant factor under asymptotic conditions.
• To analyze the performance trade-off between cache size and transmission load under general Zipf popularity distributions.

Proposed method

• Designs a coded caching scheme that leverages file popularity and cooperation among caches to create coded multicasting opportunities.
• Applies a placement strategy that prioritizes popular files in caches based on their Zipf distribution probabilities.
• Uses a delivery scheme that combines coded multicasting with file-level coding to minimize the number of transmissions.
• Derives an outer bound using information-theoretic techniques to establish the fundamental limit on transmission reduction.
• Analyzes the asymptotic behavior as the number of files m and users n tend to infinity, under fixed cache size M.
• Compares the achievable transmission load with the outer bound to prove order-optimality up to a constant factor.

Experimental results

Research questions

• RQ1 How can coded caching be optimized under Zipf-distributed file request patterns to minimize average transmission load?
• RQ2 What is the fundamental limit (outer bound) on the average number of transmissions in such a caching network?
• RQ3 To what extent can coded multicasting gains be exploited under general Zipf popularity distributions?
• RQ4 How close is the performance of the proposed scheme to the information-theoretic limit as the network scales?
• RQ5 Does the gap between the achievable scheme and the outer bound remain bounded by a constant factor in the asymptotic regime?

Key findings

• The proposed coded caching-aided multicast scheme achieves an average number of transmissions that is order-optimal under Zipf-distributed demands.
• As m, n → ∞ and for any fixed M, the ratio between the achievable transmission load and the outer bound is bounded by a constant factor.
• The scheme effectively exploits file popularity skew and coded multicasting gains, especially in scenarios with flatter popularity distributions.
• The outer bound derived provides a tight fundamental limit on the minimum average number of transmissions required.
• The performance gap between the achievable scheme and the theoretical limit remains bounded regardless of the Zipf parameter, demonstrating robustness.
• The results confirm that coded caching significantly improves multicast efficiency under general popularity distributions, especially when uncoded schemes are suboptimal.