On the asymptotic content routing stretch in network of caches: impact of popularity learning

DOI10.1007/978-3-030-10880-9_9zbMATH Open1417.91133OpenAlexW2914606649MaRDI QIDQ2312935FDOQ2312935

Authors: Boram Jin, Jiin Woo, Yung Yi 

Publication date: 18 July 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-10880-9_9

Recommendations

• Serving content with unknown demand: the high-dimensional regime
• CONTENT NETWORKS: DISTRIBUTED ROUTING DECISIONS IN PRESENCE OF REPEATED QUERIES
• scientific article; zbMATH DE number 2089324
• An approximate dynamic programming approach for collaborative caching
• Probabilistic methods for web caching

zbMATH Keywords

learningpopularitycache networks

Mathematics Subject Classification ID

Games involving graphs (91A43) Rationality and learning in game theory (91A26)

Cited In (1)

• Serving content with unknown demand: the high-dimensional regime

This page was built for publication: On the asymptotic content routing stretch in network of caches: impact of popularity learning

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