# Routing-Based Delivery in Combination-Type Networks with Random Topology

## TL;DR

This paper extends the MAN coded caching scheme to two-hop relay networks with random topology, optimizing routing via linear programming and a dynamic algorithm, resulting in improved performance over existing schemes.

## Contribution

It introduces a routing-based extension of the MAN caching scheme for combination-type networks with random topology, including an LP formulation and a dynamic algorithm for routing optimization.

## Key findings

- Outperforms existing caching schemes in simulations.
- Routing optimization improves network efficiency.
- Dynamic algorithm reduces computational complexity.

## Abstract

The coded caching scheme proposed by Maddah-Ali and Niesen (MAN) transmits coded multicast messages to users equipped with caches and it is known to be optimal within a constant factor. This work extends this caching scheme to two-hop relay networks with one main server with access to a library of $N$ files, and $H$ relays communicating with $K$ users with cache, each of which is connected to a random subset of relays. This topology can be considered as a generalized version of a celebrated family of networks, referred to as combination networks. Our approach is simply based on routing MAN packets through the network. The optimization of the routing can be formulated as a Linear Program (LP). In addition, to reduce the computation complexity, a dynamic algorithm is proposed to approach the LP solution. Numerical simulations show that the proposed scheme outperforms the existing caching schemes for this class of networks.