期刊
2020 IEEE INFORMATION THEORY WORKSHOP (ITW)
卷 -, 期 -, 页码 -出版社
IEEE
DOI: 10.1109/ITW46852.2021.9457599
关键词
-
资金
- Science and Engineering Research Board (SERB) of Department of Science and Technology (DST), Government of India
This study proposes a new caching and coded delivery scheme for multi-access networks, which outperforms other schemes when normalized by the rate of users served.
We present a novel caching and coded delivery scheme for a multi-access network where multiple users can have access to the same cache (shared cache) and any cache can assist multiple users. This scheme is obtained from resolvable designs satisfying certain conditions which we call cross resolvable designs. To be able to compare different multi-access coded schemes with different number of users we normalize the rate of the schemes by the number of users served. Based on this per-user-rate we show that our scheme performs better than the recently proposed (Multi-access coded caching: gains beyond cache-redundancy by Serbetci, Parrinello and Elia) SPE scheme. It is shown that the resolvable designs from affine planes are cross resolvable designs and our scheme can be used based on these. The SPE scheme considers only the cases where the product of the number of users and the normalized cache size is 2, whereas the proposed scheme allows different choices depending on the choice of the cross resolvable design.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据