TY - GEN
T1 - Online edge caching in fog-aided wireless networks
AU - Azimi, Seyyed Mohammadreza
AU - Simeone, Osvaldo
AU - Sengupta, Avik
AU - Tandon, Ravi
N1 - Funding Information:
The work of S.M. Azimi and O. Simeone was partially supported by the U.S. NSF through grant CCF-1525629.
Publisher Copyright:
© 2017 IEEE.
PY - 2017/8/9
Y1 - 2017/8/9
N2 - In a Fog Radio Access Network (F-RAN) architecture, edge nodes (ENs), such as base stations, are equipped with limited-capacity caches, as well as with fronthaul links that can support given transmission rates from a cloud processor. Existing information-theoretic analyses of content delivery in F-RANs have focused on offline caching with separate content placement and delivery phases. In contrast, this work considers an online caching set-up, in which the set of popular files is time-varying and both cache replenishment and content delivery can take place in each time slot. The analysis is centered on the characterization of the long-term Normalized Delivery Time (NDT), which captures the temporal dependence of the coding latencies accrued across multiple time slots in the high signal-to-noise ratio regime. Online caching and delivery schemes based on reactive and proactive caching are investigated, and their performance is compared to optimal offline caching schemes both analytically and via numerical results.
AB - In a Fog Radio Access Network (F-RAN) architecture, edge nodes (ENs), such as base stations, are equipped with limited-capacity caches, as well as with fronthaul links that can support given transmission rates from a cloud processor. Existing information-theoretic analyses of content delivery in F-RANs have focused on offline caching with separate content placement and delivery phases. In contrast, this work considers an online caching set-up, in which the set of popular files is time-varying and both cache replenishment and content delivery can take place in each time slot. The analysis is centered on the characterization of the long-term Normalized Delivery Time (NDT), which captures the temporal dependence of the coding latencies accrued across multiple time slots in the high signal-to-noise ratio regime. Online caching and delivery schemes based on reactive and proactive caching are investigated, and their performance is compared to optimal offline caching schemes both analytically and via numerical results.
KW - C-RAN
KW - Edge caching
KW - Online caching
UR - http://www.scopus.com/inward/record.url?scp=85034022459&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85034022459&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2017.8006722
DO - 10.1109/ISIT.2017.8006722
M3 - Conference contribution
AN - SCOPUS:85034022459
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1217
EP - 1221
BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017
Y2 - 25 June 2017 through 30 June 2017
ER -