Optimal Content Caching and Recommendation With Age of Information

被引:10
作者
Ahani, Ghafour [1 ,2 ]
Yuan, Di [2 ]
机构
[1] Komar Univ Sci & Technol, Dept Comp Sci, Sulaymaniyah 75105, Iraq
[2] Uppsala Univ, Dept Informat Technol, S-75236 Uppsala, Sweden
关键词
Age of information; caching; content recommendation; scheduling; DELIVERY;
D O I
10.1109/TMC.2022.3213782
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Content caching at the network edge is an effective way of mitigating backhaul load and improving user experience. Caching efficiency can be enhanced by content recommendation and by keeping the information fresh. By content recommendation, a requested content that is not in the cache can be alternatively satisfied by a related cached content recommended by the system. Information freshness can be quantified by age of information (AoI). This article has the following contributions. First, we address optimal scheduling of cache updates for a time-slotted system accounting for content recommendation and AoI, and to the best of our knowledge, there is no work that has jointly taken into account these aspects. Next, we rigorously prove the problem's NP-hardness. Then, we derive an integer linear formulation, by which the optimal solution can be obtained for small-scale scenarios. On the algorithmic side, our contributions include the development of an effective algorithm based on Lagrangian decomposition, and efficient algorithms for solving the resulting subproblems. Our algorithm computes a bound that can be used to evaluate the performance of any suboptimal solution. We conduct simulations to show the effectiveness of our algorithm.
引用
收藏
页码:689 / 704
页数:16
相关论文
共 47 条
[1]   Fresh Caching for Dynamic Content [J].
Abolhassani, Bahman ;
Tadrous, John ;
Eryilmaz, Atilla ;
Yeh, Edmund .
IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021), 2021,
[2]   Accounting for Information Freshness in Scheduling of Content Caching [J].
Ahani, Ghafour ;
Yuan, Di .
ICC 2020 - 2020 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2020,
[3]   Optimal Scheduling of Age-Centric Caching: Tractability and Computation [J].
Ahani, Ghafour ;
Yuan, Di ;
Sun, Sumei .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2022, 21 (08) :2939-2954
[4]   Optimal Scheduling of Content Caching Subject to Deadline [J].
Ahani, Ghafour ;
Yuan, Di .
IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY, 2020, 1 :293-307
[5]  
[Anonymous], 2021, Gurobi Optimizer, version 9.5
[6]   Maximizing Information Freshness in Caching Systems with Limited Cache Storage Capacity [J].
Bastopcu, Melih ;
Ulukus, Sennur .
2020 54TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2020, :423-427
[7]  
Bastopcu M, 2021, IEEE T WIREL COMMUN, V20, P1861, DOI [10.14422/icade.i111.y2021.001, 10.1109/TWC.2020.3037144]
[8]   ON THE CHOICE OF STEP SIZE IN SUBGRADIENT OPTIMIZATION [J].
BAZARAA, MS ;
SHERALI, HD .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1981, 7 (04) :380-388
[9]   Age of Gossip in Networks with Community Structure [J].
Buyukates, Baturalp ;
Bastopcu, Melih ;
Ulukus, Sennur .
2021 IEEE 22ND INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (SPAWC), 2021, :326-330
[10]  
Chatzieleftheriou L. E., 2017, P IEEE C COMP COMM, P1