Scheduling for Multi-Cell Caching: Hit Maximization Subject to Age of Information

In this paper, we investigate how to schedule content updates for multi-cell caching networks. We model a hit ratio maximization problem subject to age of information (AoI), and prove the NP-hardness of the problem. For problem solving, we propose a scalable and effective algorithm based on repeated...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on vehicular technology Vol. 72; no. 9; pp. 12441 - 12446
Main Authors Deng, Tao, Yu, Zhanwei, Yuan, Di
Format Journal Article
LanguageEnglish
Published New York IEEE 01.09.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Age of information
Algorithms
Backhaul networks
Caching
Cutting
cutting plane
Data centers
Data communication
Information age
Maximization
multi-cell caching
NP-hardness
Optimization
Performance evaluation
Problem solving
Scheduling
Symbols
Online AccessGet full text

Cover

More Information
Summary:In this paper, we investigate how to schedule content updates for multi-cell caching networks. We model a hit ratio maximization problem subject to age of information (AoI), and prove the NP-hardness of the problem. For problem solving, we propose a scalable and effective algorithm based on repeated cutting plane (RCP), in which a cutting plane algorithm and a rounding algorithm are implemented iteratively. In addition, we derive a bound that serves as a benchmark of any suboptimal solution. Performance evaluations show that for RCP, the performance gap to optimum is less than 2.5%.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
1939-9359
DOI:10.1109/TVT.2023.3270322