Cache aided wireless networks: Tradeoffs between storage and latency
Document Type
Conference Proceeding
Publication Date
4-26-2016
Abstract
We investigate the fundamental information theoretic limits of cache-aided wireless networks, where edge nodes (or transmitters) are endowed with caches that can store popular content such as multimedia files. This architecture aims to localize popular multimedia content by proactively pushing it closer to the edge of the wireless network, thereby alleviating backhaul load. An information theoretic model of such networks is presented, that includes the introduction of a new metric, namely normalized delivery time (NDT), which captures the worst case time to deliver any requested content to the users. We present new results on the trade-off between latency, measured via the NDT, and the cache storage capacity of the edge nodes. In particular, a novel information theoretic lower bound on NDT is presented for cache aided networks. The optimality of this bound is shown for several system parameters.
Identifier
84992426938 (Scopus)
ISBN
[9781467394574]
Publication Title
2016 50th Annual Conference on Information Systems and Sciences Ciss 2016
External Full Text Location
https://doi.org/10.1109/CISS.2016.7460522
First Page
320
Last Page
325
Recommended Citation
Sengupta, Avik; Tandon, Ravi; and Simeone, Osvaldo, "Cache aided wireless networks: Tradeoffs between storage and latency" (2016). Faculty Publications. 10572.
https://digitalcommons.njit.edu/fac_pubs/10572
