Related papers: Effect of Retransmissions on Optimal Caching in Ca…
We investigate the secrecy performance of an underlay small-cell cognitive radio network under unreliable backhaul connections. The small-cell network shares the same spectrum with the primary network, ensuring that a desired outage…
Coded caching utilizes proper file subpacketization and coded delivery to make full use of the multicast opportunities in content delivery, to alleviate file transfer load in massive content delivery scenarios. Most existing work considers…
Nowadays computer networks use different kind of memory whose speeds and capacities vary widely. There exist methods of a so-called caching which are intended to use the different kinds of memory in such a way that the frequently used data…
Most of prior works optimize caching policies based on the following assumptions: 1) every user initiates request according to content popularity, 2) all users are with the same active level, and 3) users are uniformly located in the…
Content delivery networks often employ caching to reduce transmission rates from the central server to the end users. Recently, the technique of coded caching was introduced whereby coding in the caches and coded transmission signals from…
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 paper, we propose a novel wireless caching scheme to enhance the physical layer security of video streaming in cellular networks with limited backhaul capacity. By proactively sharing video data across a subset of base stations…
We investigate optimal geographical caching in heterogeneous cellular networks, where different types of base stations (BSs) have different cache capacities. The content library contains files with different popularities. The performance…
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…
This paper studies content caching in cloud-aided wireless networks where small cell base stations with limited storage are connected to the cloud via limited capacity fronthaul links. By formulating a utility (inverse of service delay)…
Edge networks are promising to provide better services to users by provisioning computing and storage resources at the edge of networks. However, due to the uncertainty and diversity of user interests, content popularity, distributed…
Caching systems have long been crucial for improving the performance of a wide variety of network and web based online applications. In such systems, end-to-end application performance heavily depends on the fraction of objects transferred…
A small-cell network with multiple transmitters and unreliable wireless backhaul is considered for secrecy enhancement. The small-cell network is operating under a spectrum sharing agreement with a primary network in a cognitive radio…
Despite significant progress in the caching literature concerning the worst case and uniform average case regimes, the algorithms for caching with nonuniform demands are still at a basic stage and mostly rely on simple grouping and…
Coded caching has been widely used in the wireless network for shifting the some transmissions during the peak traffic times to the off-peak traffic times. Multi-server coded caching, which can share responsibility for the total amount of…
To improve signal-to-interference ratio (SIR) and make better use of file diversity provided by random caching, we consider two types of linear receivers, i.e., maximal ratio combining (MRC) receiver and partial zero forcing (PZF) receiver,…
In this paper, the problem of content-aware user clustering and content caching in wireless small cell networks is studied. In particular, a service delay minimization problem is formulated, aiming at optimally caching contents at the small…
This paper studies the fundamental limits of the shared-link coded caching problem with correlated files, where a server with a library of $N$ files communicates with $K$ users who can locally cache $M$ files. Given an integer $r \in [N]$,…
In this paper, we address the caching problem in small cell networks from a game theoretic point of view. In particular, we formulate the caching problem as a many-to-many matching game between small base stations and service providers'…
Caching aims to store data locally in some nodes within the network to be able to retrieve the contents in shorter time periods. However, caching in the network did not always consider secure storage (due to the compromise between time…