TY - JOUR
T1 - Content delivery in fog-aided small-cell systems with offline and online caching
T2 - An information-theoretic analysis
AU - Azimi, Seyyed Mohammadreza
AU - Simeone, Osvaldo
AU - Tandon, Ravi
N1 - Publisher Copyright:
© 2017 by the authors.
PY - 2017/7/18
Y1 - 2017/7/18
N2 - 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.
AB - 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.
KW - Cloud RAN
KW - Edge caching
KW - Information theory
KW - Interference channel
KW - Latency
UR - http://www.scopus.com/inward/record.url?scp=85024475301&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85024475301&partnerID=8YFLogxK
U2 - 10.3390/e19070366
DO - 10.3390/e19070366
M3 - Article
AN - SCOPUS:85024475301
SN - 1099-4300
VL - 19
JO - Entropy
JF - Entropy
IS - 7
M1 - 366
ER -