An approximate dynamic programming approach for collaborative caching

DOI10.1080/0305215X.2020.1767098MaRDI QIDQ6047951zbMATH OpenOpenAlexFDO

Authors Xinan Yang, Nikolaos Thomos

Publication date 10 October 2023

Published in Engineering Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0305215x.2020.1767098

zbMATH Keywords

approximate dynamic programmingcollaborative cachingfinite horizon MDPonline/offline cachingpopularity dynamics

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 1670647
• Low-latency cooperative caching research in multi-Cell wireless networks
• scientific article; zbMATH DE number 1756089
• Placement algorithms for hierarchical cooperative caching
• Distributed caching over heterogeneous mobile networks

Cited in

(5)

• On the asymptotic content routing stretch in network of caches: impact of popularity learning
• Placement algorithms for hierarchical cooperative caching
• Distributed caching over heterogeneous mobile networks
• scientific article; zbMATH DE number 1305451 (Why is no real title available?)
• Low-latency cooperative caching research in multi-Cell wireless networks

This page was built for publication: An approximate dynamic programming approach for collaborative caching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047951)