蜂窝异构网络中基于隐马尔可夫的内容缓存策略
摘要
蜂窝异构网络中,将流行度高的内容缓存到用户侧,可以有效的减少小/微基站间的共享数据量,提高系统效率,降低系统能耗,同时还降低宏蜂窝基站回程负担。然而由于小/微基站的缓存容量有限,如何利用小/微基站有限的缓存空间以提高缓存效益是蜂窝异构网络中内容缓存面临的主要挑战之一。本文依据内容流行度与用户请求,考虑基站之间的协作关系,将蜂窝异构网络中内容缓存与共享转化为一个隐马尔可夫模型,依据小/微基站间的协作关系以及用户请求,计算流行内容在小/微基站中的缓存状态概率,最后依据小/微基站的缓存空间以及内容的状态概率优化缓存策略。
引文
[1]S.Singh,H.S.Dhillon,and J.G.Andrews,“Offloading in heterogeneous networks:Modeling,analysis,and design insights,”IEEE Trans.Wireless Commun.,vol.12,no.5,pp.2484-2497,May 2013.
[2]K.Poularakis,G.Iosifidis,and L.Tassiulas,“Approximation algorithms for mobile data caching in small cell networks,”IEEETrans.Commun.,vol.62,no.10,pp.3665-3677,Oct.2014
[3]M.Dehghan,A.Seetharam,B.Jiang,T.He,T.Salonidis,J.Kurose,D.Towsley,and R.Sitaraman,“On the complexity of optimal routing and content caching in heterogeneous networks,”in Proc.INFOCOM,April 26-May 1 2015.
[4]B.Zhou,Y.Cui,and M.Tao,“Stochastic content-centric multicast scheduling for cache-enabled heterogeneous cellular networks,”IEEE Trans.Wireless Commun.,vol.15,no.9,pp.1536-1276,Sep.2016.
[5]G.Bottazzi,D.Pirino,F.Tamagni,“Zipf law and the firm size distribution:a critical discussion of popular estimators[J],”Journal of Evolutionary Economics,vol.25,no.3,pp.585-610,2015.
[2]K.Poularakis,G.Iosifidis,and L.Tassiulas,“Approximation algorithms for mobile data caching in small cell networks,”IEEETrans.Commun.,vol.62,no.10,pp.3665-3677,Oct.2014
[3]M.Dehghan,A.Seetharam,B.Jiang,T.He,T.Salonidis,J.Kurose,D.Towsley,and R.Sitaraman,“On the complexity of optimal routing and content caching in heterogeneous networks,”in Proc.INFOCOM,April 26-May 1 2015.
[4]B.Zhou,Y.Cui,and M.Tao,“Stochastic content-centric multicast scheduling for cache-enabled heterogeneous cellular networks,”IEEE Trans.Wireless Commun.,vol.15,no.9,pp.1536-1276,Sep.2016.
[5]G.Bottazzi,D.Pirino,F.Tamagni,“Zipf law and the firm size distribution:a critical discussion of popular estimators[J],”Journal of Evolutionary Economics,vol.25,no.3,pp.585-610,2015.