An Optimal Decentralized Multi-access Coded Caching System
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911928926863360 |
|---|---|
| author | Dutta, Monolina Thomas, Anoop Rajan, B. Sundar |
| author_facet | Dutta, Monolina Thomas, Anoop Rajan, B. Sundar |
| contents | In this paper, we consider a multi-access coded caching system with decentralized prefetching, where a server hosts $N$ files, each of size $F$ bits, and is connected to $K$ users through a shared link. There are $c$ caches distributed across the network and each of the $K$ users connects to a random set of $r\leq c$ caches. Initially, we consider the model in which each of the cache subsets is accessed by exactly a specific number of users. For this model, a novel linear delivery scheme is introduced, using which the closed-form expression for the per-user delivery rate is computed. Furthermore, using techniques from index coding, the optimality of the proposed linear delivery scheme among all linear delivery schemes is proved. The results of the decentralized shared caching and conventional decentralized caching schemes are recovered as special cases of the proposed model. The model is further generalized by allowing each cache subset to serve any number of users. This enhances the flexibility of the system, enabling it to accommodate any arbitrary number of users. A delivery scheme is proposed for the generalized model and is shown to be optimal for certain user-to-cache associations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2203_16845 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | An Optimal Decentralized Multi-access Coded Caching System Dutta, Monolina Thomas, Anoop Rajan, B. Sundar Information Theory In this paper, we consider a multi-access coded caching system with decentralized prefetching, where a server hosts $N$ files, each of size $F$ bits, and is connected to $K$ users through a shared link. There are $c$ caches distributed across the network and each of the $K$ users connects to a random set of $r\leq c$ caches. Initially, we consider the model in which each of the cache subsets is accessed by exactly a specific number of users. For this model, a novel linear delivery scheme is introduced, using which the closed-form expression for the per-user delivery rate is computed. Furthermore, using techniques from index coding, the optimality of the proposed linear delivery scheme among all linear delivery schemes is proved. The results of the decentralized shared caching and conventional decentralized caching schemes are recovered as special cases of the proposed model. The model is further generalized by allowing each cache subset to serve any number of users. This enhances the flexibility of the system, enabling it to accommodate any arbitrary number of users. A delivery scheme is proposed for the generalized model and is shown to be optimal for certain user-to-cache associations. |
| title | An Optimal Decentralized Multi-access Coded Caching System |
| topic | Information Theory |
| url | https://arxiv.org/abs/2203.16845 |