TY - GEN
T1 - Dynamic edge caching with popularity drifting
AU - Song, Linqi
AU - Xu, Jie
N1 - Publisher Copyright:
© 2018 IEEE Information Theory Workshop, ITW 2018. All rights reserved.
Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.
PY - 2019/1/15
Y1 - 2019/1/15
N2 - Caching at the network edge devices such as wireless caching stations (WCS) is a key technology in the 5G network. The spatial-temporal diversity of content popularity requires different content to be cached in different WCSs and periodically updated to adapt to temporal changes. In this paper, we study how the popularity drifting speed affects the number of required broadcast transmissions by the MBS and then design coded transmission schemes by leveraging the broadcast advantage under the index coding framework. The key idea is that files already cached in WCSs, which although may be currently unpopular, can serve as side information to facilitate coded broadcast transmission for cache updating. Our algorithm extends existing index coding-based schemes from a single-request scenario to a multiple-request scenario via a “dynamic coloring” approach. Simulation results indicate that a significant bandwidth saving can be achieved by adopting our scheme.
AB - Caching at the network edge devices such as wireless caching stations (WCS) is a key technology in the 5G network. The spatial-temporal diversity of content popularity requires different content to be cached in different WCSs and periodically updated to adapt to temporal changes. In this paper, we study how the popularity drifting speed affects the number of required broadcast transmissions by the MBS and then design coded transmission schemes by leveraging the broadcast advantage under the index coding framework. The key idea is that files already cached in WCSs, which although may be currently unpopular, can serve as side information to facilitate coded broadcast transmission for cache updating. Our algorithm extends existing index coding-based schemes from a single-request scenario to a multiple-request scenario via a “dynamic coloring” approach. Simulation results indicate that a significant bandwidth saving can be achieved by adopting our scheme.
UR - http://www.scopus.com/inward/record.url?scp=85062106992&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85062106992&partnerID=8YFLogxK
U2 - 10.1109/ITW.2018.8613493
DO - 10.1109/ITW.2018.8613493
M3 - Conference contribution
AN - SCOPUS:85062106992
T3 - 2018 IEEE Information Theory Workshop, ITW 2018
BT - 2018 IEEE Information Theory Workshop, ITW 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE Information Theory Workshop, ITW 2018
Y2 - 25 November 2018 through 29 November 2018
ER -