Work

A Cyclic Placement Strategy for Multi-Access Coded Caching

Year: 2024

Type: conference-paper

Abstract: We investigate the multi-access coded caching problem, which involves$N$files,$K$users, and$K$caches. Each user can access$L$adjacent caches in a cyclic manner. We present a novel coded placement scheme for the case of cache size$M=\displaystyle \frac{K-1}{KL}$, where$\displaystyle \frac{K-1}{L}$is an integer. The scheme is based on coded placement and involves cyclic placement in caches. We show that the scheme achieves a lower worst-case transmission rate than existing schemes in some cases when$N\leq K-L$. As for the case of$N > K-L$, for$N > 2,L=K-1$and cache size$M \in\left[0, \frac{1}{K}\right]$, our proposed achievable scheme is another way to achieve the optimal memory-rate tradeoff, in addition to the scheme proposed by Namboodiri and Rajan.

Source: International Conference on Wireless Communications and Signal Processing (WCSP)

DOI: 10.1109/wcsp62071.2024.10826942

Authors: Zeru Chen, Nan Liu, Wei Kang

Institution: Southeast University

Language: English

Topic: Caching and Content Delivery

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Natural Science Foundation of China, National Mobile Communications Research Laboratory, Southeast University

Awards: G3386364851, 异构服务器下私密信息检索容量的研究