Spatially Correlated Placement Policies for Wireless Content Caching Networks

被引:0
作者
Chen, Shukai [1 ]
Malak, Derya [2 ]
Abouzeid, Alhussein A. [1 ]
机构
[1] Rensselaer Polytech Inst, Troy, NY 12181 USA
[2] EURECOM, Biot, Sophia Antipolis, France
来源
ICC 2023-IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS | 2023年
基金
欧洲研究理事会; 美国国家科学基金会;
关键词
Edge caching; Poisson network; content popularity; hit probability; optimization; OPTIMIZATION;
D O I
10.1109/ICC45041.2023.10278651
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
We propose a geographic content placement policy for wireless caching networks. This policy, named Joint Caching Policy (JCP), jointly determines the caching strategy across the set of base stations (BSs) to improve the hit probability of an arbitrarily located user in the network versus caching policies where placement is independent and identically distributed across the BSs. To that end, JCP divides the BSs into groups, and executes a joint caching policy for each group, while content placement is independent across the groups. Existing joint caching policies require knowledge of user location to optimize content placement. On the other hand, JCP does not require any information on user location, and it provides a content placement policy that outperforms the one given by Independent Caching Policy (ICP), proposed by Blaszczyszyn and Giovanidis in 2015, under any user location distribution. We prove that the hit probability under JCP is lower bounded by that of ICP. We further propose an extension of JCP, named JCP-OPT, which improves the hit probability over JCP by solving a concave maximization problem, provided that there is side information about the user locations. We validate the performance of JCP and JCP-OPT via numerical evaluations and demonstrate that they can provide up to a 30% gain in hit probability over ICP.
引用
收藏
页码:6255 / 6260
页数:6
相关论文
共 26 条
[1]  
Altman E, 2014, 2014 IFIP NETWORKING CONFERENCE
[2]  
Avrachenkov K, 2017, P ACM MEAS ANAL COMP, V1, DOI 10.1145/3084465
[3]   Optimization of caching devices with geometric constraints [J].
Avrachenkov, Konstantin ;
Bai, Xinwei ;
Goseling, Jasper .
PERFORMANCE EVALUATION, 2017, 113 :68-82
[4]   Stochastic Geometry and Wireless Networks: Volume II Applications [J].
Baccelli, Francois ;
Blaszczyszyn, Bartlomiej .
FOUNDATIONS AND TRENDS IN NETWORKING, 2009, 4 (1-2) :1-302
[5]   Adaptive TTL-Based Caching for Content Delivery [J].
Basu, Soumya ;
Sundarrajan, Aditya ;
Ghaderi, Javad ;
Shakkottai, Sanjay ;
Sitaraman, Ramesh .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (03) :1063-1077
[6]  
Blaszczyszyn B, 2015, IEEE ICC, P3358, DOI 10.1109/ICC.2015.7248843
[7]   Learning to Cache and Caching to Learn: Regret Analysis of Caching Algorithms [J].
Bura, Archana ;
Rengarajan, Desik ;
Kalathil, Dileep ;
Shakkottai, Srinivas ;
Chamberland, Jean-Francois .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2022, 30 (01) :18-31
[8]   Gibbsian On-Line Distributed Content Caching Strategy for Cellular Networks [J].
Chattopadhyay, Arpan ;
Blaszczyszyn, Bartlomiej ;
Keeler, H. Paul .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (02) :969-981
[9]  
Chen S., 2022, SPATIALLY CORRELATED
[10]   TinyLFU: A Highly Efficient Cache Admission Policy [J].
Einziger, Gil ;
Friedman, Roy ;
Manes, Ben .
ACM TRANSACTIONS ON STORAGE, 2017, 13 (04)