pith. sign in

arxiv: 1603.04574 · v3 · pith:VS332SIBnew · submitted 2016-03-15 · 💻 cs.IT · math.IT

Caching in Wireless Small Cell Networks: A Storage-Bandwidth Tradeoff

classification 💻 cs.IT math.IT
keywords cachinggivenpopularityprobabilitybasecacheaccordingcache-miss
0
0 comments X
read the original abstract

Caching contents at the network edge is an efficient mean for offloading traffic, reducing latency and improving users' quality-of-experience. In this letter, we focus on aspects of storage-bandwidth tradeoffs in which small cell base stations are distributed according to a homogeneous Poisson point process and cache contents according to a given content popularity distribution, subject to storage constraints. We provide a closed-form expression of the cache-miss probability, defined as the probability of not satisfying users' requests over a given coverage area, as a function of signal-to-interference ratio, cache size, base stations density and content popularity. In particular, it is shown that for a given minimum cache size, the popularity based caching strategy achieves lower outage probability for a given base station density compared to uniform caching. Furthermore, we show that popularity based caching attains better performance in terms of cache-miss probability for the same amount of spectrum.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.