English
Related papers

Related papers: A Novel Transformation Approach of Shared-link Cod…

200 papers

Recently Hachem et al. formulated a multiaccess coded caching model which consists of a central server connected to $K$ users via an error-free shared link, and $K$ cache-nodes. Each cache-node is equipped with a local cache and each user…

Information Theory · Computer Science 2021-07-01 Dequan Liang , Kai Wan , Minquan Cheng , Giuseppe Caire

Maddah-Ali and Niesen's original coded caching scheme for shared-link broadcast networks is now known to be optimal to within a factor two, and has been applied to other types of networks. For practical reasons, this paper considers that a…

Information Theory · Computer Science 2018-04-06 Kai Wan , Mingyue Ji , Pablo Piantanida , Daniela Tuninetti

This paper studies a novel multi-access coded caching (MACC) model in the two-dimensional (2D) topology, which is a generalization of the one-dimensional (1D) MACC model proposed by Hachem et al. The 2D MACC model is formed by a server…

Information Theory · Computer Science 2022-06-24 Mingming Zhang , Kai Wan , Minquan Cheng , Giuseppe Caire

Caching is an efficient way to reduce network traffic congestion during peak hours by storing some content at the users' local caches. For the shared-link network with end-user-caches, Maddah-Ali and Niesen proposed a two-phase coded…

Information Theory · Computer Science 2021-11-08 Kai Wan , Daniela Tuninetti , Mingyue Ji , Pablo Piantanida

We consider the $(K,L,M,N)$ multi-access coded caching system introduced by Hachem et al., which consists of a central server with $N$ files and $K$ cache nodes, each of memory size $M$, where each user can access $L$ cache nodes in a…

Information Theory · Computer Science 2026-03-17 Mengyuan Li , Minquan Cheng , Kai Wan , Giuseppe Caire

We investigate the multi-access coded caching problem, which involves $N$ files, $K$ users, and $K$ caches in this paper. Each user can access $L$ adjacent caches in a cyclic manner. We present a coded placement scheme for the case of cache…

Information Theory · Computer Science 2023-12-11 Zeru Chen , Nan Liu , Wei Kang

We consider the multi-access coded caching problem, which contains a central server with $N$ files, $K$ caches with $M$ units of memory each and $K$ users where each one is connected to $L (\geq 1)$ consecutive caches, with a cyclic…

Information Theory · Computer Science 2023-05-10 Srinivas Reddy Kota , Nikhil Karamchandani

Caching is an efficient way to reduce network traffic congestion during peak hours by storing some content at the user's local cache memory without knowledge of later demands. For the shared-link caching model, Maddah-Ali and Niesen (MAN)…

Information Theory · Computer Science 2020-06-22 Kai Wan , Giuseppe Caire

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…

Information Theory · Computer Science 2026-01-19 Wenbo Huang , Minquan Cheng , Kai Wan , Xiaojun Li , Robert Caiming Qiu , Giuseppe Caire

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…

Information Theory · Computer Science 2024-06-25 Monolina Dutta , Anoop Thomas , B. Sundar Rajan

The multi-access variant of the coded caching problem in the presence of an external wiretapper is investigated . A multi-access coded caching scheme with $K$ users, $K$ caches and $N$ files, where each user has access to $L$ neighbouring…

Information Theory · Computer Science 2021-05-13 K. K. Krishnan Namboodiri , B. Sundar Rajan

Caching is an efficient way to reduce peak hour network traffic congestion by storing some contents at the user's cache without knowledge of later demands. Coded caching strategy was originally proposed by Maddah-Ali and Niesen to give an…

Information Theory · Computer Science 2018-03-19 Kai Wan , Daniela Tuninetti , Pablo Piantanida , Mingyue Ji

This paper presents a novel achievable scheme for coded caching systems with $N$ files and $K$ users, specifically when $N \leq K$. This new scheme employs linear coding both during the placement phase - where cache contents are linear…

Information Theory · Computer Science 2024-06-11 Yinbin Ma , Daniela Tuninetti

We consider multi-access coded caching problem introduced by Hachem et.al., where each user has access to $L$ neighboring caches in a cyclic wrap-around fashion. We focus on the deterministic schemes for a specific class of multi-access…

Information Theory · Computer Science 2021-02-26 Shanuja Sasi , B. Sundar Rajan

Caching appears to be an efficient way to reduce peak hour network traffic congestion by storing some content at the user's cache without knowledge of later demands. Recently, Maddah-Ali and Niesen proposed a two-phase, placement and…

Information Theory · Computer Science 2016-01-28 Kai Wan , Daniela Tuninetti , Pablo Piantanida

The coded caching scheme originally proposed by Maddah-Ali and Niesen (MAN) transmits coded multicast messages from a server to users equipped with caches via a capacitated shared-link and was shown to be information theoretically optimal…

Information Theory · Computer Science 2020-08-21 Mozhgan Bayat , Kai Wan , Giuseppe Caire

Caching at the wireless edge nodes is a promising way to boost the spatial and spectral efficiency, for the sake of alleviating networks from content-related traffic. Coded caching originally introduced by Maddah-Ali and Niesen…

Information Theory · Computer Science 2022-03-18 Kai Wan , Minquan Cheng , Mari Kobayashi , Giuseppe Caire

This paper studies a multiaccess coded caching (MACC) where the connectivity topology between the users and the caches can be described by a class of combinatorial designs. Our model includes as special cases several MACC topologies…

Information Theory · Computer Science 2023-11-01 Minquan Cheng , Kai Wan , Petros Elia , Giuseppe Caire

Maddah-Ali and Niesen (MAN) in 2014 surprisingly showed that it is possible to serve an arbitrarily large number of cache-equipped users with a constant number of transmissions by using coded caching in shared-link broadcast networks. This…

Information Theory · Computer Science 2018-03-01 Kai Wan , Mingyue Ji , Pablo Piantanida , Daniela Tuninetti

We study the problem of multi-access coded caching (MACC): a central server has $N$ files, $K$ ($K \leq N$) caches each of which stores $M$ out of the $N$ files, $K$ users each of which demands one out of the $N$ files, and each user…

Information Theory · Computer Science 2022-02-14 Niladri Das , B. Sundar Rajan
‹ Prev 1 2 3 10 Next ›