On Decentralized Multi-Transmitter Coded Caching

TL;DR

This paper explores decentralized coded caching with multiple transmitters and clients, analyzing system performance under various cooperation levels and finite file sizes, applicable to wired and wireless networks.

Contribution

It introduces a comprehensive analysis of decentralized caching scenarios with no or limited cooperation, including hybrid placements and finite file size effects.

Findings

Performance bounds for fully decentralized caching

Impact of limited cooperation on caching efficiency

Finite file size effects on system delay

Abstract

This paper investigates a setup consisting of multiple transmitters serving multiple cache-enabled clients through a linear network, which covers both wired and wireless transmission situations. We investigate decentralized coded caching scenarios in which there is either no cooperation or limited cooperation between the clients at the cache content placement phase. For the fully decentralized caching case (i.e., no cooperation) we analyze the performance of the system in terms of the Coding Delay metric. Furthermore, we investigate a hybrid cache content placement scenario in which there are two groups of users with different cache content placement situations (i.e., limited cooperation). Also, we examine the effect of finite file size in above scenarios.