Related papers: Caching with Unknown Popularity Profiles in Small …
In this work, we focus on distributed cache systems with non-uniform storage capacity across caches. We compare the performance of our system with the performance of a system with the same cumulative storage distributed evenly across the…
This paper considers the secretive coded caching problem with shared caches in which no user must have access to the files that it did not demand. In a shared cache network, the users are served by a smaller number of helper caches and each…
This paper aims to characterize the memory-rate tradeoff for decentralized caching under nonuniform file popularity and size. We consider a recently proposed decentralized modified coded caching scheme (D-MCCS) and formulate the cache…
We investigate the problem of coded caching for nonuniform demands when the structured clique cover algorithm proposed by Maddah-Ali and Niesen for decentralized caching is used for delivery. We apply this algorithm to all user demands…
In this book chapter, we study a problem of distributed content caching in an ultra-dense edge caching network (UDCN), in which a large number of small base stations (SBSs) prefetch popular files to cope with the ever-growing user demand in…
Previous works on cache-enabled small-cell networks (SCNs) with probabilistic caching often assume that each user is connected to the nearest small base station (SBS) among all that have cached its desired content. The user may, however,…
We consider a network consisting of a file server connected through a shared link to a number of users, each equipped with a cache. Knowing the popularity distribution of the files, the goal is to optimally populate the caches such as to…
To address the massive growth of data traffic over cellular networks, increasing spatial reuse of the frequency spectrum by the deployment of small base stations (SBSs) has been considered. For rapid deployment of SBSs in the networks,…
Prior works in designing caching policy do not distinguish content popularity with user preference. In this paper, we illustrate the caching gain by exploiting individual user behavior in sending requests. After showing the connection…
We consider the problem of video caching across a set of 5G small-cell base stations (SBS) connected to each other over a high-capacity short-delay back-haul link, and linked to a remote server over a long-delay connection. Even though the…
Caching popular contents at base stations (BSs) is a promising way to unleash the potential of cellular heterogeneous networks (HetNets), where backhaul has become a bottleneck. In this paper, we compare a cache-enabled HetNet where a tier…
Caching at small base stations (SBSs) has demonstrated significant benefits in alleviating the backhaul requirement in heterogeneous cellular networks (HetNets). While many existing works focus on what contents to cache at each SBS, an…
In this paper, we propose a novel secure random caching scheme for large-scale multi-antenna heterogeneous wireless networks, where the base stations (BSs) deliver randomly cached confidential contents to the legitimate users in the…
With the rapid explosion of data volume from mobile networks, edge caching has received significant attentions as an efficient approach to boost content delivery efficiency by bringing contents near users. In this article, cache-enabled…
To understand the spatial deployment of base stations (BSs) is the first step to analyze the performance of cellular networks and further design efficient networking protocols. Poisson point process (PPP), which has been widely adopted to…
It has been recently established that joint design of content delivery and storage (coded caching) can significantly improve performance over conventional caching. This has also been extended to the case when content has non-uniform…
The deployment of small cells, overlaid on existing cellular infrastructure, is seen as a key feature in next-generation cellular systems. In this paper, the problem of user association in the downlink of small cell networks (SCNs) is…
A new scheme for the problem of centralized coded caching with non-uniform demands is proposed. The distinguishing feature of the proposed placement strategy is that it admits equal sub-packetization for all files while allowing the users…
Redundant storage maintains the performance of distributed systems under various forms of uncertainty. This paper considers the uncertainty in node access and download service. We consider two access models under two download service…
In a Poisson Point Process (PPP) network model, in which the locations of Base Stations (BSs) are randomly distributed according to a Spatial Poisson Process, has been recently used as a tractable stochastic model to analyse the performance…