TY - JOUR
T1 - Balancing energy efficiency and hit ratio in social-aware caching
T2 - 2019 IEEE Global Communications Conference, GLOBECOM 2019
AU - Fang, Yan
AU - Chen, Wei
AU - Li, Lixin
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019
Y1 - 2019
N2 - Caching is a promising technique that can effectively reduce peak traffic by pushing popular content items proactively to the users during off- peak hours. Two key performance metrics for proactive caching are the energy efficiency and hit ratio. In this paper, we are interested in balancing the hit ratio and energy efficiency in social-aware proactive caching. More specifically, we present a social behavior driven pushing and caching policy that is capable of maximizing the hit ratio while satisfying the power constraint. For two notable schemes, namely uncoded caching and coded caching, we formulate two optimization problems that give the optimal tradeoff between the energy efficiency and caching hit ratio. Furthermore, the optimal solutions present the energy efficient joint pushing and buffer update polices. Our simulation results show that the social-aware pushing and update policies may bring a significant hit ratio gain when the buffer size is far less than the number of items.
AB - Caching is a promising technique that can effectively reduce peak traffic by pushing popular content items proactively to the users during off- peak hours. Two key performance metrics for proactive caching are the energy efficiency and hit ratio. In this paper, we are interested in balancing the hit ratio and energy efficiency in social-aware proactive caching. More specifically, we present a social behavior driven pushing and caching policy that is capable of maximizing the hit ratio while satisfying the power constraint. For two notable schemes, namely uncoded caching and coded caching, we formulate two optimization problems that give the optimal tradeoff between the energy efficiency and caching hit ratio. Furthermore, the optimal solutions present the energy efficient joint pushing and buffer update polices. Our simulation results show that the social-aware pushing and update policies may bring a significant hit ratio gain when the buffer size is far less than the number of items.
UR - http://www.scopus.com/inward/record.url?scp=85081982429&partnerID=8YFLogxK
U2 - 10.1109/GLOBECOM38437.2019.9013391
DO - 10.1109/GLOBECOM38437.2019.9013391
M3 - 会议文章
AN - SCOPUS:85081982429
SN - 2334-0983
JO - Proceedings - IEEE Global Communications Conference, GLOBECOM
JF - Proceedings - IEEE Global Communications Conference, GLOBECOM
M1 - 9013391
Y2 - 9 December 2019 through 13 December 2019
ER -