| Entropy | 卷:19 |
| Content Delivery in Fog-Aided Small-Cell Systems with Offline and Online Caching: An Information—Theoretic Analysis | |
| Seyyed Mohammadreza Azimi1  Osvaldo Simeone2  Ravi Tandon3  | |
| [1] CWiP, Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA; | |
| [2] Centre for Telecommunications Research, Department of Informatics, King’s College London, London WC2R 2LS, UK; | |
| [3] Department of Electrical and Computer Engineering, The University of Arizona, Tucson, AZ 85721, USA; | |
| 关键词: edge caching; interference channel; information theory; latency; cloud RAN; | |
| DOI : 10.3390/e19070366 | |
| 来源: DOAJ | |
【 摘 要 】
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.
【 授权许可】
Unknown