dorsal/arxiv
View SchemaMultiaccess Coded Caching with Heterogeneous Retrieval Costs
| Authors | Wenbo Huang, Minquan Cheng, Kai Wan, Xiaojun Li, Robert Caiming Qiu, Giuseppe Caire |
|---|---|
| Categories | |
| ArXiv ID | 2601.10394vv2 |
| URL | https://arxiv.org/abs/2601.10394 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
The multiaccess coded caching (MACC) system, as formulated by Hachem {\it et al.}, consists of a central server with a library of $N$ files, connected to $K$ cache-less users via an error-free shared link, and $K$ cache nodes, each equipped with cache memory of size $M$ files. Each user can access $L$ neighboring cache nodes under a cyclic wrap-around topology. Most existing studies operate under the strong assumption that users can retrieve content from their connected cache nodes at no communication cost. In practice, each user retrieves content from its $L$ different connected cache nodes at varying costs. Additionally, the server also incurs certain costs to transmit the content to the users. In this paper, we focus on a cost-aware MACC system and aim to minimize the total system cost, which includes cache-access costs and broadcast costs. Firstly, we propose a novel coded caching framework based on superposition coding, where the MACC schemes of Cheng \textit{et al.} are layered. Then, a cost-aware optimization problem is derived that optimizes cache placement and minimizes system cost. By identifying a sparsity property of the optimal solution, we propose a structure-aware algorithm with reduced complexity. Simulation results demonstrate that our proposed scheme consistently outperforms the scheme of Cheng {\it et al.} in scenarios with heterogeneous retrieval costs.
{
"annotation_id": "01077cb7-3e9c-4462-adea-c58ed05512cd",
"date_created": "2026-02-17T05:53:24.175000Z",
"date_modified": "2026-02-17T05:53:24.175000Z",
"file_hash": "037e9b1830e133c5480ee554b63d96e449df4102568b2627be4595265632c20b",
"private": false,
"record": {
"abstract": "The multiaccess coded caching (MACC) system, as formulated by Hachem {\\it et al.}, consists of a central server with a library of $N$ files, connected to $K$ cache-less users via an error-free shared link, and $K$ cache nodes, each equipped with cache memory of size $M$ files. Each user can access $L$ neighboring cache nodes under a cyclic wrap-around topology. Most existing studies operate under the strong assumption that users can retrieve content from their connected cache nodes at no communication cost. In practice, each user retrieves content from its $L$ different connected cache nodes at varying costs. Additionally, the server also incurs certain costs to transmit the content to the users. In this paper, we focus on a cost-aware MACC system and aim to minimize the total system cost, which includes cache-access costs and broadcast costs. Firstly, we propose a novel coded caching framework based on superposition coding, where the MACC schemes of Cheng \\textit{et al.} are layered. Then, a cost-aware optimization problem is derived that optimizes cache placement and minimizes system cost. By identifying a sparsity property of the optimal solution, we propose a structure-aware algorithm with reduced complexity. Simulation results demonstrate that our proposed scheme consistently outperforms the scheme of Cheng {\\it et al.} in scenarios with heterogeneous retrieval costs.",
"arxiv_id": "2601.10394",
"authors": [
"Wenbo Huang",
"Minquan Cheng",
"Kai Wan",
"Xiaojun Li",
"Robert Caiming Qiu",
"Giuseppe Caire"
],
"categories": [
"cs.IT",
"math.IT"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Multiaccess Coded Caching with Heterogeneous Retrieval Costs",
"url": "https://arxiv.org/abs/2601.10394",
"version": "v2"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "977496df-4962-4aec-b3c4-d04d0b265e2d",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}