# Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching

@article{Tian2017SymmetryOB, title={Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching}, author={Chao Tian}, journal={Entropy}, year={2017}, volume={20} }

We present our recent effort, in the context of the caching systems, in developing a computer-aided approach in the investigation of information systems. Yeung's linear programming (LP) outer bound of the entropy space is our starting point, however our effort goes significantly beyond using it to prove information inequalities. A symmetry-reduced linear program is used to identify the boundary of the memory-transmission-rate tradeoff for several simple cases, for which we can obtain a set of…

## Figures, Tables, and Topics from this paper

## 46 Citations

A computer-aided investigation on the fundamental limits of caching

- Mathematics, Computer ScienceISIT
- 2017

This work considers the optimal memory-transmission-rate tradeoff of caching systems, and shows that by carefully analyzing the joint entropy structure of the outer bounds for certain cases, a novel code construction can be reverse-engineered, which eventually leads to a general class of codes.

Pareto Optimal Schemes in Coded Caching

- Computer Science2019 IEEE International Symposium on Information Theory (ISIT)
- 2019

This paper proves that universal codes do not exist when coding is permitted in the placement phase, and it is proved that Chen’s scheme is Pareto optimal.

On the Fundamental Limits of Coded Caching Systems With Restricted Demand Types

- Computer Science, MathematicsIEEE Transactions on Communications
- 2021

A better understanding of the fundamental limits of coded caching is developed by investigating systems with certain demand type restrictions, including the canonical three-user three-file system, and it is shown that the worst demand type is not the one in which all three files are requested.

On the Fundamental Limit of Coded Caching Systems with a Single Demand Type

- Computer Science2019 IEEE Information Theory Workshop (ITW)
- 2019

It is shown that in the canonical three-user three-file systems, such single demand type systems already provide important insights, and a novel coding scheme is proposed, which provides several optimal memory-transmission operating points.

Communication-optimal coding designs for caching networks

- Computer Science2017 IEEE Information Theory Workshop (ITW)
- 2017

This survey paper reviews three recent main results on cache networks, and presents an order-wise optimal scheme that is independent of the underlying communication network between the server and the users, shown to achieve the minimum delivery delay with a constant factor for all memoryless networks.

Demand-Private Coded Caching and the Exact Trade-off for N=K=2

- Computer Science, Mathematics2020 National Conference on Communications (NCC)
- 2020

This paper first shows that the memory-rate pair (M, min{ N, K}(1- M / N) is achievable under information theoretic demand privacy, while using broadcast transmissions, and shows that perfectly demand-private coded caching rate is order optimal for all parameter regimes.

Fundamental Limits of Demand-Private Coded Caching

- Computer Science, MathematicsArXiv
- 2021

It is demonstrated that, the memoryrate pair (M,min{N,K}(1 −M/N)), which is achievable for non-private schemes with uncoded transmissions, is also achievable under demand privacy.

The Exact Rate Memory Tradeoff for Small Caches with Coded Placement

- Computer Science, MathematicsArXiv
- 2021

The lower bounds demonstrate that the caching scheme introduced by Gómez-Vilardebó is optimal and thus extend the characterization of the exact rate memory tradeoff.

Towards the Exact Memory Rate Tradeoff for the (4,5) Cache Network

- Computer Science2020 International Conference on Signal Processing and Communications (SPCOM)
- 2020

This paper considers the (4, 5) cache network where the server has four files, each of size F bits, and five users are connected to the server through a common shared link, and derives an improved lower bound for the small cache region.

Optimization of Heterogeneous Coded Caching

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2020

An optimization theoretic perspective on the seminal work on the fundamental limits of caching by Maddah-Ali and Niesen is developed, and it is proved that the coded caching scheme presented is the optimal scheme among a large, non-trivial family of possible caching schemes.

## References

SHOWING 1-10 OF 54 REFERENCES

Symmetry, demand types and outer bounds in caching systems

- Mathematics, Computer Science2016 IEEE International Symposium on Information Theory (ISIT)
- 2016

The fundamental limit of coded caching is considered and the symmetry structure in the caching problem is investigated, which is used to show the existence of optimal symmetric solutions, as well as to motivate the notion of demand types.

Characterizing the Rate Region of the (4,3,3) Exact-Repair Regenerating Codes

- Mathematics, Computer ScienceIEEE Journal on Selected Areas in Communications
- 2014

A computer-aided proof approach based on primal and dual relation is developed, which extends Yeung's linear programming method, which was previously only used on information theoretic problems with a few random variables due to the exponential growth of the number of variables in the corresponding LP problem.

Symmetry reduction of information inequalities

- Mathematics, Computer Science2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
- 2016

This work provides a generic method to pinpoint the precise amount of reduction in symmetry in extremal pairwise cyclic entropy inequalities, the regenerating code problem, and the caching problem by viewing the symmetry as an induced permutation group on certain set.

Improved lower bounds for coded caching

- Computer Science, Mathematics2015 IEEE International Symposium on Information Theory (ISIT)
- 2015

This work derives tighter lower bounds on coded caching rates than were known previously and demonstrates that this problem can equivalently be posed as one of optimally labeling the leaves of a directed tree.

Multilevel Diversity Coding Systems: Rate Regions, Codes, Computation, & Forbidden Minors

- Mathematics, Computer ScienceIEEE Transactions on Information Theory
- 2017

The rate regions of multilevel diversity coding systems (MDCSs), a sub-class of the broader family of multi-source multi-sink networks with special structure, are investigated in a systematic way and a series of embedding operations that preserve the property of sufficiency of scalar or vector codes is presented.

Fundamental Limits of Caching

- Computer ScienceIEEE Trans. Inf. Theory
- 2014

This paper proposes a novel coded caching scheme that exploits both local and global caching gains, leading to a multiplicative improvement in the peak rate compared with previously known schemes, and argues that the performance of the proposed scheme is within a constant factor of the information-theoretic optimum for all values of the problem parameters.

On the Symmetry Reduction of Information Inequalities

- Mathematics, Computer ScienceIEEE Transactions on Communications
- 2018

This paper provides a method to pinpoint this reduction by counting the number of orbits induced by the symmetry on the set of the LP variables and the LP constraints, respectively, by using the Pólya counting theorem.

Fundamental Limits of Caching: Improved Bounds For Small Buffer Users

- Computer Science, MathematicsArXiv
- 2014

In this work, the peak rate of the caching problem is investigated, under the scenario that the users are with small buffer sizes and the number of users is no less than the amount of files in the…

Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache Capacity Trade-off

- Computer Science, Mathematics
- 2016

A novel coded caching scheme for the cache capacity of M= (N-1)/K is proposed and it is shown that the proposed scheme achieves a smaller delivery rate than the existing coded caching schemes in the literature when K > N >= 3.

The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2018

A novel caching scheme is proposed, which strictly improves the state of the art by exploiting commonality among user demands and fully characterize the rate-memory tradeoff for a decentralized setting, in which users fill out their cache content without any coordination.