The storage of frequently requested multimedia content at small-cell base stations (BSs) can reduce the load of macro-BSs without relying on high-speed backhaul links. In this work, the optimal operation of a system consisting of a cache-aided small-cell BS and a macro-BS is investigated for both offline and online caching settings. In particular, a binary fading one-sided interference channel is considered in which the small-cell BS, whose transmission is interfered by the macro-BS, has a limited-capacity cache. The delivery time per bit (DTB) is adopted as a measure of the coding latency, that is, the duration of the transmission block, required for reliable delivery. For offline caching, assuming a static set of popular contents, the minimum achievable DTB is characterized through information-theoretic achievability and converse arguments as a function of the cache capacity and of the capacity of the backhaul link connecting cloud and small-cell BS. For online caching, under a time-varying set of popular contents, the long-term (average) DTB is evaluated for both proactive and reactive caching policies. Furthermore, a converse argument is developed to characterize the minimum achievable long-term DTB for online caching in terms of the minimum achievable DTB for offline caching. The performance of both online and offline caching is finally compared using numerical results.
Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/625476 |
Date | 18 July 2017 |
Creators | Azimi, Seyyed, Simeone, Osvaldo, Tandon, Ravi |
Contributors | Univ Arizona, Dept Elect & Comp Engn |
Publisher | MDPI AG |
Source Sets | University of Arizona |
Language | English |
Detected Language | English |
Type | Article |
Rights | © 2017 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license. |
Relation | http://www.mdpi.com/1099-4300/19/7/366 |
Page generated in 0.002 seconds