1,701 research outputs found
Optimal Geographic Caching In Cellular Networks
In this work we consider the problem of an optimal geographic placement of
content in wireless cellular networks modelled by Poisson point processes.
Specifically, for the typical user requesting some particular content and whose
popularity follows a given law (e.g. Zipf), we calculate the probability of
finding the content cached in one of the base stations. Wireless coverage
follows the usual signal-to-interference-and noise ratio (SINR) model, or some
variants of it. We formulate and solve the problem of an optimal randomized
content placement policy, to maximize the user's hit probability. The result
dictates that it is not always optimal to follow the standard policy "cache the
most popular content, everywhere". In fact, our numerical results regarding
three different coverage scenarios, show that the optimal policy significantly
increases the chances of hit under high-coverage regime, i.e., when the
probabilities of coverage by more than just one station are high enough.Comment: 6 pages, 6 figures, conferenc
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints
We consider caching in cellular networks in which each base station is
equipped with a cache that can store a limited number of files. The popularity
of the files is known and the goal is to place files in the caches such that
the probability that a user at an arbitrary location in the plane will find the
file that she requires in one of the covering caches is maximized.
We develop distributed asynchronous algorithms for deciding which contents to
store in which cache. Such cooperative algorithms require communication only
between caches with overlapping coverage areas and can operate in asynchronous
manner. The development of the algorithms is principally based on an
observation that the problem can be viewed as a potential game. Our basic
algorithm is derived from the best response dynamics. We demonstrate that the
complexity of each best response step is independent of the number of files,
linear in the cache capacity and linear in the maximum number of base stations
that cover a certain area. Then, we show that the overall algorithm complexity
for a discrete cache placement is polynomial in both network size and catalog
size. In practical examples, the algorithm converges in just a few iterations.
Also, in most cases of interest, the basic algorithm finds the best Nash
equilibrium corresponding to the global optimum. We provide two extensions of
our basic algorithm based on stochastic and deterministic simulated annealing
which find the global optimum.
Finally, we demonstrate the hit probability evolution on real and synthetic
networks numerically and show that our distributed caching algorithm performs
significantly better than storing the most popular content, probabilistic
content placement policy and Multi-LRU caching policies.Comment: 24 pages, 9 figures, presented at SIGMETRICS'1
Optimizing The Spatial Content Caching Distribution for Device-to-Device Communications
We study the optimal geographic content placement problem for
device-to-device (D2D) networks in which the content popularity follows the
Zipf law. We consider a D2D caching model where the locations of the D2D users
(caches) are modeled by a Poisson point process (PPP) and have limited
communication range and finite storage. Unlike most related work which assumes
independent placement of content, and does not capture the locations of the
users, we model the spatial properties of the network including spatial
correlation in terms of the cached content. We propose two novel spatial
correlation models, the exchangeable content model and a Mat\'{e}rn (MHC)
content placement model, and analyze and optimize the \emph{hit probability},
which is the probability of a given D2D node finding a desired file at another
node within its communication range. We contrast these results to the
independent placement model, and show that exchangeable placement performs
worse. On the other hand, MHC placement yields a higher cache hit probability
than independent placement for small cache sizes.Comment: appeared in Proc. IEEE Intl. Symposium on Info. Theory, Barcelona,
Spain, July 201
Mitigating Interference in Content Delivery Networks by Spatial Signal Alignment: The Approach of Shot-Noise Ratio
Multimedia content especially videos is expected to dominate data traffic in
next-generation mobile networks. Caching popular content at the network edge
has emerged to be a solution for low-latency content delivery. Compared with
the traditional wireless communication, content delivery has a key
characteristic that many signals coexisting in the air carry identical popular
content. They, however, can interfere with each other at a receiver if their
modulation-and-coding (MAC) schemes are adapted to individual channels
following the classic approach. To address this issue, we present a novel idea
of content adaptive MAC (CAMAC) where adapting MAC schemes to content ensures
that all signals carry identical content are encoded using an identical MAC
scheme, achieving spatial MAC alignment. Consequently, interference can be
harnessed as signals, to improve the reliability of wireless delivery. In the
remaining part of the paper, we focus on quantifying the gain CAMAC can bring
to a content-delivery network using a stochastic-geometry model. Specifically,
content helpers are distributed as a Poisson point process, each of which
transmits a file from a content database based on a given popularity
distribution. It is discovered that the successful content-delivery probability
is closely related to the distribution of the ratio of two independent shot
noise processes, named a shot-noise ratio. The distribution itself is an open
mathematical problem that we tackle in this work. Using stable-distribution
theory and tools from stochastic geometry, the distribution function is derived
in closed form. Extending the result in the context of content-delivery
networks with CAMAC yields the content-delivery probability in different closed
forms. In addition, the gain in the probability due to CAMAC is shown to grow
with the level of skewness in the content popularity distribution.Comment: 32 pages, to appear in IEEE Trans. on Wireless Communicatio
- …