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...
Saved in:
Published in | IEEE transactions on vehicular technology Vol. 72; no. 9; pp. 12441 - 12446 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.09.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!