2,746 research outputs found
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
Cross-Layer Optimization of Fast Video Delivery in Cache-Enabled Relaying Networks
This paper investigates the cross-layer optimization of fast video delivery
and caching for minimization of the overall video delivery time in a two-hop
relaying network. The half-duplex relay nodes are equipped with both a cache
and a buffer which facilitate joint scheduling of fetching and delivery to
exploit the channel diversity for improving the overall delivery performance.
The fast delivery control is formulated as a two-stage functional non-convex
optimization problem. By exploiting the underlying convex and quasi-convex
structures, the problem can be solved exactly and efficiently by the developed
algorithm. Simulation results show that significant caching and buffering gains
can be achieved with the proposed framework, which translates into a reduction
of the overall video delivery time. Besides, a trade-off between caching and
buffering gains is unveiled.Comment: 7 pages, 4 figures; accepted for presentation at IEEE Globecom, San
Diego, CA, Dec. 201
- …